./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0026ab1092a8a0465a20b39c2dea92fa9c4dc52098c477016ebc8544f5aaf0f0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:02:21,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:02:21,535 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-19 08:02:21,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:02:21,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:02:21,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:02:21,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:02:21,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:02:21,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:02:21,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:02:21,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:02:21,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:02:21,591 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:02:21,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:02:21,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:02:21,592 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:02:21,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:02:21,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:02:21,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:02:21,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:02:21,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:02:21,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:02:21,597 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-19 08:02:21,597 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:02:21,598 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:02:21,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:02:21,599 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:02:21,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:02:21,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:02:21,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:02:21,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:02:21,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:02:21,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:02:21,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:02:21,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:02:21,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:02:21,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:02:21,609 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:02:21,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:02:21,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:02:21,610 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:02:21,611 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_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/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_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0026ab1092a8a0465a20b39c2dea92fa9c4dc52098c477016ebc8544f5aaf0f0 [2023-11-19 08:02:21,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:02:22,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:02:22,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:02:22,031 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:02:22,031 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:02:22,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i [2023-11-19 08:02:25,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:02:25,409 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:02:25,410 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i [2023-11-19 08:02:25,430 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/data/23ddd6555/831d0e9733654f4bacce7cfff44c4535/FLAGb4dce0180 [2023-11-19 08:02:25,446 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/data/23ddd6555/831d0e9733654f4bacce7cfff44c4535 [2023-11-19 08:02:25,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:02:25,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:02:25,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:02:25,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:02:25,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:02:25,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:02:25" (1/1) ... [2023-11-19 08:02:25,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2170b75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:25, skipping insertion in model container [2023-11-19 08:02:25,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:02:25" (1/1) ... [2023-11-19 08:02:25,529 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:02:25,759 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 08:02:26,103 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:02:26,118 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:02:26,144 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 08:02:26,204 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:02:26,267 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:02:26,275 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:02:26,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26 WrapperNode [2023-11-19 08:02:26,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:02:26,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:02:26,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:02:26,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:02:26,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26" (1/1) ... [2023-11-19 08:02:26,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26" (1/1) ... [2023-11-19 08:02:26,379 INFO L138 Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-19 08:02:26,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:02:26,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:02:26,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:02:26,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:02:26,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26" (1/1) ... [2023-11-19 08:02:26,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26" (1/1) ... [2023-11-19 08:02:26,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26" (1/1) ... [2023-11-19 08:02:26,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26" (1/1) ... [2023-11-19 08:02:26,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26" (1/1) ... [2023-11-19 08:02:26,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26" (1/1) ... [2023-11-19 08:02:26,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26" (1/1) ... [2023-11-19 08:02:26,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26" (1/1) ... [2023-11-19 08:02:26,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:02:26,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:02:26,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:02:26,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:02:26,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26" (1/1) ... [2023-11-19 08:02:26,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:02:26,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:26,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:02:26,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:02:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:02:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 08:02:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:02:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 08:02:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 08:02:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:02:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 08:02:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-19 08:02:26,542 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-19 08:02:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:02:26,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:02:26,546 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 08:02:26,804 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:02:26,807 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:02:27,106 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:02:27,115 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:02:27,116 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 08:02:27,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:27 BoogieIcfgContainer [2023-11-19 08:02:27,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:02:27,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:02:27,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:02:27,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:02:27,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:02:25" (1/3) ... [2023-11-19 08:02:27,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ee23be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:02:27, skipping insertion in model container [2023-11-19 08:02:27,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:26" (2/3) ... [2023-11-19 08:02:27,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ee23be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:02:27, skipping insertion in model container [2023-11-19 08:02:27,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:27" (3/3) ... [2023-11-19 08:02:27,129 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array.i [2023-11-19 08:02:27,138 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 08:02:27,149 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:02:27,149 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 08:02:27,150 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:02:27,242 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-19 08:02:27,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 251 flow [2023-11-19 08:02:27,354 INFO L124 PetriNetUnfolderBase]: 6/188 cut-off events. [2023-11-19 08:02:27,354 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 08:02:27,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 188 events. 6/188 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 382 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2023-11-19 08:02:27,360 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 251 flow [2023-11-19 08:02:27,365 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 251 flow [2023-11-19 08:02:27,369 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:02:27,379 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 251 flow [2023-11-19 08:02:27,382 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 251 flow [2023-11-19 08:02:27,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 251 flow [2023-11-19 08:02:27,427 INFO L124 PetriNetUnfolderBase]: 6/188 cut-off events. [2023-11-19 08:02:27,427 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 08:02:27,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 188 events. 6/188 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 382 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2023-11-19 08:02:27,432 INFO L119 LiptonReduction]: Number of co-enabled transitions 2368 [2023-11-19 08:02:30,565 INFO L134 LiptonReduction]: Checked pairs total: 9513 [2023-11-19 08:02:30,566 INFO L136 LiptonReduction]: Total number of compositions: 69 [2023-11-19 08:02:30,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:02:30,590 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d45cd72, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:02:30,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-19 08:02:30,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:02:30,598 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-19 08:02:30,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:30,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:30,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:30,600 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 08:02:30,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:30,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1944862519, now seen corresponding path program 1 times [2023-11-19 08:02:30,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:30,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137449594] [2023-11-19 08:02:30,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:30,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:31,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:31,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137449594] [2023-11-19 08:02:31,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137449594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:31,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:31,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:02:31,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002188743] [2023-11-19 08:02:31,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:31,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:02:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:31,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:02:31,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:02:31,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 191 [2023-11-19 08:02:31,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:31,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:31,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 191 [2023-11-19 08:02:31,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:32,257 INFO L124 PetriNetUnfolderBase]: 142/502 cut-off events. [2023-11-19 08:02:32,258 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2023-11-19 08:02:32,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 502 events. 142/502 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2683 event pairs, 46 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 770. Up to 224 conditions per place. [2023-11-19 08:02:32,270 INFO L140 encePairwiseOnDemand]: 175/191 looper letters, 47 selfloop transitions, 23 changer transitions 0/98 dead transitions. [2023-11-19 08:02:32,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 98 transitions, 343 flow [2023-11-19 08:02:32,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:02:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:02:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 654 transitions. [2023-11-19 08:02:32,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5706806282722513 [2023-11-19 08:02:32,299 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 654 transitions. [2023-11-19 08:02:32,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 654 transitions. [2023-11-19 08:02:32,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:32,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 654 transitions. [2023-11-19 08:02:32,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:32,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:32,320 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:32,322 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 121 flow. Second operand 6 states and 654 transitions. [2023-11-19 08:02:32,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 98 transitions, 343 flow [2023-11-19 08:02:32,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 343 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:32,331 INFO L231 Difference]: Finished difference. Result has 69 places, 80 transitions, 291 flow [2023-11-19 08:02:32,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=69, PETRI_TRANSITIONS=80} [2023-11-19 08:02:32,338 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2023-11-19 08:02:32,338 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 291 flow [2023-11-19 08:02:32,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:32,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:32,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:32,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:02:32,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 08:02:32,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:32,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1019690596, now seen corresponding path program 1 times [2023-11-19 08:02:32,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:32,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280147632] [2023-11-19 08:02:32,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:32,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:32,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:32,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280147632] [2023-11-19 08:02:32,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280147632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:32,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:32,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:02:32,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739640332] [2023-11-19 08:02:32,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:32,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:02:32,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:32,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:02:32,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:02:33,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 191 [2023-11-19 08:02:33,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:33,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:33,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 191 [2023-11-19 08:02:33,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:33,385 INFO L124 PetriNetUnfolderBase]: 284/849 cut-off events. [2023-11-19 08:02:33,386 INFO L125 PetriNetUnfolderBase]: For 323/329 co-relation queries the response was YES. [2023-11-19 08:02:33,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2005 conditions, 849 events. 284/849 cut-off events. For 323/329 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5134 event pairs, 46 based on Foata normal form. 5/812 useless extension candidates. Maximal degree in co-relation 1869. Up to 391 conditions per place. [2023-11-19 08:02:33,398 INFO L140 encePairwiseOnDemand]: 168/191 looper letters, 73 selfloop transitions, 50 changer transitions 0/152 dead transitions. [2023-11-19 08:02:33,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 152 transitions, 798 flow [2023-11-19 08:02:33,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:02:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:02:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 637 transitions. [2023-11-19 08:02:33,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.555846422338569 [2023-11-19 08:02:33,404 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 637 transitions. [2023-11-19 08:02:33,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 637 transitions. [2023-11-19 08:02:33,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:33,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 637 transitions. [2023-11-19 08:02:33,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:33,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:33,415 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:33,419 INFO L175 Difference]: Start difference. First operand has 69 places, 80 transitions, 291 flow. Second operand 6 states and 637 transitions. [2023-11-19 08:02:33,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 152 transitions, 798 flow [2023-11-19 08:02:33,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 152 transitions, 798 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:33,438 INFO L231 Difference]: Finished difference. Result has 79 places, 129 transitions, 769 flow [2023-11-19 08:02:33,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=769, PETRI_PLACES=79, PETRI_TRANSITIONS=129} [2023-11-19 08:02:33,440 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2023-11-19 08:02:33,441 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 129 transitions, 769 flow [2023-11-19 08:02:33,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:33,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:33,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:33,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:02:33,449 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 08:02:33,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2137668406, now seen corresponding path program 1 times [2023-11-19 08:02:33,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:33,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176450098] [2023-11-19 08:02:33,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:33,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:33,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:33,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176450098] [2023-11-19 08:02:33,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176450098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:33,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:33,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:02:33,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108958636] [2023-11-19 08:02:33,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:33,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:02:33,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:33,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:02:33,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:02:34,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 191 [2023-11-19 08:02:34,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 129 transitions, 769 flow. Second operand has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:34,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:34,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 191 [2023-11-19 08:02:34,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:34,620 INFO L124 PetriNetUnfolderBase]: 280/832 cut-off events. [2023-11-19 08:02:34,620 INFO L125 PetriNetUnfolderBase]: For 1099/1118 co-relation queries the response was YES. [2023-11-19 08:02:34,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2533 conditions, 832 events. 280/832 cut-off events. For 1099/1118 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5017 event pairs, 47 based on Foata normal form. 1/802 useless extension candidates. Maximal degree in co-relation 2371. Up to 429 conditions per place. [2023-11-19 08:02:34,629 INFO L140 encePairwiseOnDemand]: 180/191 looper letters, 76 selfloop transitions, 33 changer transitions 8/171 dead transitions. [2023-11-19 08:02:34,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 171 transitions, 1242 flow [2023-11-19 08:02:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:02:34,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:02:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 656 transitions. [2023-11-19 08:02:34,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5724258289703316 [2023-11-19 08:02:34,633 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 656 transitions. [2023-11-19 08:02:34,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 656 transitions. [2023-11-19 08:02:34,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:34,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 656 transitions. [2023-11-19 08:02:34,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:34,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:34,640 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:34,641 INFO L175 Difference]: Start difference. First operand has 79 places, 129 transitions, 769 flow. Second operand 6 states and 656 transitions. [2023-11-19 08:02:34,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 171 transitions, 1242 flow [2023-11-19 08:02:34,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 171 transitions, 1242 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:34,651 INFO L231 Difference]: Finished difference. Result has 89 places, 159 transitions, 1134 flow [2023-11-19 08:02:34,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1134, PETRI_PLACES=89, PETRI_TRANSITIONS=159} [2023-11-19 08:02:34,653 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2023-11-19 08:02:34,653 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 159 transitions, 1134 flow [2023-11-19 08:02:34,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:34,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:34,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:34,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:02:34,655 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 08:02:34,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:34,655 INFO L85 PathProgramCache]: Analyzing trace with hash -708610628, now seen corresponding path program 1 times [2023-11-19 08:02:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:34,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111888787] [2023-11-19 08:02:34,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:34,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:35,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:35,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111888787] [2023-11-19 08:02:35,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111888787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:35,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:35,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:02:35,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768429808] [2023-11-19 08:02:35,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:35,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:02:35,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:35,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:02:35,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:02:35,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 191 [2023-11-19 08:02:35,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 159 transitions, 1134 flow. Second operand has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:35,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:35,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 191 [2023-11-19 08:02:35,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:35,779 INFO L124 PetriNetUnfolderBase]: 536/1340 cut-off events. [2023-11-19 08:02:35,780 INFO L125 PetriNetUnfolderBase]: For 1846/1860 co-relation queries the response was YES. [2023-11-19 08:02:35,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4857 conditions, 1340 events. 536/1340 cut-off events. For 1846/1860 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8488 event pairs, 92 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 4691. Up to 994 conditions per place. [2023-11-19 08:02:35,797 INFO L140 encePairwiseOnDemand]: 161/191 looper letters, 167 selfloop transitions, 111 changer transitions 10/304 dead transitions. [2023-11-19 08:02:35,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 304 transitions, 2364 flow [2023-11-19 08:02:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:02:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:02:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 683 transitions. [2023-11-19 08:02:35,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5959860383944153 [2023-11-19 08:02:35,802 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 683 transitions. [2023-11-19 08:02:35,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 683 transitions. [2023-11-19 08:02:35,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:35,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 683 transitions. [2023-11-19 08:02:35,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:35,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:35,811 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:35,812 INFO L175 Difference]: Start difference. First operand has 89 places, 159 transitions, 1134 flow. Second operand 6 states and 683 transitions. [2023-11-19 08:02:35,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 304 transitions, 2364 flow [2023-11-19 08:02:35,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 304 transitions, 2364 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:35,840 INFO L231 Difference]: Finished difference. Result has 97 places, 262 transitions, 2044 flow [2023-11-19 08:02:35,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2044, PETRI_PLACES=97, PETRI_TRANSITIONS=262} [2023-11-19 08:02:35,843 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places. [2023-11-19 08:02:35,843 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 262 transitions, 2044 flow [2023-11-19 08:02:35,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:35,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:35,844 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:35,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:02:35,845 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 08:02:35,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:35,845 INFO L85 PathProgramCache]: Analyzing trace with hash -694906988, now seen corresponding path program 1 times [2023-11-19 08:02:35,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:35,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58814656] [2023-11-19 08:02:35,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:35,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:36,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:36,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58814656] [2023-11-19 08:02:36,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58814656] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:02:36,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938711424] [2023-11-19 08:02:36,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:36,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:36,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:36,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:02:36,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 08:02:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:36,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-19 08:02:36,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:02:36,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 08:02:36,784 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 08:02:36,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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 [2023-11-19 08:02:36,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:02:36,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2023-11-19 08:02:36,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:02:36,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 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 [2023-11-19 08:02:36,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:02:37,000 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 [2023-11-19 08:02:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:37,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:02:37,106 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_199 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_199) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_199 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_199) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_199 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_199) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_199 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_199) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0))) is different from false [2023-11-19 08:02:37,136 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_199 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_199) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_199 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_199) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_199 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_199) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_199 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_199) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0))))) is different from false [2023-11-19 08:02:37,166 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_199 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_199) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_199 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_199) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_199 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_199) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_199 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_199) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0))))) is different from false [2023-11-19 08:02:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-19 08:02:39,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938711424] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:02:39,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:02:39,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2023-11-19 08:02:39,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151041142] [2023-11-19 08:02:39,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:02:39,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-19 08:02:39,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:39,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-19 08:02:39,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650 [2023-11-19 08:02:39,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 191 [2023-11-19 08:02:39,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 262 transitions, 2044 flow. Second operand has 26 states, 26 states have (on average 60.65384615384615) internal successors, (1577), 26 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:39,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:39,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 191 [2023-11-19 08:02:39,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:40,823 INFO L124 PetriNetUnfolderBase]: 631/1458 cut-off events. [2023-11-19 08:02:40,823 INFO L125 PetriNetUnfolderBase]: For 3383/3383 co-relation queries the response was YES. [2023-11-19 08:02:40,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6479 conditions, 1458 events. 631/1458 cut-off events. For 3383/3383 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 9141 event pairs, 83 based on Foata normal form. 10/1368 useless extension candidates. Maximal degree in co-relation 6377. Up to 1331 conditions per place. [2023-11-19 08:02:40,843 INFO L140 encePairwiseOnDemand]: 181/191 looper letters, 304 selfloop transitions, 12 changer transitions 12/330 dead transitions. [2023-11-19 08:02:40,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 330 transitions, 3085 flow [2023-11-19 08:02:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 08:02:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-19 08:02:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 699 transitions. [2023-11-19 08:02:40,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36596858638743457 [2023-11-19 08:02:40,848 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 699 transitions. [2023-11-19 08:02:40,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 699 transitions. [2023-11-19 08:02:40,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:40,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 699 transitions. [2023-11-19 08:02:40,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 69.9) internal successors, (699), 10 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:40,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:40,856 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:40,857 INFO L175 Difference]: Start difference. First operand has 97 places, 262 transitions, 2044 flow. Second operand 10 states and 699 transitions. [2023-11-19 08:02:40,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 330 transitions, 3085 flow [2023-11-19 08:02:40,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 330 transitions, 2941 flow, removed 72 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:40,909 INFO L231 Difference]: Finished difference. Result has 107 places, 265 transitions, 1940 flow [2023-11-19 08:02:40,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1940, PETRI_PLACES=107, PETRI_TRANSITIONS=265} [2023-11-19 08:02:40,913 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places. [2023-11-19 08:02:40,913 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 265 transitions, 1940 flow [2023-11-19 08:02:40,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 60.65384615384615) internal successors, (1577), 26 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:40,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:40,915 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:40,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 08:02:41,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:41,137 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 08:02:41,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:41,137 INFO L85 PathProgramCache]: Analyzing trace with hash -809315380, now seen corresponding path program 1 times [2023-11-19 08:02:41,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:41,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040561028] [2023-11-19 08:02:41,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:41,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:41,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:41,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040561028] [2023-11-19 08:02:41,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040561028] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:02:41,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668541413] [2023-11-19 08:02:41,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:41,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:41,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:41,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:02:41,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 08:02:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:41,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-19 08:02:41,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:02:41,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 08:02:41,919 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 08:02:41,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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 [2023-11-19 08:02:41,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:02:41,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2023-11-19 08:02:42,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:02:42,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 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 [2023-11-19 08:02:42,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:02:42,122 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 [2023-11-19 08:02:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:42,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:02:42,160 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-19 08:02:42,184 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset)))))) is different from false [2023-11-19 08:02:42,206 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-19 08:02:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-19 08:02:44,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668541413] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:02:44,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:02:44,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2023-11-19 08:02:44,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260134473] [2023-11-19 08:02:44,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:02:44,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-19 08:02:44,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:44,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-19 08:02:44,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650 [2023-11-19 08:02:44,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 191 [2023-11-19 08:02:44,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 265 transitions, 1940 flow. Second operand has 26 states, 26 states have (on average 58.65384615384615) internal successors, (1525), 26 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:44,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:44,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 191 [2023-11-19 08:02:44,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:47,185 INFO L124 PetriNetUnfolderBase]: 658/1514 cut-off events. [2023-11-19 08:02:47,185 INFO L125 PetriNetUnfolderBase]: For 3421/3421 co-relation queries the response was YES. [2023-11-19 08:02:47,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6822 conditions, 1514 events. 658/1514 cut-off events. For 3421/3421 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9625 event pairs, 57 based on Foata normal form. 0/1434 useless extension candidates. Maximal degree in co-relation 6708. Up to 939 conditions per place. [2023-11-19 08:02:47,207 INFO L140 encePairwiseOnDemand]: 162/191 looper letters, 315 selfloop transitions, 136 changer transitions 35/488 dead transitions. [2023-11-19 08:02:47,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 488 transitions, 4234 flow [2023-11-19 08:02:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 08:02:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-19 08:02:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1298 transitions. [2023-11-19 08:02:47,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3775450843513671 [2023-11-19 08:02:47,214 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1298 transitions. [2023-11-19 08:02:47,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1298 transitions. [2023-11-19 08:02:47,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:47,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1298 transitions. [2023-11-19 08:02:47,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 72.11111111111111) internal successors, (1298), 18 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:47,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 191.0) internal successors, (3629), 19 states have internal predecessors, (3629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:47,229 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 191.0) internal successors, (3629), 19 states have internal predecessors, (3629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:47,230 INFO L175 Difference]: Start difference. First operand has 107 places, 265 transitions, 1940 flow. Second operand 18 states and 1298 transitions. [2023-11-19 08:02:47,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 488 transitions, 4234 flow [2023-11-19 08:02:47,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 488 transitions, 4207 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 08:02:47,271 INFO L231 Difference]: Finished difference. Result has 125 places, 304 transitions, 2752 flow [2023-11-19 08:02:47,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2752, PETRI_PLACES=125, PETRI_TRANSITIONS=304} [2023-11-19 08:02:47,275 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 66 predicate places. [2023-11-19 08:02:47,276 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 304 transitions, 2752 flow [2023-11-19 08:02:47,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 58.65384615384615) internal successors, (1525), 26 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:47,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:47,277 INFO L208 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] [2023-11-19 08:02:47,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 08:02:47,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 08:02:47,499 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 08:02:47,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:47,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1558882150, now seen corresponding path program 1 times [2023-11-19 08:02:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:47,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926602961] [2023-11-19 08:02:47,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:47,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:47,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:47,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926602961] [2023-11-19 08:02:47,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926602961] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:02:47,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757702094] [2023-11-19 08:02:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:47,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:47,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:47,634 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:02:47,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 08:02:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:47,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 08:02:47,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:02:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:47,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:02:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:47,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757702094] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:02:47,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:02:47,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2023-11-19 08:02:47,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697823483] [2023-11-19 08:02:47,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:02:47,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 08:02:47,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:47,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 08:02:47,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-19 08:02:48,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 191 [2023-11-19 08:02:48,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 304 transitions, 2752 flow. Second operand has 9 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:48,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:48,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 191 [2023-11-19 08:02:48,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:48,245 INFO L124 PetriNetUnfolderBase]: 237/726 cut-off events. [2023-11-19 08:02:48,245 INFO L125 PetriNetUnfolderBase]: For 2622/2641 co-relation queries the response was YES. [2023-11-19 08:02:48,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3352 conditions, 726 events. 237/726 cut-off events. For 2622/2641 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4463 event pairs, 7 based on Foata normal form. 0/722 useless extension candidates. Maximal degree in co-relation 3248. Up to 240 conditions per place. [2023-11-19 08:02:48,256 INFO L140 encePairwiseOnDemand]: 185/191 looper letters, 22 selfloop transitions, 9 changer transitions 3/226 dead transitions. [2023-11-19 08:02:48,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 226 transitions, 2106 flow [2023-11-19 08:02:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:02:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:02:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 750 transitions. [2023-11-19 08:02:48,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5609573672400897 [2023-11-19 08:02:48,260 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 750 transitions. [2023-11-19 08:02:48,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 750 transitions. [2023-11-19 08:02:48,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:48,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 750 transitions. [2023-11-19 08:02:48,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:48,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:48,266 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:48,267 INFO L175 Difference]: Start difference. First operand has 125 places, 304 transitions, 2752 flow. Second operand 7 states and 750 transitions. [2023-11-19 08:02:48,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 226 transitions, 2106 flow [2023-11-19 08:02:48,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 226 transitions, 2018 flow, removed 22 selfloop flow, removed 8 redundant places. [2023-11-19 08:02:48,295 INFO L231 Difference]: Finished difference. Result has 111 places, 219 transitions, 1930 flow [2023-11-19 08:02:48,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1930, PETRI_PLACES=111, PETRI_TRANSITIONS=219} [2023-11-19 08:02:48,296 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 52 predicate places. [2023-11-19 08:02:48,296 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 219 transitions, 1930 flow [2023-11-19 08:02:48,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:48,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:48,297 INFO L208 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] [2023-11-19 08:02:48,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 08:02:48,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-19 08:02:48,509 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 08:02:48,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:48,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1323892095, now seen corresponding path program 1 times [2023-11-19 08:02:48,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:48,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941154572] [2023-11-19 08:02:48,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:48,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:49,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:49,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941154572] [2023-11-19 08:02:49,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941154572] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:02:49,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821601849] [2023-11-19 08:02:49,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:49,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:49,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:49,121 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:02:49,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 08:02:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:49,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-19 08:02:49,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:02:49,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 08:02:49,359 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 08:02:49,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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 [2023-11-19 08:02:49,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:02:49,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2023-11-19 08:02:49,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:02:49,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 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 [2023-11-19 08:02:49,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:02:49,577 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 [2023-11-19 08:02:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:49,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:02:49,612 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_489 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset))) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-19 08:02:49,660 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_489 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset))))))) is different from false [2023-11-19 08:02:49,683 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_489 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-19 08:02:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-19 08:02:51,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821601849] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:02:51,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:02:51,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2023-11-19 08:02:51,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109689924] [2023-11-19 08:02:51,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:02:51,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-19 08:02:51,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:51,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-19 08:02:51,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650 [2023-11-19 08:02:51,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 191 [2023-11-19 08:02:51,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 219 transitions, 1930 flow. Second operand has 26 states, 26 states have (on average 55.76923076923077) internal successors, (1450), 26 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:51,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:51,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 191 [2023-11-19 08:02:51,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:53,794 INFO L124 PetriNetUnfolderBase]: 458/1087 cut-off events. [2023-11-19 08:02:53,795 INFO L125 PetriNetUnfolderBase]: For 3547/3549 co-relation queries the response was YES. [2023-11-19 08:02:53,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5534 conditions, 1087 events. 458/1087 cut-off events. For 3547/3549 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6469 event pairs, 31 based on Foata normal form. 2/1054 useless extension candidates. Maximal degree in co-relation 5417. Up to 600 conditions per place. [2023-11-19 08:02:53,811 INFO L140 encePairwiseOnDemand]: 171/191 looper letters, 276 selfloop transitions, 96 changer transitions 9/383 dead transitions. [2023-11-19 08:02:53,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 383 transitions, 3649 flow [2023-11-19 08:02:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 08:02:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-19 08:02:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1105 transitions. [2023-11-19 08:02:53,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3403141361256545 [2023-11-19 08:02:53,818 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1105 transitions. [2023-11-19 08:02:53,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1105 transitions. [2023-11-19 08:02:53,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:53,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1105 transitions. [2023-11-19 08:02:53,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 65.0) internal successors, (1105), 17 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:53,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 191.0) internal successors, (3438), 18 states have internal predecessors, (3438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:53,831 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 191.0) internal successors, (3438), 18 states have internal predecessors, (3438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:53,832 INFO L175 Difference]: Start difference. First operand has 111 places, 219 transitions, 1930 flow. Second operand 17 states and 1105 transitions. [2023-11-19 08:02:53,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 383 transitions, 3649 flow [2023-11-19 08:02:53,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 383 transitions, 3626 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-11-19 08:02:53,865 INFO L231 Difference]: Finished difference. Result has 125 places, 248 transitions, 2550 flow [2023-11-19 08:02:53,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=1917, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2550, PETRI_PLACES=125, PETRI_TRANSITIONS=248} [2023-11-19 08:02:53,869 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 66 predicate places. [2023-11-19 08:02:53,869 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 248 transitions, 2550 flow [2023-11-19 08:02:53,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 55.76923076923077) internal successors, (1450), 26 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:53,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:53,871 INFO L208 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] [2023-11-19 08:02:53,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 08:02:54,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-19 08:02:54,085 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 08:02:54,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:54,085 INFO L85 PathProgramCache]: Analyzing trace with hash 173595536, now seen corresponding path program 1 times [2023-11-19 08:02:54,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:54,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428995478] [2023-11-19 08:02:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:54,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:54,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:54,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428995478] [2023-11-19 08:02:54,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428995478] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:02:54,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868810839] [2023-11-19 08:02:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:54,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:54,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:54,657 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:02:54,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 08:02:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:54,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-19 08:02:54,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:02:54,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 08:02:54,883 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 08:02:54,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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 [2023-11-19 08:02:54,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:02:54,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2023-11-19 08:02:55,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:02:55,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 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 [2023-11-19 08:02:55,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:02:55,108 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 [2023-11-19 08:02:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:55,118 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:02:55,240 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of1ForFork0_~t~0.base_41 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_41) (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_41 v_ArrVal_589) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_41 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_41) (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_41 v_ArrVal_589) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_41 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_41) (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_41 v_ArrVal_589) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_41 Int)) (or (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_41 v_ArrVal_589) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_41)))) is different from false [2023-11-19 08:02:55,291 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_threadThread1of1ForFork0_~t~0.base_41 Int)) (or (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_41 v_ArrVal_589) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_41))) (forall ((v_threadThread1of1ForFork0_~t~0.base_41 Int)) (or (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_41 v_ArrVal_589) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_41))) (forall ((v_threadThread1of1ForFork0_~t~0.base_41 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_41) (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_41 v_ArrVal_589) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_41 Int)) (or (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_41 v_ArrVal_589) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_41)))))) is different from false [2023-11-19 08:02:55,341 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (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|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of1ForFork0_~t~0.base_41 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_41) (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_41 v_ArrVal_589) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_41 Int)) (or (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_41 v_ArrVal_589) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_41))) (forall ((v_threadThread1of1ForFork0_~t~0.base_41 Int)) (or (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_41 v_ArrVal_589) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_41))) (forall ((v_threadThread1of1ForFork0_~t~0.base_41 Int)) (or (forall ((v_ArrVal_589 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_41 v_ArrVal_589) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_41)))))) is different from false [2023-11-19 08:02:57,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:02:57,575 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 35 treesize of output 51 [2023-11-19 08:02:57,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:02:57,590 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 64 treesize of output 36 [2023-11-19 08:02:57,603 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-19 08:02:57,604 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 35 treesize of output 1 [2023-11-19 08:02:57,612 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-19 08:02:57,613 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 33 treesize of output 1 [2023-11-19 08:02:57,621 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-19 08:02:57,622 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 35 treesize of output 1 [2023-11-19 08:02:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:57,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868810839] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:02:57,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:02:57,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2023-11-19 08:02:57,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686236465] [2023-11-19 08:02:57,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:02:57,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-19 08:02:57,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:57,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-19 08:02:57,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=488, Unknown=8, NotChecked=144, Total=756 [2023-11-19 08:02:57,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 191 [2023-11-19 08:02:57,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 248 transitions, 2550 flow. Second operand has 28 states, 28 states have (on average 57.607142857142854) internal successors, (1613), 28 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:57,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:57,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 191 [2023-11-19 08:02:57,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:58,832 INFO L124 PetriNetUnfolderBase]: 438/1054 cut-off events. [2023-11-19 08:02:58,832 INFO L125 PetriNetUnfolderBase]: For 6389/6398 co-relation queries the response was YES. [2023-11-19 08:02:58,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6090 conditions, 1054 events. 438/1054 cut-off events. For 6389/6398 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6145 event pairs, 68 based on Foata normal form. 23/1042 useless extension candidates. Maximal degree in co-relation 5960. Up to 964 conditions per place. [2023-11-19 08:02:58,848 INFO L140 encePairwiseOnDemand]: 182/191 looper letters, 263 selfloop transitions, 13 changer transitions 1/279 dead transitions. [2023-11-19 08:02:58,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 279 transitions, 3263 flow [2023-11-19 08:02:58,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 08:02:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-19 08:02:58,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 633 transitions. [2023-11-19 08:02:58,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33141361256544505 [2023-11-19 08:02:58,853 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 633 transitions. [2023-11-19 08:02:58,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 633 transitions. [2023-11-19 08:02:58,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:58,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 633 transitions. [2023-11-19 08:02:58,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 63.3) internal successors, (633), 10 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:58,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:58,860 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:58,860 INFO L175 Difference]: Start difference. First operand has 125 places, 248 transitions, 2550 flow. Second operand 10 states and 633 transitions. [2023-11-19 08:02:58,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 279 transitions, 3263 flow [2023-11-19 08:02:58,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 279 transitions, 3198 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-11-19 08:02:58,903 INFO L231 Difference]: Finished difference. Result has 121 places, 247 transitions, 2512 flow [2023-11-19 08:02:58,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=2478, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2512, PETRI_PLACES=121, PETRI_TRANSITIONS=247} [2023-11-19 08:02:58,905 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 62 predicate places. [2023-11-19 08:02:58,905 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 247 transitions, 2512 flow [2023-11-19 08:02:58,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 57.607142857142854) internal successors, (1613), 28 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:58,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:58,907 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:58,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 08:02:59,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:59,122 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 08:02:59,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:59,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1641413046, now seen corresponding path program 2 times [2023-11-19 08:02:59,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:59,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150021013] [2023-11-19 08:02:59,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:59,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:59,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:59,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150021013] [2023-11-19 08:02:59,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150021013] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:02:59,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122349421] [2023-11-19 08:02:59,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 08:02:59,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:59,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:59,853 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:02:59,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046c7ff6-b80d-4ef1-8240-2b9740ccbdd2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 08:03:00,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 08:03:00,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:03:00,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-19 08:03:00,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:03:00,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-19 08:03:00,188 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 08:03:00,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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 [2023-11-19 08:03:00,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:03:00,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2023-11-19 08:03:00,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:00,347 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 34 treesize of output 25 [2023-11-19 08:03:00,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:03:00,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 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 [2023-11-19 08:03:00,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:00,445 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 [2023-11-19 08:03:00,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:00,479 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 [2023-11-19 08:03:00,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:00,505 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 [2023-11-19 08:03:00,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:00,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:00,644 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 08:03:00,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2023-11-19 08:03:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:00,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:03:00,702 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-19 08:03:00,813 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (and (forall ((v_ArrVal_707 (Array Int Int))) (or (forall ((v_ArrVal_708 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))) (not (= (select v_ArrVal_707 .cse0) 0)))) (forall ((v_ArrVal_707 (Array Int Int))) (or (not (= (select v_ArrVal_707 .cse0) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_707 (Array Int Int))) (or (not (= (select v_ArrVal_707 .cse0) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_707 (Array Int Int))) (or (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_707 .cse0) 0)))))) is different from false [2023-11-19 08:03:00,928 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_707 (Array Int Int))) (or (not (= (select v_ArrVal_707 .cse0) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_707 (Array Int Int))) (or (not (= (select v_ArrVal_707 .cse0) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset))))) (forall ((v_ArrVal_707 (Array Int Int))) (or (forall ((v_ArrVal_708 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)))) (not (= (select v_ArrVal_707 .cse0) 0)))) (forall ((v_ArrVal_707 (Array Int Int))) (or (not (= (select v_ArrVal_707 .cse0) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))))) is different from false [2023-11-19 08:03:00,977 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse0 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (or (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_703) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_707 .cse1) 0)))) (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (or (not (= (select v_ArrVal_707 .cse1) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_703) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (or (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_703) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_707 .cse1) 0)))) (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (or (not (= (select v_ArrVal_707 .cse1) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_703) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-11-19 08:03:01,027 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (and (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (or (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_703) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_707 .cse3) 0)))) (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (or (not (= (select v_ArrVal_707 .cse3) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_703) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (or (not (= (select v_ArrVal_707 .cse3) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_703) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (or (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_703) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_708) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_707 .cse3) 0))))))) is different from false [2023-11-19 08:03:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-19 08:03:01,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122349421] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:03:01,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:03:01,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 29 [2023-11-19 08:03:01,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740000579] [2023-11-19 08:03:01,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:03:01,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-19 08:03:01,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:01,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-19 08:03:01,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=549, Unknown=5, NotChecked=260, Total=930 [2023-11-19 08:03:01,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 191 [2023-11-19 08:03:01,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 247 transitions, 2512 flow. Second operand has 31 states, 31 states have (on average 55.74193548387097) internal successors, (1728), 31 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:01,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:01,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 191 [2023-11-19 08:03:01,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:04,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 08:03:06,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 08:03:08,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 08:03:11,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 08:03:13,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]