./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/goblint-regression/28-race_reach_12-ptr_racefree.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 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:52:57,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:52:57,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:52:57,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:52:57,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:52:57,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:52:57,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:52:57,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:52:57,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:52:57,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:52:57,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:52:57,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:52:57,719 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:52:57,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:52:57,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:52:57,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:52:57,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:52:57,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:52:57,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:52:57,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:52:57,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:52:57,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:52:57,725 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:52:57,726 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:52:57,726 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:52:57,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:52:57,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:52:57,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:52:57,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:52:57,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:52:57,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:52:57,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:52:57,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:52:57,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:52:57,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:52:57,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:52:57,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:52:57,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:52:57,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:52:57,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:52:57,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:52:57,737 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 -> 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 [2024-11-19 05:52:57,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:52:58,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:52:58,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:52:58,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:52:58,013 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:52:58,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-11-19 05:52:59,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:52:59,741 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:52:59,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-11-19 05:52:59,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/868f9c81f/78a5cc7c18ea41e2bbd032201e556a59/FLAG0e7ee15ba [2024-11-19 05:52:59,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/868f9c81f/78a5cc7c18ea41e2bbd032201e556a59 [2024-11-19 05:52:59,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:52:59,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:52:59,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:52:59,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:52:59,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:52:59,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:52:59" (1/1) ... [2024-11-19 05:52:59,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b91ad2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:59, skipping insertion in model container [2024-11-19 05:52:59,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:52:59" (1/1) ... [2024-11-19 05:52:59,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:53:00,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:53:00,276 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:53:00,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:53:00,388 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:53:00,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00 WrapperNode [2024-11-19 05:53:00,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:53:00,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:53:00,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:53:00,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:53:00,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,448 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 153 [2024-11-19 05:53:00,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:53:00,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:53:00,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:53:00,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:53:00,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:53:00,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:53:00,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:53:00,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:53:00,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:53:00,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:53:00,541 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-19 05:53:00,543 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-19 05:53:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:53:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:53:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 05:53:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:53:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:53:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 05:53:00,590 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 05:53:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:53:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:53:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 05:53:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:53:00,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:53:00,593 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:53:00,720 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:53:00,722 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:53:01,079 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:53:01,079 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:53:01,133 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:53:01,133 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-19 05:53:01,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:53:01 BoogieIcfgContainer [2024-11-19 05:53:01,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:53:01,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:53:01,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:53:01,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:53:01,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:52:59" (1/3) ... [2024-11-19 05:53:01,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1213b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:53:01, skipping insertion in model container [2024-11-19 05:53:01,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (2/3) ... [2024-11-19 05:53:01,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1213b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:53:01, skipping insertion in model container [2024-11-19 05:53:01,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:53:01" (3/3) ... [2024-11-19 05:53:01,145 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2024-11-19 05:53:01,189 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:53:01,190 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-19 05:53:01,190 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:53:01,294 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 05:53:01,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 221 transitions, 449 flow [2024-11-19 05:53:01,430 INFO L124 PetriNetUnfolderBase]: 19/285 cut-off events. [2024-11-19 05:53:01,430 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:53:01,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 285 events. 19/285 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 720 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 148. Up to 4 conditions per place. [2024-11-19 05:53:01,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 221 transitions, 449 flow [2024-11-19 05:53:01,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 221 transitions, 449 flow [2024-11-19 05:53:01,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:53:01,477 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;@71e4a343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:53:01,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-19 05:53:01,506 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:53:01,506 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2024-11-19 05:53:01,507 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:53:01,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:01,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:01,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:53:01,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:01,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1190862045, now seen corresponding path program 1 times [2024-11-19 05:53:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:01,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161290889] [2024-11-19 05:53:01,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:01,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:02,725 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-19 05:53:02,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:02,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161290889] [2024-11-19 05:53:02,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161290889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:02,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:02,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:53:02,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822644744] [2024-11-19 05:53:02,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:02,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:53:02,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:02,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:53:02,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:03,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 221 [2024-11-19 05:53:03,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 221 transitions, 449 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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-19 05:53:03,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:03,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 221 [2024-11-19 05:53:03,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:03,764 INFO L124 PetriNetUnfolderBase]: 579/2204 cut-off events. [2024-11-19 05:53:03,765 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:53:03,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3462 conditions, 2204 events. 579/2204 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 14977 event pairs, 357 based on Foata normal form. 225/2274 useless extension candidates. Maximal degree in co-relation 3263. Up to 1080 conditions per place. [2024-11-19 05:53:03,783 INFO L140 encePairwiseOnDemand]: 186/221 looper letters, 73 selfloop transitions, 70 changer transitions 0/300 dead transitions. [2024-11-19 05:53:03,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 300 transitions, 893 flow [2024-11-19 05:53:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:53:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:53:03,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1128 transitions. [2024-11-19 05:53:03,805 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8506787330316742 [2024-11-19 05:53:03,810 INFO L175 Difference]: Start difference. First operand has 211 places, 221 transitions, 449 flow. Second operand 6 states and 1128 transitions. [2024-11-19 05:53:03,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 300 transitions, 893 flow [2024-11-19 05:53:03,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 300 transitions, 893 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:53:03,827 INFO L231 Difference]: Finished difference. Result has 219 places, 276 transitions, 883 flow [2024-11-19 05:53:03,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=883, PETRI_PLACES=219, PETRI_TRANSITIONS=276} [2024-11-19 05:53:03,835 INFO L277 CegarLoopForPetriNet]: 211 programPoint places, 8 predicate places. [2024-11-19 05:53:03,836 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 276 transitions, 883 flow [2024-11-19 05:53:03,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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-19 05:53:03,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:03,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:03,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:53:03,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:53:03,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash -196153078, now seen corresponding path program 1 times [2024-11-19 05:53:03,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:03,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808249854] [2024-11-19 05:53:03,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:03,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:03,930 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-19 05:53:03,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:03,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808249854] [2024-11-19 05:53:03,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808249854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:03,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:03,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:53:03,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759009726] [2024-11-19 05:53:03,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:03,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:03,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:03,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:03,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:03,960 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 221 [2024-11-19 05:53:03,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 276 transitions, 883 flow. Second operand has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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-19 05:53:03,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:03,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 221 [2024-11-19 05:53:03,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:04,193 INFO L124 PetriNetUnfolderBase]: 185/1196 cut-off events. [2024-11-19 05:53:04,194 INFO L125 PetriNetUnfolderBase]: For 118/132 co-relation queries the response was YES. [2024-11-19 05:53:04,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 1196 events. 185/1196 cut-off events. For 118/132 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6937 event pairs, 35 based on Foata normal form. 1/1122 useless extension candidates. Maximal degree in co-relation 1745. Up to 223 conditions per place. [2024-11-19 05:53:04,201 INFO L140 encePairwiseOnDemand]: 218/221 looper letters, 22 selfloop transitions, 3 changer transitions 0/282 dead transitions. [2024-11-19 05:53:04,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 282 transitions, 945 flow [2024-11-19 05:53:04,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:04,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2024-11-19 05:53:04,204 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2024-11-19 05:53:04,204 INFO L175 Difference]: Start difference. First operand has 219 places, 276 transitions, 883 flow. Second operand 3 states and 595 transitions. [2024-11-19 05:53:04,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 282 transitions, 945 flow [2024-11-19 05:53:04,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 282 transitions, 945 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:53:04,218 INFO L231 Difference]: Finished difference. Result has 222 places, 276 transitions, 894 flow [2024-11-19 05:53:04,218 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=222, PETRI_TRANSITIONS=276} [2024-11-19 05:53:04,219 INFO L277 CegarLoopForPetriNet]: 211 programPoint places, 11 predicate places. [2024-11-19 05:53:04,219 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 276 transitions, 894 flow [2024-11-19 05:53:04,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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-19 05:53:04,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:53:04,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:53:04,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:53:04,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash 770082283, now seen corresponding path program 1 times [2024-11-19 05:53:04,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:04,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843081661] [2024-11-19 05:53:04,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:04,729 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-19 05:53:04,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:04,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843081661] [2024-11-19 05:53:04,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843081661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:04,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:04,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:53:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41885880] [2024-11-19 05:53:04,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:04,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:53:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:04,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:53:04,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:04,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 221 [2024-11-19 05:53:04,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 276 transitions, 894 flow. Second operand has 6 states, 6 states have (on average 171.16666666666666) internal successors, (1027), 6 states have internal predecessors, (1027), 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-19 05:53:04,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:04,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 221 [2024-11-19 05:53:04,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:05,306 INFO L124 PetriNetUnfolderBase]: 370/1611 cut-off events. [2024-11-19 05:53:05,307 INFO L125 PetriNetUnfolderBase]: For 462/474 co-relation queries the response was YES. [2024-11-19 05:53:05,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3296 conditions, 1611 events. 370/1611 cut-off events. For 462/474 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 10518 event pairs, 96 based on Foata normal form. 2/1559 useless extension candidates. Maximal degree in co-relation 3125. Up to 642 conditions per place. [2024-11-19 05:53:05,318 INFO L140 encePairwiseOnDemand]: 203/221 looper letters, 112 selfloop transitions, 53 changer transitions 0/335 dead transitions. [2024-11-19 05:53:05,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 335 transitions, 1466 flow [2024-11-19 05:53:05,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:53:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:53:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1097 transitions. [2024-11-19 05:53:05,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8273001508295625 [2024-11-19 05:53:05,321 INFO L175 Difference]: Start difference. First operand has 222 places, 276 transitions, 894 flow. Second operand 6 states and 1097 transitions. [2024-11-19 05:53:05,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 335 transitions, 1466 flow [2024-11-19 05:53:05,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 335 transitions, 1460 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:05,333 INFO L231 Difference]: Finished difference. Result has 230 places, 319 transitions, 1376 flow [2024-11-19 05:53:05,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1376, PETRI_PLACES=230, PETRI_TRANSITIONS=319} [2024-11-19 05:53:05,335 INFO L277 CegarLoopForPetriNet]: 211 programPoint places, 19 predicate places. [2024-11-19 05:53:05,335 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 319 transitions, 1376 flow [2024-11-19 05:53:05,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.16666666666666) internal successors, (1027), 6 states have internal predecessors, (1027), 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-19 05:53:05,336 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:05,336 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 05:53:05,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:53:05,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:53:05,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1722305356, now seen corresponding path program 1 times [2024-11-19 05:53:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:05,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049563172] [2024-11-19 05:53:05,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:05,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:53:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:05,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:53:05,438 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:53:05,440 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-19 05:53:05,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-19 05:53:05,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-19 05:53:05,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-19 05:53:05,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-19 05:53:05,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-19 05:53:05,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-19 05:53:05,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-19 05:53:05,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-19 05:53:05,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-19 05:53:05,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-19 05:53:05,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-19 05:53:05,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:53:05,448 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 05:53:05,450 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:53:05,452 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 05:53:05,491 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 05:53:05,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 287 transitions, 590 flow [2024-11-19 05:53:05,561 INFO L124 PetriNetUnfolderBase]: 34/443 cut-off events. [2024-11-19 05:53:05,561 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:53:05,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 443 events. 34/443 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1466 event pairs, 0 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 287. Up to 8 conditions per place. [2024-11-19 05:53:05,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 287 transitions, 590 flow [2024-11-19 05:53:05,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 272 places, 287 transitions, 590 flow [2024-11-19 05:53:05,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:53:05,575 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;@71e4a343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:53:05,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-19 05:53:05,589 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:53:05,589 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2024-11-19 05:53:05,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:53:05,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:05,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:05,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:05,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1785199357, now seen corresponding path program 1 times [2024-11-19 05:53:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:05,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960004891] [2024-11-19 05:53:05,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:05,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:05,993 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-19 05:53:05,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:05,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960004891] [2024-11-19 05:53:05,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960004891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:05,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:05,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:53:05,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492691772] [2024-11-19 05:53:05,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:05,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:53:05,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:05,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:53:05,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:06,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 287 [2024-11-19 05:53:06,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 287 transitions, 590 flow. Second operand has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 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-19 05:53:06,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:06,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 287 [2024-11-19 05:53:06,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:15,750 INFO L124 PetriNetUnfolderBase]: 29150/68169 cut-off events. [2024-11-19 05:53:15,750 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2024-11-19 05:53:15,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113703 conditions, 68169 events. 29150/68169 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 757617 event pairs, 19147 based on Foata normal form. 8132/72324 useless extension candidates. Maximal degree in co-relation 99472. Up to 40547 conditions per place. [2024-11-19 05:53:16,209 INFO L140 encePairwiseOnDemand]: 230/287 looper letters, 122 selfloop transitions, 134 changer transitions 0/449 dead transitions. [2024-11-19 05:53:16,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 449 transitions, 1431 flow [2024-11-19 05:53:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:53:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:53:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2024-11-19 05:53:16,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8635307781649245 [2024-11-19 05:53:16,214 INFO L175 Difference]: Start difference. First operand has 272 places, 287 transitions, 590 flow. Second operand 6 states and 1487 transitions. [2024-11-19 05:53:16,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 449 transitions, 1431 flow [2024-11-19 05:53:16,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 449 transitions, 1431 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:53:16,243 INFO L231 Difference]: Finished difference. Result has 280 places, 400 transitions, 1428 flow [2024-11-19 05:53:16,244 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1428, PETRI_PLACES=280, PETRI_TRANSITIONS=400} [2024-11-19 05:53:16,246 INFO L277 CegarLoopForPetriNet]: 272 programPoint places, 8 predicate places. [2024-11-19 05:53:16,246 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 400 transitions, 1428 flow [2024-11-19 05:53:16,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 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-19 05:53:16,247 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:16,247 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:16,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:53:16,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:16,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:16,248 INFO L85 PathProgramCache]: Analyzing trace with hash -268637430, now seen corresponding path program 1 times [2024-11-19 05:53:16,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:16,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773212418] [2024-11-19 05:53:16,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:16,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:16,310 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-19 05:53:16,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:16,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773212418] [2024-11-19 05:53:16,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773212418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:16,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:16,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:53:16,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626290256] [2024-11-19 05:53:16,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:16,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:16,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:16,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:16,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:16,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 287 [2024-11-19 05:53:16,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 400 transitions, 1428 flow. Second operand has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 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-19 05:53:16,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:16,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 287 [2024-11-19 05:53:16,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:20,180 INFO L124 PetriNetUnfolderBase]: 9617/30373 cut-off events. [2024-11-19 05:53:20,181 INFO L125 PetriNetUnfolderBase]: For 5314/5716 co-relation queries the response was YES. [2024-11-19 05:53:20,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54618 conditions, 30373 events. 9617/30373 cut-off events. For 5314/5716 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 342076 event pairs, 3405 based on Foata normal form. 1/27872 useless extension candidates. Maximal degree in co-relation 28177. Up to 8560 conditions per place. [2024-11-19 05:53:20,400 INFO L140 encePairwiseOnDemand]: 284/287 looper letters, 32 selfloop transitions, 3 changer transitions 0/408 dead transitions. [2024-11-19 05:53:20,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 408 transitions, 1520 flow [2024-11-19 05:53:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2024-11-19 05:53:20,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8826945412311266 [2024-11-19 05:53:20,403 INFO L175 Difference]: Start difference. First operand has 280 places, 400 transitions, 1428 flow. Second operand 3 states and 760 transitions. [2024-11-19 05:53:20,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 408 transitions, 1520 flow [2024-11-19 05:53:20,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 408 transitions, 1520 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:53:20,548 INFO L231 Difference]: Finished difference. Result has 283 places, 402 transitions, 1453 flow [2024-11-19 05:53:20,549 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1453, PETRI_PLACES=283, PETRI_TRANSITIONS=402} [2024-11-19 05:53:20,552 INFO L277 CegarLoopForPetriNet]: 272 programPoint places, 11 predicate places. [2024-11-19 05:53:20,552 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 402 transitions, 1453 flow [2024-11-19 05:53:20,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 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-19 05:53:20,554 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:20,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:53:20,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:53:20,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:20,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:20,555 INFO L85 PathProgramCache]: Analyzing trace with hash -619006229, now seen corresponding path program 1 times [2024-11-19 05:53:20,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:20,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535800743] [2024-11-19 05:53:20,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:20,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:21,018 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-19 05:53:21,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:21,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535800743] [2024-11-19 05:53:21,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535800743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:21,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:21,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:53:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494308376] [2024-11-19 05:53:21,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:21,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:53:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:21,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:53:21,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:21,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 287 [2024-11-19 05:53:21,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 402 transitions, 1453 flow. Second operand has 6 states, 6 states have (on average 215.16666666666666) internal successors, (1291), 6 states have internal predecessors, (1291), 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-19 05:53:21,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:21,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 287 [2024-11-19 05:53:21,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:28,633 INFO L124 PetriNetUnfolderBase]: 22789/55945 cut-off events. [2024-11-19 05:53:28,633 INFO L125 PetriNetUnfolderBase]: For 20607/22116 co-relation queries the response was YES. [2024-11-19 05:53:28,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123377 conditions, 55945 events. 22789/55945 cut-off events. For 20607/22116 co-relation queries the response was YES. Maximal size of possible extension queue 1101. Compared 624226 event pairs, 7775 based on Foata normal form. 55/52787 useless extension candidates. Maximal degree in co-relation 123155. Up to 26561 conditions per place. [2024-11-19 05:53:29,130 INFO L140 encePairwiseOnDemand]: 261/287 looper letters, 192 selfloop transitions, 141 changer transitions 0/581 dead transitions. [2024-11-19 05:53:29,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 581 transitions, 2921 flow [2024-11-19 05:53:29,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:53:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:53:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1441 transitions. [2024-11-19 05:53:29,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8368176538908246 [2024-11-19 05:53:29,136 INFO L175 Difference]: Start difference. First operand has 283 places, 402 transitions, 1453 flow. Second operand 6 states and 1441 transitions. [2024-11-19 05:53:29,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 581 transitions, 2921 flow [2024-11-19 05:53:29,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 581 transitions, 2918 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:53:29,395 INFO L231 Difference]: Finished difference. Result has 292 places, 533 transitions, 2834 flow [2024-11-19 05:53:29,396 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2834, PETRI_PLACES=292, PETRI_TRANSITIONS=533} [2024-11-19 05:53:29,396 INFO L277 CegarLoopForPetriNet]: 272 programPoint places, 20 predicate places. [2024-11-19 05:53:29,397 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 533 transitions, 2834 flow [2024-11-19 05:53:29,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.16666666666666) internal successors, (1291), 6 states have internal predecessors, (1291), 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-19 05:53:29,398 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:29,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:53:29,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:53:29,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:29,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:29,399 INFO L85 PathProgramCache]: Analyzing trace with hash 519339482, now seen corresponding path program 1 times [2024-11-19 05:53:29,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:29,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645379820] [2024-11-19 05:53:29,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:29,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:29,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:29,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645379820] [2024-11-19 05:53:29,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645379820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:53:29,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705305570] [2024-11-19 05:53:29,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:29,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:53:29,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:53:29,508 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-19 05:53:29,518 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-19 05:53:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:29,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 05:53:29,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:53:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:29,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:53:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:29,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705305570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:53:29,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:53:29,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 05:53:29,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308245212] [2024-11-19 05:53:29,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:53:29,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:53:29,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:29,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:53:29,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:53:29,853 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 287 [2024-11-19 05:53:29,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 533 transitions, 2834 flow. Second operand has 10 states, 10 states have (on average 241.3) internal successors, (2413), 10 states have internal predecessors, (2413), 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-19 05:53:29,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:29,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 287 [2024-11-19 05:53:29,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:34,531 INFO L124 PetriNetUnfolderBase]: 12683/33928 cut-off events. [2024-11-19 05:53:34,532 INFO L125 PetriNetUnfolderBase]: For 24315/26215 co-relation queries the response was YES. [2024-11-19 05:53:34,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84276 conditions, 33928 events. 12683/33928 cut-off events. For 24315/26215 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 354595 event pairs, 1715 based on Foata normal form. 240/32448 useless extension candidates. Maximal degree in co-relation 37946. Up to 13115 conditions per place. [2024-11-19 05:53:34,802 INFO L140 encePairwiseOnDemand]: 282/287 looper letters, 72 selfloop transitions, 9 changer transitions 0/541 dead transitions. [2024-11-19 05:53:34,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 541 transitions, 3004 flow [2024-11-19 05:53:34,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:53:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 05:53:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2232 transitions. [2024-11-19 05:53:34,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8641114982578397 [2024-11-19 05:53:34,812 INFO L175 Difference]: Start difference. First operand has 292 places, 533 transitions, 2834 flow. Second operand 9 states and 2232 transitions. [2024-11-19 05:53:34,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 541 transitions, 3004 flow [2024-11-19 05:53:35,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 541 transitions, 2986 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-19 05:53:35,157 INFO L231 Difference]: Finished difference. Result has 252 places, 485 transitions, 2730 flow [2024-11-19 05:53:35,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=2708, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2730, PETRI_PLACES=252, PETRI_TRANSITIONS=485} [2024-11-19 05:53:35,158 INFO L277 CegarLoopForPetriNet]: 272 programPoint places, -20 predicate places. [2024-11-19 05:53:35,159 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 485 transitions, 2730 flow [2024-11-19 05:53:35,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 241.3) internal successors, (2413), 10 states have internal predecessors, (2413), 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-19 05:53:35,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:35,161 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:53:35,179 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-19 05:53:35,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:53:35,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:35,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1496893580, now seen corresponding path program 1 times [2024-11-19 05:53:35,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:35,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144742270] [2024-11-19 05:53:35,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:35,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:35,993 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-19 05:53:35,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:35,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144742270] [2024-11-19 05:53:35,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144742270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:35,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:35,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:53:35,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102455990] [2024-11-19 05:53:35,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:35,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:53:35,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:35,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:53:35,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:36,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 287 [2024-11-19 05:53:36,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 485 transitions, 2730 flow. Second operand has 6 states, 6 states have (on average 199.16666666666666) internal successors, (1195), 6 states have internal predecessors, (1195), 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-19 05:53:36,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:36,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 287 [2024-11-19 05:53:36,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:42,271 INFO L124 PetriNetUnfolderBase]: 20252/44503 cut-off events. [2024-11-19 05:53:42,272 INFO L125 PetriNetUnfolderBase]: For 47058/50762 co-relation queries the response was YES. [2024-11-19 05:53:42,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134357 conditions, 44503 events. 20252/44503 cut-off events. For 47058/50762 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 438439 event pairs, 5324 based on Foata normal form. 64/42780 useless extension candidates. Maximal degree in co-relation 116467. Up to 29019 conditions per place. [2024-11-19 05:53:42,597 INFO L140 encePairwiseOnDemand]: 260/287 looper letters, 338 selfloop transitions, 213 changer transitions 0/716 dead transitions. [2024-11-19 05:53:42,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 716 transitions, 5174 flow [2024-11-19 05:53:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:53:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:53:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1348 transitions. [2024-11-19 05:53:42,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7828106852497096 [2024-11-19 05:53:42,601 INFO L175 Difference]: Start difference. First operand has 252 places, 485 transitions, 2730 flow. Second operand 6 states and 1348 transitions. [2024-11-19 05:53:42,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 716 transitions, 5174 flow [2024-11-19 05:53:42,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 716 transitions, 5151 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-19 05:53:42,902 INFO L231 Difference]: Finished difference. Result has 257 places, 688 transitions, 5017 flow [2024-11-19 05:53:42,903 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=2707, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5017, PETRI_PLACES=257, PETRI_TRANSITIONS=688} [2024-11-19 05:53:42,904 INFO L277 CegarLoopForPetriNet]: 272 programPoint places, -15 predicate places. [2024-11-19 05:53:42,904 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 688 transitions, 5017 flow [2024-11-19 05:53:42,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.16666666666666) internal successors, (1195), 6 states have internal predecessors, (1195), 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-19 05:53:42,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:42,906 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2024-11-19 05:53:42,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:53:42,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:42,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:42,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1958461570, now seen corresponding path program 1 times [2024-11-19 05:53:42,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:42,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043521328] [2024-11-19 05:53:42,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:42,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 05:53:43,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:43,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043521328] [2024-11-19 05:53:43,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043521328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:53:43,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139415799] [2024-11-19 05:53:43,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:43,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:53:43,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:53:43,546 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-19 05:53:43,548 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-19 05:53:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:43,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 05:53:43,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:53:43,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 05:53:43,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 05:53:44,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-19 05:53:44,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-19 05:53:44,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 05:53:44,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-19 05:53:44,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 05:53:44,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-19 05:53:44,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-19 05:53:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 05:53:44,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:53:44,650 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_555 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))) (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 3 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_555 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)))) (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)))) is different from false [2024-11-19 05:53:44,766 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_555 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))) (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_555 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 3 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))))) is different from false [2024-11-19 05:53:44,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 3 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet16#1|)))) (and (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)))))) is different from false [2024-11-19 05:53:44,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 05:53:44,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-19 05:53:44,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 05:53:44,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 35 [2024-11-19 05:53:44,954 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-19 05:53:44,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-19 05:53:44,965 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-19 05:53:44,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-19 05:53:44,973 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-19 05:53:44,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-19 05:53:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 6 trivial. 1 not checked. [2024-11-19 05:53:48,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139415799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:53:48,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:53:48,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-11-19 05:53:48,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010118895] [2024-11-19 05:53:48,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:53:48,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 05:53:48,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:48,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 05:53:48,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=227, Unknown=19, NotChecked=102, Total=420 [2024-11-19 05:53:48,899 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 287 [2024-11-19 05:53:48,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 688 transitions, 5017 flow. Second operand has 21 states, 21 states have (on average 156.0952380952381) internal successors, (3278), 21 states have internal predecessors, (3278), 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-19 05:53:48,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:48,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 287 [2024-11-19 05:53:48,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand