./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:04:53,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:04:53,674 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 22:04:53,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:04:53,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:04:53,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:04:53,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:04:53,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:04:53,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:04:53,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:04:53,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:04:53,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:04:53,723 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:04:53,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:04:53,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:04:53,726 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:04:53,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:04:53,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:04:53,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:04:53,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:04:53,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:04:53,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:04:53,728 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 22:04:53,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:04:53,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:04:53,729 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:04:53,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:04:53,729 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:04:53,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:04:53,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:04:53,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:04:53,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:53,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:04:53,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:04:53,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:04:53,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:04:53,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:04:53,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:04:53,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:04:53,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:04:53,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:04:53,738 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f [2024-10-31 22:04:54,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:04:54,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:04:54,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:04:54,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:04:54,074 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:04:54,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i Unable to find full path for "g++" [2024-10-31 22:04:56,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:04:56,799 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:04:56,799 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2024-10-31 22:04:56,821 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/data/8d7d0a500/3be3ac74b9954c6fb1955938d3792afc/FLAGa51320650 [2024-10-31 22:04:57,046 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/data/8d7d0a500/3be3ac74b9954c6fb1955938d3792afc [2024-10-31 22:04:57,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:04:57,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:04:57,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:57,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:04:57,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:04:57,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:57" (1/1) ... [2024-10-31 22:04:57,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c0f9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57, skipping insertion in model container [2024-10-31 22:04:57,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:57" (1/1) ... [2024-10-31 22:04:57,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:04:57,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:57,664 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:04:57,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:57,789 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:04:57,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57 WrapperNode [2024-10-31 22:04:57,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:57,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:57,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:04:57,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:04:57,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57" (1/1) ... [2024-10-31 22:04:57,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57" (1/1) ... [2024-10-31 22:04:57,846 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-10-31 22:04:57,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:57,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:04:57,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:04:57,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:04:57,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57" (1/1) ... [2024-10-31 22:04:57,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57" (1/1) ... [2024-10-31 22:04:57,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57" (1/1) ... [2024-10-31 22:04:57,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57" (1/1) ... [2024-10-31 22:04:57,886 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57" (1/1) ... [2024-10-31 22:04:57,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57" (1/1) ... [2024-10-31 22:04:57,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57" (1/1) ... [2024-10-31 22:04:57,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57" (1/1) ... [2024-10-31 22:04:57,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:04:57,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:04:57,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:04:57,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:04:57,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57" (1/1) ... [2024-10-31 22:04:57,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:57,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:04:57,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:04:57,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:04:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:04:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:04:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:04:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:04:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-31 22:04:57,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-31 22:04:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:04:57,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:04:57,975 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:04:58,137 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:04:58,140 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:04:58,378 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:04:58,379 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:04:58,395 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:04:58,396 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-31 22:04:58,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:58 BoogieIcfgContainer [2024-10-31 22:04:58,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:04:58,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:04:58,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:04:58,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:04:58,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:04:57" (1/3) ... [2024-10-31 22:04:58,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab7a427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:58, skipping insertion in model container [2024-10-31 22:04:58,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:57" (2/3) ... [2024-10-31 22:04:58,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab7a427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:58, skipping insertion in model container [2024-10-31 22:04:58,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:58" (3/3) ... [2024-10-31 22:04:58,412 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2024-10-31 22:04:58,434 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:04:58,434 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-31 22:04:58,435 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:04:58,556 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-31 22:04:58,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 84 transitions, 175 flow [2024-10-31 22:04:58,695 INFO L124 PetriNetUnfolderBase]: 6/116 cut-off events. [2024-10-31 22:04:58,695 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 22:04:58,705 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 196 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-10-31 22:04:58,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 84 transitions, 175 flow [2024-10-31 22:04:58,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 84 transitions, 175 flow [2024-10-31 22:04:58,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:04:58,746 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;@6839c848, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:04:58,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-31 22:04:58,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:04:58,787 INFO L124 PetriNetUnfolderBase]: 3/49 cut-off events. [2024-10-31 22:04:58,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:04:58,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:04:58,792 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:58,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 22:04:58,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:58,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2102882945, now seen corresponding path program 1 times [2024-10-31 22:04:58,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:58,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924058438] [2024-10-31 22:04:58,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:58,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:00,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:00,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924058438] [2024-10-31 22:05:00,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924058438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:00,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:00,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:05:00,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494660961] [2024-10-31 22:05:00,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:00,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:05:00,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:00,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:05:00,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:05:00,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 84 [2024-10-31 22:05:00,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 175 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-10-31 22:05:00,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:00,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 84 [2024-10-31 22:05:00,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:00,572 INFO L124 PetriNetUnfolderBase]: 71/365 cut-off events. [2024-10-31 22:05:00,572 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 22:05:00,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 365 events. 71/365 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1796 event pairs, 32 based on Foata normal form. 13/339 useless extension candidates. Maximal degree in co-relation 471. Up to 151 conditions per place. [2024-10-31 22:05:00,578 INFO L140 encePairwiseOnDemand]: 70/84 looper letters, 23 selfloop transitions, 22 changer transitions 1/102 dead transitions. [2024-10-31 22:05:00,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 102 transitions, 301 flow [2024-10-31 22:05:00,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:05:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:05:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 391 transitions. [2024-10-31 22:05:00,595 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7757936507936508 [2024-10-31 22:05:00,597 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 175 flow. Second operand 6 states and 391 transitions. [2024-10-31 22:05:00,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 102 transitions, 301 flow [2024-10-31 22:05:00,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 102 transitions, 301 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:05:00,609 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 317 flow [2024-10-31 22:05:00,611 INFO L260 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2024-10-31 22:05:00,617 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, 10 predicate places. [2024-10-31 22:05:00,618 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 317 flow [2024-10-31 22:05:00,618 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-10-31 22:05:00,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:00,619 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:00,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:05:00,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 22:05:00,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1651711161, now seen corresponding path program 1 times [2024-10-31 22:05:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:00,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037335330] [2024-10-31 22:05:00,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:00,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:00,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:00,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037335330] [2024-10-31 22:05:00,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037335330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:00,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:00,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:05:00,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207795150] [2024-10-31 22:05:00,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:00,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:05:00,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:00,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:05:00,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:05:00,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 84 [2024-10-31 22:05:00,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 317 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-10-31 22:05:00,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:00,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 84 [2024-10-31 22:05:00,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:00,979 INFO L124 PetriNetUnfolderBase]: 33/232 cut-off events. [2024-10-31 22:05:00,979 INFO L125 PetriNetUnfolderBase]: For 31/40 co-relation queries the response was YES. [2024-10-31 22:05:00,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 232 events. 33/232 cut-off events. For 31/40 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 743 event pairs, 0 based on Foata normal form. 2/223 useless extension candidates. Maximal degree in co-relation 304. Up to 45 conditions per place. [2024-10-31 22:05:00,982 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 11 selfloop transitions, 2 changer transitions 5/106 dead transitions. [2024-10-31 22:05:00,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 106 transitions, 363 flow [2024-10-31 22:05:00,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:05:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:05:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 427 transitions. [2024-10-31 22:05:00,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8472222222222222 [2024-10-31 22:05:00,990 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 317 flow. Second operand 6 states and 427 transitions. [2024-10-31 22:05:00,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 106 transitions, 363 flow [2024-10-31 22:05:00,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 106 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:05:01,000 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 335 flow [2024-10-31 22:05:01,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2024-10-31 22:05:01,002 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, 18 predicate places. [2024-10-31 22:05:01,003 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 335 flow [2024-10-31 22:05:01,003 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-10-31 22:05:01,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:01,004 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:01,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:05:01,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 22:05:01,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:01,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1712778762, now seen corresponding path program 1 times [2024-10-31 22:05:01,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:01,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959935960] [2024-10-31 22:05:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:01,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:01,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959935960] [2024-10-31 22:05:01,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959935960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:01,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:01,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:05:01,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472926117] [2024-10-31 22:05:01,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:01,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:05:01,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:01,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:05:01,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:05:01,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 84 [2024-10-31 22:05:01,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 101 transitions, 335 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-10-31 22:05:01,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:01,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 84 [2024-10-31 22:05:01,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:01,834 INFO L124 PetriNetUnfolderBase]: 130/477 cut-off events. [2024-10-31 22:05:01,835 INFO L125 PetriNetUnfolderBase]: For 139/151 co-relation queries the response was YES. [2024-10-31 22:05:01,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 477 events. 130/477 cut-off events. For 139/151 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2447 event pairs, 23 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 992. Up to 238 conditions per place. [2024-10-31 22:05:01,843 INFO L140 encePairwiseOnDemand]: 69/84 looper letters, 33 selfloop transitions, 48 changer transitions 8/144 dead transitions. [2024-10-31 22:05:01,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 144 transitions, 653 flow [2024-10-31 22:05:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:05:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:05:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2024-10-31 22:05:01,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2024-10-31 22:05:01,847 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 335 flow. Second operand 6 states and 429 transitions. [2024-10-31 22:05:01,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 144 transitions, 653 flow [2024-10-31 22:05:01,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 144 transitions, 639 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-31 22:05:01,859 INFO L231 Difference]: Finished difference. Result has 103 places, 136 transitions, 693 flow [2024-10-31 22:05:01,859 INFO L260 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-10-31 22:05:01,860 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, 20 predicate places. [2024-10-31 22:05:01,861 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 693 flow [2024-10-31 22:05:01,861 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-10-31 22:05:01,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:01,862 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:01,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:05:01,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 22:05:01,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:01,863 INFO L85 PathProgramCache]: Analyzing trace with hash 556796804, now seen corresponding path program 1 times [2024-10-31 22:05:01,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:01,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224563868] [2024-10-31 22:05:01,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:01,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:05:02,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:02,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224563868] [2024-10-31 22:05:02,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224563868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:02,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:02,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:05:02,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947278822] [2024-10-31 22:05:02,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:02,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:05:02,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:02,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:05:02,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:05:02,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 84 [2024-10-31 22:05:02,417 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-10-31 22:05:02,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:02,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 84 [2024-10-31 22:05:02,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:02,646 INFO L124 PetriNetUnfolderBase]: 142/505 cut-off events. [2024-10-31 22:05:02,646 INFO L125 PetriNetUnfolderBase]: For 464/488 co-relation queries the response was YES. [2024-10-31 22:05:02,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 505 events. 142/505 cut-off events. For 464/488 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2811 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-10-31 22:05:02,653 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 73 selfloop transitions, 25 changer transitions 13/164 dead transitions. [2024-10-31 22:05:02,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1076 flow [2024-10-31 22:05:02,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:05:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:05:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2024-10-31 22:05:02,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7876984126984127 [2024-10-31 22:05:02,656 INFO L175 Difference]: Start difference. First operand has 103 places, 136 transitions, 693 flow. Second operand 6 states and 397 transitions. [2024-10-31 22:05:02,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1076 flow [2024-10-31 22:05:02,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 164 transitions, 1058 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-31 22:05:02,671 INFO L231 Difference]: Finished difference. Result has 105 places, 151 transitions, 910 flow [2024-10-31 22:05:02,674 INFO L260 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-10-31 22:05:02,675 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2024-10-31 22:05:02,675 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 151 transitions, 910 flow [2024-10-31 22:05:02,675 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-10-31 22:05:02,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:02,676 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:02,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:05:02,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 22:05:02,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:02,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1182255393, now seen corresponding path program 1 times [2024-10-31 22:05:02,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:02,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364784047] [2024-10-31 22:05:02,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:02,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:05:02,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:05:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:05:02,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:05:02,757 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:05:02,758 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-31 22:05:02,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-10-31 22:05:02,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-10-31 22:05:02,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-10-31 22:05:02,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-10-31 22:05:02,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:05:02,761 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-31 22:05:02,765 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 22:05:02,765 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-31 22:05:02,798 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-31 22:05:02,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 102 transitions, 220 flow [2024-10-31 22:05:02,832 INFO L124 PetriNetUnfolderBase]: 11/199 cut-off events. [2024-10-31 22:05:02,832 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-31 22:05:02,833 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 424 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-10-31 22:05:02,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 102 transitions, 220 flow [2024-10-31 22:05:02,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 102 transitions, 220 flow [2024-10-31 22:05:02,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:05:02,838 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;@6839c848, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:05:02,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-31 22:05:02,844 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:05:02,844 INFO L124 PetriNetUnfolderBase]: 3/49 cut-off events. [2024-10-31 22:05:02,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:05:02,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:02,845 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:02,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:05:02,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:02,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1295496281, now seen corresponding path program 1 times [2024-10-31 22:05:02,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:02,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106981304] [2024-10-31 22:05:02,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:02,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:03,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:03,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106981304] [2024-10-31 22:05:03,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106981304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:03,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:03,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:05:03,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578651681] [2024-10-31 22:05:03,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:03,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:05:03,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:03,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:05:03,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:05:03,308 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 102 [2024-10-31 22:05:03,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 220 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-10-31 22:05:03,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:03,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 102 [2024-10-31 22:05:03,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:03,915 INFO L124 PetriNetUnfolderBase]: 903/2672 cut-off events. [2024-10-31 22:05:03,916 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-10-31 22:05:03,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 2672 events. 903/2672 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20559 event pairs, 529 based on Foata normal form. 68/2471 useless extension candidates. Maximal degree in co-relation 2356. Up to 1385 conditions per place. [2024-10-31 22:05:03,937 INFO L140 encePairwiseOnDemand]: 84/102 looper letters, 30 selfloop transitions, 38 changer transitions 1/137 dead transitions. [2024-10-31 22:05:03,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 137 transitions, 431 flow [2024-10-31 22:05:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:05:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:05:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 486 transitions. [2024-10-31 22:05:03,940 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7941176470588235 [2024-10-31 22:05:03,940 INFO L175 Difference]: Start difference. First operand has 102 places, 102 transitions, 220 flow. Second operand 6 states and 486 transitions. [2024-10-31 22:05:03,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 137 transitions, 431 flow [2024-10-31 22:05:03,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 137 transitions, 431 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:05:03,944 INFO L231 Difference]: Finished difference. Result has 112 places, 135 transitions, 466 flow [2024-10-31 22:05:03,945 INFO L260 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=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=112, PETRI_TRANSITIONS=135} [2024-10-31 22:05:03,946 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places. [2024-10-31 22:05:03,946 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 135 transitions, 466 flow [2024-10-31 22:05:03,947 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-10-31 22:05:03,947 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:03,947 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:03,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:05:03,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:05:03,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:03,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1746668065, now seen corresponding path program 1 times [2024-10-31 22:05:03,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:03,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146929897] [2024-10-31 22:05:03,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:03,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:04,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146929897] [2024-10-31 22:05:04,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146929897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:04,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:04,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:05:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280283821] [2024-10-31 22:05:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:04,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:05:04,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:04,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:05:04,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:05:04,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 102 [2024-10-31 22:05:04,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 135 transitions, 466 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-10-31 22:05:04,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:04,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 102 [2024-10-31 22:05:04,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:04,448 INFO L124 PetriNetUnfolderBase]: 420/1426 cut-off events. [2024-10-31 22:05:04,448 INFO L125 PetriNetUnfolderBase]: For 368/444 co-relation queries the response was YES. [2024-10-31 22:05:04,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2684 conditions, 1426 events. 420/1426 cut-off events. For 368/444 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 9313 event pairs, 112 based on Foata normal form. 2/1356 useless extension candidates. Maximal degree in co-relation 2141. Up to 520 conditions per place. [2024-10-31 22:05:04,462 INFO L140 encePairwiseOnDemand]: 94/102 looper letters, 14 selfloop transitions, 2 changer transitions 5/141 dead transitions. [2024-10-31 22:05:04,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 141 transitions, 520 flow [2024-10-31 22:05:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:05:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:05:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2024-10-31 22:05:04,465 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8594771241830066 [2024-10-31 22:05:04,465 INFO L175 Difference]: Start difference. First operand has 112 places, 135 transitions, 466 flow. Second operand 6 states and 526 transitions. [2024-10-31 22:05:04,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 141 transitions, 520 flow [2024-10-31 22:05:04,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 141 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:05:04,472 INFO L231 Difference]: Finished difference. Result has 120 places, 136 transitions, 488 flow [2024-10-31 22:05:04,473 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=120, PETRI_TRANSITIONS=136} [2024-10-31 22:05:04,473 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places. [2024-10-31 22:05:04,474 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 136 transitions, 488 flow [2024-10-31 22:05:04,474 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-10-31 22:05:04,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:04,475 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:04,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:05:04,475 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:05:04,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:04,476 INFO L85 PathProgramCache]: Analyzing trace with hash 304559244, now seen corresponding path program 1 times [2024-10-31 22:05:04,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:04,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224278141] [2024-10-31 22:05:04,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:04,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:04,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:04,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224278141] [2024-10-31 22:05:04,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224278141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:04,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:04,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:05:04,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977184874] [2024-10-31 22:05:04,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:04,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:05:04,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:04,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:05:04,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:05:04,945 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 102 [2024-10-31 22:05:04,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 136 transitions, 488 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-10-31 22:05:04,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:04,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 102 [2024-10-31 22:05:04,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:05,949 INFO L124 PetriNetUnfolderBase]: 1866/4588 cut-off events. [2024-10-31 22:05:05,950 INFO L125 PetriNetUnfolderBase]: For 1536/1621 co-relation queries the response was YES. [2024-10-31 22:05:05,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10823 conditions, 4588 events. 1866/4588 cut-off events. For 1536/1621 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 35949 event pairs, 434 based on Foata normal form. 0/4306 useless extension candidates. Maximal degree in co-relation 10729. Up to 2580 conditions per place. [2024-10-31 22:05:05,996 INFO L140 encePairwiseOnDemand]: 83/102 looper letters, 63 selfloop transitions, 92 changer transitions 0/231 dead transitions. [2024-10-31 22:05:05,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 231 transitions, 1234 flow [2024-10-31 22:05:05,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:05:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:05:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2024-10-31 22:05:06,000 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8676470588235294 [2024-10-31 22:05:06,000 INFO L175 Difference]: Start difference. First operand has 120 places, 136 transitions, 488 flow. Second operand 6 states and 531 transitions. [2024-10-31 22:05:06,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 231 transitions, 1234 flow [2024-10-31 22:05:06,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 231 transitions, 1222 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-31 22:05:06,017 INFO L231 Difference]: Finished difference. Result has 123 places, 223 transitions, 1312 flow [2024-10-31 22:05:06,018 INFO L260 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-10-31 22:05:06,019 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2024-10-31 22:05:06,019 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 223 transitions, 1312 flow [2024-10-31 22:05:06,020 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-10-31 22:05:06,020 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:06,020 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:06,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:05:06,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:05:06,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:06,022 INFO L85 PathProgramCache]: Analyzing trace with hash 708533652, now seen corresponding path program 1 times [2024-10-31 22:05:06,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:06,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996269356] [2024-10-31 22:05:06,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:06,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:05:06,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:06,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996269356] [2024-10-31 22:05:06,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996269356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:06,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:06,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:05:06,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898183854] [2024-10-31 22:05:06,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:06,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:05:06,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:06,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:05:06,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:05:06,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 102 [2024-10-31 22:05:06,609 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-10-31 22:05:06,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:06,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 102 [2024-10-31 22:05:06,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:07,770 INFO L124 PetriNetUnfolderBase]: 2323/5525 cut-off events. [2024-10-31 22:05:07,770 INFO L125 PetriNetUnfolderBase]: For 5295/5499 co-relation queries the response was YES. [2024-10-31 22:05:07,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17450 conditions, 5525 events. 2323/5525 cut-off events. For 5295/5499 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 44282 event pairs, 290 based on Foata normal form. 2/5296 useless extension candidates. Maximal degree in co-relation 13995. Up to 3131 conditions per place. [2024-10-31 22:05:07,845 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 145 selfloop transitions, 76 changer transitions 0/296 dead transitions. [2024-10-31 22:05:07,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 296 transitions, 2246 flow [2024-10-31 22:05:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:05:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:05:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2024-10-31 22:05:07,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8071895424836601 [2024-10-31 22:05:07,848 INFO L175 Difference]: Start difference. First operand has 123 places, 223 transitions, 1312 flow. Second operand 6 states and 494 transitions. [2024-10-31 22:05:07,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 296 transitions, 2246 flow [2024-10-31 22:05:07,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 296 transitions, 2228 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-31 22:05:07,910 INFO L231 Difference]: Finished difference. Result has 133 places, 294 transitions, 2152 flow [2024-10-31 22:05:07,911 INFO L260 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-10-31 22:05:07,912 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2024-10-31 22:05:07,914 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 294 transitions, 2152 flow [2024-10-31 22:05:07,914 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-10-31 22:05:07,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:07,915 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:07,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:05:07,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:05:07,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:07,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1881560913, now seen corresponding path program 1 times [2024-10-31 22:05:07,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:07,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667970521] [2024-10-31 22:05:07,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:07,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:08,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:08,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667970521] [2024-10-31 22:05:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667970521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:05:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920887105] [2024-10-31 22:05:08,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:08,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:05:08,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:05:08,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:05:08,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:05:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:09,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-31 22:05:09,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:05:09,212 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-10-31 22:05:09,302 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:05:09,303 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-10-31 22:05:09,393 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-10-31 22:05:09,416 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-10-31 22:05:09,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:05:09,448 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-10-31 22:05:09,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:05:09,500 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-10-31 22:05:09,755 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-10-31 22:05:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:09,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:05:09,854 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)))) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))))) is different from false [2024-10-31 22:05:10,098 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |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_232 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |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|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2024-10-31 22:05:10,132 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_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |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|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-10-31 22:05:10,172 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_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-10-31 22:05:13,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:05:13,369 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-10-31 22:05:13,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:05:13,383 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 93 treesize of output 31 [2024-10-31 22:05:13,405 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-31 22:05:13,405 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-10-31 22:05:13,418 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-31 22:05:13,419 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-10-31 22:05:13,431 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-31 22:05:13,432 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-10-31 22:05:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-31 22:05:13,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920887105] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:05:13,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:05:13,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2024-10-31 22:05:13,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853672596] [2024-10-31 22:05:13,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:05:13,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-31 22:05:13,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:13,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-31 22:05:13,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=241, Unknown=20, NotChecked=140, Total=462 [2024-10-31 22:05:13,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-10-31 22:05:13,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 294 transitions, 2152 flow. Second operand has 22 states, 22 states have (on average 49.04545454545455) internal successors, (1079), 22 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:13,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:13,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-10-31 22:05:13,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:17,928 INFO L124 PetriNetUnfolderBase]: 6647/14233 cut-off events. [2024-10-31 22:05:17,928 INFO L125 PetriNetUnfolderBase]: For 20772/21073 co-relation queries the response was YES. [2024-10-31 22:05:17,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46842 conditions, 14233 events. 6647/14233 cut-off events. For 20772/21073 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 125124 event pairs, 1478 based on Foata normal form. 91/13625 useless extension candidates. Maximal degree in co-relation 36624. Up to 8488 conditions per place. [2024-10-31 22:05:18,078 INFO L140 encePairwiseOnDemand]: 76/102 looper letters, 285 selfloop transitions, 135 changer transitions 0/468 dead transitions. [2024-10-31 22:05:18,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 468 transitions, 4231 flow [2024-10-31 22:05:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-31 22:05:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-31 22:05:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 981 transitions. [2024-10-31 22:05:18,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5657439446366782 [2024-10-31 22:05:18,083 INFO L175 Difference]: Start difference. First operand has 133 places, 294 transitions, 2152 flow. Second operand 17 states and 981 transitions. [2024-10-31 22:05:18,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 468 transitions, 4231 flow [2024-10-31 22:05:18,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 468 transitions, 4087 flow, removed 72 selfloop flow, removed 0 redundant places. [2024-10-31 22:05:18,239 INFO L231 Difference]: Finished difference. Result has 157 places, 353 transitions, 3118 flow [2024-10-31 22:05:18,240 INFO L260 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-10-31 22:05:18,241 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 55 predicate places. [2024-10-31 22:05:18,241 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 353 transitions, 3118 flow [2024-10-31 22:05:18,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 49.04545454545455) internal successors, (1079), 22 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:18,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:18,242 INFO L204 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-10-31 22:05:18,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:05:18,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:05:18,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:05:18,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:18,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1785825861, now seen corresponding path program 1 times [2024-10-31 22:05:18,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:18,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011843219] [2024-10-31 22:05:18,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:18,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:19,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:19,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011843219] [2024-10-31 22:05:19,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011843219] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:05:19,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816591472] [2024-10-31 22:05:19,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:19,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:05:19,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:05:19,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:05:19,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeb4980-7d7b-4e92-a4f1-b96c1b14e4cc/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:05:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:19,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-31 22:05:19,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:05:19,416 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-10-31 22:05:19,434 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:05:19,435 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-10-31 22:05:19,588 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 11 treesize of output 7 [2024-10-31 22:05:19,602 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 21 treesize of output 20 [2024-10-31 22:05:19,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:05:19,630 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 30 treesize of output 32 [2024-10-31 22:05:19,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:05:19,656 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 39 treesize of output 44 [2024-10-31 22:05:19,684 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 43 treesize of output 32 [2024-10-31 22:05:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:19,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:05:19,733 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) is different from false [2024-10-31 22:05:19,761 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2024-10-31 22:05:19,788 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false