./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f 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_05-lockfuns_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 1fe12ce8951e45860142b9cebaa325eef531c18fa917882c03ee5396afb187f5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:32:29,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:32:29,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:32:29,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:32:29,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:32:29,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:32:29,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:32:29,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:32:29,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:32:29,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:32:29,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:32:29,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:32:29,783 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:32:29,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:32:29,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:32:29,785 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:32:29,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:32:29,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:32:29,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:32:29,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:32:29,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:32:29,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:32:29,790 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:32:29,790 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:32:29,790 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:32:29,791 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:32:29,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:32:29,791 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:32:29,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:32:29,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:32:29,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:32:29,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:32:29,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:32:29,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:32:29,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:32:29,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:32:29,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:32:29,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:32:29,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:32:29,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:32:29,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:32:29,794 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 -> 1fe12ce8951e45860142b9cebaa325eef531c18fa917882c03ee5396afb187f5 [2024-11-10 14:32:30,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:32:30,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:32:30,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:32:30,081 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:32:30,082 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:32:30,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i [2024-11-10 14:32:31,538 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:32:31,800 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:32:31,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i [2024-11-10 14:32:31,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3308da19/64c0a2ff5e57411eb80f70e26a3505eb/FLAG7e3a53ae7 [2024-11-10 14:32:32,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3308da19/64c0a2ff5e57411eb80f70e26a3505eb [2024-11-10 14:32:32,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:32:32,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:32:32,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:32:32,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:32:32,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:32:32,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b7cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32, skipping insertion in model container [2024-11-10 14:32:32,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:32:32,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:32:32,597 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:32:32,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:32:32,701 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:32:32,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32 WrapperNode [2024-11-10 14:32:32,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:32:32,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:32:32,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:32:32,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:32:32,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,751 INFO L138 Inliner]: procedures = 173, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-10 14:32:32,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:32:32,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:32:32,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:32:32,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:32:32,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,782 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:32:32,799 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:32:32,799 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:32:32,799 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:32:32,800 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:32:32,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:32:32,838 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-10 14:32:32,842 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-10 14:32:32,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:32:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:32:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:32:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:32:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:32:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 14:32:32,895 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 14:32:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:32:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:32:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:32:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:32:32,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:32:32,898 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:32:33,053 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:32:33,057 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:32:33,331 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-10 14:32:33,331 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-10 14:32:33,388 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:32:33,391 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:32:33,448 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:32:33,448 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:32:33,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:32:33 BoogieIcfgContainer [2024-11-10 14:32:33,449 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:32:33,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:32:33,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:32:33,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:32:33,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:32:32" (1/3) ... [2024-11-10 14:32:33,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d9b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:32:33, skipping insertion in model container [2024-11-10 14:32:33,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (2/3) ... [2024-11-10 14:32:33,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d9b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:32:33, skipping insertion in model container [2024-11-10 14:32:33,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:32:33" (3/3) ... [2024-11-10 14:32:33,463 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_05-lockfuns_racefree.i [2024-11-10 14:32:33,482 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:32:33,483 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-10 14:32:33,483 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:32:33,540 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:32:33,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 153 transitions, 313 flow [2024-11-10 14:32:33,681 INFO L124 PetriNetUnfolderBase]: 19/219 cut-off events. [2024-11-10 14:32:33,682 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:32:33,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 219 events. 19/219 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 685 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 122. Up to 4 conditions per place. [2024-11-10 14:32:33,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 153 transitions, 313 flow [2024-11-10 14:32:33,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 153 transitions, 313 flow [2024-11-10 14:32:33,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:33,726 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;@5dfa6c9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:33,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-10 14:32:33,737 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:33,737 INFO L124 PetriNetUnfolderBase]: 1/51 cut-off events. [2024-11-10 14:32:33,737 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:33,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:33,738 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] [2024-11-10 14:32:33,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:33,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash 97079057, now seen corresponding path program 1 times [2024-11-10 14:32:33,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:33,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097245896] [2024-11-10 14:32:33,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:33,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:34,633 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-10 14:32:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:34,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097245896] [2024-11-10 14:32:34,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097245896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:34,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:34,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:34,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818265506] [2024-11-10 14:32:34,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:34,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:34,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:34,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:34,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 153 [2024-11-10 14:32:34,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 153 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 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-10 14:32:34,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:34,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 153 [2024-11-10 14:32:34,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:35,108 INFO L124 PetriNetUnfolderBase]: 109/884 cut-off events. [2024-11-10 14:32:35,108 INFO L125 PetriNetUnfolderBase]: For 6/9 co-relation queries the response was YES. [2024-11-10 14:32:35,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 884 events. 109/884 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5329 event pairs, 77 based on Foata normal form. 149/943 useless extension candidates. Maximal degree in co-relation 1035. Up to 186 conditions per place. [2024-11-10 14:32:35,120 INFO L140 encePairwiseOnDemand]: 135/153 looper letters, 48 selfloop transitions, 5 changer transitions 0/162 dead transitions. [2024-11-10 14:32:35,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 162 transitions, 437 flow [2024-11-10 14:32:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:32:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:32:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2024-11-10 14:32:35,138 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8169934640522876 [2024-11-10 14:32:35,142 INFO L175 Difference]: Start difference. First operand has 143 places, 153 transitions, 313 flow. Second operand 6 states and 750 transitions. [2024-11-10 14:32:35,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 162 transitions, 437 flow [2024-11-10 14:32:35,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 162 transitions, 437 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:35,153 INFO L231 Difference]: Finished difference. Result has 145 places, 138 transitions, 293 flow [2024-11-10 14:32:35,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=145, PETRI_TRANSITIONS=138} [2024-11-10 14:32:35,159 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 2 predicate places. [2024-11-10 14:32:35,161 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 138 transitions, 293 flow [2024-11-10 14:32:35,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 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-10 14:32:35,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:35,162 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] [2024-11-10 14:32:35,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:32:35,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:35,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1241289619, now seen corresponding path program 1 times [2024-11-10 14:32:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:35,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062699421] [2024-11-10 14:32:35,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:35,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:35,230 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-10 14:32:35,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:35,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062699421] [2024-11-10 14:32:35,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062699421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:35,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:35,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:32:35,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577507226] [2024-11-10 14:32:35,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:35,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:35,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:35,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:35,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:35,261 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 153 [2024-11-10 14:32:35,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 138 transitions, 293 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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-10 14:32:35,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:35,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 153 [2024-11-10 14:32:35,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:35,358 INFO L124 PetriNetUnfolderBase]: 48/574 cut-off events. [2024-11-10 14:32:35,358 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-10 14:32:35,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 574 events. 48/574 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2845 event pairs, 0 based on Foata normal form. 1/535 useless extension candidates. Maximal degree in co-relation 654. Up to 108 conditions per place. [2024-11-10 14:32:35,361 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 22 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2024-11-10 14:32:35,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 144 transitions, 353 flow [2024-11-10 14:32:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2024-11-10 14:32:35,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2024-11-10 14:32:35,364 INFO L175 Difference]: Start difference. First operand has 145 places, 138 transitions, 293 flow. Second operand 3 states and 391 transitions. [2024-11-10 14:32:35,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 144 transitions, 353 flow [2024-11-10 14:32:35,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 144 transitions, 343 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:32:35,368 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 291 flow [2024-11-10 14:32:35,369 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=291, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2024-11-10 14:32:35,369 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 0 predicate places. [2024-11-10 14:32:35,370 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 291 flow [2024-11-10 14:32:35,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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-10 14:32:35,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:35,370 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] [2024-11-10 14:32:35,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:32:35,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:35,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:35,372 INFO L85 PathProgramCache]: Analyzing trace with hash 104028774, now seen corresponding path program 1 times [2024-11-10 14:32:35,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:35,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808005911] [2024-11-10 14:32:35,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:35,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:35,409 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-10 14:32:35,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:35,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808005911] [2024-11-10 14:32:35,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808005911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:35,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:35,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:35,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894890175] [2024-11-10 14:32:35,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:35,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:35,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:35,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:35,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:35,437 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 153 [2024-11-10 14:32:35,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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-10 14:32:35,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:35,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 153 [2024-11-10 14:32:35,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:35,604 INFO L124 PetriNetUnfolderBase]: 91/856 cut-off events. [2024-11-10 14:32:35,605 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-10 14:32:35,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 856 events. 91/856 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5147 event pairs, 30 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 1035. Up to 125 conditions per place. [2024-11-10 14:32:35,612 INFO L140 encePairwiseOnDemand]: 144/153 looper letters, 30 selfloop transitions, 6 changer transitions 0/151 dead transitions. [2024-11-10 14:32:35,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 151 transitions, 392 flow [2024-11-10 14:32:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2024-11-10 14:32:35,614 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8496732026143791 [2024-11-10 14:32:35,614 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 291 flow. Second operand 3 states and 390 transitions. [2024-11-10 14:32:35,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 151 transitions, 392 flow [2024-11-10 14:32:35,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 151 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:35,620 INFO L231 Difference]: Finished difference. Result has 143 places, 140 transitions, 325 flow [2024-11-10 14:32:35,622 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=143, PETRI_TRANSITIONS=140} [2024-11-10 14:32:35,623 INFO L277 CegarLoopForPetriNet]: 143 programPoint places, 0 predicate places. [2024-11-10 14:32:35,623 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 140 transitions, 325 flow [2024-11-10 14:32:35,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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-10 14:32:35,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:35,624 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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] [2024-11-10 14:32:35,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:32:35,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:35,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1747357112, now seen corresponding path program 1 times [2024-11-10 14:32:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:35,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29344072] [2024-11-10 14:32:35,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:35,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:32:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:35,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:32:35,702 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:32:35,703 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-10 14:32:35,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-10 14:32:35,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-10 14:32:35,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-10 14:32:35,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-10 14:32:35,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-10 14:32:35,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-10 14:32:35,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-10 14:32:35,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-10 14:32:35,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-10 14:32:35,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-10 14:32:35,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-10 14:32:35,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:32:35,708 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 14:32:35,712 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:32:35,712 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:32:35,745 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:32:35,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 208 transitions, 432 flow [2024-11-10 14:32:35,791 INFO L124 PetriNetUnfolderBase]: 34/369 cut-off events. [2024-11-10 14:32:35,791 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:32:35,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 369 events. 34/369 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1313 event pairs, 0 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 221. Up to 8 conditions per place. [2024-11-10 14:32:35,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 208 transitions, 432 flow [2024-11-10 14:32:35,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 208 transitions, 432 flow [2024-11-10 14:32:35,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:35,806 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;@5dfa6c9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:35,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-10 14:32:35,810 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:35,812 INFO L124 PetriNetUnfolderBase]: 1/51 cut-off events. [2024-11-10 14:32:35,812 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:35,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:35,814 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] [2024-11-10 14:32:35,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:35,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:35,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1911512303, now seen corresponding path program 1 times [2024-11-10 14:32:35,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:35,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807598982] [2024-11-10 14:32:35,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:35,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:36,123 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-10 14:32:36,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:36,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807598982] [2024-11-10 14:32:36,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807598982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:36,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:36,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:36,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413767930] [2024-11-10 14:32:36,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:36,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:36,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:36,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:36,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:36,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 208 [2024-11-10 14:32:36,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 208 transitions, 432 flow. Second operand has 6 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 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-10 14:32:36,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:36,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 208 [2024-11-10 14:32:36,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:37,182 INFO L124 PetriNetUnfolderBase]: 1719/5717 cut-off events. [2024-11-10 14:32:37,183 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-10 14:32:37,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8612 conditions, 5717 events. 1719/5717 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 54166 event pairs, 222 based on Foata normal form. 2107/7445 useless extension candidates. Maximal degree in co-relation 1100. Up to 2020 conditions per place. [2024-11-10 14:32:37,225 INFO L140 encePairwiseOnDemand]: 184/208 looper letters, 80 selfloop transitions, 5 changer transitions 0/235 dead transitions. [2024-11-10 14:32:37,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 235 transitions, 656 flow [2024-11-10 14:32:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:32:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:32:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1058 transitions. [2024-11-10 14:32:37,228 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8477564102564102 [2024-11-10 14:32:37,229 INFO L175 Difference]: Start difference. First operand has 193 places, 208 transitions, 432 flow. Second operand 6 states and 1058 transitions. [2024-11-10 14:32:37,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 235 transitions, 656 flow [2024-11-10 14:32:37,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 235 transitions, 656 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:37,235 INFO L231 Difference]: Finished difference. Result has 195 places, 187 transitions, 400 flow [2024-11-10 14:32:37,235 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=195, PETRI_TRANSITIONS=187} [2024-11-10 14:32:37,237 INFO L277 CegarLoopForPetriNet]: 193 programPoint places, 2 predicate places. [2024-11-10 14:32:37,237 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 187 transitions, 400 flow [2024-11-10 14:32:37,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 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-10 14:32:37,238 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:37,238 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] [2024-11-10 14:32:37,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:32:37,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:37,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:37,240 INFO L85 PathProgramCache]: Analyzing trace with hash -895500189, now seen corresponding path program 1 times [2024-11-10 14:32:37,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:37,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738155086] [2024-11-10 14:32:37,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:37,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:37,277 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-10 14:32:37,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:37,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738155086] [2024-11-10 14:32:37,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738155086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:37,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:32:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368229933] [2024-11-10 14:32:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:37,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:37,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:37,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:37,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:37,307 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 208 [2024-11-10 14:32:37,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 187 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-10 14:32:37,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:37,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 208 [2024-11-10 14:32:37,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:38,009 INFO L124 PetriNetUnfolderBase]: 788/4788 cut-off events. [2024-11-10 14:32:38,009 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-11-10 14:32:38,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6386 conditions, 4788 events. 788/4788 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 46075 event pairs, 703 based on Foata normal form. 1/4389 useless extension candidates. Maximal degree in co-relation 4790. Up to 1303 conditions per place. [2024-11-10 14:32:38,040 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 31 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2024-11-10 14:32:38,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 194 transitions, 482 flow [2024-11-10 14:32:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2024-11-10 14:32:38,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8381410256410257 [2024-11-10 14:32:38,043 INFO L175 Difference]: Start difference. First operand has 195 places, 187 transitions, 400 flow. Second operand 3 states and 523 transitions. [2024-11-10 14:32:38,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 194 transitions, 482 flow [2024-11-10 14:32:38,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 194 transitions, 470 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:32:38,048 INFO L231 Difference]: Finished difference. Result has 193 places, 188 transitions, 402 flow [2024-11-10 14:32:38,048 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=193, PETRI_TRANSITIONS=188} [2024-11-10 14:32:38,049 INFO L277 CegarLoopForPetriNet]: 193 programPoint places, 0 predicate places. [2024-11-10 14:32:38,049 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 188 transitions, 402 flow [2024-11-10 14:32:38,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-10 14:32:38,050 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:38,050 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] [2024-11-10 14:32:38,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:32:38,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:38,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:38,051 INFO L85 PathProgramCache]: Analyzing trace with hash -266664175, now seen corresponding path program 1 times [2024-11-10 14:32:38,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:38,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764139558] [2024-11-10 14:32:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:38,089 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-10 14:32:38,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:38,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764139558] [2024-11-10 14:32:38,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764139558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:38,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:38,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:38,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976139438] [2024-11-10 14:32:38,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:38,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:38,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:38,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:38,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:38,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 208 [2024-11-10 14:32:38,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 188 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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-10 14:32:38,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:38,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 208 [2024-11-10 14:32:38,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:40,023 INFO L124 PetriNetUnfolderBase]: 3895/15486 cut-off events. [2024-11-10 14:32:40,023 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-11-10 14:32:40,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22026 conditions, 15486 events. 3895/15486 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 177490 event pairs, 1409 based on Foata normal form. 0/13927 useless extension candidates. Maximal degree in co-relation 21975. Up to 3516 conditions per place. [2024-11-10 14:32:40,135 INFO L140 encePairwiseOnDemand]: 189/208 looper letters, 58 selfloop transitions, 14 changer transitions 0/221 dead transitions. [2024-11-10 14:32:40,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 221 transitions, 623 flow [2024-11-10 14:32:40,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2024-11-10 14:32:40,138 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.844551282051282 [2024-11-10 14:32:40,138 INFO L175 Difference]: Start difference. First operand has 193 places, 188 transitions, 402 flow. Second operand 3 states and 527 transitions. [2024-11-10 14:32:40,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 221 transitions, 623 flow [2024-11-10 14:32:40,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 221 transitions, 621 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:32:40,144 INFO L231 Difference]: Finished difference. Result has 196 places, 202 transitions, 522 flow [2024-11-10 14:32:40,145 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=196, PETRI_TRANSITIONS=202} [2024-11-10 14:32:40,146 INFO L277 CegarLoopForPetriNet]: 193 programPoint places, 3 predicate places. [2024-11-10 14:32:40,147 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 202 transitions, 522 flow [2024-11-10 14:32:40,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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-10 14:32:40,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:40,148 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:40,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:32:40,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:40,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash 386731258, now seen corresponding path program 1 times [2024-11-10 14:32:40,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:40,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553724875] [2024-11-10 14:32:40,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:40,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:40,195 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-10 14:32:40,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:40,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553724875] [2024-11-10 14:32:40,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553724875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:40,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:40,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423968293] [2024-11-10 14:32:40,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:40,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:40,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:40,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:40,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:40,243 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 208 [2024-11-10 14:32:40,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 202 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-10 14:32:40,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:40,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 208 [2024-11-10 14:32:40,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:42,234 INFO L124 PetriNetUnfolderBase]: 4045/17619 cut-off events. [2024-11-10 14:32:42,234 INFO L125 PetriNetUnfolderBase]: For 4306/4483 co-relation queries the response was YES. [2024-11-10 14:32:42,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28374 conditions, 17619 events. 4045/17619 cut-off events. For 4306/4483 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 211817 event pairs, 2518 based on Foata normal form. 46/16105 useless extension candidates. Maximal degree in co-relation 27024. Up to 5540 conditions per place. [2024-11-10 14:32:42,382 INFO L140 encePairwiseOnDemand]: 199/208 looper letters, 52 selfloop transitions, 14 changer transitions 0/226 dead transitions. [2024-11-10 14:32:42,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 226 transitions, 740 flow [2024-11-10 14:32:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2024-11-10 14:32:42,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8349358974358975 [2024-11-10 14:32:42,385 INFO L175 Difference]: Start difference. First operand has 196 places, 202 transitions, 522 flow. Second operand 3 states and 521 transitions. [2024-11-10 14:32:42,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 226 transitions, 740 flow [2024-11-10 14:32:42,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 226 transitions, 702 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:42,399 INFO L231 Difference]: Finished difference. Result has 198 places, 214 transitions, 620 flow [2024-11-10 14:32:42,399 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=198, PETRI_TRANSITIONS=214} [2024-11-10 14:32:42,400 INFO L277 CegarLoopForPetriNet]: 193 programPoint places, 5 predicate places. [2024-11-10 14:32:42,400 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 214 transitions, 620 flow [2024-11-10 14:32:42,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-10 14:32:42,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:42,401 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 14:32:42,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:32:42,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:42,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:42,402 INFO L85 PathProgramCache]: Analyzing trace with hash 180233988, now seen corresponding path program 1 times [2024-11-10 14:32:42,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:42,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909039087] [2024-11-10 14:32:42,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:42,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:42,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:32:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:42,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:32:42,463 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:32:42,463 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-10 14:32:42,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-10 14:32:42,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-10 14:32:42,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-10 14:32:42,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-10 14:32:42,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-10 14:32:42,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-10 14:32:42,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-10 14:32:42,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-10 14:32:42,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-10 14:32:42,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-10 14:32:42,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-10 14:32:42,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-10 14:32:42,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-10 14:32:42,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-10 14:32:42,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-10 14:32:42,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:32:42,469 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 14:32:42,470 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:32:42,473 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:32:42,503 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:32:42,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 263 transitions, 553 flow [2024-11-10 14:32:42,756 INFO L124 PetriNetUnfolderBase]: 54/566 cut-off events. [2024-11-10 14:32:42,757 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 14:32:42,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 566 events. 54/566 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2196 event pairs, 1 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 377. Up to 16 conditions per place. [2024-11-10 14:32:42,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 263 transitions, 553 flow [2024-11-10 14:32:42,771 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 263 transitions, 553 flow [2024-11-10 14:32:42,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:42,773 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;@5dfa6c9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:42,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-10 14:32:42,780 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:42,781 INFO L124 PetriNetUnfolderBase]: 1/51 cut-off events. [2024-11-10 14:32:42,781 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:42,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:42,782 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] [2024-11-10 14:32:42,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:32:42,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:42,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1168049455, now seen corresponding path program 1 times [2024-11-10 14:32:42,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:42,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411356287] [2024-11-10 14:32:42,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:42,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:43,032 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-10 14:32:43,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:43,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411356287] [2024-11-10 14:32:43,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411356287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:43,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:43,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:43,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656776328] [2024-11-10 14:32:43,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:43,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:43,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:43,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:43,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:43,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 263 [2024-11-10 14:32:43,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 263 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 193.5) internal successors, (1161), 6 states have internal predecessors, (1161), 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-10 14:32:43,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:43,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 263 [2024-11-10 14:32:43,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:49,791 INFO L124 PetriNetUnfolderBase]: 19556/53590 cut-off events. [2024-11-10 14:32:49,791 INFO L125 PetriNetUnfolderBase]: For 1171/1171 co-relation queries the response was YES. [2024-11-10 14:32:49,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81947 conditions, 53590 events. 19556/53590 cut-off events. For 1171/1171 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 661181 event pairs, 2086 based on Foata normal form. 22322/72476 useless extension candidates. Maximal degree in co-relation 9237. Up to 20053 conditions per place. [2024-11-10 14:32:50,272 INFO L140 encePairwiseOnDemand]: 233/263 looper letters, 112 selfloop transitions, 5 changer transitions 0/308 dead transitions. [2024-11-10 14:32:50,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 308 transitions, 877 flow [2024-11-10 14:32:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:32:50,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:32:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1366 transitions. [2024-11-10 14:32:50,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8656527249683144 [2024-11-10 14:32:50,278 INFO L175 Difference]: Start difference. First operand has 243 places, 263 transitions, 553 flow. Second operand 6 states and 1366 transitions. [2024-11-10 14:32:50,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 308 transitions, 877 flow [2024-11-10 14:32:50,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 308 transitions, 877 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:50,287 INFO L231 Difference]: Finished difference. Result has 245 places, 236 transitions, 509 flow [2024-11-10 14:32:50,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=509, PETRI_PLACES=245, PETRI_TRANSITIONS=236} [2024-11-10 14:32:50,290 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, 2 predicate places. [2024-11-10 14:32:50,291 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 236 transitions, 509 flow [2024-11-10 14:32:50,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.5) internal successors, (1161), 6 states have internal predecessors, (1161), 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-10 14:32:50,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:50,293 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] [2024-11-10 14:32:50,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:32:50,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:32:50,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:50,294 INFO L85 PathProgramCache]: Analyzing trace with hash 677011882, now seen corresponding path program 1 times [2024-11-10 14:32:50,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:50,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827066819] [2024-11-10 14:32:50,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:50,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:50,329 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-10 14:32:50,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:50,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827066819] [2024-11-10 14:32:50,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827066819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:50,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:50,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:32:50,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871638277] [2024-11-10 14:32:50,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:50,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:50,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:50,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:50,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:50,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 263 [2024-11-10 14:32:50,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 236 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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-10 14:32:50,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:50,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 263 [2024-11-10 14:32:50,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:54,934 INFO L124 PetriNetUnfolderBase]: 8935/38189 cut-off events. [2024-11-10 14:32:54,934 INFO L125 PetriNetUnfolderBase]: For 2320/2320 co-relation queries the response was YES. [2024-11-10 14:32:55,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53359 conditions, 38189 events. 8935/38189 cut-off events. For 2320/2320 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 505616 event pairs, 5659 based on Foata normal form. 1/35462 useless extension candidates. Maximal degree in co-relation 6412. Up to 12747 conditions per place. [2024-11-10 14:32:55,181 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 39 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2024-11-10 14:32:55,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 243 transitions, 607 flow [2024-11-10 14:32:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions. [2024-11-10 14:32:55,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8288973384030418 [2024-11-10 14:32:55,184 INFO L175 Difference]: Start difference. First operand has 245 places, 236 transitions, 509 flow. Second operand 3 states and 654 transitions. [2024-11-10 14:32:55,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 243 transitions, 607 flow [2024-11-10 14:32:55,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 243 transitions, 595 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:32:55,193 INFO L231 Difference]: Finished difference. Result has 243 places, 237 transitions, 511 flow [2024-11-10 14:32:55,193 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=511, PETRI_PLACES=243, PETRI_TRANSITIONS=237} [2024-11-10 14:32:55,194 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, 0 predicate places. [2024-11-10 14:32:55,195 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 237 transitions, 511 flow [2024-11-10 14:32:55,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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-10 14:32:55,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:55,195 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] [2024-11-10 14:32:55,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:32:55,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:32:55,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:55,196 INFO L85 PathProgramCache]: Analyzing trace with hash 90840806, now seen corresponding path program 1 times [2024-11-10 14:32:55,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:55,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624179359] [2024-11-10 14:32:55,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:55,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:55,233 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-10 14:32:55,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:55,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624179359] [2024-11-10 14:32:55,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624179359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:55,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:55,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:55,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038108981] [2024-11-10 14:32:55,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:55,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:55,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:55,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:55,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 263 [2024-11-10 14:32:55,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 237 transitions, 511 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 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-10 14:32:55,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:55,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 263 [2024-11-10 14:32:55,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand