./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/reorder_5-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/reorder_5-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU --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 898f8e4708144102795278f9f1417651c36b4d3f17c0ba18e240a325ff6101b3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:16:02,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:16:02,678 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 22:16:02,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:16:02,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:16:02,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:16:02,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:16:02,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:16:02,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:16:02,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:16:02,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:16:02,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:16:02,784 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:16:02,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:16:02,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:16:02,789 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:16:02,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:16:02,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:16:02,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:16:02,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:16:02,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:16:02,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:16:02,793 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 22:16:02,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:16:02,794 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:16:02,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:16:02,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:16:02,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:16:02,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:16:02,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:16:02,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:16:02,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:16:02,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:16:02,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:16:02,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:16:02,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:16:02,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:16:02,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:16:02,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:16:02,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:16:02,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:16:02,801 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 898f8e4708144102795278f9f1417651c36b4d3f17c0ba18e240a325ff6101b3 [2024-10-31 22:16:03,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:16:03,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:16:03,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:16:03,192 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:16:03,193 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:16:03,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread/reorder_5-race.i Unable to find full path for "g++" [2024-10-31 22:16:05,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:16:05,656 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:16:05,657 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/sv-benchmarks/c/pthread/reorder_5-race.i [2024-10-31 22:16:05,679 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU/data/a40df8682/ca0ad80366e14d53ab051cc27de48845/FLAG0ab959722 [2024-10-31 22:16:05,701 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU/data/a40df8682/ca0ad80366e14d53ab051cc27de48845 [2024-10-31 22:16:05,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:16:05,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:16:05,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:16:05,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:16:05,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:16:05,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:16:05" (1/1) ... [2024-10-31 22:16:05,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b4af24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:05, skipping insertion in model container [2024-10-31 22:16:05,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:16:05" (1/1) ... [2024-10-31 22:16:05,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:16:06,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:16:06,580 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:16:06,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:16:06,743 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:16:06,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:06 WrapperNode [2024-10-31 22:16:06,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:16:06,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:16:06,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:16:06,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:16:06,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:06" (1/1) ... [2024-10-31 22:16:06,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:06" (1/1) ... [2024-10-31 22:16:06,809 INFO L138 Inliner]: procedures = 369, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 225 [2024-10-31 22:16:06,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:16:06,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:16:06,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:16:06,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:16:06,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:06" (1/1) ... [2024-10-31 22:16:06,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:06" (1/1) ... [2024-10-31 22:16:06,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:06" (1/1) ... [2024-10-31 22:16:06,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:06" (1/1) ... [2024-10-31 22:16:06,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:06" (1/1) ... [2024-10-31 22:16:06,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:06" (1/1) ... [2024-10-31 22:16:06,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:06" (1/1) ... [2024-10-31 22:16:06,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:06" (1/1) ... [2024-10-31 22:16:06,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:16:06,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:16:06,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:16:06,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:16:06,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:06" (1/1) ... [2024-10-31 22:16:06,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:16:06,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:16:06,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:16:06,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcbb10b-6bc0-4fd3-ae3f-127a808dfc98/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:16:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 22:16:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:16:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:16:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2024-10-31 22:16:06,957 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2024-10-31 22:16:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:16:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:16:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2024-10-31 22:16:06,959 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2024-10-31 22:16:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:16:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:16:06,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:16:06,962 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:16:07,166 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:16:07,168 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:16:07,592 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:16:07,593 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:16:07,616 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:16:07,618 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-31 22:16:07,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:16:07 BoogieIcfgContainer [2024-10-31 22:16:07,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:16:07,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:16:07,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:16:07,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:16:07,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:16:05" (1/3) ... [2024-10-31 22:16:07,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252a0b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:16:07, skipping insertion in model container [2024-10-31 22:16:07,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:06" (2/3) ... [2024-10-31 22:16:07,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252a0b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:16:07, skipping insertion in model container [2024-10-31 22:16:07,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:16:07" (3/3) ... [2024-10-31 22:16:07,629 INFO L112 eAbstractionObserver]: Analyzing ICFG reorder_5-race.i [2024-10-31 22:16:07,650 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:16:07,651 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-10-31 22:16:07,651 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:16:07,762 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-31 22:16:07,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 276 transitions, 572 flow [2024-10-31 22:16:08,030 INFO L124 PetriNetUnfolderBase]: 43/574 cut-off events. [2024-10-31 22:16:08,032 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-31 22:16:08,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 574 events. 43/574 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2527 event pairs, 0 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 286. Up to 8 conditions per place. [2024-10-31 22:16:08,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 276 transitions, 572 flow [2024-10-31 22:16:08,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 276 transitions, 572 flow [2024-10-31 22:16:08,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:16:08,074 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;@6570e2ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:16:08,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2024-10-31 22:16:08,080 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:16:08,080 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-10-31 22:16:08,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:16:08,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:08,081 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] [2024-10-31 22:16:08,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-10-31 22:16:08,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:08,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1239072798, now seen corresponding path program 1 times [2024-10-31 22:16:08,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:08,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85031876] [2024-10-31 22:16:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:08,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85031876] [2024-10-31 22:16:08,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85031876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:08,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:08,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:08,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355747716] [2024-10-31 22:16:08,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:08,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:08,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:08,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:08,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:08,547 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 276 [2024-10-31 22:16:08,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 276 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-10-31 22:16:08,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:08,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 276 [2024-10-31 22:16:08,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:08,720 INFO L124 PetriNetUnfolderBase]: 16/537 cut-off events. [2024-10-31 22:16:08,720 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-10-31 22:16:08,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 537 events. 16/537 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2255 event pairs, 0 based on Foata normal form. 23/475 useless extension candidates. Maximal degree in co-relation 283. Up to 27 conditions per place. [2024-10-31 22:16:08,729 INFO L140 encePairwiseOnDemand]: 260/276 looper letters, 14 selfloop transitions, 1 changer transitions 4/260 dead transitions. [2024-10-31 22:16:08,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 260 transitions, 570 flow [2024-10-31 22:16:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2024-10-31 22:16:08,752 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239130434782609 [2024-10-31 22:16:08,755 INFO L175 Difference]: Start difference. First operand has 261 places, 276 transitions, 572 flow. Second operand 3 states and 765 transitions. [2024-10-31 22:16:08,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 260 transitions, 570 flow [2024-10-31 22:16:08,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 260 transitions, 570 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:16:08,770 INFO L231 Difference]: Finished difference. Result has 258 places, 256 transitions, 534 flow [2024-10-31 22:16:08,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=258, PETRI_TRANSITIONS=256} [2024-10-31 22:16:08,778 INFO L277 CegarLoopForPetriNet]: 261 programPoint places, -3 predicate places. [2024-10-31 22:16:08,778 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 256 transitions, 534 flow [2024-10-31 22:16:08,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-10-31 22:16:08,779 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:08,779 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] [2024-10-31 22:16:08,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:16:08,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-10-31 22:16:08,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash 243244496, now seen corresponding path program 1 times [2024-10-31 22:16:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:08,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599476766] [2024-10-31 22:16:08,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:08,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:08,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:08,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599476766] [2024-10-31 22:16:08,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599476766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:08,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:08,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:08,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892286142] [2024-10-31 22:16:08,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:08,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:08,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:08,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:08,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:08,956 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 276 [2024-10-31 22:16:08,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 256 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 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-10-31 22:16:08,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:08,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 276 [2024-10-31 22:16:08,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:09,173 INFO L124 PetriNetUnfolderBase]: 30/1015 cut-off events. [2024-10-31 22:16:09,174 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-10-31 22:16:09,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 1015 events. 30/1015 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5817 event pairs, 0 based on Foata normal form. 0/856 useless extension candidates. Maximal degree in co-relation 507. Up to 14 conditions per place. [2024-10-31 22:16:09,181 INFO L140 encePairwiseOnDemand]: 274/276 looper letters, 13 selfloop transitions, 1 changer transitions 0/261 dead transitions. [2024-10-31 22:16:09,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 261 transitions, 590 flow [2024-10-31 22:16:09,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:09,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2024-10-31 22:16:09,186 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2024-10-31 22:16:09,187 INFO L175 Difference]: Start difference. First operand has 258 places, 256 transitions, 534 flow. Second operand 3 states and 780 transitions. [2024-10-31 22:16:09,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 261 transitions, 590 flow [2024-10-31 22:16:09,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 261 transitions, 589 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:16:09,196 INFO L231 Difference]: Finished difference. Result has 254 places, 255 transitions, 533 flow [2024-10-31 22:16:09,196 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=254, PETRI_TRANSITIONS=255} [2024-10-31 22:16:09,197 INFO L277 CegarLoopForPetriNet]: 261 programPoint places, -7 predicate places. [2024-10-31 22:16:09,197 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 255 transitions, 533 flow [2024-10-31 22:16:09,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 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-10-31 22:16:09,198 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:09,198 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:09,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:16:09,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-10-31 22:16:09,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:09,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1049377832, now seen corresponding path program 1 times [2024-10-31 22:16:09,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:09,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269754870] [2024-10-31 22:16:09,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:09,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:09,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:09,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269754870] [2024-10-31 22:16:09,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269754870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:09,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:09,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:09,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871974912] [2024-10-31 22:16:09,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:09,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:09,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:09,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:09,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:09,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 276 [2024-10-31 22:16:09,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 255 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 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-10-31 22:16:09,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:09,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 276 [2024-10-31 22:16:09,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:09,531 INFO L124 PetriNetUnfolderBase]: 70/1100 cut-off events. [2024-10-31 22:16:09,531 INFO L125 PetriNetUnfolderBase]: For 78/94 co-relation queries the response was YES. [2024-10-31 22:16:09,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 1100 events. 70/1100 cut-off events. For 78/94 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6845 event pairs, 16 based on Foata normal form. 9/964 useless extension candidates. Maximal degree in co-relation 642. Up to 125 conditions per place. [2024-10-31 22:16:09,541 INFO L140 encePairwiseOnDemand]: 264/276 looper letters, 15 selfloop transitions, 5 changer transitions 5/255 dead transitions. [2024-10-31 22:16:09,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 255 transitions, 585 flow [2024-10-31 22:16:09,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:09,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2024-10-31 22:16:09,545 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9045893719806763 [2024-10-31 22:16:09,546 INFO L175 Difference]: Start difference. First operand has 254 places, 255 transitions, 533 flow. Second operand 3 states and 749 transitions. [2024-10-31 22:16:09,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 255 transitions, 585 flow [2024-10-31 22:16:09,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 255 transitions, 584 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:16:09,552 INFO L231 Difference]: Finished difference. Result has 250 places, 248 transitions, 537 flow [2024-10-31 22:16:09,553 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=250, PETRI_TRANSITIONS=248} [2024-10-31 22:16:09,554 INFO L277 CegarLoopForPetriNet]: 261 programPoint places, -11 predicate places. [2024-10-31 22:16:09,554 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 248 transitions, 537 flow [2024-10-31 22:16:09,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 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-10-31 22:16:09,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:09,556 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] [2024-10-31 22:16:09,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:16:09,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-10-31 22:16:09,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1595325554, now seen corresponding path program 1 times [2024-10-31 22:16:09,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:09,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180890287] [2024-10-31 22:16:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:09,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:09,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180890287] [2024-10-31 22:16:09,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180890287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:09,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:09,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:09,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729945087] [2024-10-31 22:16:09,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:09,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:09,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:09,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:09,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:09,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 276 [2024-10-31 22:16:09,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 248 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-10-31 22:16:09,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:09,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 276 [2024-10-31 22:16:09,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:09,835 INFO L124 PetriNetUnfolderBase]: 34/1009 cut-off events. [2024-10-31 22:16:09,836 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-10-31 22:16:09,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 1009 events. 34/1009 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5847 event pairs, 0 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 1011. Up to 64 conditions per place. [2024-10-31 22:16:09,844 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 14 selfloop transitions, 2 changer transitions 0/245 dead transitions. [2024-10-31 22:16:09,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 245 transitions, 563 flow [2024-10-31 22:16:09,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2024-10-31 22:16:09,846 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9118357487922706 [2024-10-31 22:16:09,846 INFO L175 Difference]: Start difference. First operand has 250 places, 248 transitions, 537 flow. Second operand 3 states and 755 transitions. [2024-10-31 22:16:09,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 245 transitions, 563 flow [2024-10-31 22:16:09,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 245 transitions, 563 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:16:09,852 INFO L231 Difference]: Finished difference. Result has 246 places, 245 transitions, 539 flow [2024-10-31 22:16:09,853 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=539, PETRI_PLACES=246, PETRI_TRANSITIONS=245} [2024-10-31 22:16:09,854 INFO L277 CegarLoopForPetriNet]: 261 programPoint places, -15 predicate places. [2024-10-31 22:16:09,854 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 245 transitions, 539 flow [2024-10-31 22:16:09,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-10-31 22:16:09,855 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:09,855 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] [2024-10-31 22:16:09,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:16:09,855 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-10-31 22:16:09,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1769067839, now seen corresponding path program 1 times [2024-10-31 22:16:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:09,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541080006] [2024-10-31 22:16:09,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:09,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:09,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:09,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541080006] [2024-10-31 22:16:09,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541080006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:09,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:09,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:09,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909357641] [2024-10-31 22:16:09,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:09,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:09,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:09,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:09,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:09,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 276 [2024-10-31 22:16:09,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 245 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-10-31 22:16:09,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:09,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 276 [2024-10-31 22:16:09,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:10,144 INFO L124 PetriNetUnfolderBase]: 34/1008 cut-off events. [2024-10-31 22:16:10,145 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-10-31 22:16:10,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 1008 events. 34/1008 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5842 event pairs, 0 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 1008. Up to 52 conditions per place. [2024-10-31 22:16:10,152 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 14 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2024-10-31 22:16:10,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 244 transitions, 569 flow [2024-10-31 22:16:10,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2024-10-31 22:16:10,154 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2024-10-31 22:16:10,154 INFO L175 Difference]: Start difference. First operand has 246 places, 245 transitions, 539 flow. Second operand 3 states and 758 transitions. [2024-10-31 22:16:10,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 244 transitions, 569 flow [2024-10-31 22:16:10,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 244 transitions, 569 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:16:10,161 INFO L231 Difference]: Finished difference. Result has 247 places, 244 transitions, 541 flow [2024-10-31 22:16:10,162 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=541, PETRI_PLACES=247, PETRI_TRANSITIONS=244} [2024-10-31 22:16:10,162 INFO L277 CegarLoopForPetriNet]: 261 programPoint places, -14 predicate places. [2024-10-31 22:16:10,162 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 244 transitions, 541 flow [2024-10-31 22:16:10,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-10-31 22:16:10,163 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:10,165 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:10,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:16:10,165 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-10-31 22:16:10,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash 386408926, now seen corresponding path program 1 times [2024-10-31 22:16:10,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:10,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256546204] [2024-10-31 22:16:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:10,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:10,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:10,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256546204] [2024-10-31 22:16:10,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256546204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:10,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:10,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:10,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68726779] [2024-10-31 22:16:10,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:10,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:10,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:10,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:10,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:10,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 276 [2024-10-31 22:16:10,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 244 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 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-10-31 22:16:10,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:10,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 276 [2024-10-31 22:16:10,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:10,450 INFO L124 PetriNetUnfolderBase]: 34/1007 cut-off events. [2024-10-31 22:16:10,450 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-10-31 22:16:10,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 1007 events. 34/1007 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5850 event pairs, 0 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 980. Up to 34 conditions per place. [2024-10-31 22:16:10,459 INFO L140 encePairwiseOnDemand]: 274/276 looper letters, 13 selfloop transitions, 1 changer transitions 0/249 dead transitions. [2024-10-31 22:16:10,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 249 transitions, 597 flow [2024-10-31 22:16:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2024-10-31 22:16:10,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2024-10-31 22:16:10,462 INFO L175 Difference]: Start difference. First operand has 247 places, 244 transitions, 541 flow. Second operand 3 states and 780 transitions. [2024-10-31 22:16:10,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 249 transitions, 597 flow [2024-10-31 22:16:10,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 249 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:16:10,470 INFO L231 Difference]: Finished difference. Result has 246 places, 243 transitions, 537 flow [2024-10-31 22:16:10,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=246, PETRI_TRANSITIONS=243} [2024-10-31 22:16:10,472 INFO L277 CegarLoopForPetriNet]: 261 programPoint places, -15 predicate places. [2024-10-31 22:16:10,472 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 243 transitions, 537 flow [2024-10-31 22:16:10,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 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-10-31 22:16:10,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:10,473 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-10-31 22:16:10,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:16:10,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-10-31 22:16:10,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:10,474 INFO L85 PathProgramCache]: Analyzing trace with hash -86598312, now seen corresponding path program 1 times [2024-10-31 22:16:10,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:10,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394652271] [2024-10-31 22:16:10,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:10,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:10,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:10,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394652271] [2024-10-31 22:16:10,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394652271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:10,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:10,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:10,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595490068] [2024-10-31 22:16:10,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:10,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:10,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:10,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:10,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:10,614 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 276 [2024-10-31 22:16:10,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 243 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-10-31 22:16:10,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:10,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 276 [2024-10-31 22:16:10,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:10,836 INFO L124 PetriNetUnfolderBase]: 34/1006 cut-off events. [2024-10-31 22:16:10,836 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-31 22:16:10,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 1006 events. 34/1006 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5807 event pairs, 0 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 1011. Up to 56 conditions per place. [2024-10-31 22:16:10,846 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 15 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2024-10-31 22:16:10,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 242 transitions, 569 flow [2024-10-31 22:16:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2024-10-31 22:16:10,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2024-10-31 22:16:10,849 INFO L175 Difference]: Start difference. First operand has 246 places, 243 transitions, 537 flow. Second operand 3 states and 758 transitions. [2024-10-31 22:16:10,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 242 transitions, 569 flow [2024-10-31 22:16:10,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 242 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:16:10,855 INFO L231 Difference]: Finished difference. Result has 246 places, 242 transitions, 538 flow [2024-10-31 22:16:10,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=246, PETRI_TRANSITIONS=242} [2024-10-31 22:16:10,856 INFO L277 CegarLoopForPetriNet]: 261 programPoint places, -15 predicate places. [2024-10-31 22:16:10,856 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 242 transitions, 538 flow [2024-10-31 22:16:10,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-10-31 22:16:10,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:10,858 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] [2024-10-31 22:16:10,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:16:10,858 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-10-31 22:16:10,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:10,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1523046221, now seen corresponding path program 1 times [2024-10-31 22:16:10,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:10,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79120909] [2024-10-31 22:16:10,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:10,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:10,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:10,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79120909] [2024-10-31 22:16:10,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79120909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:10,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:10,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:16:10,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922248243] [2024-10-31 22:16:10,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:10,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:10,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:10,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:10,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:10,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 276 [2024-10-31 22:16:10,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 242 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 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-10-31 22:16:10,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:10,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 276 [2024-10-31 22:16:10,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:11,132 INFO L124 PetriNetUnfolderBase]: 32/994 cut-off events. [2024-10-31 22:16:11,132 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-10-31 22:16:11,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 994 events. 32/994 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5694 event pairs, 0 based on Foata normal form. 2/883 useless extension candidates. Maximal degree in co-relation 983. Up to 42 conditions per place. [2024-10-31 22:16:11,153 INFO L140 encePairwiseOnDemand]: 274/276 looper letters, 13 selfloop transitions, 0 changer transitions 1/241 dead transitions. [2024-10-31 22:16:11,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 241 transitions, 561 flow [2024-10-31 22:16:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2024-10-31 22:16:11,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2024-10-31 22:16:11,160 INFO L175 Difference]: Start difference. First operand has 246 places, 242 transitions, 538 flow. Second operand 3 states and 759 transitions. [2024-10-31 22:16:11,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 241 transitions, 561 flow [2024-10-31 22:16:11,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 241 transitions, 553 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-10-31 22:16:11,167 INFO L231 Difference]: Finished difference. Result has 245 places, 240 transitions, 525 flow [2024-10-31 22:16:11,167 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=245, PETRI_TRANSITIONS=240} [2024-10-31 22:16:11,170 INFO L277 CegarLoopForPetriNet]: 261 programPoint places, -16 predicate places. [2024-10-31 22:16:11,170 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 240 transitions, 525 flow [2024-10-31 22:16:11,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 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-10-31 22:16:11,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:11,172 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] [2024-10-31 22:16:11,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:16:11,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-10-31 22:16:11,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:11,173 INFO L85 PathProgramCache]: Analyzing trace with hash 620651015, now seen corresponding path program 1 times [2024-10-31 22:16:11,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:11,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302960708] [2024-10-31 22:16:11,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:11,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:11,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:11,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302960708] [2024-10-31 22:16:11,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302960708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:11,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:11,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:16:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144251774] [2024-10-31 22:16:11,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:11,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:16:11,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:11,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:16:11,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:16:12,105 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 276 [2024-10-31 22:16:12,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 240 transitions, 525 flow. Second operand has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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-10-31 22:16:12,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:12,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 276 [2024-10-31 22:16:12,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:12,307 INFO L124 PetriNetUnfolderBase]: 32/988 cut-off events. [2024-10-31 22:16:12,307 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-10-31 22:16:12,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 988 events. 32/988 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5672 event pairs, 0 based on Foata normal form. 0/889 useless extension candidates. Maximal degree in co-relation 1294. Up to 193 conditions per place. [2024-10-31 22:16:12,316 INFO L140 encePairwiseOnDemand]: 269/276 looper letters, 34 selfloop transitions, 6 changer transitions 0/239 dead transitions. [2024-10-31 22:16:12,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 239 transitions, 603 flow [2024-10-31 22:16:12,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:16:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:16:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1379 transitions. [2024-10-31 22:16:12,319 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8327294685990339 [2024-10-31 22:16:12,319 INFO L175 Difference]: Start difference. First operand has 245 places, 240 transitions, 525 flow. Second operand 6 states and 1379 transitions. [2024-10-31 22:16:12,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 239 transitions, 603 flow [2024-10-31 22:16:12,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 239 transitions, 601 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-31 22:16:12,325 INFO L231 Difference]: Finished difference. Result has 247 places, 239 transitions, 533 flow [2024-10-31 22:16:12,326 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=533, PETRI_PLACES=247, PETRI_TRANSITIONS=239} [2024-10-31 22:16:12,326 INFO L277 CegarLoopForPetriNet]: 261 programPoint places, -14 predicate places. [2024-10-31 22:16:12,326 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 239 transitions, 533 flow [2024-10-31 22:16:12,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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-10-31 22:16:12,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:12,328 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:12,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:16:12,328 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-10-31 22:16:12,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:12,329 INFO L85 PathProgramCache]: Analyzing trace with hash 33772072, now seen corresponding path program 1 times [2024-10-31 22:16:12,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:12,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138936578] [2024-10-31 22:16:12,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:12,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:12,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:12,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138936578] [2024-10-31 22:16:12,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138936578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:12,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:12,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:16:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805658431] [2024-10-31 22:16:12,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:12,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:16:12,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:12,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:16:12,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:16:12,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 276 [2024-10-31 22:16:12,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 239 transitions, 533 flow. Second operand has 4 states, 4 states have (on average 244.5) internal successors, (978), 4 states have internal predecessors, (978), 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-10-31 22:16:12,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:12,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 276 [2024-10-31 22:16:12,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:12,746 INFO L124 PetriNetUnfolderBase]: 24/884 cut-off events. [2024-10-31 22:16:12,746 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-10-31 22:16:12,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 884 events. 24/884 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4599 event pairs, 0 based on Foata normal form. 3/805 useless extension candidates. Maximal degree in co-relation 1058. Up to 43 conditions per place. [2024-10-31 22:16:12,754 INFO L140 encePairwiseOnDemand]: 263/276 looper letters, 31 selfloop transitions, 11 changer transitions 1/261 dead transitions. [2024-10-31 22:16:12,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 261 transitions, 687 flow [2024-10-31 22:16:12,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:16:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:16:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1017 transitions. [2024-10-31 22:16:12,757 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9211956521739131 [2024-10-31 22:16:12,757 INFO L175 Difference]: Start difference. First operand has 247 places, 239 transitions, 533 flow. Second operand 4 states and 1017 transitions. [2024-10-31 22:16:12,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 261 transitions, 687 flow [2024-10-31 22:16:12,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 261 transitions, 675 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-31 22:16:12,763 INFO L231 Difference]: Finished difference. Result has 247 places, 248 transitions, 603 flow [2024-10-31 22:16:12,764 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=603, PETRI_PLACES=247, PETRI_TRANSITIONS=248} [2024-10-31 22:16:12,765 INFO L277 CegarLoopForPetriNet]: 261 programPoint places, -14 predicate places. [2024-10-31 22:16:12,765 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 248 transitions, 603 flow [2024-10-31 22:16:12,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 244.5) internal successors, (978), 4 states have internal predecessors, (978), 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-10-31 22:16:12,766 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:12,766 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] [2024-10-31 22:16:12,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:16:12,767 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting setThreadErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-10-31 22:16:12,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1857312720, now seen corresponding path program 1 times [2024-10-31 22:16:12,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:12,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142998273] [2024-10-31 22:16:12,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:12,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142998273] [2024-10-31 22:16:12,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142998273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:12,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:12,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823704836] [2024-10-31 22:16:12,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:12,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:12,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:12,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:12,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 276 [2024-10-31 22:16:12,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 248 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-10-31 22:16:12,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:12,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 276 [2024-10-31 22:16:12,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:13,131 INFO L124 PetriNetUnfolderBase]: 103/1636 cut-off events. [2024-10-31 22:16:13,131 INFO L125 PetriNetUnfolderBase]: For 239/608 co-relation queries the response was YES. [2024-10-31 22:16:13,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2082 conditions, 1636 events. 103/1636 cut-off events. For 239/608 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 11639 event pairs, 28 based on Foata normal form. 8/1444 useless extension candidates. Maximal degree in co-relation 2073. Up to 118 conditions per place. [2024-10-31 22:16:13,155 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 15 selfloop transitions, 5 changer transitions 0/255 dead transitions. [2024-10-31 22:16:13,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 255 transitions, 666 flow [2024-10-31 22:16:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 774 transitions. [2024-10-31 22:16:13,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9347826086956522 [2024-10-31 22:16:13,157 INFO L175 Difference]: Start difference. First operand has 247 places, 248 transitions, 603 flow. Second operand 3 states and 774 transitions. [2024-10-31 22:16:13,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 255 transitions, 666 flow [2024-10-31 22:16:13,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 255 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:16:13,164 INFO L231 Difference]: Finished difference. Result has 250 places, 252 transitions, 639 flow [2024-10-31 22:16:13,164 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=250, PETRI_TRANSITIONS=252} [2024-10-31 22:16:13,165 INFO L277 CegarLoopForPetriNet]: 261 programPoint places, -11 predicate places. [2024-10-31 22:16:13,165 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 252 transitions, 639 flow [2024-10-31 22:16:13,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-10-31 22:16:13,166 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:13,166 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:13,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:16:13,166 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting setThreadErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-10-31 22:16:13,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:13,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1608555765, now seen corresponding path program 1 times [2024-10-31 22:16:13,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:13,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032112493] [2024-10-31 22:16:13,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:13,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:13,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:13,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032112493] [2024-10-31 22:16:13,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032112493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:13,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:13,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:13,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083595151] [2024-10-31 22:16:13,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:13,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:13,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:13,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:13,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:13,253 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 276 [2024-10-31 22:16:13,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 252 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-10-31 22:16:13,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:13,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 276 [2024-10-31 22:16:13,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:13,670 INFO L124 PetriNetUnfolderBase]: 183/2376 cut-off events. [2024-10-31 22:16:13,670 INFO L125 PetriNetUnfolderBase]: For 282/578 co-relation queries the response was YES. [2024-10-31 22:16:13,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3074 conditions, 2376 events. 183/2376 cut-off events. For 282/578 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 19326 event pairs, 30 based on Foata normal form. 8/2070 useless extension candidates. Maximal degree in co-relation 3064. Up to 149 conditions per place. [2024-10-31 22:16:13,704 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 15 selfloop transitions, 5 changer transitions 8/259 dead transitions. [2024-10-31 22:16:13,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 259 transitions, 702 flow [2024-10-31 22:16:13,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 774 transitions. [2024-10-31 22:16:13,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9347826086956522 [2024-10-31 22:16:13,706 INFO L175 Difference]: Start difference. First operand has 250 places, 252 transitions, 639 flow. Second operand 3 states and 774 transitions. [2024-10-31 22:16:13,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 259 transitions, 702 flow [2024-10-31 22:16:13,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 259 transitions, 692 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:16:13,713 INFO L231 Difference]: Finished difference. Result has 252 places, 248 transitions, 648 flow [2024-10-31 22:16:13,713 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=252, PETRI_TRANSITIONS=248} [2024-10-31 22:16:13,714 INFO L277 CegarLoopForPetriNet]: 261 programPoint places, -9 predicate places. [2024-10-31 22:16:13,714 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 248 transitions, 648 flow [2024-10-31 22:16:13,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-10-31 22:16:13,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:13,715 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:13,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:16:13,716 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-10-31 22:16:13,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2136676987, now seen corresponding path program 1 times [2024-10-31 22:16:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:13,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446991512] [2024-10-31 22:16:13,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:13,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:16:13,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:16:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:16:13,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:16:13,810 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:16:13,811 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 37 remaining) [2024-10-31 22:16:13,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2024-10-31 22:16:13,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2024-10-31 22:16:13,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2024-10-31 22:16:13,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2024-10-31 22:16:13,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2024-10-31 22:16:13,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2024-10-31 22:16:13,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr4ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2024-10-31 22:16:13,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2024-10-31 22:16:13,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2024-10-31 22:16:13,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2024-10-31 22:16:13,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2024-10-31 22:16:13,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2024-10-31 22:16:13,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2024-10-31 22:16:13,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2024-10-31 22:16:13,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2024-10-31 22:16:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2024-10-31 22:16:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2024-10-31 22:16:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2024-10-31 22:16:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2024-10-31 22:16:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (16 of 37 remaining) [2024-10-31 22:16:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2024-10-31 22:16:13,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2024-10-31 22:16:13,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2024-10-31 22:16:13,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2024-10-31 22:16:13,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2024-10-31 22:16:13,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2024-10-31 22:16:13,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2024-10-31 22:16:13,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2024-10-31 22:16:13,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 37 remaining) [2024-10-31 22:16:13,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2024-10-31 22:16:13,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2024-10-31 22:16:13,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2024-10-31 22:16:13,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2024-10-31 22:16:13,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2024-10-31 22:16:13,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2024-10-31 22:16:13,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr4ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2024-10-31 22:16:13,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:16:13,829 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:13,831 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 22:16:13,831 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-31 22:16:13,890 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-10-31 22:16:13,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 339 transitions, 722 flow [2024-10-31 22:16:14,211 INFO L124 PetriNetUnfolderBase]: 167/1779 cut-off events. [2024-10-31 22:16:14,211 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-10-31 22:16:14,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 1779 events. 167/1779 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11030 event pairs, 1 based on Foata normal form. 0/1456 useless extension candidates. Maximal degree in co-relation 1037. Up to 32 conditions per place. [2024-10-31 22:16:14,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 320 places, 339 transitions, 722 flow [2024-10-31 22:16:14,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 320 places, 339 transitions, 722 flow [2024-10-31 22:16:14,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:16:14,252 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;@6570e2ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:16:14,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-10-31 22:16:14,259 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:16:14,259 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-10-31 22:16:14,259 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:16:14,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:14,260 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] [2024-10-31 22:16:14,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-31 22:16:14,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:14,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1994095906, now seen corresponding path program 1 times [2024-10-31 22:16:14,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:14,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498993395] [2024-10-31 22:16:14,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:14,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:14,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:14,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498993395] [2024-10-31 22:16:14,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498993395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:14,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:14,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:14,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963343789] [2024-10-31 22:16:14,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:14,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:14,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:14,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:14,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:14,313 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 339 [2024-10-31 22:16:14,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 339 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 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-10-31 22:16:14,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:14,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 339 [2024-10-31 22:16:14,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:14,728 INFO L124 PetriNetUnfolderBase]: 77/1662 cut-off events. [2024-10-31 22:16:14,728 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2024-10-31 22:16:14,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 1662 events. 77/1662 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 10417 event pairs, 1 based on Foata normal form. 122/1526 useless extension candidates. Maximal degree in co-relation 1016. Up to 114 conditions per place. [2024-10-31 22:16:14,760 INFO L140 encePairwiseOnDemand]: 322/339 looper letters, 20 selfloop transitions, 1 changer transitions 4/321 dead transitions. [2024-10-31 22:16:14,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 321 transitions, 728 flow [2024-10-31 22:16:14,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:14,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2024-10-31 22:16:14,763 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9213372664700098 [2024-10-31 22:16:14,763 INFO L175 Difference]: Start difference. First operand has 320 places, 339 transitions, 722 flow. Second operand 3 states and 937 transitions. [2024-10-31 22:16:14,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 321 transitions, 728 flow [2024-10-31 22:16:14,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 321 transitions, 728 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:16:14,769 INFO L231 Difference]: Finished difference. Result has 316 places, 317 transitions, 680 flow [2024-10-31 22:16:14,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=316, PETRI_TRANSITIONS=317} [2024-10-31 22:16:14,771 INFO L277 CegarLoopForPetriNet]: 320 programPoint places, -4 predicate places. [2024-10-31 22:16:14,771 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 317 transitions, 680 flow [2024-10-31 22:16:14,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 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-10-31 22:16:14,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:14,772 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] [2024-10-31 22:16:14,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:16:14,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-31 22:16:14,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:14,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1687226849, now seen corresponding path program 1 times [2024-10-31 22:16:14,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:14,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537425143] [2024-10-31 22:16:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:14,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:14,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:14,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537425143] [2024-10-31 22:16:14,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537425143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:14,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:14,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:14,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312601570] [2024-10-31 22:16:14,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:14,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:14,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:14,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:14,826 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 339 [2024-10-31 22:16:14,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 317 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 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-10-31 22:16:14,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:14,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 339 [2024-10-31 22:16:14,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:15,572 INFO L124 PetriNetUnfolderBase]: 152/3265 cut-off events. [2024-10-31 22:16:15,573 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2024-10-31 22:16:15,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3588 conditions, 3265 events. 152/3265 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 26068 event pairs, 2 based on Foata normal form. 0/2760 useless extension candidates. Maximal degree in co-relation 1923. Up to 74 conditions per place. [2024-10-31 22:16:15,622 INFO L140 encePairwiseOnDemand]: 337/339 looper letters, 25 selfloop transitions, 1 changer transitions 0/328 dead transitions. [2024-10-31 22:16:15,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 328 transitions, 794 flow [2024-10-31 22:16:15,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2024-10-31 22:16:15,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9410029498525073 [2024-10-31 22:16:15,625 INFO L175 Difference]: Start difference. First operand has 316 places, 317 transitions, 680 flow. Second operand 3 states and 957 transitions. [2024-10-31 22:16:15,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 328 transitions, 794 flow [2024-10-31 22:16:15,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 328 transitions, 793 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:16:15,632 INFO L231 Difference]: Finished difference. Result has 312 places, 316 transitions, 679 flow [2024-10-31 22:16:15,633 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=312, PETRI_TRANSITIONS=316} [2024-10-31 22:16:15,633 INFO L277 CegarLoopForPetriNet]: 320 programPoint places, -8 predicate places. [2024-10-31 22:16:15,633 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 316 transitions, 679 flow [2024-10-31 22:16:15,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 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-10-31 22:16:15,634 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:15,634 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:15,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:16:15,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-31 22:16:15,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:15,636 INFO L85 PathProgramCache]: Analyzing trace with hash 764402488, now seen corresponding path program 1 times [2024-10-31 22:16:15,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:15,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745558460] [2024-10-31 22:16:15,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:15,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:15,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:15,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745558460] [2024-10-31 22:16:15,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745558460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:15,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:15,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:15,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037693687] [2024-10-31 22:16:15,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:15,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:15,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:15,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:15,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:15,685 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 339 [2024-10-31 22:16:15,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 316 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 292.6666666666667) internal successors, (878), 3 states have internal predecessors, (878), 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-10-31 22:16:15,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:15,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 339 [2024-10-31 22:16:15,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:16,979 INFO L124 PetriNetUnfolderBase]: 1076/5164 cut-off events. [2024-10-31 22:16:16,979 INFO L125 PetriNetUnfolderBase]: For 1356/1484 co-relation queries the response was YES. [2024-10-31 22:16:17,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7515 conditions, 5164 events. 1076/5164 cut-off events. For 1356/1484 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 48198 event pairs, 402 based on Foata normal form. 33/4650 useless extension candidates. Maximal degree in co-relation 3753. Up to 1737 conditions per place. [2024-10-31 22:16:17,077 INFO L140 encePairwiseOnDemand]: 325/339 looper letters, 32 selfloop transitions, 6 changer transitions 3/323 dead transitions. [2024-10-31 22:16:17,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 323 transitions, 800 flow [2024-10-31 22:16:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 922 transitions. [2024-10-31 22:16:17,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9065880039331367 [2024-10-31 22:16:17,081 INFO L175 Difference]: Start difference. First operand has 312 places, 316 transitions, 679 flow. Second operand 3 states and 922 transitions. [2024-10-31 22:16:17,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 323 transitions, 800 flow [2024-10-31 22:16:17,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 323 transitions, 799 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:16:17,092 INFO L231 Difference]: Finished difference. Result has 307 places, 311 transitions, 696 flow [2024-10-31 22:16:17,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=307, PETRI_TRANSITIONS=311} [2024-10-31 22:16:17,093 INFO L277 CegarLoopForPetriNet]: 320 programPoint places, -13 predicate places. [2024-10-31 22:16:17,093 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 311 transitions, 696 flow [2024-10-31 22:16:17,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.6666666666667) internal successors, (878), 3 states have internal predecessors, (878), 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-10-31 22:16:17,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:17,094 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] [2024-10-31 22:16:17,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:16:17,095 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-31 22:16:17,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:17,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1985817870, now seen corresponding path program 1 times [2024-10-31 22:16:17,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:17,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583883612] [2024-10-31 22:16:17,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:17,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:17,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:17,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583883612] [2024-10-31 22:16:17,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583883612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:17,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:17,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:17,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946621550] [2024-10-31 22:16:17,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:17,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:17,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:17,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:17,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:17,164 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 339 [2024-10-31 22:16:17,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 311 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 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-10-31 22:16:17,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:17,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 339 [2024-10-31 22:16:17,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:17,892 INFO L124 PetriNetUnfolderBase]: 268/3541 cut-off events. [2024-10-31 22:16:17,892 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2024-10-31 22:16:17,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4364 conditions, 3541 events. 268/3541 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 29841 event pairs, 20 based on Foata normal form. 0/3149 useless extension candidates. Maximal degree in co-relation 3293. Up to 302 conditions per place. [2024-10-31 22:16:17,968 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 20 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2024-10-31 22:16:17,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 308 transitions, 734 flow [2024-10-31 22:16:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2024-10-31 22:16:17,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9105211406096362 [2024-10-31 22:16:17,971 INFO L175 Difference]: Start difference. First operand has 307 places, 311 transitions, 696 flow. Second operand 3 states and 926 transitions. [2024-10-31 22:16:17,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 308 transitions, 734 flow [2024-10-31 22:16:17,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 308 transitions, 734 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:16:17,977 INFO L231 Difference]: Finished difference. Result has 303 places, 308 transitions, 698 flow [2024-10-31 22:16:17,978 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=303, PETRI_TRANSITIONS=308} [2024-10-31 22:16:17,979 INFO L277 CegarLoopForPetriNet]: 320 programPoint places, -17 predicate places. [2024-10-31 22:16:17,979 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 308 transitions, 698 flow [2024-10-31 22:16:17,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 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-10-31 22:16:17,980 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:17,980 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] [2024-10-31 22:16:17,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:16:17,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-31 22:16:17,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash -559030687, now seen corresponding path program 1 times [2024-10-31 22:16:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428869856] [2024-10-31 22:16:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:18,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428869856] [2024-10-31 22:16:18,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428869856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:18,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:18,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:18,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782563697] [2024-10-31 22:16:18,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:18,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:18,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:18,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:18,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:18,094 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 339 [2024-10-31 22:16:18,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 308 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-10-31 22:16:18,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:18,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 339 [2024-10-31 22:16:18,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:18,775 INFO L124 PetriNetUnfolderBase]: 268/3540 cut-off events. [2024-10-31 22:16:18,776 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2024-10-31 22:16:18,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 3540 events. 268/3540 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 29864 event pairs, 20 based on Foata normal form. 0/3149 useless extension candidates. Maximal degree in co-relation 3272. Up to 302 conditions per place. [2024-10-31 22:16:18,811 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 20 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2024-10-31 22:16:18,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 307 transitions, 740 flow [2024-10-31 22:16:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2024-10-31 22:16:18,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134709931170109 [2024-10-31 22:16:18,814 INFO L175 Difference]: Start difference. First operand has 303 places, 308 transitions, 698 flow. Second operand 3 states and 929 transitions. [2024-10-31 22:16:18,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 307 transitions, 740 flow [2024-10-31 22:16:18,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 307 transitions, 740 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:16:18,820 INFO L231 Difference]: Finished difference. Result has 304 places, 307 transitions, 700 flow [2024-10-31 22:16:18,822 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=304, PETRI_TRANSITIONS=307} [2024-10-31 22:16:18,822 INFO L277 CegarLoopForPetriNet]: 320 programPoint places, -16 predicate places. [2024-10-31 22:16:18,823 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 700 flow [2024-10-31 22:16:18,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-10-31 22:16:18,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:18,824 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:18,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:16:18,824 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-31 22:16:18,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash -378076194, now seen corresponding path program 1 times [2024-10-31 22:16:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:18,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315051206] [2024-10-31 22:16:18,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:18,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:18,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315051206] [2024-10-31 22:16:18,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315051206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:18,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:18,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:18,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830394060] [2024-10-31 22:16:18,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:18,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:18,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:18,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:18,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:18,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 339 [2024-10-31 22:16:18,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 700 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 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-10-31 22:16:18,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:18,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 339 [2024-10-31 22:16:18,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:19,619 INFO L124 PetriNetUnfolderBase]: 268/3539 cut-off events. [2024-10-31 22:16:19,619 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2024-10-31 22:16:19,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4267 conditions, 3539 events. 268/3539 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 29865 event pairs, 20 based on Foata normal form. 0/3149 useless extension candidates. Maximal degree in co-relation 3194. Up to 302 conditions per place. [2024-10-31 22:16:19,666 INFO L140 encePairwiseOnDemand]: 337/339 looper letters, 25 selfloop transitions, 1 changer transitions 0/318 dead transitions. [2024-10-31 22:16:19,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 318 transitions, 814 flow [2024-10-31 22:16:19,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2024-10-31 22:16:19,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9410029498525073 [2024-10-31 22:16:19,670 INFO L175 Difference]: Start difference. First operand has 304 places, 307 transitions, 700 flow. Second operand 3 states and 957 transitions. [2024-10-31 22:16:19,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 318 transitions, 814 flow [2024-10-31 22:16:19,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 318 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:16:19,678 INFO L231 Difference]: Finished difference. Result has 303 places, 306 transitions, 696 flow [2024-10-31 22:16:19,679 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=303, PETRI_TRANSITIONS=306} [2024-10-31 22:16:19,679 INFO L277 CegarLoopForPetriNet]: 320 programPoint places, -17 predicate places. [2024-10-31 22:16:19,679 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 306 transitions, 696 flow [2024-10-31 22:16:19,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 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-10-31 22:16:19,680 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:19,680 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-10-31 22:16:19,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 22:16:19,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-31 22:16:19,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash 932198505, now seen corresponding path program 1 times [2024-10-31 22:16:19,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:19,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628583345] [2024-10-31 22:16:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:19,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:19,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:19,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628583345] [2024-10-31 22:16:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628583345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:19,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:19,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:19,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664169937] [2024-10-31 22:16:19,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:19,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:19,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:19,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:19,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:19,754 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 339 [2024-10-31 22:16:19,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 306 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-10-31 22:16:19,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:19,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 339 [2024-10-31 22:16:19,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:20,655 INFO L124 PetriNetUnfolderBase]: 268/3538 cut-off events. [2024-10-31 22:16:20,656 INFO L125 PetriNetUnfolderBase]: For 430/430 co-relation queries the response was YES. [2024-10-31 22:16:20,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4356 conditions, 3538 events. 268/3538 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 29856 event pairs, 20 based on Foata normal form. 0/3149 useless extension candidates. Maximal degree in co-relation 3283. Up to 302 conditions per place. [2024-10-31 22:16:20,747 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 21 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2024-10-31 22:16:20,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 305 transitions, 740 flow [2024-10-31 22:16:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:20,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2024-10-31 22:16:20,751 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134709931170109 [2024-10-31 22:16:20,751 INFO L175 Difference]: Start difference. First operand has 303 places, 306 transitions, 696 flow. Second operand 3 states and 929 transitions. [2024-10-31 22:16:20,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 305 transitions, 740 flow [2024-10-31 22:16:20,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 305 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:16:20,760 INFO L231 Difference]: Finished difference. Result has 303 places, 305 transitions, 697 flow [2024-10-31 22:16:20,761 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=303, PETRI_TRANSITIONS=305} [2024-10-31 22:16:20,762 INFO L277 CegarLoopForPetriNet]: 320 programPoint places, -17 predicate places. [2024-10-31 22:16:20,762 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 305 transitions, 697 flow [2024-10-31 22:16:20,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-10-31 22:16:20,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:20,763 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:20,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 22:16:20,764 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-31 22:16:20,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash -292038300, now seen corresponding path program 1 times [2024-10-31 22:16:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485944118] [2024-10-31 22:16:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:20,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485944118] [2024-10-31 22:16:20,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485944118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:20,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:16:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408214554] [2024-10-31 22:16:20,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:20,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:20,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:20,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:20,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:20,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 339 [2024-10-31 22:16:20,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 305 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 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-10-31 22:16:20,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:20,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 339 [2024-10-31 22:16:20,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:21,425 INFO L124 PetriNetUnfolderBase]: 266/3526 cut-off events. [2024-10-31 22:16:21,426 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2024-10-31 22:16:21,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 3526 events. 266/3526 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 29739 event pairs, 20 based on Foata normal form. 2/3139 useless extension candidates. Maximal degree in co-relation 3221. Up to 302 conditions per place. [2024-10-31 22:16:21,465 INFO L140 encePairwiseOnDemand]: 337/339 looper letters, 19 selfloop transitions, 0 changer transitions 1/304 dead transitions. [2024-10-31 22:16:21,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 304 transitions, 732 flow [2024-10-31 22:16:21,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2024-10-31 22:16:21,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9144542772861357 [2024-10-31 22:16:21,471 INFO L175 Difference]: Start difference. First operand has 303 places, 305 transitions, 697 flow. Second operand 3 states and 930 transitions. [2024-10-31 22:16:21,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 304 transitions, 732 flow [2024-10-31 22:16:21,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 304 transitions, 724 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-10-31 22:16:21,479 INFO L231 Difference]: Finished difference. Result has 302 places, 303 transitions, 684 flow [2024-10-31 22:16:21,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=302, PETRI_TRANSITIONS=303} [2024-10-31 22:16:21,480 INFO L277 CegarLoopForPetriNet]: 320 programPoint places, -18 predicate places. [2024-10-31 22:16:21,480 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 303 transitions, 684 flow [2024-10-31 22:16:21,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 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-10-31 22:16:21,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:21,485 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] [2024-10-31 22:16:21,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 22:16:21,485 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-31 22:16:21,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:21,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1147780377, now seen corresponding path program 1 times [2024-10-31 22:16:21,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:21,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134495807] [2024-10-31 22:16:21,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:21,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:21,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:21,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134495807] [2024-10-31 22:16:21,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134495807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:21,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:21,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:16:21,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824358961] [2024-10-31 22:16:21,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:21,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:16:21,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:21,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:16:21,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:16:22,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2024-10-31 22:16:22,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 303 transitions, 684 flow. Second operand has 6 states, 6 states have (on average 279.6666666666667) internal successors, (1678), 6 states have internal predecessors, (1678), 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-10-31 22:16:22,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:22,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2024-10-31 22:16:22,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:22,830 INFO L124 PetriNetUnfolderBase]: 266/3518 cut-off events. [2024-10-31 22:16:22,831 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2024-10-31 22:16:22,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4843 conditions, 3518 events. 266/3518 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 29717 event pairs, 20 based on Foata normal form. 0/3169 useless extension candidates. Maximal degree in co-relation 4834. Up to 717 conditions per place. [2024-10-31 22:16:22,859 INFO L140 encePairwiseOnDemand]: 332/339 looper letters, 40 selfloop transitions, 6 changer transitions 0/302 dead transitions. [2024-10-31 22:16:22,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 302 transitions, 774 flow [2024-10-31 22:16:22,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:16:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:16:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1715 transitions. [2024-10-31 22:16:22,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8431661750245821 [2024-10-31 22:16:22,864 INFO L175 Difference]: Start difference. First operand has 302 places, 303 transitions, 684 flow. Second operand 6 states and 1715 transitions. [2024-10-31 22:16:22,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 302 transitions, 774 flow [2024-10-31 22:16:22,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 302 transitions, 772 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-31 22:16:22,870 INFO L231 Difference]: Finished difference. Result has 304 places, 302 transitions, 692 flow [2024-10-31 22:16:22,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=692, PETRI_PLACES=304, PETRI_TRANSITIONS=302} [2024-10-31 22:16:22,871 INFO L277 CegarLoopForPetriNet]: 320 programPoint places, -16 predicate places. [2024-10-31 22:16:22,871 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 302 transitions, 692 flow [2024-10-31 22:16:22,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 279.6666666666667) internal successors, (1678), 6 states have internal predecessors, (1678), 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-10-31 22:16:22,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:22,872 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:22,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-31 22:16:22,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-31 22:16:22,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:22,873 INFO L85 PathProgramCache]: Analyzing trace with hash -694284472, now seen corresponding path program 1 times [2024-10-31 22:16:22,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:22,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952068784] [2024-10-31 22:16:22,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:22,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:22,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:22,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952068784] [2024-10-31 22:16:22,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952068784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:22,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:22,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:16:22,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547173185] [2024-10-31 22:16:22,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:22,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:16:22,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:22,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:16:22,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:16:23,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 339 [2024-10-31 22:16:23,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 302 transitions, 692 flow. Second operand has 4 states, 4 states have (on average 299.5) internal successors, (1198), 4 states have internal predecessors, (1198), 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-10-31 22:16:23,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:23,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 339 [2024-10-31 22:16:23,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:23,740 INFO L124 PetriNetUnfolderBase]: 269/3695 cut-off events. [2024-10-31 22:16:23,741 INFO L125 PetriNetUnfolderBase]: For 488/488 co-relation queries the response was YES. [2024-10-31 22:16:23,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4704 conditions, 3695 events. 269/3695 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 31654 event pairs, 17 based on Foata normal form. 7/3351 useless extension candidates. Maximal degree in co-relation 4695. Up to 298 conditions per place. [2024-10-31 22:16:23,782 INFO L140 encePairwiseOnDemand]: 326/339 looper letters, 53 selfloop transitions, 11 changer transitions 0/339 dead transitions. [2024-10-31 22:16:23,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 339 transitions, 958 flow [2024-10-31 22:16:23,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:16:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:16:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1258 transitions. [2024-10-31 22:16:23,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9277286135693216 [2024-10-31 22:16:23,785 INFO L175 Difference]: Start difference. First operand has 304 places, 302 transitions, 692 flow. Second operand 4 states and 1258 transitions. [2024-10-31 22:16:23,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 339 transitions, 958 flow [2024-10-31 22:16:23,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 339 transitions, 946 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-31 22:16:23,791 INFO L231 Difference]: Finished difference. Result has 304 places, 311 transitions, 762 flow [2024-10-31 22:16:23,792 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=762, PETRI_PLACES=304, PETRI_TRANSITIONS=311} [2024-10-31 22:16:23,792 INFO L277 CegarLoopForPetriNet]: 320 programPoint places, -16 predicate places. [2024-10-31 22:16:23,793 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 311 transitions, 762 flow [2024-10-31 22:16:23,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 299.5) internal successors, (1198), 4 states have internal predecessors, (1198), 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-10-31 22:16:23,794 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:23,794 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] [2024-10-31 22:16:23,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-31 22:16:23,794 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting setThreadErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-31 22:16:23,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash -388451721, now seen corresponding path program 1 times [2024-10-31 22:16:23,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:23,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866167629] [2024-10-31 22:16:23,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:23,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866167629] [2024-10-31 22:16:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866167629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:23,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:23,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:23,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261153549] [2024-10-31 22:16:23,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:23,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:23,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:23,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:23,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 339 [2024-10-31 22:16:23,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 311 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 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-10-31 22:16:23,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:23,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 339 [2024-10-31 22:16:23,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:30,461 INFO L124 PetriNetUnfolderBase]: 5005/31527 cut-off events. [2024-10-31 22:16:30,461 INFO L125 PetriNetUnfolderBase]: For 8527/29179 co-relation queries the response was YES. [2024-10-31 22:16:30,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43118 conditions, 31527 events. 5005/31527 cut-off events. For 8527/29179 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 445961 event pairs, 1823 based on Foata normal form. 27/26423 useless extension candidates. Maximal degree in co-relation 43107. Up to 4278 conditions per place. [2024-10-31 22:16:31,031 INFO L140 encePairwiseOnDemand]: 330/339 looper letters, 30 selfloop transitions, 8 changer transitions 0/327 dead transitions. [2024-10-31 22:16:31,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 327 transitions, 901 flow [2024-10-31 22:16:31,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 948 transitions. [2024-10-31 22:16:31,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9321533923303835 [2024-10-31 22:16:31,034 INFO L175 Difference]: Start difference. First operand has 304 places, 311 transitions, 762 flow. Second operand 3 states and 948 transitions. [2024-10-31 22:16:31,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 327 transitions, 901 flow [2024-10-31 22:16:31,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 327 transitions, 899 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:16:31,049 INFO L231 Difference]: Finished difference. Result has 307 places, 318 transitions, 822 flow [2024-10-31 22:16:31,050 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=307, PETRI_TRANSITIONS=318} [2024-10-31 22:16:31,050 INFO L277 CegarLoopForPetriNet]: 320 programPoint places, -13 predicate places. [2024-10-31 22:16:31,051 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 318 transitions, 822 flow [2024-10-31 22:16:31,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 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-10-31 22:16:31,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:31,051 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:31,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-31 22:16:31,052 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting setThreadErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2024-10-31 22:16:31,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1597516331, now seen corresponding path program 1 times [2024-10-31 22:16:31,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:31,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304858249] [2024-10-31 22:16:31,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:31,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:31,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304858249] [2024-10-31 22:16:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304858249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:31,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:31,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:31,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141723380] [2024-10-31 22:16:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:31,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:31,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:31,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:31,124 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 339 [2024-10-31 22:16:31,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 318 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 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-10-31 22:16:31,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:31,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 339 [2024-10-31 22:16:31,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:32,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1027] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][231], [319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), 321#true, Black: 329#true, 331#(= |#race~stderr~0| 0), Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 238#L1259-10true, 89#L1281-3true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:32,557 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-10-31 22:16:32,557 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-31 22:16:32,557 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-31 22:16:32,557 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-31 22:16:32,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1027] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][231], [130#L1281-4true, 319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), 321#true, Black: 329#true, 331#(= |#race~stderr~0| 0), Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 238#L1259-10true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:32,603 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-31 22:16:32,604 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-31 22:16:32,604 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-31 22:16:32,604 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-31 22:16:32,607 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1027] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][231], [319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), 321#true, Black: 329#true, 331#(= |#race~stderr~0| 0), Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 238#L1259-10true, 89#L1281-3true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:32,607 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-10-31 22:16:32,607 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-31 22:16:32,608 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-31 22:16:32,608 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:16:32,608 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-31 22:16:32,608 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1027] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][231], [130#L1281-4true, 319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), 321#true, Black: 329#true, 331#(= |#race~stderr~0| 0), Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 238#L1259-10true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:32,608 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-31 22:16:32,608 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-31 22:16:32,608 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-31 22:16:32,609 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-31 22:16:32,609 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-31 22:16:32,663 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][300], [319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), 321#true, Black: 329#true, 331#(= |#race~stderr~0| 0), Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 238#L1259-10true, 89#L1281-3true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:32,664 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-10-31 22:16:32,664 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-31 22:16:32,664 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:16:32,664 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-31 22:16:32,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][300], [130#L1281-4true, 319#true, 316#true, 362#true, 88#L1286-2true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), 321#true, Black: 329#true, 331#(= |#race~stderr~0| 0), Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 238#L1259-10true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:32,664 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-31 22:16:32,664 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-31 22:16:32,665 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-31 22:16:32,665 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-31 22:16:32,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][300], [319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), 321#true, Black: 329#true, 331#(= |#race~stderr~0| 0), 203#L1261-2true, Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 89#L1281-3true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:32,744 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2024-10-31 22:16:32,745 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-31 22:16:32,745 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-31 22:16:32,745 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-31 22:16:32,746 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][300], [319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), 321#true, Black: 329#true, 331#(= |#race~stderr~0| 0), Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 238#L1259-10true, 367#true, 89#L1281-3true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:32,746 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is not cut-off event [2024-10-31 22:16:32,746 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is not cut-off event [2024-10-31 22:16:32,746 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-31 22:16:32,746 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-31 22:16:32,746 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is not cut-off event [2024-10-31 22:16:32,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][300], [130#L1281-4true, 319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), 321#true, Black: 329#true, 331#(= |#race~stderr~0| 0), 203#L1261-2true, Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:32,819 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:16:32,819 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:16:32,819 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:16:32,819 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-31 22:16:32,820 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][300], [130#L1281-4true, 319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), 321#true, Black: 329#true, 331#(= |#race~stderr~0| 0), Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 238#L1259-10true, 367#true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:32,820 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is not cut-off event [2024-10-31 22:16:32,820 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is not cut-off event [2024-10-31 22:16:32,820 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is not cut-off event [2024-10-31 22:16:32,820 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-10-31 22:16:32,820 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is not cut-off event [2024-10-31 22:16:33,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1027] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][231], [319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), 321#true, Black: 329#true, 331#(= |#race~stderr~0| 0), Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 203#L1261-2true, 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 89#L1281-3true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:33,043 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-10-31 22:16:33,043 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-31 22:16:33,044 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:16:33,044 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-31 22:16:33,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1027] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][231], [130#L1281-4true, 319#true, 316#true, 362#true, 88#L1286-2true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), Black: 329#true, 321#true, 331#(= |#race~stderr~0| 0), Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 203#L1261-2true, 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:33,125 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-10-31 22:16:33,125 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:16:33,125 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:16:33,125 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-31 22:16:33,447 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][300], [319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), Black: 329#true, 321#true, 331#(= |#race~stderr~0| 0), Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 203#L1261-2true, 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 89#L1281-3true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:33,448 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-10-31 22:16:33,448 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-31 22:16:33,448 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:16:33,448 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-31 22:16:33,448 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-31 22:16:33,448 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1069] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][300], [130#L1281-4true, 319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), Black: 329#true, 321#true, 331#(= |#race~stderr~0| 0), Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 203#L1261-2true, 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:33,448 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-10-31 22:16:33,448 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:16:33,449 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:16:33,449 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:16:33,449 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-31 22:16:33,569 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1027] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][231], [319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), 321#true, Black: 329#true, 331#(= |#race~stderr~0| 0), 203#L1261-2true, Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 89#L1281-3true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:33,570 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2024-10-31 22:16:33,570 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2024-10-31 22:16:33,570 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-31 22:16:33,570 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2024-10-31 22:16:33,570 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-31 22:16:33,702 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1027] L1286-1-->L1286-2: Formula: (= |v_#race~stderr~0_1| 0) InVars {} OutVars{#race~stderr~0=|v_#race~stderr~0_1|} AuxVars[] AssignedVars[#race~stderr~0][231], [130#L1281-4true, 319#true, 316#true, 88#L1286-2true, 362#true, Black: 359#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 ~iSet~0)), 134#L1286-2true, 325#(= |#race~iSet~0| 0), Black: 329#true, 321#true, 331#(= |#race~stderr~0| 0), 203#L1261-2true, Black: 364#(= |setThreadThread1of2ForFork0_#t~nondet58| |#race~a~0|), 346#true, 315#true, 335#(= |#race~iCheck~0| 0), 367#true, 358#(<= 4 ~iSet~0)]) [2024-10-31 22:16:33,702 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event [2024-10-31 22:16:33,702 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-31 22:16:33,703 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-31 22:16:33,703 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is not cut-off event [2024-10-31 22:16:33,703 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event