./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-atomic/lamport-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/lamport-b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl --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 991793f8d7262fdf8fcd914d5c9fbaf399d7f573a6d3b742f5710da63c18b7e1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:26:01,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:26:01,707 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-12 02:26:01,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:26:01,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:26:01,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:26:01,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:26:01,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:26:01,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:26:01,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:26:01,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:26:01,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:26:01,746 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:26:01,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:26:01,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:26:01,748 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:26:01,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:26:01,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:26:01,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:26:01,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:26:01,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:26:01,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:26:01,752 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-12 02:26:01,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:26:01,754 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:26:01,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:26:01,755 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:26:01,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:26:01,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:26:01,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:26:01,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:26:01,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:26:01,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:26:01,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:26:01,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:26:01,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:26:01,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:26:01,760 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:26:01,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:26:01,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:26:01,761 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:26:01,762 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_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/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_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl 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 -> 991793f8d7262fdf8fcd914d5c9fbaf399d7f573a6d3b742f5710da63c18b7e1 [2023-11-12 02:26:02,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:26:02,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:26:02,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:26:02,092 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:26:02,094 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:26:02,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-atomic/lamport-b.i [2023-11-12 02:26:05,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:26:06,171 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:26:06,177 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/sv-benchmarks/c/pthread-atomic/lamport-b.i [2023-11-12 02:26:06,208 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/data/ccc1a2c69/01f6683731754150af472b40f68f57e9/FLAG752366de5 [2023-11-12 02:26:06,228 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/data/ccc1a2c69/01f6683731754150af472b40f68f57e9 [2023-11-12 02:26:06,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:26:06,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:26:06,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:26:06,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:26:06,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:26:06,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:26:06" (1/1) ... [2023-11-12 02:26:06,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e22cfcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06, skipping insertion in model container [2023-11-12 02:26:06,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:26:06" (1/1) ... [2023-11-12 02:26:06,325 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:26:06,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:26:06,727 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:26:06,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:26:06,862 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:26:06,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06 WrapperNode [2023-11-12 02:26:06,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:26:06,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:26:06,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:26:06,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:26:06,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06" (1/1) ... [2023-11-12 02:26:06,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06" (1/1) ... [2023-11-12 02:26:06,945 INFO L138 Inliner]: procedures = 167, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 225 [2023-11-12 02:26:06,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:26:06,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:26:06,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:26:06,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:26:06,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06" (1/1) ... [2023-11-12 02:26:06,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06" (1/1) ... [2023-11-12 02:26:06,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06" (1/1) ... [2023-11-12 02:26:06,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06" (1/1) ... [2023-11-12 02:26:06,971 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06" (1/1) ... [2023-11-12 02:26:06,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06" (1/1) ... [2023-11-12 02:26:06,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06" (1/1) ... [2023-11-12 02:26:07,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06" (1/1) ... [2023-11-12 02:26:07,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:26:07,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:26:07,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:26:07,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:26:07,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06" (1/1) ... [2023-11-12 02:26:07,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:26:07,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:26:07,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:26:07,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:26:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:26:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-11-12 02:26:07,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-11-12 02:26:07,123 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-12 02:26:07,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-12 02:26:07,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:26:07,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:26:07,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:26:07,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:26:07,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:26:07,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:26:07,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:26:07,126 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:26:07,317 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:26:07,319 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:26:07,714 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:26:07,725 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:26:07,726 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-12 02:26:07,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:26:07 BoogieIcfgContainer [2023-11-12 02:26:07,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:26:07,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:26:07,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:26:07,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:26:07,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:26:06" (1/3) ... [2023-11-12 02:26:07,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8a479b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:26:07, skipping insertion in model container [2023-11-12 02:26:07,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:06" (2/3) ... [2023-11-12 02:26:07,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8a479b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:26:07, skipping insertion in model container [2023-11-12 02:26:07,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:26:07" (3/3) ... [2023-11-12 02:26:07,747 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport-b.i [2023-11-12 02:26:07,764 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:26:07,777 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:26:07,778 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-11-12 02:26:07,778 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:26:07,927 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-12 02:26:07,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 255 transitions, 524 flow [2023-11-12 02:26:08,090 INFO L124 PetriNetUnfolderBase]: 26/253 cut-off events. [2023-11-12 02:26:08,090 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-12 02:26:08,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 253 events. 26/253 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 804 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 219. Up to 5 conditions per place. [2023-11-12 02:26:08,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 255 transitions, 524 flow [2023-11-12 02:26:08,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 224 places, 243 transitions, 495 flow [2023-11-12 02:26:08,134 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:26:08,145 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 243 transitions, 495 flow [2023-11-12 02:26:08,148 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 243 transitions, 495 flow [2023-11-12 02:26:08,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 243 transitions, 495 flow [2023-11-12 02:26:08,232 INFO L124 PetriNetUnfolderBase]: 26/243 cut-off events. [2023-11-12 02:26:08,233 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-12 02:26:08,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 243 events. 26/243 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 800 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 219. Up to 5 conditions per place. [2023-11-12 02:26:08,267 INFO L119 LiptonReduction]: Number of co-enabled transitions 26600 [2023-11-12 02:26:11,321 INFO L134 LiptonReduction]: Checked pairs total: 136381 [2023-11-12 02:26:11,321 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-11-12 02:26:11,350 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:26:11,360 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@59777d85, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:26:11,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-11-12 02:26:11,369 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:26:11,369 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2023-11-12 02:26:11,369 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:26:11,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:11,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:26:11,371 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-11-12 02:26:11,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:11,377 INFO L85 PathProgramCache]: Analyzing trace with hash 913651109, now seen corresponding path program 1 times [2023-11-12 02:26:11,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:11,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619145054] [2023-11-12 02:26:11,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:11,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:26:11,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:11,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619145054] [2023-11-12 02:26:11,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619145054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:11,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:11,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:26:11,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774617576] [2023-11-12 02:26:11,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:11,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:26:11,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:11,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:26:11,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:26:11,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 365 [2023-11-12 02:26:11,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 161 transitions, 331 flow. Second operand has 2 states, 2 states have (on average 237.0) internal successors, (474), 2 states have internal predecessors, (474), 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) [2023-11-12 02:26:11,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:11,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 365 [2023-11-12 02:26:11,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:12,344 INFO L124 PetriNetUnfolderBase]: 1485/4460 cut-off events. [2023-11-12 02:26:12,344 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-12 02:26:12,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6531 conditions, 4460 events. 1485/4460 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 37302 event pairs, 1137 based on Foata normal form. 317/3992 useless extension candidates. Maximal degree in co-relation 6354. Up to 2007 conditions per place. [2023-11-12 02:26:12,388 INFO L140 encePairwiseOnDemand]: 349/365 looper letters, 44 selfloop transitions, 0 changer transitions 0/142 dead transitions. [2023-11-12 02:26:12,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 142 transitions, 381 flow [2023-11-12 02:26:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:26:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-12 02:26:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 530 transitions. [2023-11-12 02:26:12,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.726027397260274 [2023-11-12 02:26:12,412 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 530 transitions. [2023-11-12 02:26:12,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 530 transitions. [2023-11-12 02:26:12,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:12,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 530 transitions. [2023-11-12 02:26:12,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 265.0) internal successors, (530), 2 states have internal predecessors, (530), 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) [2023-11-12 02:26:12,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 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) [2023-11-12 02:26:12,434 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 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) [2023-11-12 02:26:12,436 INFO L175 Difference]: Start difference. First operand has 142 places, 161 transitions, 331 flow. Second operand 2 states and 530 transitions. [2023-11-12 02:26:12,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 142 transitions, 381 flow [2023-11-12 02:26:12,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 142 transitions, 376 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-12 02:26:12,449 INFO L231 Difference]: Finished difference. Result has 135 places, 142 transitions, 288 flow [2023-11-12 02:26:12,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=288, PETRI_PLACES=135, PETRI_TRANSITIONS=142} [2023-11-12 02:26:12,457 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -7 predicate places. [2023-11-12 02:26:12,457 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 142 transitions, 288 flow [2023-11-12 02:26:12,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 237.0) internal successors, (474), 2 states have internal predecessors, (474), 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) [2023-11-12 02:26:12,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:12,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 02:26:12,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:26:12,458 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-11-12 02:26:12,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1743472716, now seen corresponding path program 1 times [2023-11-12 02:26:12,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:12,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121807517] [2023-11-12 02:26:12,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:12,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:26:12,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:12,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121807517] [2023-11-12 02:26:12,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121807517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:12,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:12,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:26:12,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420961856] [2023-11-12 02:26:12,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:12,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:26:12,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:12,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:26:12,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:26:12,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 365 [2023-11-12 02:26:12,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 142 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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) [2023-11-12 02:26:12,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:12,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 365 [2023-11-12 02:26:12,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:13,359 INFO L124 PetriNetUnfolderBase]: 1919/5254 cut-off events. [2023-11-12 02:26:13,360 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-12 02:26:13,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7984 conditions, 5254 events. 1919/5254 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 43121 event pairs, 1341 based on Foata normal form. 0/4336 useless extension candidates. Maximal degree in co-relation 7981. Up to 2447 conditions per place. [2023-11-12 02:26:13,405 INFO L140 encePairwiseOnDemand]: 360/365 looper letters, 69 selfloop transitions, 4 changer transitions 0/166 dead transitions. [2023-11-12 02:26:13,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 166 transitions, 484 flow [2023-11-12 02:26:13,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:26:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:26:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2023-11-12 02:26:13,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6867579908675799 [2023-11-12 02:26:13,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2023-11-12 02:26:13,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2023-11-12 02:26:13,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:13,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2023-11-12 02:26:13,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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) [2023-11-12 02:26:13,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:13,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:13,418 INFO L175 Difference]: Start difference. First operand has 135 places, 142 transitions, 288 flow. Second operand 3 states and 752 transitions. [2023-11-12 02:26:13,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 166 transitions, 484 flow [2023-11-12 02:26:13,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 166 transitions, 484 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:26:13,423 INFO L231 Difference]: Finished difference. Result has 139 places, 145 transitions, 318 flow [2023-11-12 02:26:13,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=139, PETRI_TRANSITIONS=145} [2023-11-12 02:26:13,425 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -3 predicate places. [2023-11-12 02:26:13,425 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 145 transitions, 318 flow [2023-11-12 02:26:13,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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) [2023-11-12 02:26:13,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:13,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:13,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:26:13,427 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-11-12 02:26:13,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:13,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2127606523, now seen corresponding path program 1 times [2023-11-12 02:26:13,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:13,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083772566] [2023-11-12 02:26:13,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:26:13,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:13,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083772566] [2023-11-12 02:26:13,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083772566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:13,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:13,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:26:13,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136889320] [2023-11-12 02:26:13,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:13,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:26:13,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:13,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:26:13,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:26:13,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 365 [2023-11-12 02:26:13,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 145 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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) [2023-11-12 02:26:13,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:13,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 365 [2023-11-12 02:26:13,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:14,369 INFO L124 PetriNetUnfolderBase]: 1954/5442 cut-off events. [2023-11-12 02:26:14,370 INFO L125 PetriNetUnfolderBase]: For 326/367 co-relation queries the response was YES. [2023-11-12 02:26:14,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8566 conditions, 5442 events. 1954/5442 cut-off events. For 326/367 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 45654 event pairs, 1320 based on Foata normal form. 0/4516 useless extension candidates. Maximal degree in co-relation 8561. Up to 2504 conditions per place. [2023-11-12 02:26:14,419 INFO L140 encePairwiseOnDemand]: 360/365 looper letters, 71 selfloop transitions, 4 changer transitions 0/171 dead transitions. [2023-11-12 02:26:14,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 171 transitions, 531 flow [2023-11-12 02:26:14,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:26:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:26:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2023-11-12 02:26:14,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6867579908675799 [2023-11-12 02:26:14,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2023-11-12 02:26:14,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2023-11-12 02:26:14,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:14,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2023-11-12 02:26:14,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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) [2023-11-12 02:26:14,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:14,432 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:14,433 INFO L175 Difference]: Start difference. First operand has 139 places, 145 transitions, 318 flow. Second operand 3 states and 752 transitions. [2023-11-12 02:26:14,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 171 transitions, 531 flow [2023-11-12 02:26:14,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 171 transitions, 519 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:26:14,440 INFO L231 Difference]: Finished difference. Result has 141 places, 148 transitions, 340 flow [2023-11-12 02:26:14,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=141, PETRI_TRANSITIONS=148} [2023-11-12 02:26:14,442 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -1 predicate places. [2023-11-12 02:26:14,442 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 148 transitions, 340 flow [2023-11-12 02:26:14,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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) [2023-11-12 02:26:14,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:14,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:14,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:26:14,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-11-12 02:26:14,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:14,445 INFO L85 PathProgramCache]: Analyzing trace with hash -755321930, now seen corresponding path program 1 times [2023-11-12 02:26:14,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:14,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001646447] [2023-11-12 02:26:14,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:14,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:26:14,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:14,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001646447] [2023-11-12 02:26:14,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001646447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:14,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:14,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:26:14,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49863054] [2023-11-12 02:26:14,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:14,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:26:14,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:14,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:26:14,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:26:14,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 365 [2023-11-12 02:26:14,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 148 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 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) [2023-11-12 02:26:14,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:14,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 365 [2023-11-12 02:26:14,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:15,276 INFO L124 PetriNetUnfolderBase]: 2061/5867 cut-off events. [2023-11-12 02:26:15,276 INFO L125 PetriNetUnfolderBase]: For 458/529 co-relation queries the response was YES. [2023-11-12 02:26:15,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9349 conditions, 5867 events. 2061/5867 cut-off events. For 458/529 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 50558 event pairs, 1357 based on Foata normal form. 0/4869 useless extension candidates. Maximal degree in co-relation 9343. Up to 2647 conditions per place. [2023-11-12 02:26:15,324 INFO L140 encePairwiseOnDemand]: 359/365 looper letters, 70 selfloop transitions, 5 changer transitions 0/173 dead transitions. [2023-11-12 02:26:15,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 173 transitions, 552 flow [2023-11-12 02:26:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:26:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:26:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2023-11-12 02:26:15,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6885844748858447 [2023-11-12 02:26:15,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 754 transitions. [2023-11-12 02:26:15,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 754 transitions. [2023-11-12 02:26:15,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:15,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 754 transitions. [2023-11-12 02:26:15,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 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) [2023-11-12 02:26:15,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:15,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:15,340 INFO L175 Difference]: Start difference. First operand has 141 places, 148 transitions, 340 flow. Second operand 3 states and 754 transitions. [2023-11-12 02:26:15,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 173 transitions, 552 flow [2023-11-12 02:26:15,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 173 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:26:15,348 INFO L231 Difference]: Finished difference. Result has 143 places, 152 transitions, 370 flow [2023-11-12 02:26:15,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=143, PETRI_TRANSITIONS=152} [2023-11-12 02:26:15,349 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 1 predicate places. [2023-11-12 02:26:15,349 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 152 transitions, 370 flow [2023-11-12 02:26:15,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 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) [2023-11-12 02:26:15,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:15,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:15,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:26:15,351 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-11-12 02:26:15,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:15,352 INFO L85 PathProgramCache]: Analyzing trace with hash -14872583, now seen corresponding path program 1 times [2023-11-12 02:26:15,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:15,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143642738] [2023-11-12 02:26:15,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:26:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143642738] [2023-11-12 02:26:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143642738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:15,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:15,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:26:15,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612853818] [2023-11-12 02:26:15,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:15,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:26:15,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:15,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:26:15,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:26:15,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 365 [2023-11-12 02:26:15,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 152 transitions, 370 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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) [2023-11-12 02:26:15,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:15,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 365 [2023-11-12 02:26:15,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:17,270 INFO L124 PetriNetUnfolderBase]: 5117/12539 cut-off events. [2023-11-12 02:26:17,271 INFO L125 PetriNetUnfolderBase]: For 972/1129 co-relation queries the response was YES. [2023-11-12 02:26:17,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22048 conditions, 12539 events. 5117/12539 cut-off events. For 972/1129 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 112202 event pairs, 1581 based on Foata normal form. 0/10951 useless extension candidates. Maximal degree in co-relation 22041. Up to 4600 conditions per place. [2023-11-12 02:26:17,358 INFO L140 encePairwiseOnDemand]: 337/365 looper letters, 113 selfloop transitions, 21 changer transitions 0/214 dead transitions. [2023-11-12 02:26:17,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 214 transitions, 793 flow [2023-11-12 02:26:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:26:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:26:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2023-11-12 02:26:17,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6894977168949772 [2023-11-12 02:26:17,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 755 transitions. [2023-11-12 02:26:17,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 755 transitions. [2023-11-12 02:26:17,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:17,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 755 transitions. [2023-11-12 02:26:17,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 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) [2023-11-12 02:26:17,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:17,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:17,373 INFO L175 Difference]: Start difference. First operand has 143 places, 152 transitions, 370 flow. Second operand 3 states and 755 transitions. [2023-11-12 02:26:17,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 214 transitions, 793 flow [2023-11-12 02:26:17,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 214 transitions, 777 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:26:17,383 INFO L231 Difference]: Finished difference. Result has 145 places, 173 transitions, 548 flow [2023-11-12 02:26:17,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=145, PETRI_TRANSITIONS=173} [2023-11-12 02:26:17,387 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 3 predicate places. [2023-11-12 02:26:17,387 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 173 transitions, 548 flow [2023-11-12 02:26:17,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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) [2023-11-12 02:26:17,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:17,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:17,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:26:17,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-11-12 02:26:17,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:17,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1602287238, now seen corresponding path program 1 times [2023-11-12 02:26:17,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:17,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437838728] [2023-11-12 02:26:17,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:26:17,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:17,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437838728] [2023-11-12 02:26:17,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437838728] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:17,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:17,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:26:17,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494057071] [2023-11-12 02:26:17,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:17,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:26:17,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:17,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:26:17,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:26:17,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 365 [2023-11-12 02:26:17,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 173 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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) [2023-11-12 02:26:17,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:17,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 365 [2023-11-12 02:26:17,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:19,017 INFO L124 PetriNetUnfolderBase]: 3978/11334 cut-off events. [2023-11-12 02:26:19,017 INFO L125 PetriNetUnfolderBase]: For 2267/2512 co-relation queries the response was YES. [2023-11-12 02:26:19,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20655 conditions, 11334 events. 3978/11334 cut-off events. For 2267/2512 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 109547 event pairs, 2471 based on Foata normal form. 38/9776 useless extension candidates. Maximal degree in co-relation 20647. Up to 5327 conditions per place. [2023-11-12 02:26:19,113 INFO L140 encePairwiseOnDemand]: 360/365 looper letters, 81 selfloop transitions, 5 changer transitions 0/202 dead transitions. [2023-11-12 02:26:19,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 202 transitions, 813 flow [2023-11-12 02:26:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:26:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:26:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2023-11-12 02:26:19,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6876712328767123 [2023-11-12 02:26:19,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 753 transitions. [2023-11-12 02:26:19,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 753 transitions. [2023-11-12 02:26:19,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:19,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 753 transitions. [2023-11-12 02:26:19,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 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) [2023-11-12 02:26:19,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:19,128 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:19,129 INFO L175 Difference]: Start difference. First operand has 145 places, 173 transitions, 548 flow. Second operand 3 states and 753 transitions. [2023-11-12 02:26:19,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 202 transitions, 813 flow [2023-11-12 02:26:19,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 202 transitions, 765 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:26:19,151 INFO L231 Difference]: Finished difference. Result has 146 places, 176 transitions, 537 flow [2023-11-12 02:26:19,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=146, PETRI_TRANSITIONS=176} [2023-11-12 02:26:19,154 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 4 predicate places. [2023-11-12 02:26:19,158 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 176 transitions, 537 flow [2023-11-12 02:26:19,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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) [2023-11-12 02:26:19,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:19,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:19,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:26:19,161 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-11-12 02:26:19,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash 187145965, now seen corresponding path program 1 times [2023-11-12 02:26:19,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:19,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229618061] [2023-11-12 02:26:19,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:19,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:26:19,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229618061] [2023-11-12 02:26:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229618061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:19,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:19,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:26:19,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631864397] [2023-11-12 02:26:19,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:19,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:26:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:19,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:26:19,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:26:19,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 365 [2023-11-12 02:26:19,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 176 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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) [2023-11-12 02:26:19,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:19,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 365 [2023-11-12 02:26:19,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:20,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([782] L693-4-->L693-1: Formula: (= |v_#race~y~0_25| 0) InVars {} OutVars{#race~y~0=|v_#race~y~0_25|} AuxVars[] AssignedVars[#race~y~0][156], [271#true, Black: 256#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 162#L693-1true, 39#L727-1true, Black: 244#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), Black: 260#true, 169#L742-4true, 266#true, 239#true, Black: 250#(= |thr2Thread1of1ForFork1_#t~nondet11#1| |#race~b2~0|), thr2Thread1of1ForFork1InUse, Black: 268#(= |thr2Thread1of1ForFork1_#t~nondet12#1| |#race~x~0|)]) [2023-11-12 02:26:20,668 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-12 02:26:20,668 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-12 02:26:20,668 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-12 02:26:20,668 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-12 02:26:20,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([782] L693-4-->L693-1: Formula: (= |v_#race~y~0_25| 0) InVars {} OutVars{#race~y~0=|v_#race~y~0_25|} AuxVars[] AssignedVars[#race~y~0][156], [271#true, Black: 256#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 162#L693-1true, Black: 244#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), Black: 260#true, 169#L742-4true, 266#true, 239#true, Black: 250#(= |thr2Thread1of1ForFork1_#t~nondet11#1| |#race~b2~0|), thr2Thread1of1ForFork1InUse, Black: 268#(= |thr2Thread1of1ForFork1_#t~nondet12#1| |#race~x~0|), 142#L727-2true]) [2023-11-12 02:26:20,669 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-12 02:26:20,670 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-12 02:26:20,670 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-12 02:26:20,670 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-12 02:26:20,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([714] L727-2-->L727-5: Formula: (= v_~y~0_7 0) InVars {~y~0=v_~y~0_7} OutVars{~y~0=v_~y~0_7} AuxVars[] AssignedVars[][188], [4#L727-5true, Black: 256#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 244#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 137#L693-4true, Black: 260#true, 169#L742-4true, 266#true, 239#true, Black: 250#(= |thr2Thread1of1ForFork1_#t~nondet11#1| |#race~b2~0|), thr2Thread1of1ForFork1InUse, 273#(= ~y~0 0), Black: 268#(= |thr2Thread1of1ForFork1_#t~nondet12#1| |#race~x~0|)]) [2023-11-12 02:26:20,670 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-12 02:26:20,671 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-12 02:26:20,671 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-12 02:26:20,673 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-12 02:26:20,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([715] L727-2-->L727-4: Formula: (not (= v_~y~0_8 0)) InVars {~y~0=v_~y~0_8} OutVars{~y~0=v_~y~0_8} AuxVars[] AssignedVars[][189], [271#true, Black: 256#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 244#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 137#L693-4true, Black: 260#true, 169#L742-4true, 266#true, 151#L727-4true, 239#true, Black: 250#(= |thr2Thread1of1ForFork1_#t~nondet11#1| |#race~b2~0|), thr2Thread1of1ForFork1InUse, Black: 268#(= |thr2Thread1of1ForFork1_#t~nondet12#1| |#race~x~0|)]) [2023-11-12 02:26:20,674 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-12 02:26:20,674 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-12 02:26:20,674 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-12 02:26:20,675 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-12 02:26:20,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([782] L693-4-->L693-1: Formula: (= |v_#race~y~0_25| 0) InVars {} OutVars{#race~y~0=|v_#race~y~0_25|} AuxVars[] AssignedVars[#race~y~0][156], [271#true, Black: 256#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 162#L693-1true, 39#L727-1true, Black: 244#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), Black: 260#true, 102#L743-6true, 266#true, 239#true, thr2Thread1of1ForFork1InUse, Black: 250#(= |thr2Thread1of1ForFork1_#t~nondet11#1| |#race~b2~0|), Black: 268#(= |thr2Thread1of1ForFork1_#t~nondet12#1| |#race~x~0|)]) [2023-11-12 02:26:20,707 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-12 02:26:20,707 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-12 02:26:20,707 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-12 02:26:20,708 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-12 02:26:20,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([782] L693-4-->L693-1: Formula: (= |v_#race~y~0_25| 0) InVars {} OutVars{#race~y~0=|v_#race~y~0_25|} AuxVars[] AssignedVars[#race~y~0][156], [271#true, Black: 256#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 162#L693-1true, Black: 244#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), Black: 260#true, 102#L743-6true, 266#true, 239#true, thr2Thread1of1ForFork1InUse, Black: 250#(= |thr2Thread1of1ForFork1_#t~nondet11#1| |#race~b2~0|), Black: 268#(= |thr2Thread1of1ForFork1_#t~nondet12#1| |#race~x~0|), 142#L727-2true]) [2023-11-12 02:26:20,708 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-12 02:26:20,708 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-12 02:26:20,709 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-12 02:26:20,709 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-12 02:26:20,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([714] L727-2-->L727-5: Formula: (= v_~y~0_7 0) InVars {~y~0=v_~y~0_7} OutVars{~y~0=v_~y~0_7} AuxVars[] AssignedVars[][188], [4#L727-5true, Black: 256#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 244#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 137#L693-4true, Black: 260#true, 102#L743-6true, 266#true, 239#true, thr2Thread1of1ForFork1InUse, Black: 250#(= |thr2Thread1of1ForFork1_#t~nondet11#1| |#race~b2~0|), 273#(= ~y~0 0), Black: 268#(= |thr2Thread1of1ForFork1_#t~nondet12#1| |#race~x~0|)]) [2023-11-12 02:26:20,709 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-12 02:26:20,709 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-12 02:26:20,709 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-12 02:26:20,709 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-12 02:26:20,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([715] L727-2-->L727-4: Formula: (not (= v_~y~0_8 0)) InVars {~y~0=v_~y~0_8} OutVars{~y~0=v_~y~0_8} AuxVars[] AssignedVars[][189], [271#true, Black: 256#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 244#(= |#race~b1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 137#L693-4true, Black: 260#true, 102#L743-6true, 266#true, 151#L727-4true, 239#true, thr2Thread1of1ForFork1InUse, Black: 250#(= |thr2Thread1of1ForFork1_#t~nondet11#1| |#race~b2~0|), Black: 268#(= |thr2Thread1of1ForFork1_#t~nondet12#1| |#race~x~0|)]) [2023-11-12 02:26:20,710 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-12 02:26:20,710 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-12 02:26:20,710 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-12 02:26:20,710 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-12 02:26:21,215 INFO L124 PetriNetUnfolderBase]: 6167/15591 cut-off events. [2023-11-12 02:26:21,215 INFO L125 PetriNetUnfolderBase]: For 2290/2807 co-relation queries the response was YES. [2023-11-12 02:26:21,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30020 conditions, 15591 events. 6167/15591 cut-off events. For 2290/2807 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 152066 event pairs, 2107 based on Foata normal form. 240/13983 useless extension candidates. Maximal degree in co-relation 30011. Up to 5428 conditions per place. [2023-11-12 02:26:21,345 INFO L140 encePairwiseOnDemand]: 346/365 looper letters, 121 selfloop transitions, 11 changer transitions 0/236 dead transitions. [2023-11-12 02:26:21,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 236 transitions, 978 flow [2023-11-12 02:26:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:26:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:26:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2023-11-12 02:26:21,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7013698630136986 [2023-11-12 02:26:21,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 768 transitions. [2023-11-12 02:26:21,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 768 transitions. [2023-11-12 02:26:21,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:21,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 768 transitions. [2023-11-12 02:26:21,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 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) [2023-11-12 02:26:21,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:21,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:21,359 INFO L175 Difference]: Start difference. First operand has 146 places, 176 transitions, 537 flow. Second operand 3 states and 768 transitions. [2023-11-12 02:26:21,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 236 transitions, 978 flow [2023-11-12 02:26:21,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 236 transitions, 971 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:26:21,371 INFO L231 Difference]: Finished difference. Result has 149 places, 186 transitions, 632 flow [2023-11-12 02:26:21,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=149, PETRI_TRANSITIONS=186} [2023-11-12 02:26:21,373 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 7 predicate places. [2023-11-12 02:26:21,373 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 186 transitions, 632 flow [2023-11-12 02:26:21,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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) [2023-11-12 02:26:21,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:21,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:21,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:26:21,375 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-11-12 02:26:21,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:21,375 INFO L85 PathProgramCache]: Analyzing trace with hash 187183477, now seen corresponding path program 1 times [2023-11-12 02:26:21,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:21,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464637976] [2023-11-12 02:26:21,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:21,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:26:21,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:21,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464637976] [2023-11-12 02:26:21,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464637976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:21,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:21,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:26:21,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683091958] [2023-11-12 02:26:21,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:21,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:26:21,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:21,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:26:21,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:26:21,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 365 [2023-11-12 02:26:21,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 186 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 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) [2023-11-12 02:26:21,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:21,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 365 [2023-11-12 02:26:21,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:23,776 INFO L124 PetriNetUnfolderBase]: 5592/14856 cut-off events. [2023-11-12 02:26:23,777 INFO L125 PetriNetUnfolderBase]: For 3547/3986 co-relation queries the response was YES. [2023-11-12 02:26:23,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30057 conditions, 14856 events. 5592/14856 cut-off events. For 3547/3986 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 149205 event pairs, 3432 based on Foata normal form. 60/13317 useless extension candidates. Maximal degree in co-relation 30047. Up to 8042 conditions per place. [2023-11-12 02:26:23,878 INFO L140 encePairwiseOnDemand]: 356/365 looper letters, 92 selfloop transitions, 14 changer transitions 0/219 dead transitions. [2023-11-12 02:26:23,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 219 transitions, 948 flow [2023-11-12 02:26:23,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:26:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:26:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2023-11-12 02:26:23,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6730593607305936 [2023-11-12 02:26:23,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 737 transitions. [2023-11-12 02:26:23,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 737 transitions. [2023-11-12 02:26:23,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:23,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 737 transitions. [2023-11-12 02:26:23,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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) [2023-11-12 02:26:23,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:23,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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) [2023-11-12 02:26:23,893 INFO L175 Difference]: Start difference. First operand has 149 places, 186 transitions, 632 flow. Second operand 3 states and 737 transitions. [2023-11-12 02:26:23,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 219 transitions, 948 flow [2023-11-12 02:26:23,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 219 transitions, 926 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:26:23,909 INFO L231 Difference]: Finished difference. Result has 150 places, 198 transitions, 724 flow [2023-11-12 02:26:23,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=150, PETRI_TRANSITIONS=198} [2023-11-12 02:26:23,914 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 8 predicate places. [2023-11-12 02:26:23,915 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 198 transitions, 724 flow [2023-11-12 02:26:23,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 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) [2023-11-12 02:26:23,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:23,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:23,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:26:23,916 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-11-12 02:26:23,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash -44410381, now seen corresponding path program 1 times [2023-11-12 02:26:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:23,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509773637] [2023-11-12 02:26:23,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:23,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:26:23,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:26:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:26:23,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:26:23,998 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:26:23,999 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (63 of 64 remaining) [2023-11-12 02:26:24,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err11ASSERT_VIOLATIONDATA_RACE (62 of 64 remaining) [2023-11-12 02:26:24,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (61 of 64 remaining) [2023-11-12 02:26:24,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err12ASSERT_VIOLATIONDATA_RACE (60 of 64 remaining) [2023-11-12 02:26:24,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (59 of 64 remaining) [2023-11-12 02:26:24,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err13ASSERT_VIOLATIONDATA_RACE (58 of 64 remaining) [2023-11-12 02:26:24,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (57 of 64 remaining) [2023-11-12 02:26:24,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err14ASSERT_VIOLATIONDATA_RACE (56 of 64 remaining) [2023-11-12 02:26:24,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (55 of 64 remaining) [2023-11-12 02:26:24,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (54 of 64 remaining) [2023-11-12 02:26:24,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (53 of 64 remaining) [2023-11-12 02:26:24,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (52 of 64 remaining) [2023-11-12 02:26:24,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (51 of 64 remaining) [2023-11-12 02:26:24,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (50 of 64 remaining) [2023-11-12 02:26:24,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (49 of 64 remaining) [2023-11-12 02:26:24,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err10ASSERT_VIOLATIONDATA_RACE (48 of 64 remaining) [2023-11-12 02:26:24,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (47 of 64 remaining) [2023-11-12 02:26:24,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (46 of 64 remaining) [2023-11-12 02:26:24,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (45 of 64 remaining) [2023-11-12 02:26:24,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (44 of 64 remaining) [2023-11-12 02:26:24,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (43 of 64 remaining) [2023-11-12 02:26:24,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (42 of 64 remaining) [2023-11-12 02:26:24,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (41 of 64 remaining) [2023-11-12 02:26:24,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (40 of 64 remaining) [2023-11-12 02:26:24,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (39 of 64 remaining) [2023-11-12 02:26:24,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (38 of 64 remaining) [2023-11-12 02:26:24,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (37 of 64 remaining) [2023-11-12 02:26:24,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (36 of 64 remaining) [2023-11-12 02:26:24,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (35 of 64 remaining) [2023-11-12 02:26:24,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (34 of 64 remaining) [2023-11-12 02:26:24,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (33 of 64 remaining) [2023-11-12 02:26:24,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 64 remaining) [2023-11-12 02:26:24,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 64 remaining) [2023-11-12 02:26:24,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 64 remaining) [2023-11-12 02:26:24,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 64 remaining) [2023-11-12 02:26:24,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err11ASSERT_VIOLATIONDATA_RACE (28 of 64 remaining) [2023-11-12 02:26:24,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (27 of 64 remaining) [2023-11-12 02:26:24,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err12ASSERT_VIOLATIONDATA_RACE (26 of 64 remaining) [2023-11-12 02:26:24,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (25 of 64 remaining) [2023-11-12 02:26:24,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err13ASSERT_VIOLATIONDATA_RACE (24 of 64 remaining) [2023-11-12 02:26:24,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (23 of 64 remaining) [2023-11-12 02:26:24,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err14ASSERT_VIOLATIONDATA_RACE (22 of 64 remaining) [2023-11-12 02:26:24,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (21 of 64 remaining) [2023-11-12 02:26:24,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (20 of 64 remaining) [2023-11-12 02:26:24,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (19 of 64 remaining) [2023-11-12 02:26:24,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (18 of 64 remaining) [2023-11-12 02:26:24,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (17 of 64 remaining) [2023-11-12 02:26:24,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (16 of 64 remaining) [2023-11-12 02:26:24,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (15 of 64 remaining) [2023-11-12 02:26:24,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err10ASSERT_VIOLATIONDATA_RACE (14 of 64 remaining) [2023-11-12 02:26:24,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (13 of 64 remaining) [2023-11-12 02:26:24,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 64 remaining) [2023-11-12 02:26:24,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (11 of 64 remaining) [2023-11-12 02:26:24,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (10 of 64 remaining) [2023-11-12 02:26:24,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 64 remaining) [2023-11-12 02:26:24,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (8 of 64 remaining) [2023-11-12 02:26:24,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 64 remaining) [2023-11-12 02:26:24,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (6 of 64 remaining) [2023-11-12 02:26:24,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 64 remaining) [2023-11-12 02:26:24,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (4 of 64 remaining) [2023-11-12 02:26:24,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (3 of 64 remaining) [2023-11-12 02:26:24,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (2 of 64 remaining) [2023-11-12 02:26:24,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (1 of 64 remaining) [2023-11-12 02:26:24,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (0 of 64 remaining) [2023-11-12 02:26:24,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:26:24,030 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:24,042 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:26:24,042 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:26:24,098 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated [2023-11-12 02:26:24,101 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre21 could not be translated [2023-11-12 02:26:24,102 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-12 02:26:24,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:26:24 BasicIcfg [2023-11-12 02:26:24,113 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:26:24,114 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:26:24,114 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:26:24,114 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:26:24,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:26:07" (3/4) ... [2023-11-12 02:26:24,117 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:26:24,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:26:24,119 INFO L158 Benchmark]: Toolchain (without parser) took 17881.88ms. Allocated memory was 140.5MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 94.6MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 416.1MB. Max. memory is 16.1GB. [2023-11-12 02:26:24,120 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 104.9MB. Free memory was 55.3MB in the beginning and 55.1MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:26:24,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 621.43ms. Allocated memory is still 140.5MB. Free memory was 94.6MB in the beginning and 74.8MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-12 02:26:24,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.22ms. Allocated memory is still 140.5MB. Free memory was 74.8MB in the beginning and 72.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:26:24,124 INFO L158 Benchmark]: Boogie Preprocessor took 65.32ms. Allocated memory is still 140.5MB. Free memory was 72.0MB in the beginning and 70.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:26:24,124 INFO L158 Benchmark]: RCFGBuilder took 719.86ms. Allocated memory is still 140.5MB. Free memory was 69.9MB in the beginning and 100.0MB in the end (delta: -30.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2023-11-12 02:26:24,125 INFO L158 Benchmark]: TraceAbstraction took 16375.77ms. Allocated memory was 140.5MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 99.5MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 420.0MB. Max. memory is 16.1GB. [2023-11-12 02:26:24,125 INFO L158 Benchmark]: Witness Printer took 5.05ms. Allocated memory is still 2.8GB. Free memory is still 2.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:26:24,128 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 104.9MB. Free memory was 55.3MB in the beginning and 55.1MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 621.43ms. Allocated memory is still 140.5MB. Free memory was 94.6MB in the beginning and 74.8MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.22ms. Allocated memory is still 140.5MB. Free memory was 74.8MB in the beginning and 72.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.32ms. Allocated memory is still 140.5MB. Free memory was 72.0MB in the beginning and 70.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 719.86ms. Allocated memory is still 140.5MB. Free memory was 69.9MB in the beginning and 100.0MB in the end (delta: -30.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16375.77ms. Allocated memory was 140.5MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 99.5MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 420.0MB. Max. memory is 16.1GB. * Witness Printer took 5.05ms. Allocated memory is still 2.8GB. Free memory is still 2.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 224 PlacesBefore, 142 PlacesAfterwards, 243 TransitionsBefore, 161 TransitionsAfterwards, 26600 CoEnabledTransitionPairs, 5 FixpointIterations, 17 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 0 ChoiceCompositions, 110 TotalNumberOfCompositions, 136381 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46344, independent: 44920, independent conditional: 0, independent unconditional: 44920, dependent: 1424, dependent conditional: 0, dependent unconditional: 1424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12264, independent: 12054, independent conditional: 0, independent unconditional: 12054, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 46344, independent: 32866, independent conditional: 0, independent unconditional: 32866, dependent: 1214, dependent conditional: 0, dependent unconditional: 1214, unknown: 12264, unknown conditional: 0, unknown unconditional: 12264] , Statistics on independence cache: Total cache size (in pairs): 3341, Positive cache size: 3193, Positive conditional cache size: 0, Positive unconditional cache size: 3193, Negative cache size: 148, Negative conditional cache size: 0, Negative unconditional cache size: 148, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - DataRaceFoundResult [Line: 690]: Data race detected [2023-11-12 02:26:24,164 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated [2023-11-12 02:26:24,167 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre21 could not be translated [2023-11-12 02:26:24,169 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-12 02:26:24,185 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated [2023-11-12 02:26:24,185 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre21 could not be translated [2023-11-12 02:26:24,186 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated Data race detected The following path leads to a data race: [L684] 0 int x, y; [L685] 0 int b1, b2; [L686] 0 int X; [L740] 0 pthread_t t1, t2; [L741] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [X=0, b1=0, b2=0, t1={5:0}, t2={3:0}, x=0, y=0] [L688] COND TRUE 1 1 [L689] 1 b1 = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=0, y=0] [L742] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [X=0, b1=1, b2=0, t1={5:0}, t2={3:0}, x=0, y=0] [L690] 1 x = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=1, y=0] [L714] COND TRUE 2 1 [L715] 2 b2 = 1 [L716] 2 x = 2 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y=0] [L690] 1 x = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y=0] Now there is a data race on ~x~0 between C: x = 2 [716] and C: x = 1 [690] - UnprovableResult [Line: 733]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 735]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 743]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 408 locations, 64 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 490 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1055 IncrementalHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 88 mSDtfsCounter, 1055 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=724occurred in iteration=8, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-12 02:26:24,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c630016-7705-4860-a118-8266319389ae/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE