./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB --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 0026ab1092a8a0465a20b39c2dea92fa9c4dc52098c477016ebc8544f5aaf0f0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:01:11,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:01:11,760 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 03:01:11,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:01:11,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:01:11,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:01:11,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:01:11,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:01:11,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:01:11,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:01:11,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:01:11,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:01:11,795 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:01:11,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:01:11,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:01:11,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:01:11,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:01:11,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:01:11,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:01:11,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:01:11,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:01:11,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:01:11,796 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 03:01:11,796 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:01:11,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:01:11,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:01:11,796 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:01:11,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:01:11,796 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:01:11,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:01:11,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:01:11,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:01:11,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:01:11,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:01:11,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:01:11,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:01:11,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:01:11,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:01:11,797 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:01:11,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:01:11,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:01:11,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:01:11,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:01:11,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:01:11,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:01:11,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:01:11,798 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 0026ab1092a8a0465a20b39c2dea92fa9c4dc52098c477016ebc8544f5aaf0f0 [2024-11-28 03:01:12,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:01:12,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:01:12,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:01:12,133 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:01:12,133 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:01:12,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i [2024-11-28 03:01:15,069 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/data/814c94d5c/ee346ccfa5404ea8a92b515d32d44e18/FLAG9b4b3fcfd [2024-11-28 03:01:15,371 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:01:15,372 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i [2024-11-28 03:01:15,390 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/data/814c94d5c/ee346ccfa5404ea8a92b515d32d44e18/FLAG9b4b3fcfd [2024-11-28 03:01:15,416 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/data/814c94d5c/ee346ccfa5404ea8a92b515d32d44e18 [2024-11-28 03:01:15,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:01:15,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:01:15,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:01:15,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:01:15,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:01:15,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:15" (1/1) ... [2024-11-28 03:01:15,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc718e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:15, skipping insertion in model container [2024-11-28 03:01:15,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:15" (1/1) ... [2024-11-28 03:01:15,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:01:16,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:01:16,131 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:01:16,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:01:16,237 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:01:16,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16 WrapperNode [2024-11-28 03:01:16,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:01:16,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:01:16,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:01:16,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:01:16,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16" (1/1) ... [2024-11-28 03:01:16,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16" (1/1) ... [2024-11-28 03:01:16,293 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2024-11-28 03:01:16,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:01:16,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:01:16,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:01:16,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:01:16,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16" (1/1) ... [2024-11-28 03:01:16,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16" (1/1) ... [2024-11-28 03:01:16,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16" (1/1) ... [2024-11-28 03:01:16,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16" (1/1) ... [2024-11-28 03:01:16,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16" (1/1) ... [2024-11-28 03:01:16,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16" (1/1) ... [2024-11-28 03:01:16,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16" (1/1) ... [2024-11-28 03:01:16,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16" (1/1) ... [2024-11-28 03:01:16,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16" (1/1) ... [2024-11-28 03:01:16,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:01:16,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:01:16,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:01:16,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:01:16,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16" (1/1) ... [2024-11-28 03:01:16,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:01:16,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:01:16,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:01:16,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:01:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:01:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 03:01:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 03:01:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:01:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-28 03:01:16,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-28 03:01:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:01:16,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:01:16,414 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:01:16,567 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:01:16,570 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:01:16,829 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:01:16,829 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:01:16,847 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:01:16,848 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:01:16,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:16 BoogieIcfgContainer [2024-11-28 03:01:16,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:01:16,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:01:16,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:01:16,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:01:16,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:01:15" (1/3) ... [2024-11-28 03:01:16,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583ce1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:01:16, skipping insertion in model container [2024-11-28 03:01:16,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:16" (2/3) ... [2024-11-28 03:01:16,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583ce1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:01:16, skipping insertion in model container [2024-11-28 03:01:16,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:16" (3/3) ... [2024-11-28 03:01:16,865 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array.i [2024-11-28 03:01:16,882 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:01:16,884 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-in-array.i that has 2 procedures, 80 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2024-11-28 03:01:16,886 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:01:16,962 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-28 03:01:17,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 84 transitions, 175 flow [2024-11-28 03:01:17,086 INFO L124 PetriNetUnfolderBase]: 6/116 cut-off events. [2024-11-28 03:01:17,090 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-28 03:01:17,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 116 events. 6/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 195 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 55. Up to 4 conditions per place. [2024-11-28 03:01:17,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 84 transitions, 175 flow [2024-11-28 03:01:17,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 84 transitions, 175 flow [2024-11-28 03:01:17,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:01:17,120 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68c0710c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:01:17,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-28 03:01:17,136 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:01:17,136 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-28 03:01:17,137 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:01:17,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:01:17,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:17,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:01:17,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:17,144 INFO L85 PathProgramCache]: Analyzing trace with hash 456909824, now seen corresponding path program 1 times [2024-11-28 03:01:17,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:17,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856171094] [2024-11-28 03:01:17,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:17,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:17,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:17,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856171094] [2024-11-28 03:01:17,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856171094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:17,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:17,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:01:17,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247409887] [2024-11-28 03:01:17,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:17,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:01:17,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:17,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:01:17,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:01:17,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 84 [2024-11-28 03:01:17,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:17,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:01:17,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 84 [2024-11-28 03:01:17,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:01:18,080 INFO L124 PetriNetUnfolderBase]: 1/118 cut-off events. [2024-11-28 03:01:18,081 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-28 03:01:18,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 118 events. 1/118 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 168 event pairs, 0 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 23. Up to 16 conditions per place. [2024-11-28 03:01:18,082 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 11 selfloop transitions, 2 changer transitions 6/86 dead transitions. [2024-11-28 03:01:18,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 86 transitions, 215 flow [2024-11-28 03:01:18,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:01:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:01:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 432 transitions. [2024-11-28 03:01:18,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2024-11-28 03:01:18,104 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 175 flow. Second operand 6 states and 432 transitions. [2024-11-28 03:01:18,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 86 transitions, 215 flow [2024-11-28 03:01:18,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:01:18,119 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 185 flow [2024-11-28 03:01:18,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2024-11-28 03:01:18,127 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2024-11-28 03:01:18,127 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 185 flow [2024-11-28 03:01:18,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:18,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:01:18,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:18,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:01:18,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:01:18,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:18,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1547791774, now seen corresponding path program 1 times [2024-11-28 03:01:18,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:18,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870131018] [2024-11-28 03:01:18,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:18,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:18,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:18,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870131018] [2024-11-28 03:01:18,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870131018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:18,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:18,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:01:18,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713096409] [2024-11-28 03:01:18,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:18,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:01:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:18,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:01:18,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:01:19,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 84 [2024-11-28 03:01:19,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:19,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:01:19,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 84 [2024-11-28 03:01:19,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:01:19,207 INFO L124 PetriNetUnfolderBase]: 70/349 cut-off events. [2024-11-28 03:01:19,208 INFO L125 PetriNetUnfolderBase]: For 25/28 co-relation queries the response was YES. [2024-11-28 03:01:19,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 349 events. 70/349 cut-off events. For 25/28 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1677 event pairs, 35 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 487. Up to 150 conditions per place. [2024-11-28 03:01:19,213 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 23 selfloop transitions, 22 changer transitions 0/101 dead transitions. [2024-11-28 03:01:19,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 101 transitions, 317 flow [2024-11-28 03:01:19,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:01:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:01:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 388 transitions. [2024-11-28 03:01:19,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7698412698412699 [2024-11-28 03:01:19,221 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 185 flow. Second operand 6 states and 388 transitions. [2024-11-28 03:01:19,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 101 transitions, 317 flow [2024-11-28 03:01:19,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 101 transitions, 303 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-28 03:01:19,226 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 321 flow [2024-11-28 03:01:19,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2024-11-28 03:01:19,229 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 10 predicate places. [2024-11-28 03:01:19,229 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 321 flow [2024-11-28 03:01:19,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:19,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:01:19,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:19,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:01:19,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:01:19,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:19,232 INFO L85 PathProgramCache]: Analyzing trace with hash -591239081, now seen corresponding path program 1 times [2024-11-28 03:01:19,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:19,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182507944] [2024-11-28 03:01:19,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:19,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:19,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:19,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182507944] [2024-11-28 03:01:19,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182507944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:19,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:19,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:01:19,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75082279] [2024-11-28 03:01:19,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:19,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:01:19,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:19,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:01:19,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:01:19,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 84 [2024-11-28 03:01:19,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:19,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:01:19,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 84 [2024-11-28 03:01:19,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:01:20,042 INFO L124 PetriNetUnfolderBase]: 130/477 cut-off events. [2024-11-28 03:01:20,043 INFO L125 PetriNetUnfolderBase]: For 138/150 co-relation queries the response was YES. [2024-11-28 03:01:20,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 477 events. 130/477 cut-off events. For 138/150 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2463 event pairs, 23 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 976. Up to 238 conditions per place. [2024-11-28 03:01:20,050 INFO L140 encePairwiseOnDemand]: 69/84 looper letters, 33 selfloop transitions, 48 changer transitions 8/144 dead transitions. [2024-11-28 03:01:20,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 144 transitions, 639 flow [2024-11-28 03:01:20,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:01:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:01:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2024-11-28 03:01:20,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2024-11-28 03:01:20,055 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 321 flow. Second operand 6 states and 429 transitions. [2024-11-28 03:01:20,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 144 transitions, 639 flow [2024-11-28 03:01:20,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 144 transitions, 639 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:01:20,064 INFO L231 Difference]: Finished difference. Result has 103 places, 136 transitions, 693 flow [2024-11-28 03:01:20,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=103, PETRI_TRANSITIONS=136} [2024-11-28 03:01:20,067 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 20 predicate places. [2024-11-28 03:01:20,068 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 693 flow [2024-11-28 03:01:20,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:20,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:01:20,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:20,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:01:20,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:01:20,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:20,070 INFO L85 PathProgramCache]: Analyzing trace with hash 419467918, now seen corresponding path program 1 times [2024-11-28 03:01:20,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:20,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109640960] [2024-11-28 03:01:20,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:20,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:20,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:20,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109640960] [2024-11-28 03:01:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109640960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:20,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:20,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:01:20,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090949793] [2024-11-28 03:01:20,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:20,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:01:20,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:20,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:01:20,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:01:20,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 84 [2024-11-28 03:01:20,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 136 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:20,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:01:20,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 84 [2024-11-28 03:01:20,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:01:20,923 INFO L124 PetriNetUnfolderBase]: 142/505 cut-off events. [2024-11-28 03:01:20,923 INFO L125 PetriNetUnfolderBase]: For 468/496 co-relation queries the response was YES. [2024-11-28 03:01:20,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 505 events. 142/505 cut-off events. For 468/496 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2810 event pairs, 10 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 1464. Up to 241 conditions per place. [2024-11-28 03:01:20,929 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 73 selfloop transitions, 25 changer transitions 13/164 dead transitions. [2024-11-28 03:01:20,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1076 flow [2024-11-28 03:01:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:01:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:01:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2024-11-28 03:01:20,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7876984126984127 [2024-11-28 03:01:20,931 INFO L175 Difference]: Start difference. First operand has 103 places, 136 transitions, 693 flow. Second operand 6 states and 397 transitions. [2024-11-28 03:01:20,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1076 flow [2024-11-28 03:01:20,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 164 transitions, 1058 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-28 03:01:20,948 INFO L231 Difference]: Finished difference. Result has 105 places, 151 transitions, 910 flow [2024-11-28 03:01:20,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=105, PETRI_TRANSITIONS=151} [2024-11-28 03:01:20,952 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2024-11-28 03:01:20,952 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 151 transitions, 910 flow [2024-11-28 03:01:20,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:20,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:01:20,953 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:20,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:01:20,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:01:20,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:20,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1897603587, now seen corresponding path program 1 times [2024-11-28 03:01:20,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:20,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596427377] [2024-11-28 03:01:20,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:20,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:01:20,998 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:01:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:01:21,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:01:21,050 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:01:21,050 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-28 03:01:21,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-11-28 03:01:21,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-11-28 03:01:21,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-11-28 03:01:21,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-11-28 03:01:21,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:01:21,056 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-28 03:01:21,059 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-28 03:01:21,059 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-28 03:01:21,096 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-28 03:01:21,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 102 transitions, 220 flow [2024-11-28 03:01:21,130 INFO L124 PetriNetUnfolderBase]: 11/199 cut-off events. [2024-11-28 03:01:21,130 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-28 03:01:21,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 199 events. 11/199 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 412 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 118. Up to 8 conditions per place. [2024-11-28 03:01:21,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 102 transitions, 220 flow [2024-11-28 03:01:21,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 102 transitions, 220 flow [2024-11-28 03:01:21,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:01:21,134 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68c0710c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:01:21,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-28 03:01:21,140 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:01:21,140 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-28 03:01:21,140 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:01:21,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:01:21,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:21,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-28 03:01:21,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:21,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1353497894, now seen corresponding path program 1 times [2024-11-28 03:01:21,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:21,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653481885] [2024-11-28 03:01:21,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:21,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:21,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:21,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653481885] [2024-11-28 03:01:21,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653481885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:21,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:21,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:01:21,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529844287] [2024-11-28 03:01:21,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:21,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:01:21,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:21,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:01:21,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:01:21,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 102 [2024-11-28 03:01:21,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:21,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:01:21,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 102 [2024-11-28 03:01:21,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:01:21,417 INFO L124 PetriNetUnfolderBase]: 3/198 cut-off events. [2024-11-28 03:01:21,417 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-28 03:01:21,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 198 events. 3/198 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 432 event pairs, 0 based on Foata normal form. 2/190 useless extension candidates. Maximal degree in co-relation 141. Up to 32 conditions per place. [2024-11-28 03:01:21,418 INFO L140 encePairwiseOnDemand]: 91/102 looper letters, 14 selfloop transitions, 2 changer transitions 6/105 dead transitions. [2024-11-28 03:01:21,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 268 flow [2024-11-28 03:01:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:01:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:01:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2024-11-28 03:01:21,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8676470588235294 [2024-11-28 03:01:21,420 INFO L175 Difference]: Start difference. First operand has 102 places, 102 transitions, 220 flow. Second operand 6 states and 531 transitions. [2024-11-28 03:01:21,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 268 flow [2024-11-28 03:01:21,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:01:21,423 INFO L231 Difference]: Finished difference. Result has 111 places, 99 transitions, 234 flow [2024-11-28 03:01:21,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=111, PETRI_TRANSITIONS=99} [2024-11-28 03:01:21,424 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 9 predicate places. [2024-11-28 03:01:21,424 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 99 transitions, 234 flow [2024-11-28 03:01:21,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:21,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:01:21,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:21,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:01:21,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-28 03:01:21,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:21,426 INFO L85 PathProgramCache]: Analyzing trace with hash -651203704, now seen corresponding path program 1 times [2024-11-28 03:01:21,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:21,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077012121] [2024-11-28 03:01:21,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:21,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:21,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:21,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077012121] [2024-11-28 03:01:21,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077012121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:21,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:21,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:01:21,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495320977] [2024-11-28 03:01:21,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:21,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:01:21,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:21,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:01:21,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:01:21,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 102 [2024-11-28 03:01:21,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 99 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:21,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:01:21,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 102 [2024-11-28 03:01:21,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:01:22,556 INFO L124 PetriNetUnfolderBase]: 902/2602 cut-off events. [2024-11-28 03:01:22,556 INFO L125 PetriNetUnfolderBase]: For 186/192 co-relation queries the response was YES. [2024-11-28 03:01:22,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4377 conditions, 2602 events. 902/2602 cut-off events. For 186/192 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 19721 event pairs, 512 based on Foata normal form. 0/2364 useless extension candidates. Maximal degree in co-relation 3404. Up to 1384 conditions per place. [2024-11-28 03:01:22,579 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 31 selfloop transitions, 38 changer transitions 0/137 dead transitions. [2024-11-28 03:01:22,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 137 transitions, 453 flow [2024-11-28 03:01:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:01:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:01:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 483 transitions. [2024-11-28 03:01:22,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7892156862745098 [2024-11-28 03:01:22,582 INFO L175 Difference]: Start difference. First operand has 111 places, 99 transitions, 234 flow. Second operand 6 states and 483 transitions. [2024-11-28 03:01:22,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 137 transitions, 453 flow [2024-11-28 03:01:22,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 137 transitions, 441 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-28 03:01:22,591 INFO L231 Difference]: Finished difference. Result has 113 places, 136 transitions, 476 flow [2024-11-28 03:01:22,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=113, PETRI_TRANSITIONS=136} [2024-11-28 03:01:22,592 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 11 predicate places. [2024-11-28 03:01:22,592 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 136 transitions, 476 flow [2024-11-28 03:01:22,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:22,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:01:22,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:22,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:01:22,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-28 03:01:22,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1426098925, now seen corresponding path program 1 times [2024-11-28 03:01:22,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:22,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330610720] [2024-11-28 03:01:22,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:22,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:22,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330610720] [2024-11-28 03:01:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330610720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:22,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:22,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:01:22,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615838648] [2024-11-28 03:01:22,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:22,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:01:22,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:22,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:01:22,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:01:23,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 102 [2024-11-28 03:01:23,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 136 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:23,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:01:23,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 102 [2024-11-28 03:01:23,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:01:24,035 INFO L124 PetriNetUnfolderBase]: 1866/4588 cut-off events. [2024-11-28 03:01:24,036 INFO L125 PetriNetUnfolderBase]: For 1537/1622 co-relation queries the response was YES. [2024-11-28 03:01:24,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10753 conditions, 4588 events. 1866/4588 cut-off events. For 1537/1622 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 35984 event pairs, 434 based on Foata normal form. 0/4289 useless extension candidates. Maximal degree in co-relation 8549. Up to 2580 conditions per place. [2024-11-28 03:01:24,073 INFO L140 encePairwiseOnDemand]: 83/102 looper letters, 63 selfloop transitions, 92 changer transitions 0/231 dead transitions. [2024-11-28 03:01:24,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 231 transitions, 1222 flow [2024-11-28 03:01:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:01:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:01:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2024-11-28 03:01:24,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8676470588235294 [2024-11-28 03:01:24,077 INFO L175 Difference]: Start difference. First operand has 113 places, 136 transitions, 476 flow. Second operand 6 states and 531 transitions. [2024-11-28 03:01:24,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 231 transitions, 1222 flow [2024-11-28 03:01:24,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 231 transitions, 1222 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:01:24,095 INFO L231 Difference]: Finished difference. Result has 123 places, 223 transitions, 1312 flow [2024-11-28 03:01:24,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=123, PETRI_TRANSITIONS=223} [2024-11-28 03:01:24,096 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2024-11-28 03:01:24,097 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 223 transitions, 1312 flow [2024-11-28 03:01:24,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:24,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:01:24,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:24,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:01:24,098 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-28 03:01:24,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash 571204766, now seen corresponding path program 1 times [2024-11-28 03:01:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467682288] [2024-11-28 03:01:24,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:24,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:24,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467682288] [2024-11-28 03:01:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467682288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:01:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590479231] [2024-11-28 03:01:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:24,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:01:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:24,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:01:24,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:01:24,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 102 [2024-11-28 03:01:24,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 223 transitions, 1312 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:24,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:01:24,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 102 [2024-11-28 03:01:24,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:01:25,637 INFO L124 PetriNetUnfolderBase]: 2321/5558 cut-off events. [2024-11-28 03:01:25,638 INFO L125 PetriNetUnfolderBase]: For 5336/5485 co-relation queries the response was YES. [2024-11-28 03:01:25,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17509 conditions, 5558 events. 2321/5558 cut-off events. For 5336/5485 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 44778 event pairs, 294 based on Foata normal form. 2/5328 useless extension candidates. Maximal degree in co-relation 14216. Up to 3135 conditions per place. [2024-11-28 03:01:25,692 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 145 selfloop transitions, 76 changer transitions 0/296 dead transitions. [2024-11-28 03:01:25,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 296 transitions, 2246 flow [2024-11-28 03:01:25,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:01:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:01:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2024-11-28 03:01:25,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8071895424836601 [2024-11-28 03:01:25,697 INFO L175 Difference]: Start difference. First operand has 123 places, 223 transitions, 1312 flow. Second operand 6 states and 494 transitions. [2024-11-28 03:01:25,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 296 transitions, 2246 flow [2024-11-28 03:01:25,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 296 transitions, 2228 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-28 03:01:25,757 INFO L231 Difference]: Finished difference. Result has 133 places, 294 transitions, 2152 flow [2024-11-28 03:01:25,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2152, PETRI_PLACES=133, PETRI_TRANSITIONS=294} [2024-11-28 03:01:25,760 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2024-11-28 03:01:25,761 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 294 transitions, 2152 flow [2024-11-28 03:01:25,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:25,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:01:25,762 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:25,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:01:25,762 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-28 03:01:25,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash 269766459, now seen corresponding path program 1 times [2024-11-28 03:01:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:25,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049453471] [2024-11-28 03:01:25,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:25,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:26,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:26,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049453471] [2024-11-28 03:01:26,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049453471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:26,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:26,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:01:26,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103219570] [2024-11-28 03:01:26,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:26,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:01:26,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:26,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:01:26,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:01:27,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 102 [2024-11-28 03:01:27,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 294 transitions, 2152 flow. Second operand has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:27,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:01:27,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 102 [2024-11-28 03:01:27,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:01:29,735 INFO L124 PetriNetUnfolderBase]: 3293/7899 cut-off events. [2024-11-28 03:01:29,735 INFO L125 PetriNetUnfolderBase]: For 12941/13245 co-relation queries the response was YES. [2024-11-28 03:01:29,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27623 conditions, 7899 events. 3293/7899 cut-off events. For 12941/13245 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 67121 event pairs, 332 based on Foata normal form. 84/7676 useless extension candidates. Maximal degree in co-relation 23481. Up to 3814 conditions per place. [2024-11-28 03:01:29,802 INFO L140 encePairwiseOnDemand]: 76/102 looper letters, 229 selfloop transitions, 135 changer transitions 0/427 dead transitions. [2024-11-28 03:01:29,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 427 transitions, 3993 flow [2024-11-28 03:01:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:01:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-28 03:01:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1151 transitions. [2024-11-28 03:01:29,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6637831603229527 [2024-11-28 03:01:29,807 INFO L175 Difference]: Start difference. First operand has 133 places, 294 transitions, 2152 flow. Second operand 17 states and 1151 transitions. [2024-11-28 03:01:29,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 427 transitions, 3993 flow [2024-11-28 03:01:29,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 427 transitions, 3849 flow, removed 72 selfloop flow, removed 0 redundant places. [2024-11-28 03:01:29,883 INFO L231 Difference]: Finished difference. Result has 157 places, 353 transitions, 3118 flow [2024-11-28 03:01:29,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3118, PETRI_PLACES=157, PETRI_TRANSITIONS=353} [2024-11-28 03:01:29,885 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 55 predicate places. [2024-11-28 03:01:29,885 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 353 transitions, 3118 flow [2024-11-28 03:01:29,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:29,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:01:29,886 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:29,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:01:29,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-28 03:01:29,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1893397025, now seen corresponding path program 1 times [2024-11-28 03:01:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:29,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923624683] [2024-11-28 03:01:29,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:29,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:30,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:30,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923624683] [2024-11-28 03:01:30,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923624683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:30,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:30,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:01:30,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875268682] [2024-11-28 03:01:30,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:30,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:01:30,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:30,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:01:30,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:01:31,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2024-11-28 03:01:31,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 353 transitions, 3118 flow. Second operand has 14 states, 14 states have (on average 64.5) internal successors, (903), 14 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:31,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:01:31,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2024-11-28 03:01:31,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:01:34,073 INFO L124 PetriNetUnfolderBase]: 3987/8986 cut-off events. [2024-11-28 03:01:34,073 INFO L125 PetriNetUnfolderBase]: For 21477/22104 co-relation queries the response was YES. [2024-11-28 03:01:34,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36266 conditions, 8986 events. 3987/8986 cut-off events. For 21477/22104 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 75698 event pairs, 258 based on Foata normal form. 293/9029 useless extension candidates. Maximal degree in co-relation 31623. Up to 3195 conditions per place. [2024-11-28 03:01:34,144 INFO L140 encePairwiseOnDemand]: 80/102 looper letters, 366 selfloop transitions, 366 changer transitions 1/805 dead transitions. [2024-11-28 03:01:34,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 805 transitions, 8690 flow [2024-11-28 03:01:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 03:01:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-28 03:01:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1662 transitions. [2024-11-28 03:01:34,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7084398976982097 [2024-11-28 03:01:34,149 INFO L175 Difference]: Start difference. First operand has 157 places, 353 transitions, 3118 flow. Second operand 23 states and 1662 transitions. [2024-11-28 03:01:34,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 805 transitions, 8690 flow [2024-11-28 03:01:34,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 805 transitions, 8632 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-28 03:01:34,260 INFO L231 Difference]: Finished difference. Result has 183 places, 671 transitions, 7920 flow [2024-11-28 03:01:34,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=3078, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7920, PETRI_PLACES=183, PETRI_TRANSITIONS=671} [2024-11-28 03:01:34,261 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 81 predicate places. [2024-11-28 03:01:34,263 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 671 transitions, 7920 flow [2024-11-28 03:01:34,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 64.5) internal successors, (903), 14 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:34,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:01:34,264 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:34,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:01:34,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-28 03:01:34,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:34,265 INFO L85 PathProgramCache]: Analyzing trace with hash 272062741, now seen corresponding path program 2 times [2024-11-28 03:01:34,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:34,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572211778] [2024-11-28 03:01:34,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:01:34,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:34,291 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:01:34,292 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:01:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:34,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:34,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572211778] [2024-11-28 03:01:34,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572211778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:34,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:34,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:01:34,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993092410] [2024-11-28 03:01:34,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:34,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:01:34,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:34,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:01:34,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:01:35,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 102 [2024-11-28 03:01:35,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 671 transitions, 7920 flow. Second operand has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:35,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:01:35,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 102 [2024-11-28 03:01:35,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:01:38,201 INFO L124 PetriNetUnfolderBase]: 4552/10582 cut-off events. [2024-11-28 03:01:38,201 INFO L125 PetriNetUnfolderBase]: For 57795/58358 co-relation queries the response was YES. [2024-11-28 03:01:38,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52800 conditions, 10582 events. 4552/10582 cut-off events. For 57795/58358 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 92202 event pairs, 160 based on Foata normal form. 252/10545 useless extension candidates. Maximal degree in co-relation 51694. Up to 4285 conditions per place. [2024-11-28 03:01:38,447 INFO L140 encePairwiseOnDemand]: 80/102 looper letters, 557 selfloop transitions, 371 changer transitions 0/1000 dead transitions. [2024-11-28 03:01:38,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1000 transitions, 14068 flow [2024-11-28 03:01:38,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 03:01:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-28 03:01:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1429 transitions. [2024-11-28 03:01:38,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6671335200746965 [2024-11-28 03:01:38,453 INFO L175 Difference]: Start difference. First operand has 183 places, 671 transitions, 7920 flow. Second operand 21 states and 1429 transitions. [2024-11-28 03:01:38,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1000 transitions, 14068 flow [2024-11-28 03:01:38,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 1000 transitions, 13844 flow, removed 106 selfloop flow, removed 6 redundant places. [2024-11-28 03:01:38,835 INFO L231 Difference]: Finished difference. Result has 204 places, 894 transitions, 12467 flow [2024-11-28 03:01:38,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=7696, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=12467, PETRI_PLACES=204, PETRI_TRANSITIONS=894} [2024-11-28 03:01:38,836 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 102 predicate places. [2024-11-28 03:01:38,836 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 894 transitions, 12467 flow [2024-11-28 03:01:38,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:38,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:01:38,837 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:38,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:01:38,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-28 03:01:38,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:38,838 INFO L85 PathProgramCache]: Analyzing trace with hash 120663575, now seen corresponding path program 3 times [2024-11-28 03:01:38,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:38,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721717560] [2024-11-28 03:01:38,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:01:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:38,872 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 03:01:38,872 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:01:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:01:40,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:40,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721717560] [2024-11-28 03:01:40,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721717560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:01:40,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219892833] [2024-11-28 03:01:40,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:01:40,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:01:40,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:01:40,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:01:40,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:01:40,246 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 03:01:40,246 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:01:40,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 03:01:40,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:01:40,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:01:40,393 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:01:40,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:01:40,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 03:01:40,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-28 03:01:40,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:01:40,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-28 03:01:40,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:01:40,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-28 03:01:40,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-28 03:01:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:01:40,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:01:43,783 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_316 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_316 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_316 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_316 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-28 03:01:50,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:01:50,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2024-11-28 03:01:50,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:01:50,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2024-11-28 03:01:50,233 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-28 03:01:50,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-28 03:01:50,242 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-28 03:01:50,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-28 03:01:50,250 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-28 03:01:50,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-28 03:01:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:01:50,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219892833] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:01:50,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:01:50,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 31 [2024-11-28 03:01:50,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425687401] [2024-11-28 03:01:50,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:01:50,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 03:01:50,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:50,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 03:01:50,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=784, Unknown=59, NotChecked=58, Total=992 [2024-11-28 03:01:50,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 102 [2024-11-28 03:01:50,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 894 transitions, 12467 flow. Second operand has 32 states, 32 states have (on average 38.4375) internal successors, (1230), 32 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:50,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:01:50,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 102 [2024-11-28 03:01:50,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:02:00,964 INFO L124 PetriNetUnfolderBase]: 14598/29828 cut-off events. [2024-11-28 03:02:00,964 INFO L125 PetriNetUnfolderBase]: For 225946/228716 co-relation queries the response was YES. [2024-11-28 03:02:01,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157164 conditions, 29828 events. 14598/29828 cut-off events. For 225946/228716 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 284729 event pairs, 2368 based on Foata normal form. 561/28905 useless extension candidates. Maximal degree in co-relation 154682. Up to 12171 conditions per place. [2024-11-28 03:02:01,198 INFO L140 encePairwiseOnDemand]: 66/102 looper letters, 1125 selfloop transitions, 639 changer transitions 1/1808 dead transitions. [2024-11-28 03:02:01,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 1808 transitions, 30102 flow [2024-11-28 03:02:01,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-28 03:02:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-28 03:02:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 1690 transitions. [2024-11-28 03:02:01,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.460239651416122 [2024-11-28 03:02:01,203 INFO L175 Difference]: Start difference. First operand has 204 places, 894 transitions, 12467 flow. Second operand 36 states and 1690 transitions. [2024-11-28 03:02:01,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 1808 transitions, 30102 flow [2024-11-28 03:02:02,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 1808 transitions, 29574 flow, removed 243 selfloop flow, removed 12 redundant places. [2024-11-28 03:02:02,394 INFO L231 Difference]: Finished difference. Result has 242 places, 1311 transitions, 22401 flow [2024-11-28 03:02:02,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=12177, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=22401, PETRI_PLACES=242, PETRI_TRANSITIONS=1311} [2024-11-28 03:02:02,395 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 140 predicate places. [2024-11-28 03:02:02,395 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 1311 transitions, 22401 flow [2024-11-28 03:02:02,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 38.4375) internal successors, (1230), 32 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:02,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:02:02,396 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:02:02,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:02:02,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 03:02:02,597 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-28 03:02:02,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1081491731, now seen corresponding path program 4 times [2024-11-28 03:02:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:02,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610758721] [2024-11-28 03:02:02,597 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:02:02,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:02,619 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:02:02,620 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:02:03,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:03,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610758721] [2024-11-28 03:02:03,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610758721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:02:03,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269748349] [2024-11-28 03:02:03,114 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:02:03,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:03,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:02:03,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:02:03,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:02:03,255 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:02:03,255 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:03,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 03:02:03,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:02:03,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:02:03,284 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:02:03,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:02:03,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 03:02:03,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-28 03:02:03,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:03,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-28 03:02:03,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:03,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-28 03:02:03,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-28 03:02:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:02:03,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:02:03,603 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_380 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)))))))) is different from false [2024-11-28 03:02:03,628 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-28 03:02:03,653 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 1)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 2)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-28 03:02:03,738 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_380 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_380 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_380) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4))))))) is different from false [2024-11-28 03:02:03,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:03,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-28 03:02:03,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:03,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 35 [2024-11-28 03:02:03,787 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-28 03:02:03,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-28 03:02:03,795 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-28 03:02:03,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-28 03:02:03,809 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-28 03:02:03,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-28 03:02:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:02:03,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269748349] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:02:03,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:02:03,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-28 03:02:03,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66685467] [2024-11-28 03:02:03,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:02:03,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 03:02:03,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:02:03,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 03:02:03,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=228, Unknown=10, NotChecked=132, Total=420 [2024-11-28 03:02:04,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-11-28 03:02:04,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 1311 transitions, 22401 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:04,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:02:04,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-11-28 03:02:04,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:02:15,425 INFO L124 PetriNetUnfolderBase]: 16006/33584 cut-off events. [2024-11-28 03:02:15,425 INFO L125 PetriNetUnfolderBase]: For 332671/334564 co-relation queries the response was YES. [2024-11-28 03:02:15,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194641 conditions, 33584 events. 16006/33584 cut-off events. For 332671/334564 co-relation queries the response was YES. Maximal size of possible extension queue 1244. Compared 333952 event pairs, 3312 based on Foata normal form. 728/32761 useless extension candidates. Maximal degree in co-relation 192317. Up to 17720 conditions per place. [2024-11-28 03:02:15,910 INFO L140 encePairwiseOnDemand]: 76/102 looper letters, 818 selfloop transitions, 973 changer transitions 1/1846 dead transitions. [2024-11-28 03:02:15,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 1846 transitions, 35625 flow [2024-11-28 03:02:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 03:02:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-28 03:02:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1169 transitions. [2024-11-28 03:02:15,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5730392156862745 [2024-11-28 03:02:15,914 INFO L175 Difference]: Start difference. First operand has 242 places, 1311 transitions, 22401 flow. Second operand 20 states and 1169 transitions. [2024-11-28 03:02:15,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 1846 transitions, 35625 flow [2024-11-28 03:02:17,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 1846 transitions, 35358 flow, removed 96 selfloop flow, removed 16 redundant places. [2024-11-28 03:02:17,986 INFO L231 Difference]: Finished difference. Result has 251 places, 1695 transitions, 33355 flow [2024-11-28 03:02:17,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=22134, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=630, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=33355, PETRI_PLACES=251, PETRI_TRANSITIONS=1695} [2024-11-28 03:02:17,987 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 149 predicate places. [2024-11-28 03:02:17,987 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 1695 transitions, 33355 flow [2024-11-28 03:02:17,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:17,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:02:17,988 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:02:17,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:02:18,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-28 03:02:18,189 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-28 03:02:18,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:18,189 INFO L85 PathProgramCache]: Analyzing trace with hash 724096859, now seen corresponding path program 5 times [2024-11-28 03:02:18,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:18,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744832471] [2024-11-28 03:02:18,189 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:02:18,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:18,208 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-28 03:02:18,209 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:02:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:18,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744832471] [2024-11-28 03:02:18,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744832471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:02:18,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424030115] [2024-11-28 03:02:18,882 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:02:18,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:18,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:02:18,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:02:18,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:02:19,004 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-28 03:02:19,005 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:19,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 03:02:19,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:02:19,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:02:19,067 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:02:19,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:02:19,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 03:02:19,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-28 03:02:19,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:19,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-28 03:02:19,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:19,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-28 03:02:19,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-28 03:02:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:02:19,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:02:19,330 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_444 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_444 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))) (forall ((v_ArrVal_444 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)))) (forall ((v_ArrVal_444 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2024-11-28 03:02:19,370 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_444 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_444 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_444 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)))) (forall ((v_ArrVal_444 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-28 03:02:19,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_444 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_444 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_444 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_444 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)))))))) is different from false [2024-11-28 03:02:19,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_444 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_444 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_444 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_444 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-28 03:02:19,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 1)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 2)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_444 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_444 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_444 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_444 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_444) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4))))))) is different from false [2024-11-28 03:02:19,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:19,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-28 03:02:19,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:19,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 35 [2024-11-28 03:02:19,531 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-28 03:02:19,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-28 03:02:19,539 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-28 03:02:19,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-28 03:02:19,546 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-28 03:02:19,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-28 03:02:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:02:19,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424030115] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:02:19,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:02:19,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-28 03:02:19,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067396525] [2024-11-28 03:02:19,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:02:19,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 03:02:19,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:02:19,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 03:02:19,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=206, Unknown=5, NotChecked=160, Total=420 [2024-11-28 03:02:19,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-11-28 03:02:19,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 1695 transitions, 33355 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:19,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:02:19,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-11-28 03:02:19,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:02:33,846 INFO L124 PetriNetUnfolderBase]: 16846/35987 cut-off events. [2024-11-28 03:02:33,846 INFO L125 PetriNetUnfolderBase]: For 485498/488519 co-relation queries the response was YES. [2024-11-28 03:02:34,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226893 conditions, 35987 events. 16846/35987 cut-off events. For 485498/488519 co-relation queries the response was YES. Maximal size of possible extension queue 1388. Compared 367699 event pairs, 3637 based on Foata normal form. 967/35309 useless extension candidates. Maximal degree in co-relation 224563. Up to 20630 conditions per place. [2024-11-28 03:02:34,222 INFO L140 encePairwiseOnDemand]: 76/102 looper letters, 959 selfloop transitions, 1003 changer transitions 1/2017 dead transitions. [2024-11-28 03:02:34,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 2017 transitions, 43596 flow [2024-11-28 03:02:34,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 03:02:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-28 03:02:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1167 transitions. [2024-11-28 03:02:34,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5720588235294117 [2024-11-28 03:02:34,225 INFO L175 Difference]: Start difference. First operand has 251 places, 1695 transitions, 33355 flow. Second operand 20 states and 1167 transitions. [2024-11-28 03:02:34,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 2017 transitions, 43596 flow [2024-11-28 03:02:37,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 2017 transitions, 42637 flow, removed 449 selfloop flow, removed 12 redundant places. [2024-11-28 03:02:37,536 INFO L231 Difference]: Finished difference. Result has 263 places, 1900 transitions, 41420 flow [2024-11-28 03:02:37,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=32512, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=818, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=804, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=41420, PETRI_PLACES=263, PETRI_TRANSITIONS=1900} [2024-11-28 03:02:37,538 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 161 predicate places. [2024-11-28 03:02:37,538 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 1900 transitions, 41420 flow [2024-11-28 03:02:37,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:37,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:02:37,539 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:02:37,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:02:37,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-28 03:02:37,739 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-28 03:02:37,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1749305001, now seen corresponding path program 6 times [2024-11-28 03:02:37,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:37,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569939374] [2024-11-28 03:02:37,740 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 03:02:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:37,779 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-11-28 03:02:37,779 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:02:38,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:38,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569939374] [2024-11-28 03:02:38,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569939374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:02:38,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006518874] [2024-11-28 03:02:38,749 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 03:02:38,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:38,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:02:38,751 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:02:38,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:02:38,994 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-11-28 03:02:38,994 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:38,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 03:02:39,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:02:39,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:02:39,074 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:02:39,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:02:39,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 03:02:39,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-28 03:02:39,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:39,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-28 03:02:39,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:39,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-28 03:02:39,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-28 03:02:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:02:39,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:02:39,436 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-28 03:02:39,457 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 2)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_508 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_508 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 1)))))))) is different from false [2024-11-28 03:02:39,525 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_508 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)))) (forall ((v_ArrVal_508 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))) (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-28 03:02:39,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_508) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-28 03:02:39,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:39,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-28 03:02:39,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:39,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 35 [2024-11-28 03:02:39,582 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-28 03:02:39,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-28 03:02:39,588 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-28 03:02:39,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-28 03:02:39,594 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-28 03:02:39,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-28 03:02:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:02:39,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006518874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:02:39,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:02:39,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 31 [2024-11-28 03:02:39,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949242925] [2024-11-28 03:02:39,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:02:39,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 03:02:39,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:02:39,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 03:02:39,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=680, Unknown=14, NotChecked=220, Total=992 [2024-11-28 03:02:39,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 102 [2024-11-28 03:02:39,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1900 transitions, 41420 flow. Second operand has 32 states, 32 states have (on average 38.4375) internal successors, (1230), 32 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:02:39,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:02:39,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 102 [2024-11-28 03:02:39,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:02:57,661 INFO L124 PetriNetUnfolderBase]: 17807/37446 cut-off events. [2024-11-28 03:02:57,662 INFO L125 PetriNetUnfolderBase]: For 562203/566352 co-relation queries the response was YES. [2024-11-28 03:02:58,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247602 conditions, 37446 events. 17807/37446 cut-off events. For 562203/566352 co-relation queries the response was YES. Maximal size of possible extension queue 1387. Compared 378858 event pairs, 2580 based on Foata normal form. 1080/36719 useless extension candidates. Maximal degree in co-relation 245075. Up to 13609 conditions per place. [2024-11-28 03:02:58,247 INFO L140 encePairwiseOnDemand]: 66/102 looper letters, 1573 selfloop transitions, 1445 changer transitions 1/3062 dead transitions. [2024-11-28 03:02:58,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 3062 transitions, 70382 flow [2024-11-28 03:02:58,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-28 03:02:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2024-11-28 03:02:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 1790 transitions. [2024-11-28 03:02:58,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46181630546955627 [2024-11-28 03:02:58,251 INFO L175 Difference]: Start difference. First operand has 263 places, 1900 transitions, 41420 flow. Second operand 38 states and 1790 transitions. [2024-11-28 03:02:58,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 3062 transitions, 70382 flow [2024-11-28 03:03:01,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 3062 transitions, 68937 flow, removed 588 selfloop flow, removed 14 redundant places. [2024-11-28 03:03:01,261 INFO L231 Difference]: Finished difference. Result has 296 places, 2370 transitions, 56589 flow [2024-11-28 03:03:01,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=40669, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=818, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=56589, PETRI_PLACES=296, PETRI_TRANSITIONS=2370} [2024-11-28 03:03:01,263 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 194 predicate places. [2024-11-28 03:03:01,263 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 2370 transitions, 56589 flow [2024-11-28 03:03:01,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 38.4375) internal successors, (1230), 32 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:03:01,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:03:01,264 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:03:01,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:03:01,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 03:03:01,468 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-28 03:03:01,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:01,468 INFO L85 PathProgramCache]: Analyzing trace with hash -667916983, now seen corresponding path program 7 times [2024-11-28 03:03:01,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:01,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278526036] [2024-11-28 03:03:01,468 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 03:03:01,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:03:02,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:02,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278526036] [2024-11-28 03:03:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278526036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:03:02,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965162130] [2024-11-28 03:03:02,102 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 03:03:02,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:03:02,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:03:02,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:03:02,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71b1a42-2bac-4fca-bf42-369ad46cec04/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process