./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c4ed3e2a82a65e4e5822106607d69caac9bb1b03d24f9127c093cc95d8a8150
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-02-28 17:54:11,309 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 17:54:11,311 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-02-28 17:54:11,331 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-02-28 17:54:11,332 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-02-28 17:54:11,332 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-02-28 17:54:11,333 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-02-28 17:54:11,334 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-02-28 17:54:11,335 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-02-28 17:54:11,336 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-02-28 17:54:11,337 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-02-28 17:54:11,337 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-02-28 17:54:11,338 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-02-28 17:54:11,338 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-02-28 17:54:11,339 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-02-28 17:54:11,340 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-02-28 17:54:11,340 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-02-28 17:54:11,341 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-02-28 17:54:11,342 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-02-28 17:54:11,343 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-02-28 17:54:11,344 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-02-28 17:54:11,345 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-02-28 17:54:11,346 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-02-28 17:54:11,346 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-02-28 17:54:11,349 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-02-28 17:54:11,349 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-02-28 17:54:11,349 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-02-28 17:54:11,350 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-02-28 17:54:11,350 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-02-28 17:54:11,351 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-02-28 17:54:11,351 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-02-28 17:54:11,352 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-02-28 17:54:11,352 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-02-28 17:54:11,353 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-02-28 17:54:11,354 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-02-28 17:54:11,354 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-02-28 17:54:11,354 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-02-28 17:54:11,354 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-02-28 17:54:11,355 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-02-28 17:54:11,355 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-02-28 17:54:11,355 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-02-28 17:54:11,356 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 17:54:11,371 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-02-28 17:54:11,371 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 17:54:11,372 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 17:54:11,372 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 17:54:11,372 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 17:54:11,372 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 17:54:11,373 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 17:54:11,373 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 17:54:11,373 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-02-28 17:54:11,373 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 17:54:11,373 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-02-28 17:54:11,373 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-02-28 17:54:11,374 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 17:54:11,374 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 17:54:11,374 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 17:54:11,374 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 17:54:11,374 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 17:54:11,374 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 17:54:11,374 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 17:54:11,374 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-02-28 17:54:11,374 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 17:54:11,375 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-02-28 17:54:11,375 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 17:54:11,375 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 17:54:11,375 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 17:54:11,375 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 17:54:11,375 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:54:11,375 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 17:54:11,375 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 17:54:11,376 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-02-28 17:54:11,376 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 17:54:11,376 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 17:54:11,376 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 17:54:11,376 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 17:54:11,376 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 17:54:11,376 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 17:54:11,376 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-02-28 17:54:11,376 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c4ed3e2a82a65e4e5822106607d69caac9bb1b03d24f9127c093cc95d8a8150
[2024-02-28 17:54:11,551 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 17:54:11,573 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 17:54:11,576 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 17:54:11,577 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-02-28 17:54:11,578 INFO  L275        PluginConnector]: CDTParser initialized
[2024-02-28 17:54:11,579 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-02-28 17:54:12,550 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 17:54:12,762 INFO  L351              CDTParser]: Found 1 translation units.
[2024-02-28 17:54:12,762 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-02-28 17:54:12,773 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/e525d6daf/d7f0cb166ad649bf80b711202b39021d/FLAGd0c6dd56c
[2024-02-28 17:54:13,136 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/e525d6daf/d7f0cb166ad649bf80b711202b39021d
[2024-02-28 17:54:13,138 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 17:54:13,140 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 17:54:13,140 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 17:54:13,141 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 17:54:13,143 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 17:54:13,144 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:54:13" (1/1) ...
[2024-02-28 17:54:13,144 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38073ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13, skipping insertion in model container
[2024-02-28 17:54:13,145 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:54:13" (1/1) ...
[2024-02-28 17:54:13,150 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-02-28 17:54:13,188 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-02-28 17:54:13,298 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:54:13,488 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2024-02-28 17:54:13,493 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:54:13,504 INFO  L203         MainTranslator]: Completed pre-run
[2024-02-28 17:54:13,514 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:54:13,535 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2024-02-28 17:54:13,539 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:54:13,600 INFO  L208         MainTranslator]: Completed translation
[2024-02-28 17:54:13,601 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13 WrapperNode
[2024-02-28 17:54:13,601 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 17:54:13,602 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 17:54:13,603 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 17:54:13,603 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 17:54:13,609 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13" (1/1) ...
[2024-02-28 17:54:13,622 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13" (1/1) ...
[2024-02-28 17:54:13,639 INFO  L138                Inliner]: procedures = 278, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103
[2024-02-28 17:54:13,639 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 17:54:13,640 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 17:54:13,640 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 17:54:13,640 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 17:54:13,646 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13" (1/1) ...
[2024-02-28 17:54:13,647 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13" (1/1) ...
[2024-02-28 17:54:13,650 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13" (1/1) ...
[2024-02-28 17:54:13,650 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13" (1/1) ...
[2024-02-28 17:54:13,656 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13" (1/1) ...
[2024-02-28 17:54:13,659 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13" (1/1) ...
[2024-02-28 17:54:13,660 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13" (1/1) ...
[2024-02-28 17:54:13,661 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13" (1/1) ...
[2024-02-28 17:54:13,663 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 17:54:13,664 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 17:54:13,664 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 17:54:13,664 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-02-28 17:54:13,665 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13" (1/1) ...
[2024-02-28 17:54:13,669 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:54:13,676 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:54:13,688 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:13,695 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-02-28 17:54:13,717 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 17:54:13,717 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 17:54:13,717 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 17:54:13,717 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-02-28 17:54:13,717 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 17:54:13,717 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 17:54:13,717 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 17:54:13,717 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2024-02-28 17:54:13,718 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 17:54:13,718 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 17:54:13,718 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 17:54:13,718 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 17:54:13,719 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-02-28 17:54:13,864 INFO  L235             CfgBuilder]: Building ICFG
[2024-02-28 17:54:13,865 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 17:54:14,084 INFO  L276             CfgBuilder]: Performing block encoding
[2024-02-28 17:54:14,091 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 17:54:14,091 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 17:54:14,092 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:54:14 BoogieIcfgContainer
[2024-02-28 17:54:14,093 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 17:54:14,094 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 17:54:14,094 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 17:54:14,096 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-02-28 17:54:14,097 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 05:54:13" (1/3) ...
[2024-02-28 17:54:14,097 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2453bc15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:54:14, skipping insertion in model container
[2024-02-28 17:54:14,097 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:13" (2/3) ...
[2024-02-28 17:54:14,098 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2453bc15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:54:14, skipping insertion in model container
[2024-02-28 17:54:14,098 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:54:14" (3/3) ...
[2024-02-28 17:54:14,099 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2024-02-28 17:54:14,105 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 17:54:14,112 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 17:54:14,112 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2024-02-28 17:54:14,112 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 17:54:14,157 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 17:54:14,184 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 306 flow
[2024-02-28 17:54:14,240 INFO  L130       PetriNetUnfolder]: 7/215 cut-off events.
[2024-02-28 17:54:14,240 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:54:14,244 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 221 conditions, 215 events. 7/215 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 413 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. 
[2024-02-28 17:54:14,244 INFO  L82        GeneralOperation]: Start removeDead. Operand has 147 places, 149 transitions, 306 flow
[2024-02-28 17:54:14,248 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 147 places, 149 transitions, 306 flow
[2024-02-28 17:54:14,251 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 17:54:14,258 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 149 transitions, 306 flow
[2024-02-28 17:54:14,260 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 149 transitions, 306 flow
[2024-02-28 17:54:14,261 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 306 flow
[2024-02-28 17:54:14,318 INFO  L130       PetriNetUnfolder]: 7/215 cut-off events.
[2024-02-28 17:54:14,319 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:54:14,319 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 221 conditions, 215 events. 7/215 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 413 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. 
[2024-02-28 17:54:14,322 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3942
[2024-02-28 17:54:16,516 INFO  L134        LiptonReduction]: Checked pairs total: 25074
[2024-02-28 17:54:16,516 INFO  L136        LiptonReduction]: Total number of compositions: 96
[2024-02-28 17:54:16,528 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 17:54:16,533 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@69185eac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 17:54:16,534 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2024-02-28 17:54:16,535 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2024-02-28 17:54:16,535 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 17:54:16,535 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:16,536 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-02-28 17:54:16,536 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:16,540 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:16,540 INFO  L85        PathProgramCache]: Analyzing trace with hash 480, now seen corresponding path program 1 times
[2024-02-28 17:54:16,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:54:16,546 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920396282]
[2024-02-28 17:54:16,547 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:16,547 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:54:16,608 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:16,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:16,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:54:16,624 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920396282]
[2024-02-28 17:54:16,625 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920396282] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:16,625 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:16,625 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-02-28 17:54:16,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558546555]
[2024-02-28 17:54:16,627 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:16,633 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-02-28 17:54:16,633 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:54:16,647 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-02-28 17:54:16,648 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-02-28 17:54:16,650 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 245
[2024-02-28 17:54:16,652 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 142 flow. Second operand  has 2 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:16,652 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:16,652 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 245
[2024-02-28 17:54:16,653 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:16,731 INFO  L130       PetriNetUnfolder]: 85/397 cut-off events.
[2024-02-28 17:54:16,731 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2024-02-28 17:54:16,732 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 606 conditions, 397 events. 85/397 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2129 event pairs, 84 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 536. Up to 203 conditions per place. 
[2024-02-28 17:54:16,734 INFO  L137   encePairwiseOnDemand]: 244/245 looper letters, 23 selfloop transitions, 0 changer transitions 0/66 dead transitions.
[2024-02-28 17:54:16,734 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 186 flow
[2024-02-28 17:54:16,735 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-02-28 17:54:16,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-02-28 17:54:16,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 310 transitions.
[2024-02-28 17:54:16,745 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6326530612244898
[2024-02-28 17:54:16,745 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 310 transitions.
[2024-02-28 17:54:16,746 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 310 transitions.
[2024-02-28 17:54:16,747 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:16,748 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 310 transitions.
[2024-02-28 17:54:16,751 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 155.0) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:16,755 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:16,756 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:16,757 INFO  L175             Difference]: Start difference. First operand has 69 places, 67 transitions, 142 flow. Second operand 2 states and 310 transitions.
[2024-02-28 17:54:16,758 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 186 flow
[2024-02-28 17:54:16,760 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:54:16,761 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 140 flow
[2024-02-28 17:54:16,763 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=140, PETRI_PLACES=69, PETRI_TRANSITIONS=66}
[2024-02-28 17:54:16,766 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places.
[2024-02-28 17:54:16,766 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 140 flow
[2024-02-28 17:54:16,766 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:16,766 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:16,766 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-02-28 17:54:16,767 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 17:54:16,767 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:16,767 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:16,767 INFO  L85        PathProgramCache]: Analyzing trace with hash 472525, now seen corresponding path program 1 times
[2024-02-28 17:54:16,768 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:54:16,768 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379890839]
[2024-02-28 17:54:16,768 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:16,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:54:16,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:16,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:16,845 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:54:16,845 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379890839]
[2024-02-28 17:54:16,845 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379890839] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:16,845 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:16,845 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:54:16,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534555624]
[2024-02-28 17:54:16,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:16,846 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:54:16,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:54:16,847 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:54:16,847 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:54:16,868 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 245
[2024-02-28 17:54:16,869 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 140 flow. Second operand  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:16,869 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:16,869 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 245
[2024-02-28 17:54:16,869 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:16,955 INFO  L130       PetriNetUnfolder]: 132/476 cut-off events.
[2024-02-28 17:54:16,955 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2024-02-28 17:54:16,956 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 797 conditions, 476 events. 132/476 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2444 event pairs, 67 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 793. Up to 172 conditions per place. 
[2024-02-28 17:54:16,958 INFO  L137   encePairwiseOnDemand]: 234/245 looper letters, 43 selfloop transitions, 8 changer transitions 0/88 dead transitions.
[2024-02-28 17:54:16,958 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 286 flow
[2024-02-28 17:54:16,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:54:16,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:54:16,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions.
[2024-02-28 17:54:16,961 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6122448979591837
[2024-02-28 17:54:16,961 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 450 transitions.
[2024-02-28 17:54:16,961 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions.
[2024-02-28 17:54:16,962 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:16,962 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions.
[2024-02-28 17:54:16,963 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:16,965 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:16,966 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:16,966 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 140 flow. Second operand 3 states and 450 transitions.
[2024-02-28 17:54:16,966 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 286 flow
[2024-02-28 17:54:16,967 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 88 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:54:16,968 INFO  L231             Difference]: Finished difference. Result has 73 places, 74 transitions, 210 flow
[2024-02-28 17:54:16,968 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=73, PETRI_TRANSITIONS=74}
[2024-02-28 17:54:16,969 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 4 predicate places.
[2024-02-28 17:54:16,969 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 210 flow
[2024-02-28 17:54:16,969 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:16,969 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:16,969 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:16,969 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 17:54:16,970 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:16,970 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:16,970 INFO  L85        PathProgramCache]: Analyzing trace with hash 1738520444, now seen corresponding path program 1 times
[2024-02-28 17:54:16,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:54:16,970 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582819806]
[2024-02-28 17:54:16,971 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:16,971 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:54:16,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:17,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:17,058 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:54:17,059 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582819806]
[2024-02-28 17:54:17,059 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582819806] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:17,059 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:17,059 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 17:54:17,059 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878431185]
[2024-02-28 17:54:17,059 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:17,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 17:54:17,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:54:17,060 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 17:54:17,060 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-02-28 17:54:17,105 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 245
[2024-02-28 17:54:17,106 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 210 flow. Second operand  has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:17,106 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:17,106 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 245
[2024-02-28 17:54:17,106 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:17,211 INFO  L130       PetriNetUnfolder]: 104/565 cut-off events.
[2024-02-28 17:54:17,211 INFO  L131       PetriNetUnfolder]: For 92/94 co-relation queries the response was YES.
[2024-02-28 17:54:17,214 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 960 conditions, 565 events. 104/565 cut-off events. For 92/94 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3403 event pairs, 15 based on Foata normal form. 2/524 useless extension candidates. Maximal degree in co-relation 954. Up to 218 conditions per place. 
[2024-02-28 17:54:17,216 INFO  L137   encePairwiseOnDemand]: 241/245 looper letters, 41 selfloop transitions, 3 changer transitions 1/91 dead transitions.
[2024-02-28 17:54:17,216 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 350 flow
[2024-02-28 17:54:17,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 17:54:17,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 17:54:17,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 585 transitions.
[2024-02-28 17:54:17,219 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5969387755102041
[2024-02-28 17:54:17,220 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 585 transitions.
[2024-02-28 17:54:17,220 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 585 transitions.
[2024-02-28 17:54:17,220 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:17,220 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 585 transitions.
[2024-02-28 17:54:17,222 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:17,224 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:17,224 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:17,225 INFO  L175             Difference]: Start difference. First operand has 73 places, 74 transitions, 210 flow. Second operand 4 states and 585 transitions.
[2024-02-28 17:54:17,225 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 350 flow
[2024-02-28 17:54:17,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 17:54:17,228 INFO  L231             Difference]: Finished difference. Result has 76 places, 75 transitions, 210 flow
[2024-02-28 17:54:17,228 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=76, PETRI_TRANSITIONS=75}
[2024-02-28 17:54:17,229 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 7 predicate places.
[2024-02-28 17:54:17,229 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 210 flow
[2024-02-28 17:54:17,229 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:17,229 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:17,229 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:17,229 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 17:54:17,229 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:17,230 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:17,230 INFO  L85        PathProgramCache]: Analyzing trace with hash -1699318889, now seen corresponding path program 1 times
[2024-02-28 17:54:17,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:54:17,230 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450386943]
[2024-02-28 17:54:17,230 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:17,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:54:17,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:17,448 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:17,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:54:17,449 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450386943]
[2024-02-28 17:54:17,449 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450386943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:17,449 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:17,449 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:54:17,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920421519]
[2024-02-28 17:54:17,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:17,450 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:54:17,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:54:17,450 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:54:17,450 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:54:17,572 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 245
[2024-02-28 17:54:17,573 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 210 flow. Second operand  has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:17,573 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:17,573 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 245
[2024-02-28 17:54:17,573 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:17,845 INFO  L130       PetriNetUnfolder]: 395/1189 cut-off events.
[2024-02-28 17:54:17,846 INFO  L131       PetriNetUnfolder]: For 92/95 co-relation queries the response was YES.
[2024-02-28 17:54:17,848 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 1189 events. 395/1189 cut-off events. For 92/95 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7813 event pairs, 125 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 2343. Up to 524 conditions per place. 
[2024-02-28 17:54:17,852 INFO  L137   encePairwiseOnDemand]: 222/245 looper letters, 88 selfloop transitions, 29 changer transitions 0/143 dead transitions.
[2024-02-28 17:54:17,852 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 143 transitions, 606 flow
[2024-02-28 17:54:17,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:54:17,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:54:17,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 822 transitions.
[2024-02-28 17:54:17,854 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5591836734693878
[2024-02-28 17:54:17,854 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 822 transitions.
[2024-02-28 17:54:17,875 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 822 transitions.
[2024-02-28 17:54:17,876 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:17,876 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 822 transitions.
[2024-02-28 17:54:17,878 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:17,880 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:17,881 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:17,881 INFO  L175             Difference]: Start difference. First operand has 76 places, 75 transitions, 210 flow. Second operand 6 states and 822 transitions.
[2024-02-28 17:54:17,881 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 143 transitions, 606 flow
[2024-02-28 17:54:17,883 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 143 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 17:54:17,885 INFO  L231             Difference]: Finished difference. Result has 85 places, 104 transitions, 428 flow
[2024-02-28 17:54:17,885 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=428, PETRI_PLACES=85, PETRI_TRANSITIONS=104}
[2024-02-28 17:54:17,885 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 16 predicate places.
[2024-02-28 17:54:17,885 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 104 transitions, 428 flow
[2024-02-28 17:54:17,886 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:17,886 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:17,886 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:17,886 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 17:54:17,886 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:17,887 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:17,887 INFO  L85        PathProgramCache]: Analyzing trace with hash 120947037, now seen corresponding path program 1 times
[2024-02-28 17:54:17,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:54:17,887 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430660918]
[2024-02-28 17:54:17,887 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:17,887 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:54:17,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:17,907 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:17,908 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:54:17,908 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430660918]
[2024-02-28 17:54:17,908 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430660918] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:17,908 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:17,908 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:54:17,908 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373265607]
[2024-02-28 17:54:17,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:17,909 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:54:17,909 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:54:17,909 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:54:17,909 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:54:17,926 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 245
[2024-02-28 17:54:17,927 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 104 transitions, 428 flow. Second operand  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:17,927 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:17,927 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 245
[2024-02-28 17:54:17,927 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:18,033 INFO  L130       PetriNetUnfolder]: 206/854 cut-off events.
[2024-02-28 17:54:18,033 INFO  L131       PetriNetUnfolder]: For 246/261 co-relation queries the response was YES.
[2024-02-28 17:54:18,034 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 854 events. 206/854 cut-off events. For 246/261 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5761 event pairs, 90 based on Foata normal form. 3/834 useless extension candidates. Maximal degree in co-relation 1942. Up to 353 conditions per place. 
[2024-02-28 17:54:18,037 INFO  L137   encePairwiseOnDemand]: 240/245 looper letters, 39 selfloop transitions, 6 changer transitions 0/114 dead transitions.
[2024-02-28 17:54:18,037 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 114 transitions, 548 flow
[2024-02-28 17:54:18,037 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:54:18,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:54:18,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions.
[2024-02-28 17:54:18,039 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5904761904761905
[2024-02-28 17:54:18,039 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 434 transitions.
[2024-02-28 17:54:18,039 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions.
[2024-02-28 17:54:18,039 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:18,039 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions.
[2024-02-28 17:54:18,040 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:18,041 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:18,042 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:18,042 INFO  L175             Difference]: Start difference. First operand has 85 places, 104 transitions, 428 flow. Second operand 3 states and 434 transitions.
[2024-02-28 17:54:18,042 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 114 transitions, 548 flow
[2024-02-28 17:54:18,045 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 114 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:54:18,046 INFO  L231             Difference]: Finished difference. Result has 88 places, 108 transitions, 470 flow
[2024-02-28 17:54:18,046 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=88, PETRI_TRANSITIONS=108}
[2024-02-28 17:54:18,047 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 19 predicate places.
[2024-02-28 17:54:18,047 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 108 transitions, 470 flow
[2024-02-28 17:54:18,047 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:18,047 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:18,048 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:18,048 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 17:54:18,048 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:18,048 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:18,048 INFO  L85        PathProgramCache]: Analyzing trace with hash -957762772, now seen corresponding path program 1 times
[2024-02-28 17:54:18,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:54:18,048 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384573446]
[2024-02-28 17:54:18,048 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:18,049 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:54:18,061 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:18,077 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:18,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:54:18,077 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384573446]
[2024-02-28 17:54:18,077 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384573446] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:18,077 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:18,078 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:54:18,078 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91685160]
[2024-02-28 17:54:18,078 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:18,078 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:54:18,078 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:54:18,078 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:54:18,079 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:54:18,088 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 245
[2024-02-28 17:54:18,088 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 108 transitions, 470 flow. Second operand  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:18,089 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:18,089 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 245
[2024-02-28 17:54:18,089 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:18,201 INFO  L130       PetriNetUnfolder]: 221/839 cut-off events.
[2024-02-28 17:54:18,201 INFO  L131       PetriNetUnfolder]: For 364/387 co-relation queries the response was YES.
[2024-02-28 17:54:18,202 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 839 events. 221/839 cut-off events. For 364/387 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5449 event pairs, 32 based on Foata normal form. 23/838 useless extension candidates. Maximal degree in co-relation 2026. Up to 361 conditions per place. 
[2024-02-28 17:54:18,205 INFO  L137   encePairwiseOnDemand]: 241/245 looper letters, 46 selfloop transitions, 2 changer transitions 1/119 dead transitions.
[2024-02-28 17:54:18,205 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 119 transitions, 612 flow
[2024-02-28 17:54:18,205 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:54:18,205 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:54:18,206 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions.
[2024-02-28 17:54:18,206 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6095238095238096
[2024-02-28 17:54:18,206 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 448 transitions.
[2024-02-28 17:54:18,207 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions.
[2024-02-28 17:54:18,207 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:18,207 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions.
[2024-02-28 17:54:18,208 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:18,209 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:18,210 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:18,210 INFO  L175             Difference]: Start difference. First operand has 88 places, 108 transitions, 470 flow. Second operand 3 states and 448 transitions.
[2024-02-28 17:54:18,210 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 119 transitions, 612 flow
[2024-02-28 17:54:18,212 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 604 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 17:54:18,214 INFO  L231             Difference]: Finished difference. Result has 88 places, 107 transitions, 468 flow
[2024-02-28 17:54:18,214 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=88, PETRI_TRANSITIONS=107}
[2024-02-28 17:54:18,214 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 19 predicate places.
[2024-02-28 17:54:18,215 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 107 transitions, 468 flow
[2024-02-28 17:54:18,215 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:18,215 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:18,215 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:18,215 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 17:54:18,215 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:18,216 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:18,216 INFO  L85        PathProgramCache]: Analyzing trace with hash -949124360, now seen corresponding path program 1 times
[2024-02-28 17:54:18,216 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:54:18,216 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918308553]
[2024-02-28 17:54:18,216 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:18,216 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:54:18,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:18,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:18,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:54:18,464 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918308553]
[2024-02-28 17:54:18,464 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918308553] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:18,464 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:18,464 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:54:18,464 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438995435]
[2024-02-28 17:54:18,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:18,465 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:54:18,465 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:54:18,465 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:54:18,465 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:54:18,553 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 245
[2024-02-28 17:54:18,554 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 107 transitions, 468 flow. Second operand  has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:18,554 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:18,554 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 245
[2024-02-28 17:54:18,554 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:19,073 INFO  L130       PetriNetUnfolder]: 565/1518 cut-off events.
[2024-02-28 17:54:19,074 INFO  L131       PetriNetUnfolder]: For 805/819 co-relation queries the response was YES.
[2024-02-28 17:54:19,077 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 1518 events. 565/1518 cut-off events. For 805/819 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10302 event pairs, 170 based on Foata normal form. 2/1446 useless extension candidates. Maximal degree in co-relation 4201. Up to 966 conditions per place. 
[2024-02-28 17:54:19,083 INFO  L137   encePairwiseOnDemand]: 222/245 looper letters, 127 selfloop transitions, 85 changer transitions 0/241 dead transitions.
[2024-02-28 17:54:19,083 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 241 transitions, 1452 flow
[2024-02-28 17:54:19,084 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:54:19,084 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:54:19,085 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions.
[2024-02-28 17:54:19,085 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5829931972789115
[2024-02-28 17:54:19,085 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 857 transitions.
[2024-02-28 17:54:19,086 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 857 transitions.
[2024-02-28 17:54:19,086 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:19,086 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 857 transitions.
[2024-02-28 17:54:19,088 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:19,089 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:19,090 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:19,090 INFO  L175             Difference]: Start difference. First operand has 88 places, 107 transitions, 468 flow. Second operand 6 states and 857 transitions.
[2024-02-28 17:54:19,090 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 241 transitions, 1452 flow
[2024-02-28 17:54:19,096 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 241 transitions, 1436 flow, removed 5 selfloop flow, removed 2 redundant places.
[2024-02-28 17:54:19,099 INFO  L231             Difference]: Finished difference. Result has 95 places, 188 transitions, 1212 flow
[2024-02-28 17:54:19,099 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1212, PETRI_PLACES=95, PETRI_TRANSITIONS=188}
[2024-02-28 17:54:19,100 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places.
[2024-02-28 17:54:19,100 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 188 transitions, 1212 flow
[2024-02-28 17:54:19,100 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:19,100 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:19,101 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:19,101 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-02-28 17:54:19,101 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:19,101 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:19,101 INFO  L85        PathProgramCache]: Analyzing trace with hash 1013407062, now seen corresponding path program 1 times
[2024-02-28 17:54:19,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:54:19,101 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445743394]
[2024-02-28 17:54:19,101 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:19,101 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:54:19,127 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:19,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:54:19,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:54:19,417 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445743394]
[2024-02-28 17:54:19,417 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445743394] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:19,417 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:19,417 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-02-28 17:54:19,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626854014]
[2024-02-28 17:54:19,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:19,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-02-28 17:54:19,417 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:54:19,418 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-02-28 17:54:19,418 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-02-28 17:54:19,675 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 245
[2024-02-28 17:54:19,676 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 188 transitions, 1212 flow. Second operand  has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:19,676 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:19,676 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 245
[2024-02-28 17:54:19,676 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:19,910 INFO  L130       PetriNetUnfolder]: 524/1426 cut-off events.
[2024-02-28 17:54:19,910 INFO  L131       PetriNetUnfolder]: For 1458/1470 co-relation queries the response was YES.
[2024-02-28 17:54:19,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5013 conditions, 1426 events. 524/1426 cut-off events. For 1458/1470 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9589 event pairs, 212 based on Foata normal form. 39/1421 useless extension candidates. Maximal degree in co-relation 4995. Up to 1052 conditions per place. 
[2024-02-28 17:54:19,919 INFO  L137   encePairwiseOnDemand]: 236/245 looper letters, 158 selfloop transitions, 7 changer transitions 1/209 dead transitions.
[2024-02-28 17:54:19,919 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 209 transitions, 1668 flow
[2024-02-28 17:54:19,920 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:54:19,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:54:19,921 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions.
[2024-02-28 17:54:19,922 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5102040816326531
[2024-02-28 17:54:19,922 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 875 transitions.
[2024-02-28 17:54:19,922 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions.
[2024-02-28 17:54:19,922 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:19,922 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions.
[2024-02-28 17:54:19,924 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:19,926 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:19,926 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:19,926 INFO  L175             Difference]: Start difference. First operand has 95 places, 188 transitions, 1212 flow. Second operand 7 states and 875 transitions.
[2024-02-28 17:54:19,926 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 209 transitions, 1668 flow
[2024-02-28 17:54:19,935 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 209 transitions, 1614 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-02-28 17:54:19,937 INFO  L231             Difference]: Finished difference. Result has 102 places, 189 transitions, 1208 flow
[2024-02-28 17:54:19,938 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1208, PETRI_PLACES=102, PETRI_TRANSITIONS=189}
[2024-02-28 17:54:19,938 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 33 predicate places.
[2024-02-28 17:54:19,939 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 189 transitions, 1208 flow
[2024-02-28 17:54:19,939 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:19,939 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:19,939 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:19,939 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-02-28 17:54:19,939 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:19,940 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:19,940 INFO  L85        PathProgramCache]: Analyzing trace with hash -1627961114, now seen corresponding path program 1 times
[2024-02-28 17:54:19,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:54:19,940 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719984650]
[2024-02-28 17:54:19,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:19,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:54:19,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:20,252 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:54:20,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:54:20,253 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719984650]
[2024-02-28 17:54:20,253 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719984650] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:20,253 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:20,253 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-02-28 17:54:20,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945640409]
[2024-02-28 17:54:20,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:20,254 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-02-28 17:54:20,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:54:20,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-02-28 17:54:20,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-02-28 17:54:20,571 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245
[2024-02-28 17:54:20,573 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 189 transitions, 1208 flow. Second operand  has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:20,573 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:20,573 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245
[2024-02-28 17:54:20,573 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:21,033 INFO  L130       PetriNetUnfolder]: 540/1423 cut-off events.
[2024-02-28 17:54:21,033 INFO  L131       PetriNetUnfolder]: For 1470/1481 co-relation queries the response was YES.
[2024-02-28 17:54:21,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5119 conditions, 1423 events. 540/1423 cut-off events. For 1470/1481 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9344 event pairs, 165 based on Foata normal form. 33/1409 useless extension candidates. Maximal degree in co-relation 5096. Up to 634 conditions per place. 
[2024-02-28 17:54:21,042 INFO  L137   encePairwiseOnDemand]: 232/245 looper letters, 254 selfloop transitions, 62 changer transitions 1/343 dead transitions.
[2024-02-28 17:54:21,042 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 343 transitions, 2754 flow
[2024-02-28 17:54:21,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-02-28 17:54:21,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-02-28 17:54:21,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1078 transitions.
[2024-02-28 17:54:21,046 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.55
[2024-02-28 17:54:21,046 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1078 transitions.
[2024-02-28 17:54:21,046 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1078 transitions.
[2024-02-28 17:54:21,047 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:21,047 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1078 transitions.
[2024-02-28 17:54:21,049 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 134.75) internal successors, (1078), 8 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:21,051 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:21,051 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:21,051 INFO  L175             Difference]: Start difference. First operand has 102 places, 189 transitions, 1208 flow. Second operand 8 states and 1078 transitions.
[2024-02-28 17:54:21,051 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 343 transitions, 2754 flow
[2024-02-28 17:54:21,061 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 343 transitions, 2724 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-02-28 17:54:21,097 INFO  L231             Difference]: Finished difference. Result has 114 places, 216 transitions, 1638 flow
[2024-02-28 17:54:21,097 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1638, PETRI_PLACES=114, PETRI_TRANSITIONS=216}
[2024-02-28 17:54:21,098 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 45 predicate places.
[2024-02-28 17:54:21,098 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 216 transitions, 1638 flow
[2024-02-28 17:54:21,098 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:21,098 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:21,099 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:21,099 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-02-28 17:54:21,099 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:21,099 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:21,099 INFO  L85        PathProgramCache]: Analyzing trace with hash -776168387, now seen corresponding path program 1 times
[2024-02-28 17:54:21,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:54:21,099 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648362253]
[2024-02-28 17:54:21,099 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:21,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:54:21,116 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:21,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:21,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:54:21,133 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648362253]
[2024-02-28 17:54:21,133 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648362253] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:21,133 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:21,133 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:54:21,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855184976]
[2024-02-28 17:54:21,134 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:21,134 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:54:21,134 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:54:21,134 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:54:21,134 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:54:21,154 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 245
[2024-02-28 17:54:21,155 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 216 transitions, 1638 flow. Second operand  has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:21,155 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:21,155 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 245
[2024-02-28 17:54:21,155 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:21,304 INFO  L130       PetriNetUnfolder]: 407/1207 cut-off events.
[2024-02-28 17:54:21,304 INFO  L131       PetriNetUnfolder]: For 3288/3310 co-relation queries the response was YES.
[2024-02-28 17:54:21,308 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4814 conditions, 1207 events. 407/1207 cut-off events. For 3288/3310 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7975 event pairs, 93 based on Foata normal form. 6/1169 useless extension candidates. Maximal degree in co-relation 4785. Up to 449 conditions per place. 
[2024-02-28 17:54:21,311 INFO  L137   encePairwiseOnDemand]: 239/245 looper letters, 46 selfloop transitions, 10 changer transitions 28/233 dead transitions.
[2024-02-28 17:54:21,312 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 233 transitions, 1857 flow
[2024-02-28 17:54:21,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:54:21,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:54:21,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions.
[2024-02-28 17:54:21,313 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6
[2024-02-28 17:54:21,313 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 441 transitions.
[2024-02-28 17:54:21,313 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions.
[2024-02-28 17:54:21,313 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:21,313 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions.
[2024-02-28 17:54:21,314 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:21,315 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:21,315 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:21,315 INFO  L175             Difference]: Start difference. First operand has 114 places, 216 transitions, 1638 flow. Second operand 3 states and 441 transitions.
[2024-02-28 17:54:21,316 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 233 transitions, 1857 flow
[2024-02-28 17:54:21,330 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 233 transitions, 1853 flow, removed 2 selfloop flow, removed 0 redundant places.
[2024-02-28 17:54:21,333 INFO  L231             Difference]: Finished difference. Result has 117 places, 199 transitions, 1501 flow
[2024-02-28 17:54:21,333 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1501, PETRI_PLACES=117, PETRI_TRANSITIONS=199}
[2024-02-28 17:54:21,333 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 48 predicate places.
[2024-02-28 17:54:21,333 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 199 transitions, 1501 flow
[2024-02-28 17:54:21,334 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:21,334 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:21,334 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:21,334 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-02-28 17:54:21,334 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:21,334 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:21,334 INFO  L85        PathProgramCache]: Analyzing trace with hash -1511156484, now seen corresponding path program 1 times
[2024-02-28 17:54:21,334 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:54:21,334 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169037680]
[2024-02-28 17:54:21,335 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:21,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:54:21,352 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:21,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:54:21,539 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:54:21,539 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169037680]
[2024-02-28 17:54:21,539 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169037680] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:21,539 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:21,539 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:54:21,539 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102021683]
[2024-02-28 17:54:21,539 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:21,539 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:54:21,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:54:21,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:54:21,540 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:54:21,753 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 245
[2024-02-28 17:54:21,754 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 199 transitions, 1501 flow. Second operand  has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:21,754 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:21,755 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 245
[2024-02-28 17:54:21,755 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:22,101 INFO  L130       PetriNetUnfolder]: 476/1312 cut-off events.
[2024-02-28 17:54:22,101 INFO  L131       PetriNetUnfolder]: For 3861/3912 co-relation queries the response was YES.
[2024-02-28 17:54:22,106 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5592 conditions, 1312 events. 476/1312 cut-off events. For 3861/3912 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8483 event pairs, 121 based on Foata normal form. 13/1287 useless extension candidates. Maximal degree in co-relation 5561. Up to 718 conditions per place. 
[2024-02-28 17:54:22,111 INFO  L137   encePairwiseOnDemand]: 234/245 looper letters, 92 selfloop transitions, 41 changer transitions 35/265 dead transitions.
[2024-02-28 17:54:22,111 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 265 transitions, 2356 flow
[2024-02-28 17:54:22,125 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:54:22,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:54:22,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 847 transitions.
[2024-02-28 17:54:22,129 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5761904761904761
[2024-02-28 17:54:22,129 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 847 transitions.
[2024-02-28 17:54:22,129 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 847 transitions.
[2024-02-28 17:54:22,130 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:22,130 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 847 transitions.
[2024-02-28 17:54:22,133 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 141.16666666666666) internal successors, (847), 6 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:22,136 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:22,137 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:22,137 INFO  L175             Difference]: Start difference. First operand has 117 places, 199 transitions, 1501 flow. Second operand 6 states and 847 transitions.
[2024-02-28 17:54:22,137 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 265 transitions, 2356 flow
[2024-02-28 17:54:22,156 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 265 transitions, 2329 flow, removed 1 selfloop flow, removed 4 redundant places.
[2024-02-28 17:54:22,159 INFO  L231             Difference]: Finished difference. Result has 122 places, 222 transitions, 1887 flow
[2024-02-28 17:54:22,159 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1887, PETRI_PLACES=122, PETRI_TRANSITIONS=222}
[2024-02-28 17:54:22,159 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 53 predicate places.
[2024-02-28 17:54:22,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 222 transitions, 1887 flow
[2024-02-28 17:54:22,160 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:22,160 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:22,160 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:22,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-02-28 17:54:22,160 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:22,160 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:22,160 INFO  L85        PathProgramCache]: Analyzing trace with hash 880579718, now seen corresponding path program 1 times
[2024-02-28 17:54:22,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:54:22,161 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792528484]
[2024-02-28 17:54:22,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:22,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:54:22,177 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:54:22,177 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 17:54:22,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:54:22,210 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 17:54:22,210 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 17:54:22,211 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining)
[2024-02-28 17:54:22,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2024-02-28 17:54:22,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2024-02-28 17:54:22,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2024-02-28 17:54:22,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2024-02-28 17:54:22,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2024-02-28 17:54:22,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2024-02-28 17:54:22,213 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2024-02-28 17:54:22,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2024-02-28 17:54:22,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining)
[2024-02-28 17:54:22,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2024-02-28 17:54:22,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2024-02-28 17:54:22,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2024-02-28 17:54:22,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2024-02-28 17:54:22,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2024-02-28 17:54:22,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2024-02-28 17:54:22,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2024-02-28 17:54:22,214 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2024-02-28 17:54:22,214 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-02-28 17:54:22,215 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:22,219 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-02-28 17:54:22,219 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-02-28 17:54:22,265 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 05:54:22 BasicIcfg
[2024-02-28 17:54:22,265 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-02-28 17:54:22,266 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-02-28 17:54:22,266 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2024-02-28 17:54:22,266 INFO  L275        PluginConnector]: Witness Printer initialized
[2024-02-28 17:54:22,266 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:54:14" (3/4) ...
[2024-02-28 17:54:22,268 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-02-28 17:54:22,268 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-02-28 17:54:22,268 INFO  L158              Benchmark]: Toolchain (without parser) took 9128.98ms. Allocated memory was 136.3MB in the beginning and 291.5MB in the end (delta: 155.2MB). Free memory was 89.2MB in the beginning and 254.0MB in the end (delta: -164.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-02-28 17:54:22,269 INFO  L158              Benchmark]: CDTParser took 0.10ms. Allocated memory is still 102.8MB. Free memory was 77.0MB in the beginning and 76.9MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-02-28 17:54:22,269 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 460.88ms. Allocated memory is still 136.3MB. Free memory was 89.1MB in the beginning and 103.1MB in the end (delta: -14.0MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB.
[2024-02-28 17:54:22,269 INFO  L158              Benchmark]: Boogie Procedure Inliner took 36.91ms. Allocated memory is still 136.3MB. Free memory was 103.1MB in the beginning and 100.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-02-28 17:54:22,269 INFO  L158              Benchmark]: Boogie Preprocessor took 23.62ms. Allocated memory is still 136.3MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-02-28 17:54:22,270 INFO  L158              Benchmark]: RCFGBuilder took 428.80ms. Allocated memory is still 136.3MB. Free memory was 98.3MB in the beginning and 80.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-02-28 17:54:22,270 INFO  L158              Benchmark]: TraceAbstraction took 8171.26ms. Allocated memory was 136.3MB in the beginning and 291.5MB in the end (delta: 155.2MB). Free memory was 79.4MB in the beginning and 254.0MB in the end (delta: -174.6MB). Peak memory consumption was 149.1MB. Max. memory is 16.1GB.
[2024-02-28 17:54:22,270 INFO  L158              Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 291.5MB. Free memory is still 254.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-02-28 17:54:22,271 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.10ms. Allocated memory is still 102.8MB. Free memory was 77.0MB in the beginning and 76.9MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 460.88ms. Allocated memory is still 136.3MB. Free memory was 89.1MB in the beginning and 103.1MB in the end (delta: -14.0MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 36.91ms. Allocated memory is still 136.3MB. Free memory was 103.1MB in the beginning and 100.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 23.62ms. Allocated memory is still 136.3MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 428.80ms. Allocated memory is still 136.3MB. Free memory was 98.3MB in the beginning and 80.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8171.26ms. Allocated memory was 136.3MB in the beginning and 291.5MB in the end (delta: 155.2MB). Free memory was 79.4MB in the beginning and 254.0MB in the end (delta: -174.6MB). Peak memory consumption was 149.1MB. Max. memory is 16.1GB.
 * Witness Printer took 2.37ms. Allocated memory is still 291.5MB. Free memory is still 254.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 2.3s, 147 PlacesBefore, 69 PlacesAfterwards, 149 TransitionsBefore, 67 TransitionsAfterwards, 3942 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 96 TotalNumberOfCompositions, 25074 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5875, independent: 5008, independent conditional: 0, independent unconditional: 5008, dependent: 867, dependent conditional: 0, dependent unconditional: 867, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1716, independent: 1611, independent conditional: 0, independent unconditional: 1611, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5875, independent: 3397, independent conditional: 0, independent unconditional: 3397, dependent: 762, dependent conditional: 0, dependent unconditional: 762, unknown: 1716, unknown conditional: 0, unknown unconditional: 1716] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 319, Positive conditional cache size: 0, Positive unconditional cache size: 319, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - UnprovableResult [Line: 1052]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: overapproximation of shiftLeft at line 1042, overapproximation of bitwiseOr at line 1042, overapproximation of bitwiseAnd at line 1053, overapproximation of bitwiseComplement at line 1053. 
Possible FailurePath: 
[L1037]               0  int threads_mask = -1;
[L1038]               0  int *datas;
[L1046]               0  int threads_total = __VERIFIER_nondet_int();
[L1047]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L1034]  COND FALSE   0  !(!cond)
[L1047]  RET          0  assume_abort_if_not(threads_total >= 0)
[L1048]  CALL         0  assume_abort_if_not(threads_total < 32)
[L1034]  COND FALSE   0  !(!cond)
[L1048]  RET          0  assume_abort_if_not(threads_total < 32)
[L1049]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1049]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1050]               0  datas = malloc(threads_total * sizeof(int))
[L1051]               0  int i = 0;
         VAL             [datas={-2:0}, i=0, threads_mask=-1, threads_total=31, tids={8:0}]
[L1051]  COND TRUE    0  i < threads_total
[L1052]  EXPR         0  ffs(threads_mask)
[L1052]               0  int j = ffs(threads_mask) - 1;
[L1053]               0  threads_mask &= ~(1 << j)
[L1054]  EXPR         0  \read(*tids)
         VAL             [\read(*tids)={-3:0}, datas={-2:0}, i=0, j=3, pthread_create(&tids[i], ((void *)0), &thread, (void*)j)=-4, threads_mask=-1, threads_total=31, tids={8:0}]
[L1054]  EXPR         0  tids[i]
         VAL             [\read(*tids)={-3:0}, datas={-2:0}, i=0, j=3, pthread_create(&tids[i], ((void *)0), &thread, (void*)j)=-4, threads_mask=-1, threads_total=31, tids={8:0}]
[L1054]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, (void*)j)
         VAL             [\read(*tids)={-3:0}, arg={0:3}, datas={-2:0}, i=0, j=3, pthread_create(&tids[i], ((void *)0), &thread, (void*)j)=-4, threads_mask=-1, threads_total=31, tids={8:0}]
[L1040]               1  int j = (int)arg;
[L1041]  EXPR         1  datas[j]
         VAL             [arg={0:3}, arg={0:3}, datas={-2:0}, j=3, threads_mask=-1]
[L1041]               1  datas[j] = __VERIFIER_nondet_int()
         VAL             [__VERIFIER_nondet_int()=-5, arg={0:3}, arg={0:3}, datas={-2:0}, j=3, threads_mask=-1]
[L1051]               0  i++
         VAL             [__VERIFIER_nondet_int()=-5, arg={0:3}, arg={0:3}, datas={-2:0}, i=1, j=3, j=3, threads_mask=-1, threads_total=31, tids={8:0}]
[L1051]  COND TRUE    0  i < threads_total
[L1042]               1  threads_mask |= 1 << j
         VAL             [arg={0:3}, arg={0:3}, datas={-2:0}, j=3, threads_mask=-1, threads_mask |= 1 << j=131]
[L1052]               0  ffs(threads_mask)
         VAL             [arg={0:3}, arg={0:3}, datas={-2:0}, i=1, j=3, j=3, threads_mask=-1, threads_mask |= 1 << j=131, threads_total=31, tids={8:0}]

  - UnprovableResult [Line: 1050]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1057]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1059]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1060]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1057]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 173 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.0s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1020 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 702 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 361 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2648 IncrementalHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 361 mSolverCounterUnsat, 27 mSDtfsCounter, 2648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1887occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-02-28 17:54:22,286 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c4ed3e2a82a65e4e5822106607d69caac9bb1b03d24f9127c093cc95d8a8150
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-02-28 17:54:23,864 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 17:54:23,865 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-02-28 17:54:23,886 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-02-28 17:54:23,887 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-02-28 17:54:23,887 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-02-28 17:54:23,888 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-02-28 17:54:23,889 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-02-28 17:54:23,891 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-02-28 17:54:23,891 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-02-28 17:54:23,892 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-02-28 17:54:23,893 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-02-28 17:54:23,893 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-02-28 17:54:23,894 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-02-28 17:54:23,895 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-02-28 17:54:23,895 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-02-28 17:54:23,896 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-02-28 17:54:23,897 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-02-28 17:54:23,898 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-02-28 17:54:23,906 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-02-28 17:54:23,908 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-02-28 17:54:23,910 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-02-28 17:54:23,911 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-02-28 17:54:23,912 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-02-28 17:54:23,914 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-02-28 17:54:23,914 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-02-28 17:54:23,915 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-02-28 17:54:23,915 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-02-28 17:54:23,915 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-02-28 17:54:23,916 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-02-28 17:54:23,916 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-02-28 17:54:23,917 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-02-28 17:54:23,917 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-02-28 17:54:23,918 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-02-28 17:54:23,918 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-02-28 17:54:23,919 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-02-28 17:54:23,919 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-02-28 17:54:23,919 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-02-28 17:54:23,920 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-02-28 17:54:23,920 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-02-28 17:54:23,921 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-02-28 17:54:23,922 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf
[2024-02-28 17:54:23,944 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-02-28 17:54:23,944 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 17:54:23,944 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 17:54:23,944 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 17:54:23,945 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 17:54:23,945 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 17:54:23,945 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 17:54:23,945 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 17:54:23,945 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-02-28 17:54:23,946 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 17:54:23,946 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-02-28 17:54:23,946 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-02-28 17:54:23,946 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 17:54:23,946 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 17:54:23,946 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 17:54:23,946 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 17:54:23,946 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 17:54:23,946 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 17:54:23,947 INFO  L138        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-02-28 17:54:23,947 INFO  L138        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-02-28 17:54:23,947 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-02-28 17:54:23,947 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 17:54:23,947 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-02-28 17:54:23,947 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 17:54:23,947 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 17:54:23,947 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 17:54:23,947 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 17:54:23,948 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:54:23,948 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 17:54:23,948 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 17:54:23,948 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-02-28 17:54:23,948 INFO  L138        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-02-28 17:54:23,948 INFO  L138        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-02-28 17:54:23,948 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 17:54:23,948 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 17:54:23,948 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 17:54:23,948 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 17:54:23,949 INFO  L138        SettingsManager]:  * Logic for external solver=AUFBV
[2024-02-28 17:54:23,949 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-02-28 17:54:23,949 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c4ed3e2a82a65e4e5822106607d69caac9bb1b03d24f9127c093cc95d8a8150
[2024-02-28 17:54:24,168 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 17:54:24,199 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 17:54:24,202 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 17:54:24,203 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-02-28 17:54:24,203 INFO  L275        PluginConnector]: CDTParser initialized
[2024-02-28 17:54:24,205 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-02-28 17:54:25,191 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 17:54:25,389 INFO  L351              CDTParser]: Found 1 translation units.
[2024-02-28 17:54:25,389 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-02-28 17:54:25,400 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/787395035/831d1d4b0dfa4bf3a7b21cd6b3913798/FLAGf1baa8d22
[2024-02-28 17:54:25,414 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/787395035/831d1d4b0dfa4bf3a7b21cd6b3913798
[2024-02-28 17:54:25,415 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 17:54:25,416 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 17:54:25,417 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 17:54:25,418 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 17:54:25,420 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 17:54:25,421 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:54:25" (1/1) ...
[2024-02-28 17:54:25,422 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c688530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25, skipping insertion in model container
[2024-02-28 17:54:25,422 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:54:25" (1/1) ...
[2024-02-28 17:54:25,427 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-02-28 17:54:25,460 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-02-28 17:54:25,579 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:54:25,755 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2024-02-28 17:54:25,760 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:54:25,769 INFO  L203         MainTranslator]: Completed pre-run
[2024-02-28 17:54:25,779 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:54:25,797 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2024-02-28 17:54:25,803 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:54:25,845 INFO  L208         MainTranslator]: Completed translation
[2024-02-28 17:54:25,845 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25 WrapperNode
[2024-02-28 17:54:25,846 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 17:54:25,846 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 17:54:25,847 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 17:54:25,847 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 17:54:25,852 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25" (1/1) ...
[2024-02-28 17:54:25,870 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25" (1/1) ...
[2024-02-28 17:54:25,889 INFO  L138                Inliner]: procedures = 279, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102
[2024-02-28 17:54:25,890 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 17:54:25,891 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 17:54:25,891 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 17:54:25,891 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 17:54:25,898 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25" (1/1) ...
[2024-02-28 17:54:25,899 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25" (1/1) ...
[2024-02-28 17:54:25,903 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25" (1/1) ...
[2024-02-28 17:54:25,903 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25" (1/1) ...
[2024-02-28 17:54:25,912 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25" (1/1) ...
[2024-02-28 17:54:25,915 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25" (1/1) ...
[2024-02-28 17:54:25,917 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25" (1/1) ...
[2024-02-28 17:54:25,918 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25" (1/1) ...
[2024-02-28 17:54:25,922 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 17:54:25,922 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 17:54:25,923 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 17:54:25,923 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-02-28 17:54:25,923 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25" (1/1) ...
[2024-02-28 17:54:25,928 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:54:25,937 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:54:25,947 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:25,972 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-02-28 17:54:25,997 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4
[2024-02-28 17:54:25,998 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 17:54:25,998 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 17:54:25,998 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 17:54:25,999 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2024-02-28 17:54:25,999 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-02-28 17:54:25,999 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 17:54:26,000 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2024-02-28 17:54:26,000 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 17:54:26,000 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 17:54:26,000 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 17:54:26,001 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 17:54:26,003 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-02-28 17:54:26,137 INFO  L235             CfgBuilder]: Building ICFG
[2024-02-28 17:54:26,144 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 17:54:26,517 INFO  L276             CfgBuilder]: Performing block encoding
[2024-02-28 17:54:26,523 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 17:54:26,524 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 17:54:26,525 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:54:26 BoogieIcfgContainer
[2024-02-28 17:54:26,525 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 17:54:26,527 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 17:54:26,527 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 17:54:26,530 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-02-28 17:54:26,530 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 05:54:25" (1/3) ...
[2024-02-28 17:54:26,530 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46faf0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:54:26, skipping insertion in model container
[2024-02-28 17:54:26,530 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:54:25" (2/3) ...
[2024-02-28 17:54:26,531 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46faf0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:54:26, skipping insertion in model container
[2024-02-28 17:54:26,531 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:54:26" (3/3) ...
[2024-02-28 17:54:26,532 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2024-02-28 17:54:26,538 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 17:54:26,544 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 17:54:26,544 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2024-02-28 17:54:26,544 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 17:54:26,593 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 17:54:26,619 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 147 transitions, 302 flow
[2024-02-28 17:54:26,679 INFO  L130       PetriNetUnfolder]: 7/212 cut-off events.
[2024-02-28 17:54:26,680 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:54:26,684 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 218 conditions, 212 events. 7/212 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 410 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. 
[2024-02-28 17:54:26,685 INFO  L82        GeneralOperation]: Start removeDead. Operand has 145 places, 147 transitions, 302 flow
[2024-02-28 17:54:26,689 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 145 places, 147 transitions, 302 flow
[2024-02-28 17:54:26,691 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 17:54:26,700 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 147 transitions, 302 flow
[2024-02-28 17:54:26,702 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 147 transitions, 302 flow
[2024-02-28 17:54:26,703 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 147 transitions, 302 flow
[2024-02-28 17:54:26,747 INFO  L130       PetriNetUnfolder]: 7/212 cut-off events.
[2024-02-28 17:54:26,747 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:54:26,748 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 218 conditions, 212 events. 7/212 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 410 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. 
[2024-02-28 17:54:26,750 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3744
[2024-02-28 17:54:30,189 INFO  L134        LiptonReduction]: Checked pairs total: 25082
[2024-02-28 17:54:30,190 INFO  L136        LiptonReduction]: Total number of compositions: 95
[2024-02-28 17:54:30,205 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 17:54:30,210 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@281618bc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 17:54:30,211 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2024-02-28 17:54:30,213 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2024-02-28 17:54:30,214 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 17:54:30,214 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:30,215 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-02-28 17:54:30,215 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:30,221 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:30,222 INFO  L85        PathProgramCache]: Analyzing trace with hash 473, now seen corresponding path program 1 times
[2024-02-28 17:54:30,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-02-28 17:54:30,232 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626052105]
[2024-02-28 17:54:30,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:30,232 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:30,232 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-02-28 17:54:30,264 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:30,266 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-02-28 17:54:30,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:30,485 INFO  L263         TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core
[2024-02-28 17:54:30,488 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:54:30,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:30,493 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:54:30,493 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-02-28 17:54:30,494 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626052105]
[2024-02-28 17:54:30,495 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626052105] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:30,495 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:30,495 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-02-28 17:54:30,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779712354]
[2024-02-28 17:54:30,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:30,503 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-02-28 17:54:30,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-02-28 17:54:30,517 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-02-28 17:54:30,518 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-02-28 17:54:30,520 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 242
[2024-02-28 17:54:30,521 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 142 flow. Second operand  has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:30,522 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:30,522 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 242
[2024-02-28 17:54:30,522 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:30,621 INFO  L130       PetriNetUnfolder]: 73/385 cut-off events.
[2024-02-28 17:54:30,622 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2024-02-28 17:54:30,623 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 569 conditions, 385 events. 73/385 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2075 event pairs, 72 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 499. Up to 178 conditions per place. 
[2024-02-28 17:54:30,625 INFO  L137   encePairwiseOnDemand]: 241/242 looper letters, 22 selfloop transitions, 0 changer transitions 0/66 dead transitions.
[2024-02-28 17:54:30,625 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 184 flow
[2024-02-28 17:54:30,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-02-28 17:54:30,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-02-28 17:54:30,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 305 transitions.
[2024-02-28 17:54:30,636 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6301652892561983
[2024-02-28 17:54:30,636 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 305 transitions.
[2024-02-28 17:54:30,636 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 305 transitions.
[2024-02-28 17:54:30,638 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:30,639 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 305 transitions.
[2024-02-28 17:54:30,642 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:30,646 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:30,647 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:30,648 INFO  L175             Difference]: Start difference. First operand has 69 places, 67 transitions, 142 flow. Second operand 2 states and 305 transitions.
[2024-02-28 17:54:30,649 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 184 flow
[2024-02-28 17:54:30,651 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:54:30,652 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 140 flow
[2024-02-28 17:54:30,654 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=140, PETRI_PLACES=69, PETRI_TRANSITIONS=66}
[2024-02-28 17:54:30,657 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places.
[2024-02-28 17:54:30,657 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 140 flow
[2024-02-28 17:54:30,658 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:30,658 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:30,658 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-02-28 17:54:30,668 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2024-02-28 17:54:30,859 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:30,860 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:30,861 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:30,861 INFO  L85        PathProgramCache]: Analyzing trace with hash 467532, now seen corresponding path program 1 times
[2024-02-28 17:54:30,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-02-28 17:54:30,863 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281183287]
[2024-02-28 17:54:30,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:30,863 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:30,864 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-02-28 17:54:30,865 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:30,867 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-02-28 17:54:30,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:30,937 INFO  L263         TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core
[2024-02-28 17:54:30,939 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:54:30,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:30,961 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:54:30,961 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-02-28 17:54:30,962 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281183287]
[2024-02-28 17:54:30,962 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281183287] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:30,962 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:30,962 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:54:30,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917858462]
[2024-02-28 17:54:30,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:30,964 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:54:30,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-02-28 17:54:30,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:54:30,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:54:30,986 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 242
[2024-02-28 17:54:30,988 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 140 flow. Second operand  has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:30,988 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:30,988 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 242
[2024-02-28 17:54:30,988 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:31,152 INFO  L130       PetriNetUnfolder]: 119/458 cut-off events.
[2024-02-28 17:54:31,152 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2024-02-28 17:54:31,153 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 752 conditions, 458 events. 119/458 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2370 event pairs, 58 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 748. Up to 153 conditions per place. 
[2024-02-28 17:54:31,155 INFO  L137   encePairwiseOnDemand]: 231/242 looper letters, 41 selfloop transitions, 8 changer transitions 0/87 dead transitions.
[2024-02-28 17:54:31,155 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 280 flow
[2024-02-28 17:54:31,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:54:31,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:54:31,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions.
[2024-02-28 17:54:31,159 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6088154269972452
[2024-02-28 17:54:31,159 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 442 transitions.
[2024-02-28 17:54:31,160 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions.
[2024-02-28 17:54:31,160 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:31,160 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions.
[2024-02-28 17:54:31,162 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:31,164 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:31,164 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:31,165 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 140 flow. Second operand 3 states and 442 transitions.
[2024-02-28 17:54:31,165 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 280 flow
[2024-02-28 17:54:31,166 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 87 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:54:31,167 INFO  L231             Difference]: Finished difference. Result has 73 places, 74 transitions, 210 flow
[2024-02-28 17:54:31,167 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=73, PETRI_TRANSITIONS=74}
[2024-02-28 17:54:31,168 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 4 predicate places.
[2024-02-28 17:54:31,168 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 210 flow
[2024-02-28 17:54:31,168 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:31,168 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:31,169 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:31,182 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2024-02-28 17:54:31,369 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:31,371 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:31,372 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:31,372 INFO  L85        PathProgramCache]: Analyzing trace with hash -1212481378, now seen corresponding path program 1 times
[2024-02-28 17:54:31,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-02-28 17:54:31,374 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519977999]
[2024-02-28 17:54:31,374 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:31,374 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:31,375 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-02-28 17:54:31,377 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:31,386 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-02-28 17:54:31,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:31,438 INFO  L263         TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core
[2024-02-28 17:54:31,438 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:54:31,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:31,447 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:54:31,448 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-02-28 17:54:31,448 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519977999]
[2024-02-28 17:54:31,448 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [519977999] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:31,449 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:31,449 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:54:31,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90248029]
[2024-02-28 17:54:31,450 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:31,450 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:54:31,451 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-02-28 17:54:31,451 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:54:31,452 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:54:31,482 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 131 out of 242
[2024-02-28 17:54:31,483 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 210 flow. Second operand  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:31,483 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:31,483 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 242
[2024-02-28 17:54:31,483 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:31,616 INFO  L130       PetriNetUnfolder]: 106/443 cut-off events.
[2024-02-28 17:54:31,617 INFO  L131       PetriNetUnfolder]: For 96/98 co-relation queries the response was YES.
[2024-02-28 17:54:31,618 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 853 conditions, 443 events. 106/443 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2329 event pairs, 78 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 847. Up to 229 conditions per place. 
[2024-02-28 17:54:31,619 INFO  L137   encePairwiseOnDemand]: 237/242 looper letters, 33 selfloop transitions, 6 changer transitions 0/83 dead transitions.
[2024-02-28 17:54:31,619 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 83 transitions, 316 flow
[2024-02-28 17:54:31,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:54:31,621 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:54:31,622 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions.
[2024-02-28 17:54:31,623 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5867768595041323
[2024-02-28 17:54:31,624 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 426 transitions.
[2024-02-28 17:54:31,624 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions.
[2024-02-28 17:54:31,624 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:31,625 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions.
[2024-02-28 17:54:31,626 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:31,629 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:31,629 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:31,629 INFO  L175             Difference]: Start difference. First operand has 73 places, 74 transitions, 210 flow. Second operand 3 states and 426 transitions.
[2024-02-28 17:54:31,629 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 83 transitions, 316 flow
[2024-02-28 17:54:31,631 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 83 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 17:54:31,632 INFO  L231             Difference]: Finished difference. Result has 74 places, 78 transitions, 236 flow
[2024-02-28 17:54:31,633 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=74, PETRI_TRANSITIONS=78}
[2024-02-28 17:54:31,633 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places.
[2024-02-28 17:54:31,634 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 236 flow
[2024-02-28 17:54:31,634 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:31,634 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:31,634 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:31,643 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-02-28 17:54:31,835 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:31,836 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:31,837 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:31,838 INFO  L85        PathProgramCache]: Analyzing trace with hash -1425225994, now seen corresponding path program 1 times
[2024-02-28 17:54:31,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-02-28 17:54:31,839 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458423480]
[2024-02-28 17:54:31,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:31,840 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:31,840 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-02-28 17:54:31,842 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:31,847 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-02-28 17:54:31,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:31,957 INFO  L263         TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core
[2024-02-28 17:54:31,961 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:54:31,994 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:54:32,012 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22
[2024-02-28 17:54:32,049 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:54:32,049 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36
[2024-02-28 17:54:32,086 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:54:32,087 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50
[2024-02-28 17:54:32,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:32,125 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:54:32,126 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-02-28 17:54:32,126 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458423480]
[2024-02-28 17:54:32,126 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [458423480] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:32,126 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:32,127 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:54:32,127 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466150535]
[2024-02-28 17:54:32,127 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:32,128 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:54:32,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-02-28 17:54:32,129 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:54:32,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:54:32,454 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 242
[2024-02-28 17:54:32,455 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 236 flow. Second operand  has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:32,456 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:32,456 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 242
[2024-02-28 17:54:32,456 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:32,991 INFO  L130       PetriNetUnfolder]: 407/1192 cut-off events.
[2024-02-28 17:54:32,991 INFO  L131       PetriNetUnfolder]: For 254/258 co-relation queries the response was YES.
[2024-02-28 17:54:32,993 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 1192 events. 407/1192 cut-off events. For 254/258 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7853 event pairs, 134 based on Foata normal form. 0/1130 useless extension candidates. Maximal degree in co-relation 2435. Up to 530 conditions per place. 
[2024-02-28 17:54:32,999 INFO  L137   encePairwiseOnDemand]: 219/242 looper letters, 89 selfloop transitions, 29 changer transitions 0/146 dead transitions.
[2024-02-28 17:54:32,999 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 146 transitions, 641 flow
[2024-02-28 17:54:33,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:54:33,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:54:33,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 810 transitions.
[2024-02-28 17:54:33,004 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5578512396694215
[2024-02-28 17:54:33,004 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 810 transitions.
[2024-02-28 17:54:33,004 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 810 transitions.
[2024-02-28 17:54:33,005 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:33,005 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 810 transitions.
[2024-02-28 17:54:33,006 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:33,009 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:33,010 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:33,010 INFO  L175             Difference]: Start difference. First operand has 74 places, 78 transitions, 236 flow. Second operand 6 states and 810 transitions.
[2024-02-28 17:54:33,010 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 146 transitions, 641 flow
[2024-02-28 17:54:33,013 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 146 transitions, 633 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 17:54:33,015 INFO  L231             Difference]: Finished difference. Result has 83 places, 107 transitions, 450 flow
[2024-02-28 17:54:33,015 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=450, PETRI_PLACES=83, PETRI_TRANSITIONS=107}
[2024-02-28 17:54:33,015 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 14 predicate places.
[2024-02-28 17:54:33,016 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 107 transitions, 450 flow
[2024-02-28 17:54:33,016 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:33,016 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:33,016 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:33,025 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0
[2024-02-28 17:54:33,224 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:33,225 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:33,226 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:33,226 INFO  L85        PathProgramCache]: Analyzing trace with hash 452500327, now seen corresponding path program 1 times
[2024-02-28 17:54:33,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-02-28 17:54:33,228 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983039115]
[2024-02-28 17:54:33,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:33,228 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:33,229 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-02-28 17:54:33,230 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:33,233 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-02-28 17:54:33,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:33,298 INFO  L263         TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core
[2024-02-28 17:54:33,299 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:54:33,309 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:33,309 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:54:33,309 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-02-28 17:54:33,310 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983039115]
[2024-02-28 17:54:33,310 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983039115] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:33,310 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:33,310 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:54:33,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582540030]
[2024-02-28 17:54:33,311 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:33,312 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:54:33,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-02-28 17:54:33,312 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:54:33,313 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:54:33,328 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 242
[2024-02-28 17:54:33,329 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 107 transitions, 450 flow. Second operand  has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:33,329 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:33,329 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 242
[2024-02-28 17:54:33,329 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:33,484 INFO  L130       PetriNetUnfolder]: 215/860 cut-off events.
[2024-02-28 17:54:33,484 INFO  L131       PetriNetUnfolder]: For 277/293 co-relation queries the response was YES.
[2024-02-28 17:54:33,486 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 860 events. 215/860 cut-off events. For 277/293 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5647 event pairs, 32 based on Foata normal form. 19/843 useless extension candidates. Maximal degree in co-relation 1989. Up to 338 conditions per place. 
[2024-02-28 17:54:33,488 INFO  L137   encePairwiseOnDemand]: 238/242 looper letters, 44 selfloop transitions, 2 changer transitions 0/118 dead transitions.
[2024-02-28 17:54:33,488 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 118 transitions, 578 flow
[2024-02-28 17:54:33,489 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:54:33,489 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:54:33,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions.
[2024-02-28 17:54:33,490 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6074380165289256
[2024-02-28 17:54:33,490 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 441 transitions.
[2024-02-28 17:54:33,490 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions.
[2024-02-28 17:54:33,491 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:33,491 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions.
[2024-02-28 17:54:33,492 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:33,493 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:33,494 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:33,494 INFO  L175             Difference]: Start difference. First operand has 83 places, 107 transitions, 450 flow. Second operand 3 states and 441 transitions.
[2024-02-28 17:54:33,494 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 118 transitions, 578 flow
[2024-02-28 17:54:33,497 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 118 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:54:33,499 INFO  L231             Difference]: Finished difference. Result has 84 places, 107 transitions, 460 flow
[2024-02-28 17:54:33,499 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=84, PETRI_TRANSITIONS=107}
[2024-02-28 17:54:33,500 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 15 predicate places.
[2024-02-28 17:54:33,500 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 107 transitions, 460 flow
[2024-02-28 17:54:33,500 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:33,500 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:33,500 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:33,509 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2024-02-28 17:54:33,701 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:33,702 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:33,702 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:33,703 INFO  L85        PathProgramCache]: Analyzing trace with hash -1792765839, now seen corresponding path program 1 times
[2024-02-28 17:54:33,703 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-02-28 17:54:33,704 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054411723]
[2024-02-28 17:54:33,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:33,705 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:33,705 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-02-28 17:54:33,707 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:33,709 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2024-02-28 17:54:33,787 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:33,789 INFO  L263         TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core
[2024-02-28 17:54:33,792 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:54:33,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:33,844 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:54:33,845 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-02-28 17:54:33,845 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054411723]
[2024-02-28 17:54:33,845 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054411723] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:33,846 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:33,846 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 17:54:33,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026065862]
[2024-02-28 17:54:33,847 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:33,847 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 17:54:33,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-02-28 17:54:33,848 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 17:54:33,848 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-02-28 17:54:33,947 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 242
[2024-02-28 17:54:33,948 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 107 transitions, 460 flow. Second operand  has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:33,948 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:33,948 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 242
[2024-02-28 17:54:33,948 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:34,149 INFO  L130       PetriNetUnfolder]: 193/868 cut-off events.
[2024-02-28 17:54:34,150 INFO  L131       PetriNetUnfolder]: For 297/307 co-relation queries the response was YES.
[2024-02-28 17:54:34,151 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 868 events. 193/868 cut-off events. For 297/307 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6181 event pairs, 18 based on Foata normal form. 2/832 useless extension candidates. Maximal degree in co-relation 2026. Up to 292 conditions per place. 
[2024-02-28 17:54:34,154 INFO  L137   encePairwiseOnDemand]: 238/242 looper letters, 42 selfloop transitions, 2 changer transitions 4/123 dead transitions.
[2024-02-28 17:54:34,154 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 123 transitions, 613 flow
[2024-02-28 17:54:34,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 17:54:34,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 17:54:34,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions.
[2024-02-28 17:54:34,156 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5981404958677686
[2024-02-28 17:54:34,156 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 579 transitions.
[2024-02-28 17:54:34,156 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions.
[2024-02-28 17:54:34,157 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:34,157 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions.
[2024-02-28 17:54:34,158 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:34,159 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:34,160 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:34,160 INFO  L175             Difference]: Start difference. First operand has 84 places, 107 transitions, 460 flow. Second operand 4 states and 579 transitions.
[2024-02-28 17:54:34,160 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 123 transitions, 613 flow
[2024-02-28 17:54:34,164 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 123 transitions, 613 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:54:34,165 INFO  L231             Difference]: Finished difference. Result has 89 places, 107 transitions, 470 flow
[2024-02-28 17:54:34,165 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=470, PETRI_PLACES=89, PETRI_TRANSITIONS=107}
[2024-02-28 17:54:34,166 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 20 predicate places.
[2024-02-28 17:54:34,166 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 107 transitions, 470 flow
[2024-02-28 17:54:34,166 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:34,166 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:34,167 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:34,177 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0
[2024-02-28 17:54:34,367 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:34,368 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:34,369 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:34,369 INFO  L85        PathProgramCache]: Analyzing trace with hash -680468640, now seen corresponding path program 1 times
[2024-02-28 17:54:34,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-02-28 17:54:34,371 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750922836]
[2024-02-28 17:54:34,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:34,371 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:34,372 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-02-28 17:54:34,373 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:34,380 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2024-02-28 17:54:34,481 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:34,484 INFO  L263         TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core
[2024-02-28 17:54:34,487 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:54:34,498 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13
[2024-02-28 17:54:34,518 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33
[2024-02-28 17:54:34,550 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:54:34,550 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52
[2024-02-28 17:54:34,592 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:54:34,593 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71
[2024-02-28 17:54:34,636 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:34,636 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:54:34,637 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-02-28 17:54:34,637 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750922836]
[2024-02-28 17:54:34,637 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750922836] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:34,637 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:34,637 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:54:34,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165862524]
[2024-02-28 17:54:34,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:34,638 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:54:34,638 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-02-28 17:54:34,638 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:54:34,638 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:54:34,930 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242
[2024-02-28 17:54:34,930 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 107 transitions, 470 flow. Second operand  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:34,931 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:34,931 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242
[2024-02-28 17:54:34,931 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:35,711 INFO  L130       PetriNetUnfolder]: 565/1517 cut-off events.
[2024-02-28 17:54:35,711 INFO  L131       PetriNetUnfolder]: For 805/820 co-relation queries the response was YES.
[2024-02-28 17:54:35,714 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4225 conditions, 1517 events. 565/1517 cut-off events. For 805/820 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10258 event pairs, 170 based on Foata normal form. 2/1445 useless extension candidates. Maximal degree in co-relation 4210. Up to 966 conditions per place. 
[2024-02-28 17:54:35,718 INFO  L137   encePairwiseOnDemand]: 219/242 looper letters, 127 selfloop transitions, 85 changer transitions 0/241 dead transitions.
[2024-02-28 17:54:35,718 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 241 transitions, 1458 flow
[2024-02-28 17:54:35,719 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:54:35,719 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:54:35,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions.
[2024-02-28 17:54:35,720 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5819559228650137
[2024-02-28 17:54:35,721 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 845 transitions.
[2024-02-28 17:54:35,721 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 845 transitions.
[2024-02-28 17:54:35,721 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:35,721 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 845 transitions.
[2024-02-28 17:54:35,722 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:35,724 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:35,724 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:35,725 INFO  L175             Difference]: Start difference. First operand has 89 places, 107 transitions, 470 flow. Second operand 6 states and 845 transitions.
[2024-02-28 17:54:35,725 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 241 transitions, 1458 flow
[2024-02-28 17:54:35,729 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 241 transitions, 1436 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-02-28 17:54:35,731 INFO  L231             Difference]: Finished difference. Result has 95 places, 188 transitions, 1212 flow
[2024-02-28 17:54:35,731 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1212, PETRI_PLACES=95, PETRI_TRANSITIONS=188}
[2024-02-28 17:54:35,732 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places.
[2024-02-28 17:54:35,732 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 188 transitions, 1212 flow
[2024-02-28 17:54:35,732 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:35,732 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:35,732 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:35,741 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0
[2024-02-28 17:54:35,933 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:35,933 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:35,940 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:35,940 INFO  L85        PathProgramCache]: Analyzing trace with hash -1641426374, now seen corresponding path program 1 times
[2024-02-28 17:54:35,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-02-28 17:54:35,942 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743210645]
[2024-02-28 17:54:35,942 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:35,942 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:35,942 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-02-28 17:54:35,944 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:35,945 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2024-02-28 17:54:36,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:36,037 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core
[2024-02-28 17:54:36,039 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:54:36,236 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:36,236 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:54:36,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:36,434 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-02-28 17:54:36,434 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743210645]
[2024-02-28 17:54:36,434 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743210645] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:54:36,434 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-02-28 17:54:36,434 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9
[2024-02-28 17:54:36,434 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138921572]
[2024-02-28 17:54:36,434 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:54:36,435 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 17:54:36,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-02-28 17:54:36,435 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 17:54:36,435 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2024-02-28 17:54:36,781 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 131 out of 242
[2024-02-28 17:54:36,782 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 188 transitions, 1212 flow. Second operand  has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:36,782 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:36,782 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 242
[2024-02-28 17:54:36,782 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:37,086 INFO  L130       PetriNetUnfolder]: 271/947 cut-off events.
[2024-02-28 17:54:37,086 INFO  L131       PetriNetUnfolder]: For 907/937 co-relation queries the response was YES.
[2024-02-28 17:54:37,089 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2844 conditions, 947 events. 271/947 cut-off events. For 907/937 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6320 event pairs, 52 based on Foata normal form. 4/924 useless extension candidates. Maximal degree in co-relation 2826. Up to 234 conditions per place. 
[2024-02-28 17:54:37,094 INFO  L137   encePairwiseOnDemand]: 235/242 looper letters, 43 selfloop transitions, 6 changer transitions 12/184 dead transitions.
[2024-02-28 17:54:37,094 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 184 transitions, 1209 flow
[2024-02-28 17:54:37,094 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:54:37,095 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:54:37,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 959 transitions.
[2024-02-28 17:54:37,098 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5661157024793388
[2024-02-28 17:54:37,098 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 959 transitions.
[2024-02-28 17:54:37,098 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 959 transitions.
[2024-02-28 17:54:37,099 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:37,099 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 959 transitions.
[2024-02-28 17:54:37,101 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:37,103 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:37,103 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:37,103 INFO  L175             Difference]: Start difference. First operand has 95 places, 188 transitions, 1212 flow. Second operand 7 states and 959 transitions.
[2024-02-28 17:54:37,103 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 184 transitions, 1209 flow
[2024-02-28 17:54:37,109 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 184 transitions, 1149 flow, removed 27 selfloop flow, removed 2 redundant places.
[2024-02-28 17:54:37,111 INFO  L231             Difference]: Finished difference. Result has 100 places, 153 transitions, 935 flow
[2024-02-28 17:54:37,111 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=935, PETRI_PLACES=100, PETRI_TRANSITIONS=153}
[2024-02-28 17:54:37,114 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 31 predicate places.
[2024-02-28 17:54:37,114 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 153 transitions, 935 flow
[2024-02-28 17:54:37,114 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:37,115 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:37,115 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:37,126 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0
[2024-02-28 17:54:37,315 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:37,316 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:37,317 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:37,317 INFO  L85        PathProgramCache]: Analyzing trace with hash 1826499191, now seen corresponding path program 1 times
[2024-02-28 17:54:37,318 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-02-28 17:54:37,318 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134370577]
[2024-02-28 17:54:37,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:37,318 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:37,318 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-02-28 17:54:37,323 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:37,325 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2024-02-28 17:54:37,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:37,412 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core
[2024-02-28 17:54:37,418 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:54:37,689 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:54:37,717 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22
[2024-02-28 17:54:37,778 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:54:37,778 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36
[2024-02-28 17:54:37,859 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:54:37,860 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50
[2024-02-28 17:54:37,950 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:54:37,951 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 17:54:38,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:54:38,015 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:54:38,016 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-02-28 17:54:38,016 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134370577]
[2024-02-28 17:54:38,016 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [134370577] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:38,016 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:38,016 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-02-28 17:54:38,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859503563]
[2024-02-28 17:54:38,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:38,016 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-02-28 17:54:38,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-02-28 17:54:38,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-02-28 17:54:38,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-02-28 17:54:40,152 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242
[2024-02-28 17:54:40,153 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 153 transitions, 935 flow. Second operand  has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:40,153 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:40,153 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242
[2024-02-28 17:54:40,153 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:40,876 INFO  L130       PetriNetUnfolder]: 384/1088 cut-off events.
[2024-02-28 17:54:40,876 INFO  L131       PetriNetUnfolder]: For 1083/1091 co-relation queries the response was YES.
[2024-02-28 17:54:40,878 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 1088 events. 384/1088 cut-off events. For 1083/1091 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6878 event pairs, 168 based on Foata normal form. 26/1085 useless extension candidates. Maximal degree in co-relation 3719. Up to 792 conditions per place. 
[2024-02-28 17:54:40,882 INFO  L137   encePairwiseOnDemand]: 235/242 looper letters, 114 selfloop transitions, 5 changer transitions 0/160 dead transitions.
[2024-02-28 17:54:40,882 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 160 transitions, 1217 flow
[2024-02-28 17:54:40,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:54:40,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:54:40,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions.
[2024-02-28 17:54:40,884 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.49763872491145217
[2024-02-28 17:54:40,884 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 843 transitions.
[2024-02-28 17:54:40,884 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions.
[2024-02-28 17:54:40,885 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:40,885 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions.
[2024-02-28 17:54:40,886 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:40,888 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:40,888 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:40,888 INFO  L175             Difference]: Start difference. First operand has 100 places, 153 transitions, 935 flow. Second operand 7 states and 843 transitions.
[2024-02-28 17:54:40,888 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 160 transitions, 1217 flow
[2024-02-28 17:54:40,894 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 160 transitions, 1194 flow, removed 1 selfloop flow, removed 5 redundant places.
[2024-02-28 17:54:40,896 INFO  L231             Difference]: Finished difference. Result has 95 places, 155 transitions, 962 flow
[2024-02-28 17:54:40,896 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=962, PETRI_PLACES=95, PETRI_TRANSITIONS=155}
[2024-02-28 17:54:40,896 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places.
[2024-02-28 17:54:40,896 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 155 transitions, 962 flow
[2024-02-28 17:54:40,897 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:40,897 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:40,897 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:40,906 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0
[2024-02-28 17:54:41,101 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:41,102 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:41,103 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:41,103 INFO  L85        PathProgramCache]: Analyzing trace with hash 1814981271, now seen corresponding path program 1 times
[2024-02-28 17:54:41,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-02-28 17:54:41,104 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152783697]
[2024-02-28 17:54:41,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:41,104 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:41,105 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-02-28 17:54:41,106 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:41,109 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2024-02-28 17:54:41,213 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:41,216 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core
[2024-02-28 17:54:41,222 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:54:41,373 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13
[2024-02-28 17:54:41,413 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33
[2024-02-28 17:54:41,467 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:54:41,467 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52
[2024-02-28 17:54:41,534 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:54:41,534 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71
[2024-02-28 17:54:41,615 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:54:41,615 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58
[2024-02-28 17:54:41,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:54:41,699 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:54:41,699 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-02-28 17:54:41,699 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152783697]
[2024-02-28 17:54:41,700 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [152783697] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:41,700 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:41,700 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-02-28 17:54:41,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830300647]
[2024-02-28 17:54:41,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:41,700 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-02-28 17:54:41,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-02-28 17:54:41,701 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-02-28 17:54:41,701 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-02-28 17:54:43,001 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242
[2024-02-28 17:54:43,002 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 155 transitions, 962 flow. Second operand  has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:43,002 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:43,002 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242
[2024-02-28 17:54:43,002 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:45,778 INFO  L130       PetriNetUnfolder]: 403/1095 cut-off events.
[2024-02-28 17:54:45,778 INFO  L131       PetriNetUnfolder]: For 1014/1023 co-relation queries the response was YES.
[2024-02-28 17:54:45,781 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3775 conditions, 1095 events. 403/1095 cut-off events. For 1014/1023 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6778 event pairs, 132 based on Foata normal form. 20/1082 useless extension candidates. Maximal degree in co-relation 3753. Up to 521 conditions per place. 
[2024-02-28 17:54:45,787 INFO  L137   encePairwiseOnDemand]: 230/242 looper letters, 177 selfloop transitions, 48 changer transitions 0/249 dead transitions.
[2024-02-28 17:54:45,787 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 249 transitions, 1973 flow
[2024-02-28 17:54:45,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:54:45,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:54:45,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions.
[2024-02-28 17:54:45,790 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5330578512396694
[2024-02-28 17:54:45,790 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 903 transitions.
[2024-02-28 17:54:45,790 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions.
[2024-02-28 17:54:45,790 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:45,790 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions.
[2024-02-28 17:54:45,792 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:45,794 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:45,794 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:45,794 INFO  L175             Difference]: Start difference. First operand has 95 places, 155 transitions, 962 flow. Second operand 7 states and 903 transitions.
[2024-02-28 17:54:45,794 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 249 transitions, 1973 flow
[2024-02-28 17:54:45,801 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 249 transitions, 1964 flow, removed 4 selfloop flow, removed 1 redundant places.
[2024-02-28 17:54:45,803 INFO  L231             Difference]: Finished difference. Result has 105 places, 167 transitions, 1233 flow
[2024-02-28 17:54:45,804 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1233, PETRI_PLACES=105, PETRI_TRANSITIONS=167}
[2024-02-28 17:54:45,804 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 36 predicate places.
[2024-02-28 17:54:45,804 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 167 transitions, 1233 flow
[2024-02-28 17:54:45,805 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:45,805 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:45,805 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:45,821 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0
[2024-02-28 17:54:46,006 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:46,006 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:46,007 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:46,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -86355948, now seen corresponding path program 1 times
[2024-02-28 17:54:46,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-02-28 17:54:46,009 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410254503]
[2024-02-28 17:54:46,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:46,010 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:46,010 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-02-28 17:54:46,012 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:46,013 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2024-02-28 17:54:46,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:46,107 INFO  L263         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core
[2024-02-28 17:54:46,108 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:54:46,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:54:46,118 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:54:46,118 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-02-28 17:54:46,118 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410254503]
[2024-02-28 17:54:46,118 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [410254503] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:46,119 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:46,119 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:54:46,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621411509]
[2024-02-28 17:54:46,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:46,119 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:54:46,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-02-28 17:54:46,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:54:46,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:54:46,142 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 242
[2024-02-28 17:54:46,143 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 167 transitions, 1233 flow. Second operand  has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:46,143 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:46,143 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 242
[2024-02-28 17:54:46,143 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:46,321 INFO  L130       PetriNetUnfolder]: 280/891 cut-off events.
[2024-02-28 17:54:46,321 INFO  L131       PetriNetUnfolder]: For 1922/1959 co-relation queries the response was YES.
[2024-02-28 17:54:46,323 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3244 conditions, 891 events. 280/891 cut-off events. For 1922/1959 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5705 event pairs, 69 based on Foata normal form. 11/867 useless extension candidates. Maximal degree in co-relation 3217. Up to 294 conditions per place. 
[2024-02-28 17:54:46,326 INFO  L137   encePairwiseOnDemand]: 236/242 looper letters, 39 selfloop transitions, 10 changer transitions 0/179 dead transitions.
[2024-02-28 17:54:46,326 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 179 transitions, 1381 flow
[2024-02-28 17:54:46,326 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:54:46,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:54:46,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions.
[2024-02-28 17:54:46,328 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5895316804407713
[2024-02-28 17:54:46,328 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 428 transitions.
[2024-02-28 17:54:46,328 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions.
[2024-02-28 17:54:46,328 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:46,328 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions.
[2024-02-28 17:54:46,329 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:46,330 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:46,330 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:46,330 INFO  L175             Difference]: Start difference. First operand has 105 places, 167 transitions, 1233 flow. Second operand 3 states and 428 transitions.
[2024-02-28 17:54:46,331 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 179 transitions, 1381 flow
[2024-02-28 17:54:46,339 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 179 transitions, 1368 flow, removed 6 selfloop flow, removed 1 redundant places.
[2024-02-28 17:54:46,341 INFO  L231             Difference]: Finished difference. Result has 107 places, 173 transitions, 1292 flow
[2024-02-28 17:54:46,341 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1292, PETRI_PLACES=107, PETRI_TRANSITIONS=173}
[2024-02-28 17:54:46,341 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 38 predicate places.
[2024-02-28 17:54:46,341 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 173 transitions, 1292 flow
[2024-02-28 17:54:46,342 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:46,342 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:46,342 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:46,357 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0
[2024-02-28 17:54:46,542 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:46,543 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:46,544 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:46,544 INFO  L85        PathProgramCache]: Analyzing trace with hash -1426846396, now seen corresponding path program 1 times
[2024-02-28 17:54:46,545 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-02-28 17:54:46,545 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615176059]
[2024-02-28 17:54:46,545 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:46,546 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:46,546 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-02-28 17:54:46,548 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:46,550 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2024-02-28 17:54:46,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:54:46,648 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core
[2024-02-28 17:54:46,652 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:54:46,657 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 17:54:46,669 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29
[2024-02-28 17:54:46,692 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:54:46,692 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46
[2024-02-28 17:54:46,730 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:54:46,731 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63
[2024-02-28 17:54:46,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:54:46,770 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:54:46,771 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-02-28 17:54:46,771 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615176059]
[2024-02-28 17:54:46,771 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615176059] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:54:46,771 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:54:46,771 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:54:46,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192460860]
[2024-02-28 17:54:46,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:54:46,771 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:54:46,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-02-28 17:54:46,772 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:54:46,772 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:54:47,442 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 242
[2024-02-28 17:54:47,444 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 173 transitions, 1292 flow. Second operand  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:47,444 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:54:47,444 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 242
[2024-02-28 17:54:47,445 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:54:48,134 INFO  L130       PetriNetUnfolder]: 411/1111 cut-off events.
[2024-02-28 17:54:48,134 INFO  L131       PetriNetUnfolder]: For 2953/3001 co-relation queries the response was YES.
[2024-02-28 17:54:48,136 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4544 conditions, 1111 events. 411/1111 cut-off events. For 2953/3001 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6802 event pairs, 104 based on Foata normal form. 12/1098 useless extension candidates. Maximal degree in co-relation 4516. Up to 586 conditions per place. 
[2024-02-28 17:54:48,140 INFO  L137   encePairwiseOnDemand]: 231/242 looper letters, 85 selfloop transitions, 41 changer transitions 36/239 dead transitions.
[2024-02-28 17:54:48,140 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 239 transitions, 2072 flow
[2024-02-28 17:54:48,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:54:48,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:54:48,142 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 832 transitions.
[2024-02-28 17:54:48,142 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5730027548209367
[2024-02-28 17:54:48,142 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 832 transitions.
[2024-02-28 17:54:48,142 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 832 transitions.
[2024-02-28 17:54:48,142 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:54:48,142 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 832 transitions.
[2024-02-28 17:54:48,144 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:48,145 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:48,146 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:48,146 INFO  L175             Difference]: Start difference. First operand has 107 places, 173 transitions, 1292 flow. Second operand 6 states and 832 transitions.
[2024-02-28 17:54:48,146 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 239 transitions, 2072 flow
[2024-02-28 17:54:48,157 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 239 transitions, 2056 flow, removed 1 selfloop flow, removed 1 redundant places.
[2024-02-28 17:54:48,160 INFO  L231             Difference]: Finished difference. Result has 116 places, 195 transitions, 1624 flow
[2024-02-28 17:54:48,160 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1624, PETRI_PLACES=116, PETRI_TRANSITIONS=195}
[2024-02-28 17:54:48,161 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 47 predicate places.
[2024-02-28 17:54:48,161 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 195 transitions, 1624 flow
[2024-02-28 17:54:48,161 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:54:48,162 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:54:48,162 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:48,171 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0
[2024-02-28 17:54:48,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:48,363 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 17:54:48,363 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:54:48,364 INFO  L85        PathProgramCache]: Analyzing trace with hash -1114213243, now seen corresponding path program 1 times
[2024-02-28 17:54:48,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-02-28 17:54:48,364 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538774186]
[2024-02-28 17:54:48,365 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:54:48,365 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:48,365 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-02-28 17:54:48,366 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-02-28 17:54:48,369 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process
[2024-02-28 17:54:48,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:54:48,474 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 17:54:48,506 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:54:48,544 INFO  L130   FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2024-02-28 17:54:48,544 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 17:54:48,545 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining)
[2024-02-28 17:54:48,547 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2024-02-28 17:54:48,547 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2024-02-28 17:54:48,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2024-02-28 17:54:48,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2024-02-28 17:54:48,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2024-02-28 17:54:48,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2024-02-28 17:54:48,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2024-02-28 17:54:48,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2024-02-28 17:54:48,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining)
[2024-02-28 17:54:48,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2024-02-28 17:54:48,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2024-02-28 17:54:48,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2024-02-28 17:54:48,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2024-02-28 17:54:48,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2024-02-28 17:54:48,549 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2024-02-28 17:54:48,549 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2024-02-28 17:54:48,549 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2024-02-28 17:54:48,563 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0
[2024-02-28 17:54:48,749 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-02-28 17:54:48,750 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:54:48,760 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-02-28 17:54:48,760 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-02-28 17:54:48,789 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 05:54:48 BasicIcfg
[2024-02-28 17:54:48,789 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-02-28 17:54:48,790 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-02-28 17:54:48,790 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2024-02-28 17:54:48,790 INFO  L275        PluginConnector]: Witness Printer initialized
[2024-02-28 17:54:48,790 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:54:26" (3/4) ...
[2024-02-28 17:54:48,792 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-02-28 17:54:48,792 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-02-28 17:54:48,792 INFO  L158              Benchmark]: Toolchain (without parser) took 23375.69ms. Allocated memory was 92.3MB in the beginning and 125.8MB in the end (delta: 33.6MB). Free memory was 48.1MB in the beginning and 42.6MB in the end (delta: 5.5MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB.
[2024-02-28 17:54:48,792 INFO  L158              Benchmark]: CDTParser took 0.22ms. Allocated memory is still 92.3MB. Free memory was 69.9MB in the beginning and 69.8MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-02-28 17:54:48,793 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 428.47ms. Allocated memory is still 92.3MB. Free memory was 47.8MB in the beginning and 51.0MB in the end (delta: -3.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB.
[2024-02-28 17:54:48,793 INFO  L158              Benchmark]: Boogie Procedure Inliner took 43.68ms. Allocated memory is still 92.3MB. Free memory was 51.0MB in the beginning and 48.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-02-28 17:54:48,793 INFO  L158              Benchmark]: Boogie Preprocessor took 31.20ms. Allocated memory is still 92.3MB. Free memory was 48.4MB in the beginning and 45.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-02-28 17:54:48,793 INFO  L158              Benchmark]: RCFGBuilder took 603.17ms. Allocated memory is still 92.3MB. Free memory was 45.9MB in the beginning and 57.6MB in the end (delta: -11.7MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB.
[2024-02-28 17:54:48,793 INFO  L158              Benchmark]: TraceAbstraction took 22261.92ms. Allocated memory was 92.3MB in the beginning and 125.8MB in the end (delta: 33.6MB). Free memory was 56.6MB in the beginning and 42.6MB in the end (delta: 14.0MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB.
[2024-02-28 17:54:48,794 INFO  L158              Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 125.8MB. Free memory is still 42.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-02-28 17:54:48,795 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.22ms. Allocated memory is still 92.3MB. Free memory was 69.9MB in the beginning and 69.8MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 428.47ms. Allocated memory is still 92.3MB. Free memory was 47.8MB in the beginning and 51.0MB in the end (delta: -3.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 43.68ms. Allocated memory is still 92.3MB. Free memory was 51.0MB in the beginning and 48.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 31.20ms. Allocated memory is still 92.3MB. Free memory was 48.4MB in the beginning and 45.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 603.17ms. Allocated memory is still 92.3MB. Free memory was 45.9MB in the beginning and 57.6MB in the end (delta: -11.7MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 22261.92ms. Allocated memory was 92.3MB in the beginning and 125.8MB in the end (delta: 33.6MB). Free memory was 56.6MB in the beginning and 42.6MB in the end (delta: 14.0MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB.
 * Witness Printer took 2.26ms. Allocated memory is still 125.8MB. Free memory is still 42.6MB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 3.5s, 145 PlacesBefore, 69 PlacesAfterwards, 147 TransitionsBefore, 67 TransitionsAfterwards, 3744 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 95 TotalNumberOfCompositions, 25082 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6302, independent: 5432, independent conditional: 0, independent unconditional: 5432, dependent: 870, dependent conditional: 0, dependent unconditional: 870, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1627, independent: 1546, independent conditional: 0, independent unconditional: 1546, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6302, independent: 3886, independent conditional: 0, independent unconditional: 3886, dependent: 789, dependent conditional: 0, dependent unconditional: 789, unknown: 1627, unknown conditional: 0, unknown unconditional: 1627] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 340, Positive conditional cache size: 0, Positive unconditional cache size: 340, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 1052]: Data race detected
    Data race detected
The following path leads to a data race: 
[L1037]               0  int threads_mask = -1;
[L1038]               0  int *datas;
[L1046]               0  int threads_total = __VERIFIER_nondet_int();
[L1047]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L1034]  COND FALSE   0  !(!cond)
[L1047]  RET          0  assume_abort_if_not(threads_total >= 0)
[L1048]  CALL         0  assume_abort_if_not(threads_total < 32)
[L1034]  COND FALSE   0  !(!cond)
[L1048]  RET          0  assume_abort_if_not(threads_total < 32)
[L1049]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1049]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1050]               0  datas = malloc(threads_total * sizeof(int))
[L1051]               0  int i = 0;
         VAL             [datas={1:0}, i=0, threads_mask=-1, threads_total=3, tids={7:0}]
[L1051]  COND TRUE    0  i < threads_total
[L1052]  EXPR         0  ffs(threads_mask)
[L1052]               0  int j = ffs(threads_mask) - 1;
[L1053]               0  threads_mask &= ~(1 << j)
[L1054]  EXPR         0  \read(*tids)
         VAL             [\read(*tids)={5:0}, datas={1:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, (void*)j)=0, threads_mask=-2, threads_total=3, tids={7:0}]
[L1054]  EXPR         0  tids[i]
         VAL             [\read(*tids)={5:0}, datas={1:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, (void*)j)=0, threads_mask=-2, threads_total=3, tids={7:0}]
[L1054]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, (void*)j)
         VAL             [\read(*tids)={5:0}, arg={0:0}, datas={1:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, (void*)j)=0, threads_mask=-2, threads_total=3, tids={7:0}]
[L1051]               0  i++
         VAL             [arg={0:0}, datas={1:0}, i=1, j=0, threads_mask=-2, threads_total=3, tids={7:0}]
[L1040]               1  int j = (int)arg;
[L1041]  EXPR         1  datas[j]
         VAL             [arg={0:0}, arg={0:0}, datas={1:0}, j=0, threads_mask=-2]
[L1041]               1  datas[j] = __VERIFIER_nondet_int()
         VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, datas={1:0}, j=0, threads_mask=-2]
[L1051]  COND TRUE    0  i < threads_total
[L1041]               1  datas[j] = __VERIFIER_nondet_int()
[L1042]               1  threads_mask |= 1 << j
         VAL             [arg={0:0}, arg={0:0}, datas={1:0}, j=0, threads_mask=-1, threads_mask |= 1 << j=-1]
[L1052]               0  ffs(threads_mask)
         VAL             [arg={0:0}, arg={0:0}, datas={1:0}, i=1, j=0, j=0, threads_mask=-1, threads_mask |= 1 << j=-1, threads_total=3, tids={7:0}]

Now there is a data race on ~threads_mask~0 between 
	C: threads_mask |= 1 << j [1042]
and
	C: ffs(threads_mask) [1052]

  - UnprovableResult [Line: 1050]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1057]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1059]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1060]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1057]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 170 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.1s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1300 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 944 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 365 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3001 IncrementalHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 365 mSolverCounterUnsat, 23 mSDtfsCounter, 3001 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1624occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 226 ConstructedInterpolants, 54 QuantifiedInterpolants, 1643 SizeOfPredicates, 14 NumberOfNonLiveVariables, 919 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 3/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-02-28 17:54:48,829 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
