./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_safe-10-racy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/fib_safe-10-racy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 a48fe857d08ac3a4ba438de35e4bd3e7e5363b4267f7ed4ba2475f684ca08cd5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 17:28:06,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 17:28:06,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-22 17:28:06,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 17:28:06,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 17:28:06,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 17:28:06,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 17:28:06,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 17:28:06,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 17:28:06,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 17:28:06,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 17:28:06,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 17:28:06,380 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 17:28:06,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 17:28:06,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 17:28:06,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 17:28:06,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 17:28:06,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 17:28:06,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 17:28:06,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 17:28:06,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 17:28:06,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 17:28:06,388 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-22 17:28:06,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 17:28:06,388 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 17:28:06,389 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 17:28:06,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 17:28:06,389 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 17:28:06,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 17:28:06,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 17:28:06,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 17:28:06,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 17:28:06,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 17:28:06,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 17:28:06,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 17:28:06,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 17:28:06,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 17:28:06,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 17:28:06,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 17:28:06,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 17:28:06,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 17:28:06,392 INFO L153 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:/storage/repos/ultimate/releaseScripts/default/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> a48fe857d08ac3a4ba438de35e4bd3e7e5363b4267f7ed4ba2475f684ca08cd5 [2024-11-22 17:28:06,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 17:28:06,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 17:28:06,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 17:28:06,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 17:28:06,632 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 17:28:06,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_safe-10-racy.i [2024-11-22 17:28:07,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 17:28:08,201 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 17:28:08,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_safe-10-racy.i [2024-11-22 17:28:08,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86e2a384/baff160973854e02bcf7ee8908c4aab1/FLAG7f1e21c5d [2024-11-22 17:28:08,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86e2a384/baff160973854e02bcf7ee8908c4aab1 [2024-11-22 17:28:08,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 17:28:08,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 17:28:08,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 17:28:08,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 17:28:08,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 17:28:08,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:28:08" (1/1) ... [2024-11-22 17:28:08,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158ee319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08, skipping insertion in model container [2024-11-22 17:28:08,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:28:08" (1/1) ... [2024-11-22 17:28:08,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 17:28:08,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 17:28:08,559 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 17:28:08,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 17:28:08,676 INFO L204 MainTranslator]: Completed translation [2024-11-22 17:28:08,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08 WrapperNode [2024-11-22 17:28:08,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 17:28:08,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 17:28:08,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 17:28:08,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 17:28:08,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08" (1/1) ... [2024-11-22 17:28:08,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08" (1/1) ... [2024-11-22 17:28:08,722 INFO L138 Inliner]: procedures = 163, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-11-22 17:28:08,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 17:28:08,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 17:28:08,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 17:28:08,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 17:28:08,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08" (1/1) ... [2024-11-22 17:28:08,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08" (1/1) ... [2024-11-22 17:28:08,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08" (1/1) ... [2024-11-22 17:28:08,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08" (1/1) ... [2024-11-22 17:28:08,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08" (1/1) ... [2024-11-22 17:28:08,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08" (1/1) ... [2024-11-22 17:28:08,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08" (1/1) ... [2024-11-22 17:28:08,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08" (1/1) ... [2024-11-22 17:28:08,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 17:28:08,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 17:28:08,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 17:28:08,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 17:28:08,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08" (1/1) ... [2024-11-22 17:28:08,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 17:28:08,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:28:08,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 17:28:08,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 17:28:08,841 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-22 17:28:08,842 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-22 17:28:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-22 17:28:08,842 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-22 17:28:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 17:28:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 17:28:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 17:28:08,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 17:28:08,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 17:28:08,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 17:28:08,844 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 17:28:08,961 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 17:28:08,964 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 17:28:09,228 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 17:28:09,228 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 17:28:09,336 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 17:28:09,337 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-22 17:28:09,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:28:09 BoogieIcfgContainer [2024-11-22 17:28:09,340 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 17:28:09,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 17:28:09,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 17:28:09,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 17:28:09,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:28:08" (1/3) ... [2024-11-22 17:28:09,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf121b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:28:09, skipping insertion in model container [2024-11-22 17:28:09,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:28:08" (2/3) ... [2024-11-22 17:28:09,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf121b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:28:09, skipping insertion in model container [2024-11-22 17:28:09,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:28:09" (3/3) ... [2024-11-22 17:28:09,356 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-10-racy.i [2024-11-22 17:28:09,387 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 17:28:09,387 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-22 17:28:09,387 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 17:28:09,483 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 17:28:09,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 188 transitions, 384 flow [2024-11-22 17:28:09,660 INFO L124 PetriNetUnfolderBase]: 9/186 cut-off events. [2024-11-22 17:28:09,660 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:09,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 186 events. 9/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 382 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2024-11-22 17:28:09,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 188 transitions, 384 flow [2024-11-22 17:28:09,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 186 transitions, 378 flow [2024-11-22 17:28:09,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 17:28:09,686 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@8c67287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 17:28:09,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-22 17:28:09,691 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 17:28:09,691 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-22 17:28:09,691 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:09,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:09,692 INFO L204 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] [2024-11-22 17:28:09,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:09,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:09,697 INFO L85 PathProgramCache]: Analyzing trace with hash 959234546, now seen corresponding path program 1 times [2024-11-22 17:28:09,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:09,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866282235] [2024-11-22 17:28:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:09,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:09,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866282235] [2024-11-22 17:28:09,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866282235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:09,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:09,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 17:28:09,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551563680] [2024-11-22 17:28:09,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:09,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 17:28:09,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 17:28:09,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 17:28:09,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 188 [2024-11-22 17:28:09,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 186 transitions, 378 flow. Second operand has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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-11-22 17:28:09,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:09,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 188 [2024-11-22 17:28:09,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:09,914 INFO L124 PetriNetUnfolderBase]: 9/286 cut-off events. [2024-11-22 17:28:09,914 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 17:28:09,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 286 events. 9/286 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 931 event pairs, 2 based on Foata normal form. 12/248 useless extension candidates. Maximal degree in co-relation 270. Up to 11 conditions per place. [2024-11-22 17:28:09,918 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 6 selfloop transitions, 0 changer transitions 0/171 dead transitions. [2024-11-22 17:28:09,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 171 transitions, 360 flow [2024-11-22 17:28:09,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 17:28:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-22 17:28:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2024-11-22 17:28:09,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441489361702128 [2024-11-22 17:28:09,932 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 378 flow. Second operand 2 states and 355 transitions. [2024-11-22 17:28:09,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 171 transitions, 360 flow [2024-11-22 17:28:09,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 171 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:09,939 INFO L231 Difference]: Finished difference. Result has 173 places, 171 transitions, 346 flow [2024-11-22 17:28:09,940 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=346, PETRI_PLACES=173, PETRI_TRANSITIONS=171} [2024-11-22 17:28:09,943 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -11 predicate places. [2024-11-22 17:28:09,943 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 171 transitions, 346 flow [2024-11-22 17:28:09,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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-11-22 17:28:09,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:09,944 INFO L204 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, 1, 1] [2024-11-22 17:28:09,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 17:28:09,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:09,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash -529477545, now seen corresponding path program 1 times [2024-11-22 17:28:09,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:09,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274051580] [2024-11-22 17:28:09,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:09,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:10,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:10,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274051580] [2024-11-22 17:28:10,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274051580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:10,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:10,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:10,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050694981] [2024-11-22 17:28:10,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:10,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:10,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:10,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:10,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:10,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-22 17:28:10,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 171 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-11-22 17:28:10,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:10,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-22 17:28:10,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:10,185 INFO L124 PetriNetUnfolderBase]: 30/366 cut-off events. [2024-11-22 17:28:10,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:10,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 366 events. 30/366 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1651 event pairs, 8 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 436. Up to 41 conditions per place. [2024-11-22 17:28:10,196 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2024-11-22 17:28:10,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 172 transitions, 380 flow [2024-11-22 17:28:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-22 17:28:10,199 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-22 17:28:10,199 INFO L175 Difference]: Start difference. First operand has 173 places, 171 transitions, 346 flow. Second operand 3 states and 496 transitions. [2024-11-22 17:28:10,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 172 transitions, 380 flow [2024-11-22 17:28:10,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 172 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 17:28:10,209 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 348 flow [2024-11-22 17:28:10,209 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=174, PETRI_TRANSITIONS=170} [2024-11-22 17:28:10,210 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -10 predicate places. [2024-11-22 17:28:10,210 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 348 flow [2024-11-22 17:28:10,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-11-22 17:28:10,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:10,211 INFO L204 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, 1, 1, 1, 1, 1] [2024-11-22 17:28:10,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 17:28:10,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:10,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1749844589, now seen corresponding path program 1 times [2024-11-22 17:28:10,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:10,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742159888] [2024-11-22 17:28:10,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:10,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:10,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742159888] [2024-11-22 17:28:10,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742159888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:10,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:10,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:10,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557279080] [2024-11-22 17:28:10,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:10,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:10,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:10,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:10,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:10,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-22 17:28:10,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-11-22 17:28:10,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:10,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-22 17:28:10,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:10,346 INFO L124 PetriNetUnfolderBase]: 20/222 cut-off events. [2024-11-22 17:28:10,348 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 17:28:10,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 222 events. 20/222 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 806 event pairs, 4 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 286. Up to 25 conditions per place. [2024-11-22 17:28:10,350 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-11-22 17:28:10,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 378 flow [2024-11-22 17:28:10,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-22 17:28:10,352 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-22 17:28:10,352 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 348 flow. Second operand 3 states and 496 transitions. [2024-11-22 17:28:10,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 378 flow [2024-11-22 17:28:10,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:10,358 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow [2024-11-22 17:28:10,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=172, PETRI_TRANSITIONS=168} [2024-11-22 17:28:10,359 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2024-11-22 17:28:10,359 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow [2024-11-22 17:28:10,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-11-22 17:28:10,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:10,360 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:28:10,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 17:28:10,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:10,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash -934832415, now seen corresponding path program 1 times [2024-11-22 17:28:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:10,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118627501] [2024-11-22 17:28:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:10,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:10,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:10,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118627501] [2024-11-22 17:28:10,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118627501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:10,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:10,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:10,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686165323] [2024-11-22 17:28:10,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:10,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:10,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:10,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:10,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:10,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-22 17:28:10,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-11-22 17:28:10,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:10,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-22 17:28:10,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:10,492 INFO L124 PetriNetUnfolderBase]: 16/288 cut-off events. [2024-11-22 17:28:10,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:10,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 288 events. 16/288 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1079 event pairs, 7 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 327. Up to 26 conditions per place. [2024-11-22 17:28:10,494 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2024-11-22 17:28:10,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 168 transitions, 372 flow [2024-11-22 17:28:10,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-22 17:28:10,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-22 17:28:10,496 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 495 transitions. [2024-11-22 17:28:10,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 168 transitions, 372 flow [2024-11-22 17:28:10,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:10,504 INFO L231 Difference]: Finished difference. Result has 171 places, 167 transitions, 342 flow [2024-11-22 17:28:10,504 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=171, PETRI_TRANSITIONS=167} [2024-11-22 17:28:10,505 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -13 predicate places. [2024-11-22 17:28:10,505 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 167 transitions, 342 flow [2024-11-22 17:28:10,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-11-22 17:28:10,506 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:10,506 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:28:10,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 17:28:10,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:10,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1890395950, now seen corresponding path program 1 times [2024-11-22 17:28:10,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:10,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006670773] [2024-11-22 17:28:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:10,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:10,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:10,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006670773] [2024-11-22 17:28:10,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006670773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:10,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:10,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:10,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341481011] [2024-11-22 17:28:10,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:10,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:10,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:10,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:10,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:10,555 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2024-11-22 17:28:10,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 167 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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-11-22 17:28:10,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:10,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2024-11-22 17:28:10,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:10,628 INFO L124 PetriNetUnfolderBase]: 49/479 cut-off events. [2024-11-22 17:28:10,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:10,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 479 events. 49/479 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2570 event pairs, 30 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 571. Up to 67 conditions per place. [2024-11-22 17:28:10,631 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2024-11-22 17:28:10,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 378 flow [2024-11-22 17:28:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2024-11-22 17:28:10,633 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2024-11-22 17:28:10,633 INFO L175 Difference]: Start difference. First operand has 171 places, 167 transitions, 342 flow. Second operand 3 states and 492 transitions. [2024-11-22 17:28:10,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 378 flow [2024-11-22 17:28:10,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:10,636 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 340 flow [2024-11-22 17:28:10,636 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2024-11-22 17:28:10,636 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -14 predicate places. [2024-11-22 17:28:10,637 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 340 flow [2024-11-22 17:28:10,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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-11-22 17:28:10,637 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:10,637 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:28:10,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 17:28:10,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:10,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1023988735, now seen corresponding path program 1 times [2024-11-22 17:28:10,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:10,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977326780] [2024-11-22 17:28:10,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:10,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:10,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:10,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977326780] [2024-11-22 17:28:10,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977326780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:10,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:10,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:10,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51904669] [2024-11-22 17:28:10,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:10,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:10,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:10,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:10,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:10,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-22 17:28:10,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-11-22 17:28:10,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:10,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-22 17:28:10,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:10,754 INFO L124 PetriNetUnfolderBase]: 15/281 cut-off events. [2024-11-22 17:28:10,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:10,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 281 events. 15/281 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1018 event pairs, 3 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 319. Up to 15 conditions per place. [2024-11-22 17:28:10,757 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2024-11-22 17:28:10,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 364 flow [2024-11-22 17:28:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-22 17:28:10,758 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-22 17:28:10,759 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 340 flow. Second operand 3 states and 495 transitions. [2024-11-22 17:28:10,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 364 flow [2024-11-22 17:28:10,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:10,761 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 336 flow [2024-11-22 17:28:10,761 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=168, PETRI_TRANSITIONS=164} [2024-11-22 17:28:10,762 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -16 predicate places. [2024-11-22 17:28:10,762 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 336 flow [2024-11-22 17:28:10,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-11-22 17:28:10,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:10,763 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:28:10,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 17:28:10,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:10,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1174888269, now seen corresponding path program 1 times [2024-11-22 17:28:10,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:10,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714516389] [2024-11-22 17:28:10,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:10,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:10,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:10,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714516389] [2024-11-22 17:28:10,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714516389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:10,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:10,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:10,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226899233] [2024-11-22 17:28:10,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:10,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:10,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:10,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:10,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:10,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-22 17:28:10,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-11-22 17:28:10,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:10,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-22 17:28:10,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:10,843 INFO L124 PetriNetUnfolderBase]: 37/449 cut-off events. [2024-11-22 17:28:10,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:10,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 449 events. 37/449 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2214 event pairs, 10 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 517. Up to 32 conditions per place. [2024-11-22 17:28:10,846 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2024-11-22 17:28:10,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 364 flow [2024-11-22 17:28:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-22 17:28:10,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-22 17:28:10,848 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 336 flow. Second operand 3 states and 496 transitions. [2024-11-22 17:28:10,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 364 flow [2024-11-22 17:28:10,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:10,850 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 332 flow [2024-11-22 17:28:10,850 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=166, PETRI_TRANSITIONS=162} [2024-11-22 17:28:10,851 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -18 predicate places. [2024-11-22 17:28:10,851 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 332 flow [2024-11-22 17:28:10,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-11-22 17:28:10,851 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:10,852 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:28:10,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 17:28:10,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:10,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1742870495, now seen corresponding path program 1 times [2024-11-22 17:28:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699504671] [2024-11-22 17:28:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:10,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:10,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699504671] [2024-11-22 17:28:10,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699504671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:10,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:10,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872852790] [2024-11-22 17:28:10,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:10,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:10,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:10,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:10,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-22 17:28:10,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 162 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-11-22 17:28:10,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:10,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-22 17:28:10,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:10,930 INFO L124 PetriNetUnfolderBase]: 20/213 cut-off events. [2024-11-22 17:28:10,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:10,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 213 events. 20/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 753 event pairs, 10 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 276. Up to 34 conditions per place. [2024-11-22 17:28:10,932 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2024-11-22 17:28:10,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 163 transitions, 366 flow [2024-11-22 17:28:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-22 17:28:10,933 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-22 17:28:10,933 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 332 flow. Second operand 3 states and 496 transitions. [2024-11-22 17:28:10,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 163 transitions, 366 flow [2024-11-22 17:28:10,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:10,935 INFO L231 Difference]: Finished difference. Result has 165 places, 161 transitions, 330 flow [2024-11-22 17:28:10,936 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=165, PETRI_TRANSITIONS=161} [2024-11-22 17:28:10,936 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -19 predicate places. [2024-11-22 17:28:10,937 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 161 transitions, 330 flow [2024-11-22 17:28:10,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-11-22 17:28:10,937 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:10,937 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:28:10,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 17:28:10,938 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:10,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:10,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1408283567, now seen corresponding path program 1 times [2024-11-22 17:28:10,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:10,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008208204] [2024-11-22 17:28:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:10,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:10,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:10,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008208204] [2024-11-22 17:28:10,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008208204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:10,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:10,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:10,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502557615] [2024-11-22 17:28:10,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:10,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:10,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:10,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:10,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:10,970 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2024-11-22 17:28:10,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 161 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-11-22 17:28:10,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:10,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2024-11-22 17:28:10,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:11,032 INFO L124 PetriNetUnfolderBase]: 33/412 cut-off events. [2024-11-22 17:28:11,032 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:11,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 412 events. 33/412 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1868 event pairs, 6 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 472. Up to 32 conditions per place. [2024-11-22 17:28:11,035 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 10 selfloop transitions, 3 changer transitions 0/161 dead transitions. [2024-11-22 17:28:11,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 356 flow [2024-11-22 17:28:11,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2024-11-22 17:28:11,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-11-22 17:28:11,037 INFO L175 Difference]: Start difference. First operand has 165 places, 161 transitions, 330 flow. Second operand 3 states and 498 transitions. [2024-11-22 17:28:11,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 356 flow [2024-11-22 17:28:11,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 161 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:11,040 INFO L231 Difference]: Finished difference. Result has 163 places, 159 transitions, 328 flow [2024-11-22 17:28:11,040 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=163, PETRI_TRANSITIONS=159} [2024-11-22 17:28:11,041 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2024-11-22 17:28:11,041 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 159 transitions, 328 flow [2024-11-22 17:28:11,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-11-22 17:28:11,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:11,042 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:28:11,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 17:28:11,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:11,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash 445824893, now seen corresponding path program 1 times [2024-11-22 17:28:11,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:11,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760508120] [2024-11-22 17:28:11,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:11,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:11,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760508120] [2024-11-22 17:28:11,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760508120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:11,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:11,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621730291] [2024-11-22 17:28:11,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:11,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:11,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:11,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:11,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:11,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2024-11-22 17:28:11,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 159 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-11-22 17:28:11,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:11,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2024-11-22 17:28:11,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:11,127 INFO L124 PetriNetUnfolderBase]: 31/360 cut-off events. [2024-11-22 17:28:11,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:11,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 360 events. 31/360 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1470 event pairs, 6 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 426. Up to 32 conditions per place. [2024-11-22 17:28:11,130 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2024-11-22 17:28:11,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 354 flow [2024-11-22 17:28:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2024-11-22 17:28:11,132 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-11-22 17:28:11,132 INFO L175 Difference]: Start difference. First operand has 163 places, 159 transitions, 328 flow. Second operand 3 states and 498 transitions. [2024-11-22 17:28:11,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 354 flow [2024-11-22 17:28:11,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:11,135 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 322 flow [2024-11-22 17:28:11,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=161, PETRI_TRANSITIONS=157} [2024-11-22 17:28:11,135 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2024-11-22 17:28:11,136 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 322 flow [2024-11-22 17:28:11,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-11-22 17:28:11,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:11,136 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:28:11,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 17:28:11,137 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:11,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:11,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1193293355, now seen corresponding path program 1 times [2024-11-22 17:28:11,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:11,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568088208] [2024-11-22 17:28:11,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:11,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:11,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:11,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568088208] [2024-11-22 17:28:11,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568088208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:11,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:11,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:11,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018433240] [2024-11-22 17:28:11,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:11,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:11,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:11,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:11,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:11,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-22 17:28:11,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 157 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-11-22 17:28:11,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:11,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-22 17:28:11,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:11,213 INFO L124 PetriNetUnfolderBase]: 15/266 cut-off events. [2024-11-22 17:28:11,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:11,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 266 events. 15/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 920 event pairs, 6 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 306. Up to 25 conditions per place. [2024-11-22 17:28:11,215 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-22 17:28:11,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 157 transitions, 350 flow [2024-11-22 17:28:11,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-22 17:28:11,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-22 17:28:11,217 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 322 flow. Second operand 3 states and 495 transitions. [2024-11-22 17:28:11,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 157 transitions, 350 flow [2024-11-22 17:28:11,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:11,220 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 320 flow [2024-11-22 17:28:11,220 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2024-11-22 17:28:11,220 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-22 17:28:11,220 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 320 flow [2024-11-22 17:28:11,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-11-22 17:28:11,221 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:11,221 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:28:11,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 17:28:11,221 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:11,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:11,222 INFO L85 PathProgramCache]: Analyzing trace with hash 215393162, now seen corresponding path program 1 times [2024-11-22 17:28:11,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:11,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377241620] [2024-11-22 17:28:11,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:11,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:11,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377241620] [2024-11-22 17:28:11,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377241620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:11,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:11,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:11,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876763279] [2024-11-22 17:28:11,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:11,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:11,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:11,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:11,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:11,253 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-22 17:28:11,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-11-22 17:28:11,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:11,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-22 17:28:11,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:11,291 INFO L124 PetriNetUnfolderBase]: 41/436 cut-off events. [2024-11-22 17:28:11,291 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:11,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 436 events. 41/436 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2170 event pairs, 22 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 512. Up to 51 conditions per place. [2024-11-22 17:28:11,293 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-22 17:28:11,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 352 flow [2024-11-22 17:28:11,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-22 17:28:11,295 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-22 17:28:11,295 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 320 flow. Second operand 3 states and 496 transitions. [2024-11-22 17:28:11,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 352 flow [2024-11-22 17:28:11,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:11,297 INFO L231 Difference]: Finished difference. Result has 159 places, 155 transitions, 318 flow [2024-11-22 17:28:11,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=159, PETRI_TRANSITIONS=155} [2024-11-22 17:28:11,297 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2024-11-22 17:28:11,298 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 318 flow [2024-11-22 17:28:11,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-11-22 17:28:11,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:11,298 INFO L204 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, 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-11-22 17:28:11,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 17:28:11,298 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:11,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:11,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1089341189, now seen corresponding path program 1 times [2024-11-22 17:28:11,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:11,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455666649] [2024-11-22 17:28:11,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:11,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:11,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:11,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455666649] [2024-11-22 17:28:11,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455666649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:11,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:11,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 17:28:11,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844139684] [2024-11-22 17:28:11,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:11,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:11,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:11,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:11,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2024-11-22 17:28:11,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-11-22 17:28:11,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:11,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2024-11-22 17:28:11,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:11,386 INFO L124 PetriNetUnfolderBase]: 25/550 cut-off events. [2024-11-22 17:28:11,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:11,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 550 events. 25/550 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2286 event pairs, 6 based on Foata normal form. 4/504 useless extension candidates. Maximal degree in co-relation 611. Up to 21 conditions per place. [2024-11-22 17:28:11,389 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2024-11-22 17:28:11,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 158 transitions, 350 flow [2024-11-22 17:28:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-11-22 17:28:11,390 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2024-11-22 17:28:11,391 INFO L175 Difference]: Start difference. First operand has 159 places, 155 transitions, 318 flow. Second operand 3 states and 506 transitions. [2024-11-22 17:28:11,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 158 transitions, 350 flow [2024-11-22 17:28:11,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 158 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:11,393 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 326 flow [2024-11-22 17:28:11,394 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2024-11-22 17:28:11,394 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-22 17:28:11,394 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 326 flow [2024-11-22 17:28:11,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-11-22 17:28:11,395 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:11,395 INFO L204 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, 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-11-22 17:28:11,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 17:28:11,395 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:11,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash -800692820, now seen corresponding path program 1 times [2024-11-22 17:28:11,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:11,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758238334] [2024-11-22 17:28:11,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:11,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:11,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758238334] [2024-11-22 17:28:11,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758238334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:11,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:11,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:11,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673373644] [2024-11-22 17:28:11,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:11,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:11,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:11,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:11,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:11,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-22 17:28:11,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-11-22 17:28:11,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:11,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-22 17:28:11,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:11,499 INFO L124 PetriNetUnfolderBase]: 65/584 cut-off events. [2024-11-22 17:28:11,499 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-22 17:28:11,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 584 events. 65/584 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2923 event pairs, 38 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 721. Up to 83 conditions per place. [2024-11-22 17:28:11,503 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-22 17:28:11,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 360 flow [2024-11-22 17:28:11,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2024-11-22 17:28:11,504 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-11-22 17:28:11,505 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 326 flow. Second operand 3 states and 494 transitions. [2024-11-22 17:28:11,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 360 flow [2024-11-22 17:28:11,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 17:28:11,507 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 326 flow [2024-11-22 17:28:11,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2024-11-22 17:28:11,507 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-22 17:28:11,507 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 326 flow [2024-11-22 17:28:11,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-11-22 17:28:11,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:11,508 INFO L204 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, 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, 1, 1, 1] [2024-11-22 17:28:11,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 17:28:11,508 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:11,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:11,509 INFO L85 PathProgramCache]: Analyzing trace with hash 809008106, now seen corresponding path program 1 times [2024-11-22 17:28:11,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:11,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199785762] [2024-11-22 17:28:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:11,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:11,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:11,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199785762] [2024-11-22 17:28:11,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199785762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:11,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:11,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:11,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163889358] [2024-11-22 17:28:11,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:11,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:11,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:11,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:11,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:11,544 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2024-11-22 17:28:11,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-11-22 17:28:11,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:11,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2024-11-22 17:28:11,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:11,594 INFO L124 PetriNetUnfolderBase]: 49/554 cut-off events. [2024-11-22 17:28:11,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:11,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 554 events. 49/554 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2407 event pairs, 10 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 651. Up to 40 conditions per place. [2024-11-22 17:28:11,597 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 10 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-22 17:28:11,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 354 flow [2024-11-22 17:28:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2024-11-22 17:28:11,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8953900709219859 [2024-11-22 17:28:11,599 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 326 flow. Second operand 3 states and 505 transitions. [2024-11-22 17:28:11,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 354 flow [2024-11-22 17:28:11,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:11,601 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 330 flow [2024-11-22 17:28:11,601 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2024-11-22 17:28:11,601 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-22 17:28:11,602 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 330 flow [2024-11-22 17:28:11,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-11-22 17:28:11,602 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:11,602 INFO L204 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:28:11,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 17:28:11,602 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:11,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:11,603 INFO L85 PathProgramCache]: Analyzing trace with hash 654170415, now seen corresponding path program 1 times [2024-11-22 17:28:11,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:11,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334467591] [2024-11-22 17:28:11,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:11,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:11,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:11,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334467591] [2024-11-22 17:28:11,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334467591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:11,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:11,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384921547] [2024-11-22 17:28:11,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:11,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:11,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:11,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:11,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:11,652 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-22 17:28:11,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-11-22 17:28:11,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:11,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-22 17:28:11,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:11,700 INFO L124 PetriNetUnfolderBase]: 69/572 cut-off events. [2024-11-22 17:28:11,701 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-22 17:28:11,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 572 events. 69/572 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2880 event pairs, 42 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 733. Up to 91 conditions per place. [2024-11-22 17:28:11,703 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2024-11-22 17:28:11,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 364 flow [2024-11-22 17:28:11,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2024-11-22 17:28:11,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-11-22 17:28:11,705 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 330 flow. Second operand 3 states and 494 transitions. [2024-11-22 17:28:11,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 364 flow [2024-11-22 17:28:11,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 17:28:11,707 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 330 flow [2024-11-22 17:28:11,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2024-11-22 17:28:11,707 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-22 17:28:11,707 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 330 flow [2024-11-22 17:28:11,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-11-22 17:28:11,708 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:11,708 INFO L204 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:28:11,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 17:28:11,708 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:11,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:11,709 INFO L85 PathProgramCache]: Analyzing trace with hash 308719358, now seen corresponding path program 1 times [2024-11-22 17:28:11,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:11,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395311519] [2024-11-22 17:28:11,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:11,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:11,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:11,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:11,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395311519] [2024-11-22 17:28:11,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395311519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:11,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:28:11,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:28:11,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101269820] [2024-11-22 17:28:11,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:11,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:11,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:11,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:11,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:28:11,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2024-11-22 17:28:11,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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-11-22 17:28:11,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:11,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2024-11-22 17:28:11,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:11,798 INFO L124 PetriNetUnfolderBase]: 57/556 cut-off events. [2024-11-22 17:28:11,798 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:11,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 556 events. 57/556 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2543 event pairs, 38 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 705. Up to 83 conditions per place. [2024-11-22 17:28:11,801 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2024-11-22 17:28:11,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 366 flow [2024-11-22 17:28:11,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2024-11-22 17:28:11,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2024-11-22 17:28:11,802 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 330 flow. Second operand 3 states and 492 transitions. [2024-11-22 17:28:11,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 366 flow [2024-11-22 17:28:11,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:11,805 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 328 flow [2024-11-22 17:28:11,805 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=159, PETRI_TRANSITIONS=153} [2024-11-22 17:28:11,805 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2024-11-22 17:28:11,805 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 328 flow [2024-11-22 17:28:11,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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-11-22 17:28:11,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:11,806 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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, 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, 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-11-22 17:28:11,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 17:28:11,806 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:11,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2042320711, now seen corresponding path program 1 times [2024-11-22 17:28:11,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:11,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870550254] [2024-11-22 17:28:11,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:11,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:11,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870550254] [2024-11-22 17:28:11,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870550254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 17:28:11,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98513377] [2024-11-22 17:28:11,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:11,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:28:11,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:28:11,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 17:28:11,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 17:28:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:11,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 17:28:11,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 17:28:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 17:28:11,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 17:28:11,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98513377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:11,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 17:28:11,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-22 17:28:11,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69067922] [2024-11-22 17:28:11,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:11,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:11,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:11,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:11,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 17:28:11,976 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2024-11-22 17:28:11,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 153 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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-11-22 17:28:11,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:11,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2024-11-22 17:28:11,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:12,022 INFO L124 PetriNetUnfolderBase]: 36/485 cut-off events. [2024-11-22 17:28:12,022 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:28:12,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 485 events. 36/485 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1794 event pairs, 1 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 563. Up to 31 conditions per place. [2024-11-22 17:28:12,025 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 9 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2024-11-22 17:28:12,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 362 flow [2024-11-22 17:28:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2024-11-22 17:28:12,027 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9024822695035462 [2024-11-22 17:28:12,027 INFO L175 Difference]: Start difference. First operand has 159 places, 153 transitions, 328 flow. Second operand 3 states and 509 transitions. [2024-11-22 17:28:12,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 362 flow [2024-11-22 17:28:12,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:12,029 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 358 flow [2024-11-22 17:28:12,029 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=161, PETRI_TRANSITIONS=157} [2024-11-22 17:28:12,029 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2024-11-22 17:28:12,030 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 358 flow [2024-11-22 17:28:12,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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-11-22 17:28:12,030 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:12,030 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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, 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, 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, 1] [2024-11-22 17:28:12,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 17:28:12,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-22 17:28:12,231 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:12,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:12,232 INFO L85 PathProgramCache]: Analyzing trace with hash -222269459, now seen corresponding path program 1 times [2024-11-22 17:28:12,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:12,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962046049] [2024-11-22 17:28:12,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:12,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:12,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:12,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962046049] [2024-11-22 17:28:12,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962046049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 17:28:12,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453297083] [2024-11-22 17:28:12,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:12,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:28:12,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:28:12,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 17:28:12,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 17:28:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:12,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 17:28:12,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 17:28:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 17:28:12,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 17:28:12,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453297083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:28:12,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 17:28:12,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-22 17:28:12,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528697186] [2024-11-22 17:28:12,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:28:12,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:28:12,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:12,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:28:12,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 17:28:12,380 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2024-11-22 17:28:12,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 157 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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-11-22 17:28:12,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:12,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2024-11-22 17:28:12,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:12,435 INFO L124 PetriNetUnfolderBase]: 78/601 cut-off events. [2024-11-22 17:28:12,435 INFO L125 PetriNetUnfolderBase]: For 138/151 co-relation queries the response was YES. [2024-11-22 17:28:12,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 601 events. 78/601 cut-off events. For 138/151 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2732 event pairs, 0 based on Foata normal form. 8/564 useless extension candidates. Maximal degree in co-relation 865. Up to 59 conditions per place. [2024-11-22 17:28:12,440 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 12 selfloop transitions, 6 changer transitions 0/164 dead transitions. [2024-11-22 17:28:12,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 164 transitions, 422 flow [2024-11-22 17:28:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:28:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:28:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2024-11-22 17:28:12,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042553191489362 [2024-11-22 17:28:12,441 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 358 flow. Second operand 3 states and 510 transitions. [2024-11-22 17:28:12,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 164 transitions, 422 flow [2024-11-22 17:28:12,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 164 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:12,444 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 408 flow [2024-11-22 17:28:12,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=163, PETRI_TRANSITIONS=163} [2024-11-22 17:28:12,444 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2024-11-22 17:28:12,444 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 408 flow [2024-11-22 17:28:12,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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-11-22 17:28:12,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:12,445 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:28:12,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 17:28:12,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:28:12,646 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:12,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:12,647 INFO L85 PathProgramCache]: Analyzing trace with hash -237909861, now seen corresponding path program 1 times [2024-11-22 17:28:12,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:12,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142328297] [2024-11-22 17:28:12,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:12,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:12,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142328297] [2024-11-22 17:28:12,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142328297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 17:28:12,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275748826] [2024-11-22 17:28:12,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:28:12,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:28:12,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:28:12,711 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 17:28:12,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 17:28:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:28:12,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 17:28:12,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 17:28:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:12,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 17:28:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:12,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275748826] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 17:28:12,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 17:28:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-22 17:28:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665307405] [2024-11-22 17:28:12,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 17:28:12,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 17:28:12,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:12,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 17:28:12,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-22 17:28:12,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-22 17:28:12,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 163 transitions, 408 flow. Second operand has 10 states, 10 states have (on average 161.4) internal successors, (1614), 10 states have internal predecessors, (1614), 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-11-22 17:28:12,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:12,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-22 17:28:12,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:13,189 INFO L124 PetriNetUnfolderBase]: 242/1310 cut-off events. [2024-11-22 17:28:13,189 INFO L125 PetriNetUnfolderBase]: For 1036/1068 co-relation queries the response was YES. [2024-11-22 17:28:13,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2354 conditions, 1310 events. 242/1310 cut-off events. For 1036/1068 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6597 event pairs, 13 based on Foata normal form. 16/1267 useless extension candidates. Maximal degree in co-relation 2346. Up to 138 conditions per place. [2024-11-22 17:28:13,201 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 63 selfloop transitions, 9 changer transitions 0/213 dead transitions. [2024-11-22 17:28:13,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 213 transitions, 864 flow [2024-11-22 17:28:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 17:28:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 17:28:13,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2024-11-22 17:28:13,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8693853427895981 [2024-11-22 17:28:13,204 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 408 flow. Second operand 9 states and 1471 transitions. [2024-11-22 17:28:13,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 213 transitions, 864 flow [2024-11-22 17:28:13,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 213 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:28:13,207 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 446 flow [2024-11-22 17:28:13,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=446, PETRI_PLACES=172, PETRI_TRANSITIONS=169} [2024-11-22 17:28:13,208 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2024-11-22 17:28:13,208 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 446 flow [2024-11-22 17:28:13,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 161.4) internal successors, (1614), 10 states have internal predecessors, (1614), 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-11-22 17:28:13,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:13,209 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1] [2024-11-22 17:28:13,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 17:28:13,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:28:13,410 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:13,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:13,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1218412197, now seen corresponding path program 2 times [2024-11-22 17:28:13,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:13,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230591859] [2024-11-22 17:28:13,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 17:28:13,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:13,427 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 17:28:13,427 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:28:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:13,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:13,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230591859] [2024-11-22 17:28:13,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230591859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 17:28:13,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951415749] [2024-11-22 17:28:13,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 17:28:13,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:28:13,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:28:13,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 17:28:13,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 17:28:13,673 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 17:28:13,674 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:28:13,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 17:28:13,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 17:28:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:13,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 17:28:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:14,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951415749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 17:28:14,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 17:28:14,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-22 17:28:14,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292963932] [2024-11-22 17:28:14,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 17:28:14,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 17:28:14,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:14,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 17:28:14,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-22 17:28:14,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-22 17:28:14,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 169 transitions, 446 flow. Second operand has 18 states, 18 states have (on average 161.22222222222223) internal successors, (2902), 18 states have internal predecessors, (2902), 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-11-22 17:28:14,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:14,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-22 17:28:14,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:14,534 INFO L124 PetriNetUnfolderBase]: 402/2170 cut-off events. [2024-11-22 17:28:14,534 INFO L125 PetriNetUnfolderBase]: For 1539/1571 co-relation queries the response was YES. [2024-11-22 17:28:14,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3921 conditions, 2170 events. 402/2170 cut-off events. For 1539/1571 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 10604 event pairs, 13 based on Foata normal form. 26/2135 useless extension candidates. Maximal degree in co-relation 3911. Up to 218 conditions per place. [2024-11-22 17:28:14,547 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 139 selfloop transitions, 21 changer transitions 0/301 dead transitions. [2024-11-22 17:28:14,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 301 transitions, 1546 flow [2024-11-22 17:28:14,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-22 17:28:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-22 17:28:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3421 transitions. [2024-11-22 17:28:14,552 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8665146909827761 [2024-11-22 17:28:14,552 INFO L175 Difference]: Start difference. First operand has 172 places, 169 transitions, 446 flow. Second operand 21 states and 3421 transitions. [2024-11-22 17:28:14,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 301 transitions, 1546 flow [2024-11-22 17:28:14,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 301 transitions, 1532 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-22 17:28:14,558 INFO L231 Difference]: Finished difference. Result has 196 places, 182 transitions, 570 flow [2024-11-22 17:28:14,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=570, PETRI_PLACES=196, PETRI_TRANSITIONS=182} [2024-11-22 17:28:14,559 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 12 predicate places. [2024-11-22 17:28:14,559 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 182 transitions, 570 flow [2024-11-22 17:28:14,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 161.22222222222223) internal successors, (2902), 18 states have internal predecessors, (2902), 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-11-22 17:28:14,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:14,560 INFO L204 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 1, 1, 1] [2024-11-22 17:28:14,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 17:28:14,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:28:14,761 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:14,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:14,762 INFO L85 PathProgramCache]: Analyzing trace with hash 557794011, now seen corresponding path program 3 times [2024-11-22 17:28:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:14,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020032195] [2024-11-22 17:28:14,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 17:28:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:14,805 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-22 17:28:14,806 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:28:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:15,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:15,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020032195] [2024-11-22 17:28:15,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020032195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 17:28:15,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144240471] [2024-11-22 17:28:15,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 17:28:15,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:28:15,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:28:15,343 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 17:28:15,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 17:28:15,438 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-22 17:28:15,438 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:28:15,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 17:28:15,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 17:28:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:15,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 17:28:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:16,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144240471] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 17:28:16,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 17:28:16,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-11-22 17:28:16,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452225894] [2024-11-22 17:28:16,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 17:28:16,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-22 17:28:16,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:16,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-22 17:28:16,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 17:28:16,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-22 17:28:16,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 182 transitions, 570 flow. Second operand has 34 states, 34 states have (on average 161.11764705882354) internal successors, (5478), 34 states have internal predecessors, (5478), 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-11-22 17:28:16,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:16,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-22 17:28:16,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:17,917 INFO L124 PetriNetUnfolderBase]: 722/3890 cut-off events. [2024-11-22 17:28:17,918 INFO L125 PetriNetUnfolderBase]: For 4577/4609 co-relation queries the response was YES. [2024-11-22 17:28:17,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7472 conditions, 3890 events. 722/3890 cut-off events. For 4577/4609 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 18669 event pairs, 13 based on Foata normal form. 46/3875 useless extension candidates. Maximal degree in co-relation 7457. Up to 378 conditions per place. [2024-11-22 17:28:17,946 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 291 selfloop transitions, 45 changer transitions 0/477 dead transitions. [2024-11-22 17:28:17,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 477 transitions, 3078 flow [2024-11-22 17:28:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-22 17:28:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-11-22 17:28:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7321 transitions. [2024-11-22 17:28:17,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8653664302600473 [2024-11-22 17:28:17,958 INFO L175 Difference]: Start difference. First operand has 196 places, 182 transitions, 570 flow. Second operand 45 states and 7321 transitions. [2024-11-22 17:28:17,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 477 transitions, 3078 flow [2024-11-22 17:28:17,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 477 transitions, 3038 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-22 17:28:17,967 INFO L231 Difference]: Finished difference. Result has 243 places, 207 transitions, 848 flow [2024-11-22 17:28:17,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=848, PETRI_PLACES=243, PETRI_TRANSITIONS=207} [2024-11-22 17:28:17,968 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 59 predicate places. [2024-11-22 17:28:17,968 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 207 transitions, 848 flow [2024-11-22 17:28:17,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 161.11764705882354) internal successors, (5478), 34 states have internal predecessors, (5478), 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-11-22 17:28:17,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:17,970 INFO L204 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 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, 1, 1, 1] [2024-11-22 17:28:17,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-22 17:28:18,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-22 17:28:18,171 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:18,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:18,171 INFO L85 PathProgramCache]: Analyzing trace with hash 178363133, now seen corresponding path program 4 times [2024-11-22 17:28:18,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:18,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174707904] [2024-11-22 17:28:18,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 17:28:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:18,242 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 17:28:18,244 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:28:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:19,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:28:19,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174707904] [2024-11-22 17:28:19,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174707904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 17:28:19,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605467261] [2024-11-22 17:28:19,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 17:28:19,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:28:19,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:28:19,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 17:28:19,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 17:28:19,580 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 17:28:19,580 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:28:19,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 17:28:19,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 17:28:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:20,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 17:28:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:28:21,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605467261] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 17:28:21,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 17:28:21,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 47 [2024-11-22 17:28:21,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732357664] [2024-11-22 17:28:21,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 17:28:21,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-22 17:28:21,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:28:21,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-22 17:28:21,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2024-11-22 17:28:21,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-22 17:28:21,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 207 transitions, 848 flow. Second operand has 47 states, 47 states have (on average 161.12765957446808) internal successors, (7573), 47 states have internal predecessors, (7573), 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-11-22 17:28:21,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:28:21,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-22 17:28:21,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:28:23,655 INFO L124 PetriNetUnfolderBase]: 1002/5395 cut-off events. [2024-11-22 17:28:23,655 INFO L125 PetriNetUnfolderBase]: For 10686/10718 co-relation queries the response was YES. [2024-11-22 17:28:23,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10892 conditions, 5395 events. 1002/5395 cut-off events. For 10686/10718 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 25713 event pairs, 13 based on Foata normal form. 41/5375 useless extension candidates. Maximal degree in co-relation 10868. Up to 518 conditions per place. [2024-11-22 17:28:23,686 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 424 selfloop transitions, 66 changer transitions 0/631 dead transitions. [2024-11-22 17:28:23,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 631 transitions, 4542 flow [2024-11-22 17:28:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-22 17:28:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2024-11-22 17:28:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 10729 transitions. [2024-11-22 17:28:23,693 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8646840747904577 [2024-11-22 17:28:23,693 INFO L175 Difference]: Start difference. First operand has 243 places, 207 transitions, 848 flow. Second operand 66 states and 10729 transitions. [2024-11-22 17:28:23,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 631 transitions, 4542 flow [2024-11-22 17:28:23,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 631 transitions, 4472 flow, removed 17 selfloop flow, removed 18 redundant places. [2024-11-22 17:28:23,707 INFO L231 Difference]: Finished difference. Result has 298 places, 229 transitions, 1158 flow [2024-11-22 17:28:23,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=1158, PETRI_PLACES=298, PETRI_TRANSITIONS=229} [2024-11-22 17:28:23,708 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 114 predicate places. [2024-11-22 17:28:23,708 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 229 transitions, 1158 flow [2024-11-22 17:28:23,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 161.12765957446808) internal successors, (7573), 47 states have internal predecessors, (7573), 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-11-22 17:28:23,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:28:23,710 INFO L204 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 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, 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, 1, 1, 1] [2024-11-22 17:28:23,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 17:28:23,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:28:23,911 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-22 17:28:23,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:28:23,912 INFO L85 PathProgramCache]: Analyzing trace with hash 732694807, now seen corresponding path program 5 times [2024-11-22 17:28:23,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:28:23,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660488690] [2024-11-22 17:28:23,912 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 17:28:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:28:24,048 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-22 17:28:24,048 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 17:28:24,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 17:28:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 17:28:24,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 17:28:24,277 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 17:28:24,277 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2024-11-22 17:28:24,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2024-11-22 17:28:24,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2024-11-22 17:28:24,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2024-11-22 17:28:24,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2024-11-22 17:28:24,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2024-11-22 17:28:24,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2024-11-22 17:28:24,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2024-11-22 17:28:24,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2024-11-22 17:28:24,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2024-11-22 17:28:24,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2024-11-22 17:28:24,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2024-11-22 17:28:24,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2024-11-22 17:28:24,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2024-11-22 17:28:24,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2024-11-22 17:28:24,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2024-11-22 17:28:24,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2024-11-22 17:28:24,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2024-11-22 17:28:24,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2024-11-22 17:28:24,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2024-11-22 17:28:24,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2024-11-22 17:28:24,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2024-11-22 17:28:24,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2024-11-22 17:28:24,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2024-11-22 17:28:24,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2024-11-22 17:28:24,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2024-11-22 17:28:24,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2024-11-22 17:28:24,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2024-11-22 17:28:24,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2024-11-22 17:28:24,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2024-11-22 17:28:24,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2024-11-22 17:28:24,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 17:28:24,282 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:28:24,562 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 17:28:24,562 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 17:28:24,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:28:24 BasicIcfg [2024-11-22 17:28:24,569 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 17:28:24,570 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 17:28:24,573 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 17:28:24,573 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 17:28:24,574 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:28:09" (3/4) ... [2024-11-22 17:28:24,575 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 17:28:24,887 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 17:28:24,888 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 17:28:24,888 INFO L158 Benchmark]: Toolchain (without parser) took 16653.19ms. Allocated memory was 144.7MB in the beginning and 574.6MB in the end (delta: 429.9MB). Free memory was 74.0MB in the beginning and 188.7MB in the end (delta: -114.8MB). Peak memory consumption was 315.8MB. Max. memory is 16.1GB. [2024-11-22 17:28:24,888 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 144.7MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 17:28:24,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.64ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 73.8MB in the beginning and 173.5MB in the end (delta: -99.7MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-11-22 17:28:24,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.97ms. Allocated memory is still 207.6MB. Free memory was 173.5MB in the beginning and 171.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 17:28:24,889 INFO L158 Benchmark]: Boogie Preprocessor took 30.79ms. Allocated memory is still 207.6MB. Free memory was 171.4MB in the beginning and 169.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 17:28:24,889 INFO L158 Benchmark]: RCFGBuilder took 583.64ms. Allocated memory is still 207.6MB. Free memory was 169.3MB in the beginning and 146.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-22 17:28:24,889 INFO L158 Benchmark]: TraceAbstraction took 15227.19ms. Allocated memory was 207.6MB in the beginning and 574.6MB in the end (delta: 367.0MB). Free memory was 145.2MB in the beginning and 321.9MB in the end (delta: -176.7MB). Peak memory consumption was 404.2MB. Max. memory is 16.1GB. [2024-11-22 17:28:24,889 INFO L158 Benchmark]: Witness Printer took 317.86ms. Allocated memory is still 574.6MB. Free memory was 321.9MB in the beginning and 188.7MB in the end (delta: 133.2MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2024-11-22 17:28:24,892 INFO L338 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 144.7MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.64ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 73.8MB in the beginning and 173.5MB in the end (delta: -99.7MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.97ms. Allocated memory is still 207.6MB. Free memory was 173.5MB in the beginning and 171.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.79ms. Allocated memory is still 207.6MB. Free memory was 171.4MB in the beginning and 169.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 583.64ms. Allocated memory is still 207.6MB. Free memory was 169.3MB in the beginning and 146.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15227.19ms. Allocated memory was 207.6MB in the beginning and 574.6MB in the end (delta: 367.0MB). Free memory was 145.2MB in the beginning and 321.9MB in the end (delta: -176.7MB). Peak memory consumption was 404.2MB. Max. memory is 16.1GB. * Witness Printer took 317.86ms. Allocated memory is still 574.6MB. Free memory was 321.9MB in the beginning and 188.7MB in the end (delta: 133.2MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 725]: Data race detected Data race detected The following path leads to a data race: [L683] 0 int i, j; VAL [i=0, j=0] [L686] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L703] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L704] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L714] 0 pthread_t id1, id2; VAL [\old(argc)=28721, \old(argv)={28719:28660}, argc=28721, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L716] 0 i = 1 VAL [\old(argc)=28721, \old(argv)={28719:28660}, argc=28721, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L719] 0 j = 1 VAL [\old(argc)=28721, \old(argv)={28719:28660}, argc=28721, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=28721, \old(argv)={28719:28660}, argc=28721, cur=1, i=1, id1=-1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=28721, \old(argv)={28719:28660}, argc=28721, cur=1, i=1, id1=-1, id2=0, j=1, next=0, p=0, prev=0, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=0, q=0, x=0] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=1, q=0, x=2] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=2, q=0, x=3] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=3, q=0, x=4] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=5, q=0, x=5] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=8, q=0, x=6] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=13, q=0, x=7] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=21, q=0, x=8] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=34, q=0, x=9] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=55, q=0, x=10] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=89, q=0, x=11] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=144, q=0, x=12] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=233, q=0, x=13] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=377, q=0, x=14] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=610, q=0, x=15] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=987, q=0, x=16] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=1597, q=0, x=17] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=2584, q=0, x=18] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=4181, q=0, x=19] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=6765, q=0, x=20] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] COND TRUE 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=10946, q=0, x=21] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] 0 x < 22 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] COND FALSE 0 !(x < 22) VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L711] 0 return prev; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result=17711, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L723] RET, EXPR 0 fib() [L688] 1 p = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L688] 1 p < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L688] COND TRUE 1 p < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L723] 0 int correct = fib(); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=28721, \old(argv)={28719:28660}, arg={0:0}, argc=28721, correct=17711, cur=28657, i=1, id1=-1, id2=0, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L725] 0 i <= correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=28721, \old(argv)={28719:28660}, arg={0:0}, argc=28721, correct=17711, cur=28657, i=1, id1=-1, id2=0, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L690] EXPR 1 i + j [L690] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=28657, i=2, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L725] 0 i <= correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=28721, \old(argv)={28719:28660}, arg={0:0}, argc=28721, correct=17711, cur=28657, i=2, id1=-1, id2=0, j=1, next=28657, p=0, prev=17711, q=0, x=22] Now there is a data race on ~i~0 between C: i = i + j [690] and C: i <= correct [725] - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: 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 5 procedures, 240 locations, 46 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: 14.8s, OverallIterations: 24, TraceHistogramMax: 23, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1422 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1208 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1157 IncrementalHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 93 mSDtfsCounter, 1157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2708 GetRequests, 2478 SyntacticMatches, 19 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3233 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1158occurred in iteration=23, InterpolantAutomatonStates: 197, 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.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 4359 NumberOfCodeBlocks, 4359 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 4661 ConstructedInterpolants, 0 QuantifiedInterpolants, 10505 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2472 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 33 InterpolantComputations, 19 PerfectInterpolantSequences, 6/13791 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-11-22 17:28:24,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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