./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a87860dbf851812846995aa918799e2b576306268e8c461660702f868d3b2804 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:15:45,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:15:45,568 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:15:45,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:15:45,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:15:45,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:15:45,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:15:45,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:15:45,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:15:45,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:15:45,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:15:45,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:15:45,627 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:15:45,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:15:45,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:15:45,630 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:15:45,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:15:45,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:15:45,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:15:45,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:15:45,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:15:45,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:15:45,636 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:15:45,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:15:45,639 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:15:45,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:15:45,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:15:45,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:15:45,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:15:45,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:15:45,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:15:45,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:15:45,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:15:45,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:15:45,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:15:45,644 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:15:45,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:15:45,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:15:45,645 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:15:45,645 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_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/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_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 ! call(reach_error())) ) 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 -> a87860dbf851812846995aa918799e2b576306268e8c461660702f868d3b2804 [2023-11-06 21:15:45,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:15:45,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:15:45,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:15:45,934 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:15:45,935 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:15:45,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2023-11-06 21:15:49,149 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:15:49,381 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:15:49,382 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2023-11-06 21:15:49,390 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/data/a9d37db88/a1b610c189384f47875b112316a5cb91/FLAG3f1bb4a46 [2023-11-06 21:15:49,413 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/data/a9d37db88/a1b610c189384f47875b112316a5cb91 [2023-11-06 21:15:49,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:15:49,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:15:49,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:15:49,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:15:49,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:15:49,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:49" (1/1) ... [2023-11-06 21:15:49,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454bac6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49, skipping insertion in model container [2023-11-06 21:15:49,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:49" (1/1) ... [2023-11-06 21:15:49,478 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:15:49,743 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c[2553,2566] [2023-11-06 21:15:49,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:15:49,768 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:15:49,795 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c[2553,2566] [2023-11-06 21:15:49,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:15:49,810 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:15:49,810 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:15:49,819 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:15:49,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49 WrapperNode [2023-11-06 21:15:49,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:15:49,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:15:49,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:15:49,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:15:49,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49" (1/1) ... [2023-11-06 21:15:49,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49" (1/1) ... [2023-11-06 21:15:49,869 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 104 [2023-11-06 21:15:49,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:15:49,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:15:49,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:15:49,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:15:49,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49" (1/1) ... [2023-11-06 21:15:49,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49" (1/1) ... [2023-11-06 21:15:49,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49" (1/1) ... [2023-11-06 21:15:49,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49" (1/1) ... [2023-11-06 21:15:49,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49" (1/1) ... [2023-11-06 21:15:49,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49" (1/1) ... [2023-11-06 21:15:49,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49" (1/1) ... [2023-11-06 21:15:49,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49" (1/1) ... [2023-11-06 21:15:49,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:15:49,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:15:49,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:15:49,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:15:49,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49" (1/1) ... [2023-11-06 21:15:49,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:15:49,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:50,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:15:50,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:15:50,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:15:50,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 21:15:50,061 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 21:15:50,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 21:15:50,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 21:15:50,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-06 21:15:50,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-06 21:15:50,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:15:50,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:15:50,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:15:50,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:15:50,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:15:50,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:15:50,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:15:50,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:15:50,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:15:50,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:15:50,067 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 21:15:50,205 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:15:50,207 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:15:50,607 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:15:50,671 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:15:50,671 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 21:15:50,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:50 BoogieIcfgContainer [2023-11-06 21:15:50,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:15:50,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:15:50,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:15:50,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:15:50,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:15:49" (1/3) ... [2023-11-06 21:15:50,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46416a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:50, skipping insertion in model container [2023-11-06 21:15:50,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:49" (2/3) ... [2023-11-06 21:15:50,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46416a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:50, skipping insertion in model container [2023-11-06 21:15:50,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:50" (3/3) ... [2023-11-06 21:15:50,690 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2023-11-06 21:15:50,699 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 21:15:50,728 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:15:50,728 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:15:50,729 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:15:50,864 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-06 21:15:50,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 156 transitions, 333 flow [2023-11-06 21:15:50,991 INFO L124 PetriNetUnfolderBase]: 12/153 cut-off events. [2023-11-06 21:15:50,991 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 21:15:50,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 153 events. 12/153 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 101 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2023-11-06 21:15:50,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 156 transitions, 333 flow [2023-11-06 21:15:51,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 142 transitions, 302 flow [2023-11-06 21:15:51,008 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:15:51,019 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 142 transitions, 302 flow [2023-11-06 21:15:51,022 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 142 transitions, 302 flow [2023-11-06 21:15:51,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 142 transitions, 302 flow [2023-11-06 21:15:51,067 INFO L124 PetriNetUnfolderBase]: 12/142 cut-off events. [2023-11-06 21:15:51,067 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 21:15:51,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 12/142 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 100 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2023-11-06 21:15:51,071 INFO L119 LiptonReduction]: Number of co-enabled transitions 1518 [2023-11-06 21:15:57,240 INFO L134 LiptonReduction]: Checked pairs total: 1673 [2023-11-06 21:15:57,241 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-11-06 21:15:57,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:15:57,263 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=LoopsAndPotentialCycles, 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;@217cc51f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:15:57,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-06 21:15:57,271 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:15:57,272 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2023-11-06 21:15:57,272 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 21:15:57,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:57,273 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] [2023-11-06 21:15:57,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:15:57,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:57,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1337388086, now seen corresponding path program 1 times [2023-11-06 21:15:57,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:57,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098459576] [2023-11-06 21:15:57,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:57,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:57,732 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-06 21:15:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:57,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098459576] [2023-11-06 21:15:57,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098459576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:57,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:57,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:15:57,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800732948] [2023-11-06 21:15:57,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:57,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:57,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:57,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:57,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:57,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 297 [2023-11-06 21:15:57,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-06 21:15:57,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:57,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 297 [2023-11-06 21:15:57,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:57,934 INFO L124 PetriNetUnfolderBase]: 360/508 cut-off events. [2023-11-06 21:15:57,934 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-06 21:15:57,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 508 events. 360/508 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1607 event pairs, 39 based on Foata normal form. 1/307 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2023-11-06 21:15:57,942 INFO L140 encePairwiseOnDemand]: 292/297 looper letters, 32 selfloop transitions, 4 changer transitions 1/40 dead transitions. [2023-11-06 21:15:57,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 187 flow [2023-11-06 21:15:57,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-11-06 21:15:57,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500561167227834 [2023-11-06 21:15:57,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-11-06 21:15:57,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-11-06 21:15:57,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:57,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-11-06 21:15:57,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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-06 21:15:57,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-06 21:15:57,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-06 21:15:57,995 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 446 transitions. [2023-11-06 21:15:57,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 187 flow [2023-11-06 21:15:58,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 40 transitions, 165 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-06 21:15:58,002 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2023-11-06 21:15:58,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-11-06 21:15:58,009 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2023-11-06 21:15:58,009 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2023-11-06 21:15:58,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-06 21:15:58,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:58,011 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-06 21:15:58,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:15:58,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:15:58,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:58,012 INFO L85 PathProgramCache]: Analyzing trace with hash 612325594, now seen corresponding path program 1 times [2023-11-06 21:15:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629259705] [2023-11-06 21:15:58,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:58,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:15:58,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:58,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629259705] [2023-11-06 21:15:58,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629259705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:58,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:58,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:15:58,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391210665] [2023-11-06 21:15:58,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:58,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:58,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:58,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:58,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:58,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 297 [2023-11-06 21:15:58,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 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-06 21:15:58,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:58,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 297 [2023-11-06 21:15:58,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:58,441 INFO L124 PetriNetUnfolderBase]: 326/475 cut-off events. [2023-11-06 21:15:58,441 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-06 21:15:58,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 475 events. 326/475 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1589 event pairs, 142 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 424. Up to 460 conditions per place. [2023-11-06 21:15:58,447 INFO L140 encePairwiseOnDemand]: 294/297 looper letters, 23 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-11-06 21:15:58,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 132 flow [2023-11-06 21:15:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-11-06 21:15:58,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4668911335578002 [2023-11-06 21:15:58,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-11-06 21:15:58,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-11-06 21:15:58,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:58,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-11-06 21:15:58,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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-06 21:15:58,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-06 21:15:58,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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-06 21:15:58,457 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 3 states and 416 transitions. [2023-11-06 21:15:58,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 132 flow [2023-11-06 21:15:58,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:58,459 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 88 flow [2023-11-06 21:15:58,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2023-11-06 21:15:58,460 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-11-06 21:15:58,461 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 88 flow [2023-11-06 21:15:58,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 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-06 21:15:58,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:58,462 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] [2023-11-06 21:15:58,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:15:58,462 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:15:58,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:58,463 INFO L85 PathProgramCache]: Analyzing trace with hash 810421534, now seen corresponding path program 1 times [2023-11-06 21:15:58,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:58,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627453827] [2023-11-06 21:15:58,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:58,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 21:15:58,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:58,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627453827] [2023-11-06 21:15:58,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627453827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:58,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:58,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:15:58,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244220583] [2023-11-06 21:15:58,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:58,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:58,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:58,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:58,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:58,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 297 [2023-11-06 21:15:58,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-06 21:15:58,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:58,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 297 [2023-11-06 21:15:58,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:58,774 INFO L124 PetriNetUnfolderBase]: 396/564 cut-off events. [2023-11-06 21:15:58,775 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2023-11-06 21:15:58,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 564 events. 396/564 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1925 event pairs, 126 based on Foata normal form. 38/597 useless extension candidates. Maximal degree in co-relation 1358. Up to 425 conditions per place. [2023-11-06 21:15:58,782 INFO L140 encePairwiseOnDemand]: 293/297 looper letters, 34 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-11-06 21:15:58,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 200 flow [2023-11-06 21:15:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:15:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:15:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-11-06 21:15:58,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2023-11-06 21:15:58,786 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-11-06 21:15:58,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-11-06 21:15:58,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:58,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-11-06 21:15:58,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 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-06 21:15:58,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 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-06 21:15:58,794 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 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-06 21:15:58,794 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 88 flow. Second operand 4 states and 549 transitions. [2023-11-06 21:15:58,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 200 flow [2023-11-06 21:15:58,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 194 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:58,797 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 101 flow [2023-11-06 21:15:58,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2023-11-06 21:15:58,798 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-11-06 21:15:58,798 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 101 flow [2023-11-06 21:15:58,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-06 21:15:58,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:58,800 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] [2023-11-06 21:15:58,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:15:58,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:15:58,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash -970585047, now seen corresponding path program 1 times [2023-11-06 21:15:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:58,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897950009] [2023-11-06 21:15:58,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:58,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:15:58,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:58,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897950009] [2023-11-06 21:15:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897950009] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:58,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40756190] [2023-11-06 21:15:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:58,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:58,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:58,944 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:15:58,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:15:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:59,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:15:59,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:15:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:15:59,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:15:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:15:59,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40756190] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:59,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:15:59,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-11-06 21:15:59,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978076362] [2023-11-06 21:15:59,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:59,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:15:59,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:59,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:15:59,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:15:59,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 297 [2023-11-06 21:15:59,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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-06 21:15:59,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:59,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 297 [2023-11-06 21:15:59,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:59,522 INFO L124 PetriNetUnfolderBase]: 324/474 cut-off events. [2023-11-06 21:15:59,523 INFO L125 PetriNetUnfolderBase]: For 236/271 co-relation queries the response was YES. [2023-11-06 21:15:59,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 474 events. 324/474 cut-off events. For 236/271 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1548 event pairs, 101 based on Foata normal form. 65/531 useless extension candidates. Maximal degree in co-relation 1291. Up to 361 conditions per place. [2023-11-06 21:15:59,529 INFO L140 encePairwiseOnDemand]: 292/297 looper letters, 35 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2023-11-06 21:15:59,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 231 flow [2023-11-06 21:15:59,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:15:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:15:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2023-11-06 21:15:59,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43703703703703706 [2023-11-06 21:15:59,534 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2023-11-06 21:15:59,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2023-11-06 21:15:59,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:59,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2023-11-06 21:15:59,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 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-06 21:15:59,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 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-06 21:15:59,544 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 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-06 21:15:59,545 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 101 flow. Second operand 5 states and 649 transitions. [2023-11-06 21:15:59,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 231 flow [2023-11-06 21:15:59,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 216 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 21:15:59,548 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 113 flow [2023-11-06 21:15:59,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2023-11-06 21:15:59,549 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-11-06 21:15:59,550 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 113 flow [2023-11-06 21:15:59,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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-06 21:15:59,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:59,551 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] [2023-11-06 21:15:59,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:15:59,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:59,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:15:59,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:59,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1779849093, now seen corresponding path program 1 times [2023-11-06 21:15:59,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:59,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370368515] [2023-11-06 21:15:59,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:59,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:00,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:00,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370368515] [2023-11-06 21:16:00,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370368515] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:00,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21365939] [2023-11-06 21:16:00,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:00,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:00,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:00,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:00,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:16:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:00,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-06 21:16:00,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:01,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:01,397 INFO L351 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 36 treesize of output 27 [2023-11-06 21:16:01,552 INFO L351 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 54 treesize of output 30 [2023-11-06 21:16:01,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:01,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:01,966 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:16:01,966 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 105 [2023-11-06 21:16:01,978 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 73 treesize of output 61 [2023-11-06 21:16:01,987 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 61 treesize of output 55 [2023-11-06 21:16:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:02,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21365939] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:02,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:02,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-11-06 21:16:02,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936925657] [2023-11-06 21:16:02,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:02,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 21:16:02,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:02,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 21:16:02,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=409, Unknown=5, NotChecked=0, Total=506 [2023-11-06 21:16:02,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 297 [2023-11-06 21:16:02,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 113 flow. Second operand has 23 states, 23 states have (on average 87.3913043478261) internal successors, (2010), 23 states have internal predecessors, (2010), 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-06 21:16:02,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:02,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 297 [2023-11-06 21:16:02,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:03,495 INFO L124 PetriNetUnfolderBase]: 643/936 cut-off events. [2023-11-06 21:16:03,496 INFO L125 PetriNetUnfolderBase]: For 549/549 co-relation queries the response was YES. [2023-11-06 21:16:03,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 936 events. 643/936 cut-off events. For 549/549 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3583 event pairs, 58 based on Foata normal form. 1/935 useless extension candidates. Maximal degree in co-relation 2392. Up to 639 conditions per place. [2023-11-06 21:16:03,505 INFO L140 encePairwiseOnDemand]: 287/297 looper letters, 72 selfloop transitions, 24 changer transitions 1/98 dead transitions. [2023-11-06 21:16:03,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 98 transitions, 524 flow [2023-11-06 21:16:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:16:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 21:16:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 946 transitions. [2023-11-06 21:16:03,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31851851851851853 [2023-11-06 21:16:03,512 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 946 transitions. [2023-11-06 21:16:03,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 946 transitions. [2023-11-06 21:16:03,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:03,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 946 transitions. [2023-11-06 21:16:03,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.6) internal successors, (946), 10 states have internal predecessors, (946), 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-06 21:16:03,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-06 21:16:03,525 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-06 21:16:03,525 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 113 flow. Second operand 10 states and 946 transitions. [2023-11-06 21:16:03,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 98 transitions, 524 flow [2023-11-06 21:16:03,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 98 transitions, 508 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 21:16:03,533 INFO L231 Difference]: Finished difference. Result has 45 places, 49 transitions, 269 flow [2023-11-06 21:16:03,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=269, PETRI_PLACES=45, PETRI_TRANSITIONS=49} [2023-11-06 21:16:03,536 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2023-11-06 21:16:03,536 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 49 transitions, 269 flow [2023-11-06 21:16:03,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 87.3913043478261) internal successors, (2010), 23 states have internal predecessors, (2010), 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-06 21:16:03,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:03,538 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] [2023-11-06 21:16:03,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:03,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:03,744 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:03,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:03,745 INFO L85 PathProgramCache]: Analyzing trace with hash 230471087, now seen corresponding path program 2 times [2023-11-06 21:16:03,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:03,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791006026] [2023-11-06 21:16:03,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:03,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791006026] [2023-11-06 21:16:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791006026] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280093911] [2023-11-06 21:16:04,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:16:04,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:04,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:04,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:04,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 21:16:04,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:16:04,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:04,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 21:16:04,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:05,090 INFO L351 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 55 treesize of output 31 [2023-11-06 21:16:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:05,148 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:05,318 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:16:05,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 49 [2023-11-06 21:16:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:05,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280093911] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:05,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 21 [2023-11-06 21:16:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701856963] [2023-11-06 21:16:05,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:05,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 21:16:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:05,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 21:16:05,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-11-06 21:16:06,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 297 [2023-11-06 21:16:06,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 49 transitions, 269 flow. Second operand has 23 states, 23 states have (on average 109.8695652173913) internal successors, (2527), 23 states have internal predecessors, (2527), 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-06 21:16:06,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:06,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 297 [2023-11-06 21:16:06,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:07,631 INFO L124 PetriNetUnfolderBase]: 913/1342 cut-off events. [2023-11-06 21:16:07,631 INFO L125 PetriNetUnfolderBase]: For 1602/1602 co-relation queries the response was YES. [2023-11-06 21:16:07,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4506 conditions, 1342 events. 913/1342 cut-off events. For 1602/1602 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4907 event pairs, 175 based on Foata normal form. 1/1342 useless extension candidates. Maximal degree in co-relation 3920. Up to 994 conditions per place. [2023-11-06 21:16:07,648 INFO L140 encePairwiseOnDemand]: 286/297 looper letters, 85 selfloop transitions, 55 changer transitions 1/141 dead transitions. [2023-11-06 21:16:07,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 141 transitions, 939 flow [2023-11-06 21:16:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 21:16:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-06 21:16:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2049 transitions. [2023-11-06 21:16:07,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3832772166105499 [2023-11-06 21:16:07,661 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2049 transitions. [2023-11-06 21:16:07,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2049 transitions. [2023-11-06 21:16:07,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:07,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2049 transitions. [2023-11-06 21:16:07,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 113.83333333333333) internal successors, (2049), 18 states have internal predecessors, (2049), 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-06 21:16:07,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 297.0) internal successors, (5643), 19 states have internal predecessors, (5643), 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-06 21:16:07,691 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 297.0) internal successors, (5643), 19 states have internal predecessors, (5643), 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-06 21:16:07,695 INFO L175 Difference]: Start difference. First operand has 45 places, 49 transitions, 269 flow. Second operand 18 states and 2049 transitions. [2023-11-06 21:16:07,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 141 transitions, 939 flow [2023-11-06 21:16:07,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 141 transitions, 878 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-11-06 21:16:07,707 INFO L231 Difference]: Finished difference. Result has 68 places, 95 transitions, 654 flow [2023-11-06 21:16:07,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=654, PETRI_PLACES=68, PETRI_TRANSITIONS=95} [2023-11-06 21:16:07,710 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2023-11-06 21:16:07,711 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 95 transitions, 654 flow [2023-11-06 21:16:07,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 109.8695652173913) internal successors, (2527), 23 states have internal predecessors, (2527), 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-06 21:16:07,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:07,713 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] [2023-11-06 21:16:07,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 21:16:07,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 21:16:07,920 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:07,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:07,920 INFO L85 PathProgramCache]: Analyzing trace with hash 602502233, now seen corresponding path program 3 times [2023-11-06 21:16:07,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:07,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565317609] [2023-11-06 21:16:07,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:07,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:08,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:08,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565317609] [2023-11-06 21:16:08,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565317609] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:08,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781629156] [2023-11-06 21:16:08,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:16:08,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:08,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:08,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:08,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 21:16:08,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 21:16:08,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:08,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 21:16:08,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:09,041 INFO L351 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 55 treesize of output 31 [2023-11-06 21:16:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:09,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:09,235 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:16:09,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 49 [2023-11-06 21:16:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:09,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781629156] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:09,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:09,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-11-06 21:16:09,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44091350] [2023-11-06 21:16:09,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:09,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 21:16:09,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:09,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 21:16:09,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-11-06 21:16:10,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 297 [2023-11-06 21:16:10,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 95 transitions, 654 flow. Second operand has 22 states, 22 states have (on average 108.77272727272727) internal successors, (2393), 22 states have internal predecessors, (2393), 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-06 21:16:10,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:10,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 297 [2023-11-06 21:16:10,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:11,423 INFO L124 PetriNetUnfolderBase]: 1103/1617 cut-off events. [2023-11-06 21:16:11,423 INFO L125 PetriNetUnfolderBase]: For 3494/3494 co-relation queries the response was YES. [2023-11-06 21:16:11,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6498 conditions, 1617 events. 1103/1617 cut-off events. For 3494/3494 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6197 event pairs, 214 based on Foata normal form. 1/1618 useless extension candidates. Maximal degree in co-relation 5550. Up to 1257 conditions per place. [2023-11-06 21:16:11,445 INFO L140 encePairwiseOnDemand]: 286/297 looper letters, 115 selfloop transitions, 84 changer transitions 1/200 dead transitions. [2023-11-06 21:16:11,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 200 transitions, 1618 flow [2023-11-06 21:16:11,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 21:16:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-06 21:16:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2261 transitions. [2023-11-06 21:16:11,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38063973063973067 [2023-11-06 21:16:11,458 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2261 transitions. [2023-11-06 21:16:11,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2261 transitions. [2023-11-06 21:16:11,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:11,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2261 transitions. [2023-11-06 21:16:11,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 113.05) internal successors, (2261), 20 states have internal predecessors, (2261), 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-06 21:16:11,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 297.0) internal successors, (6237), 21 states have internal predecessors, (6237), 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-06 21:16:11,485 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 297.0) internal successors, (6237), 21 states have internal predecessors, (6237), 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-06 21:16:11,485 INFO L175 Difference]: Start difference. First operand has 68 places, 95 transitions, 654 flow. Second operand 20 states and 2261 transitions. [2023-11-06 21:16:11,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 200 transitions, 1618 flow [2023-11-06 21:16:11,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 200 transitions, 1537 flow, removed 26 selfloop flow, removed 3 redundant places. [2023-11-06 21:16:11,506 INFO L231 Difference]: Finished difference. Result has 94 places, 141 transitions, 1217 flow [2023-11-06 21:16:11,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1217, PETRI_PLACES=94, PETRI_TRANSITIONS=141} [2023-11-06 21:16:11,507 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 64 predicate places. [2023-11-06 21:16:11,507 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 141 transitions, 1217 flow [2023-11-06 21:16:11,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 108.77272727272727) internal successors, (2393), 22 states have internal predecessors, (2393), 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-06 21:16:11,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:11,509 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] [2023-11-06 21:16:11,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:11,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:11,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:11,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1827137497, now seen corresponding path program 4 times [2023-11-06 21:16:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:11,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636760671] [2023-11-06 21:16:11,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:11,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:12,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:12,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636760671] [2023-11-06 21:16:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636760671] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:12,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180422844] [2023-11-06 21:16:12,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 21:16:12,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:12,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:12,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:12,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 21:16:12,499 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 21:16:12,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:12,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 21:16:12,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:12,900 INFO L351 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 55 treesize of output 31 [2023-11-06 21:16:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:12,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:13,081 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:16:13,081 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 49 [2023-11-06 21:16:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:13,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180422844] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:13,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:13,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 21 [2023-11-06 21:16:13,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423201113] [2023-11-06 21:16:13,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:13,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 21:16:13,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:13,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 21:16:13,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2023-11-06 21:16:14,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 297 [2023-11-06 21:16:14,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 141 transitions, 1217 flow. Second operand has 23 states, 23 states have (on average 108.69565217391305) internal successors, (2500), 23 states have internal predecessors, (2500), 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-06 21:16:14,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:14,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 297 [2023-11-06 21:16:14,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:15,525 INFO L124 PetriNetUnfolderBase]: 1212/1783 cut-off events. [2023-11-06 21:16:15,526 INFO L125 PetriNetUnfolderBase]: For 4925/4925 co-relation queries the response was YES. [2023-11-06 21:16:15,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7871 conditions, 1783 events. 1212/1783 cut-off events. For 4925/4925 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7058 event pairs, 219 based on Foata normal form. 1/1772 useless extension candidates. Maximal degree in co-relation 7385. Up to 1380 conditions per place. [2023-11-06 21:16:15,551 INFO L140 encePairwiseOnDemand]: 286/297 looper letters, 111 selfloop transitions, 100 changer transitions 1/212 dead transitions. [2023-11-06 21:16:15,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 212 transitions, 1980 flow [2023-11-06 21:16:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 21:16:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-06 21:16:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2039 transitions. [2023-11-06 21:16:15,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38140665918443695 [2023-11-06 21:16:15,562 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2039 transitions. [2023-11-06 21:16:15,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2039 transitions. [2023-11-06 21:16:15,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:15,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2039 transitions. [2023-11-06 21:16:15,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 113.27777777777777) internal successors, (2039), 18 states have internal predecessors, (2039), 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-06 21:16:15,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 297.0) internal successors, (5643), 19 states have internal predecessors, (5643), 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-06 21:16:15,584 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 297.0) internal successors, (5643), 19 states have internal predecessors, (5643), 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-06 21:16:15,584 INFO L175 Difference]: Start difference. First operand has 94 places, 141 transitions, 1217 flow. Second operand 18 states and 2039 transitions. [2023-11-06 21:16:15,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 212 transitions, 1980 flow [2023-11-06 21:16:15,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 212 transitions, 1894 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-11-06 21:16:15,618 INFO L231 Difference]: Finished difference. Result has 110 places, 157 transitions, 1550 flow [2023-11-06 21:16:15,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1550, PETRI_PLACES=110, PETRI_TRANSITIONS=157} [2023-11-06 21:16:15,621 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2023-11-06 21:16:15,622 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 157 transitions, 1550 flow [2023-11-06 21:16:15,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 108.69565217391305) internal successors, (2500), 23 states have internal predecessors, (2500), 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-06 21:16:15,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:15,623 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] [2023-11-06 21:16:15,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:15,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:15,833 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:15,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:15,833 INFO L85 PathProgramCache]: Analyzing trace with hash 956429821, now seen corresponding path program 5 times [2023-11-06 21:16:15,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:15,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038206852] [2023-11-06 21:16:15,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:15,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:16,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:16,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038206852] [2023-11-06 21:16:16,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038206852] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:16,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697740887] [2023-11-06 21:16:16,412 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 21:16:16,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:16,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:16,413 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:16,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 21:16:16,538 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-06 21:16:16,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:16,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 21:16:16,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:17,001 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:16:17,001 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 77 treesize of output 71 [2023-11-06 21:16:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:17,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:17,542 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:16:17,543 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2023-11-06 21:16:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:17,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697740887] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:17,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:17,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 19 [2023-11-06 21:16:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860635309] [2023-11-06 21:16:17,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:17,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 21:16:17,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:17,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 21:16:17,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-11-06 21:16:18,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 297 [2023-11-06 21:16:18,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 157 transitions, 1550 flow. Second operand has 21 states, 21 states have (on average 111.80952380952381) internal successors, (2348), 21 states have internal predecessors, (2348), 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-06 21:16:18,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:18,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 297 [2023-11-06 21:16:18,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:21,437 INFO L124 PetriNetUnfolderBase]: 1647/2444 cut-off events. [2023-11-06 21:16:21,437 INFO L125 PetriNetUnfolderBase]: For 9554/9614 co-relation queries the response was YES. [2023-11-06 21:16:21,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11600 conditions, 2444 events. 1647/2444 cut-off events. For 9554/9614 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 10991 event pairs, 190 based on Foata normal form. 12/2419 useless extension candidates. Maximal degree in co-relation 10929. Up to 1523 conditions per place. [2023-11-06 21:16:21,478 INFO L140 encePairwiseOnDemand]: 286/297 looper letters, 160 selfloop transitions, 177 changer transitions 5/352 dead transitions. [2023-11-06 21:16:21,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 352 transitions, 3467 flow [2023-11-06 21:16:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-06 21:16:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-06 21:16:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 4044 transitions. [2023-11-06 21:16:21,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.389033189033189 [2023-11-06 21:16:21,499 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 4044 transitions. [2023-11-06 21:16:21,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 4044 transitions. [2023-11-06 21:16:21,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:21,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 4044 transitions. [2023-11-06 21:16:21,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 115.54285714285714) internal successors, (4044), 35 states have internal predecessors, (4044), 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-06 21:16:21,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 297.0) internal successors, (10692), 36 states have internal predecessors, (10692), 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-06 21:16:21,557 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 297.0) internal successors, (10692), 36 states have internal predecessors, (10692), 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-06 21:16:21,557 INFO L175 Difference]: Start difference. First operand has 110 places, 157 transitions, 1550 flow. Second operand 35 states and 4044 transitions. [2023-11-06 21:16:21,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 352 transitions, 3467 flow [2023-11-06 21:16:21,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 352 transitions, 3358 flow, removed 25 selfloop flow, removed 7 redundant places. [2023-11-06 21:16:21,608 INFO L231 Difference]: Finished difference. Result has 139 places, 255 transitions, 2757 flow [2023-11-06 21:16:21,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1451, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2757, PETRI_PLACES=139, PETRI_TRANSITIONS=255} [2023-11-06 21:16:21,609 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2023-11-06 21:16:21,610 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 255 transitions, 2757 flow [2023-11-06 21:16:21,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 111.80952380952381) internal successors, (2348), 21 states have internal predecessors, (2348), 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-06 21:16:21,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:21,611 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] [2023-11-06 21:16:21,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:21,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:21,817 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:21,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1521731287, now seen corresponding path program 6 times [2023-11-06 21:16:21,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:21,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568666947] [2023-11-06 21:16:21,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:21,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:22,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:22,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568666947] [2023-11-06 21:16:22,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568666947] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:22,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522354399] [2023-11-06 21:16:22,655 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 21:16:22,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:22,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:22,659 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:22,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 21:16:22,783 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-06 21:16:22,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:22,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-06 21:16:22,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:23,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:23,080 INFO L351 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 36 treesize of output 27 [2023-11-06 21:16:23,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:23,246 INFO L351 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 36 treesize of output 27 [2023-11-06 21:16:23,365 INFO L351 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 55 treesize of output 31 [2023-11-06 21:16:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:23,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:25,745 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base) .cse1))) (or (= c_~max1~0 .cse0) (< .cse0 (+ c_~max2~0 1))))) (or (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base) .cse1))) (= c_~max1~0 c_~max2~0)))) is different from false [2023-11-06 21:16:25,773 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:16:25,774 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 223 [2023-11-06 21:16:25,787 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 191 treesize of output 179 [2023-11-06 21:16:25,797 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 179 treesize of output 173 [2023-11-06 21:16:25,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 173 treesize of output 161 [2023-11-06 21:16:25,816 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 161 treesize of output 137 [2023-11-06 21:16:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:26,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522354399] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:26,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:26,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2023-11-06 21:16:26,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587768502] [2023-11-06 21:16:26,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:26,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 21:16:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:26,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 21:16:26,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=493, Unknown=7, NotChecked=46, Total=650 [2023-11-06 21:16:26,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 297 [2023-11-06 21:16:26,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 255 transitions, 2757 flow. Second operand has 26 states, 26 states have (on average 84.1923076923077) internal successors, (2189), 26 states have internal predecessors, (2189), 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-06 21:16:26,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:26,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 297 [2023-11-06 21:16:26,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:27,712 INFO L124 PetriNetUnfolderBase]: 1758/2621 cut-off events. [2023-11-06 21:16:27,712 INFO L125 PetriNetUnfolderBase]: For 11203/11295 co-relation queries the response was YES. [2023-11-06 21:16:27,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13503 conditions, 2621 events. 1758/2621 cut-off events. For 11203/11295 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12123 event pairs, 105 based on Foata normal form. 15/2587 useless extension candidates. Maximal degree in co-relation 13274. Up to 2004 conditions per place. [2023-11-06 21:16:27,758 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 195 selfloop transitions, 100 changer transitions 1/306 dead transitions. [2023-11-06 21:16:27,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 306 transitions, 3607 flow [2023-11-06 21:16:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:16:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 21:16:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 916 transitions. [2023-11-06 21:16:27,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3084175084175084 [2023-11-06 21:16:27,762 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 916 transitions. [2023-11-06 21:16:27,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 916 transitions. [2023-11-06 21:16:27,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:27,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 916 transitions. [2023-11-06 21:16:27,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.6) internal successors, (916), 10 states have internal predecessors, (916), 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-06 21:16:27,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-06 21:16:27,771 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-06 21:16:27,772 INFO L175 Difference]: Start difference. First operand has 139 places, 255 transitions, 2757 flow. Second operand 10 states and 916 transitions. [2023-11-06 21:16:27,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 306 transitions, 3607 flow [2023-11-06 21:16:27,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 306 transitions, 2875 flow, removed 299 selfloop flow, removed 12 redundant places. [2023-11-06 21:16:27,882 INFO L231 Difference]: Finished difference. Result has 139 places, 264 transitions, 2408 flow [2023-11-06 21:16:27,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=2031, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2408, PETRI_PLACES=139, PETRI_TRANSITIONS=264} [2023-11-06 21:16:27,883 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2023-11-06 21:16:27,883 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 264 transitions, 2408 flow [2023-11-06 21:16:27,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 84.1923076923077) internal successors, (2189), 26 states have internal predecessors, (2189), 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-06 21:16:27,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:27,884 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] [2023-11-06 21:16:27,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:28,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 21:16:28,092 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:28,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:28,092 INFO L85 PathProgramCache]: Analyzing trace with hash 310532207, now seen corresponding path program 7 times [2023-11-06 21:16:28,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:28,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281583440] [2023-11-06 21:16:28,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:28,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:28,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:28,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281583440] [2023-11-06 21:16:28,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281583440] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:28,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765359192] [2023-11-06 21:16:28,639 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 21:16:28,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:28,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:28,641 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:28,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 21:16:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:28,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 21:16:28,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:29,052 INFO L351 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 54 treesize of output 30 [2023-11-06 21:16:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:29,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:29,250 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:16:29,251 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 49 [2023-11-06 21:16:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:29,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765359192] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:29,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:29,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2023-11-06 21:16:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111261321] [2023-11-06 21:16:29,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:29,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 21:16:29,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:29,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 21:16:29,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-11-06 21:16:30,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 297 [2023-11-06 21:16:30,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 264 transitions, 2408 flow. Second operand has 20 states, 20 states have (on average 110.85) internal successors, (2217), 20 states have internal predecessors, (2217), 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-06 21:16:30,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:30,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 297 [2023-11-06 21:16:30,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:31,392 INFO L124 PetriNetUnfolderBase]: 1860/2761 cut-off events. [2023-11-06 21:16:31,393 INFO L125 PetriNetUnfolderBase]: For 11054/11166 co-relation queries the response was YES. [2023-11-06 21:16:31,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12863 conditions, 2761 events. 1860/2761 cut-off events. For 11054/11166 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 12776 event pairs, 322 based on Foata normal form. 23/2704 useless extension candidates. Maximal degree in co-relation 12674. Up to 2421 conditions per place. [2023-11-06 21:16:31,436 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 195 selfloop transitions, 88 changer transitions 1/294 dead transitions. [2023-11-06 21:16:31,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 294 transitions, 3118 flow [2023-11-06 21:16:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:16:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 21:16:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1045 transitions. [2023-11-06 21:16:31,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39094650205761317 [2023-11-06 21:16:31,440 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1045 transitions. [2023-11-06 21:16:31,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1045 transitions. [2023-11-06 21:16:31,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:31,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1045 transitions. [2023-11-06 21:16:31,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.11111111111111) internal successors, (1045), 9 states have internal predecessors, (1045), 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-06 21:16:31,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-06 21:16:31,451 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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-06 21:16:31,451 INFO L175 Difference]: Start difference. First operand has 139 places, 264 transitions, 2408 flow. Second operand 9 states and 1045 transitions. [2023-11-06 21:16:31,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 294 transitions, 3118 flow [2023-11-06 21:16:31,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 294 transitions, 2975 flow, removed 30 selfloop flow, removed 5 redundant places. [2023-11-06 21:16:31,513 INFO L231 Difference]: Finished difference. Result has 144 places, 270 transitions, 2574 flow [2023-11-06 21:16:31,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2574, PETRI_PLACES=144, PETRI_TRANSITIONS=270} [2023-11-06 21:16:31,515 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 114 predicate places. [2023-11-06 21:16:31,515 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 270 transitions, 2574 flow [2023-11-06 21:16:31,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 110.85) internal successors, (2217), 20 states have internal predecessors, (2217), 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-06 21:16:31,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:31,517 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:31,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:31,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 21:16:31,723 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:31,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:31,723 INFO L85 PathProgramCache]: Analyzing trace with hash -751121875, now seen corresponding path program 8 times [2023-11-06 21:16:31,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:31,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446718315] [2023-11-06 21:16:31,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:31,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:31,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:31,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446718315] [2023-11-06 21:16:31,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446718315] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:31,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460156580] [2023-11-06 21:16:31,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:16:31,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:31,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:31,880 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:31,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 21:16:32,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:16:32,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:32,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:16:32,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:32,148 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:32,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460156580] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:32,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:32,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-06 21:16:32,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770608259] [2023-11-06 21:16:32,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:32,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 21:16:32,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:32,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 21:16:32,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-06 21:16:32,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 297 [2023-11-06 21:16:32,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 270 transitions, 2574 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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-06 21:16:32,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:32,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 297 [2023-11-06 21:16:32,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:32,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L46-4-->L46-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_37 (+ v_thread1Thread1of1ForFork0_~i~0_38 1)) (< v_thread1Thread1of1ForFork0_~i~0_38 v_~N~0_33) (let ((.cse0 (select (select |v_#memory_int_82| v_~A~0.base_47) (+ (* v_thread1Thread1of1ForFork0_~i~0_38 4) v_~A~0.offset_47)))) (or (and (< v_~max1~0_37 .cse0) (= v_~max1~0_36 .cse0)) (and (= v_~max1~0_37 v_~max1~0_36) (= |v_thread1Thread1of1ForFork0_#t~mem3_12| |v_thread1Thread1of1ForFork0_#t~mem3_11|) (<= .cse0 v_~max1~0_37))))) InVars {~max1~0=v_~max1~0_37, ~A~0.base=v_~A~0.base_47, ~A~0.offset=v_~A~0.offset_47, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_12|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_38, #memory_int=|v_#memory_int_82|, ~N~0=v_~N~0_33} OutVars{~max1~0=v_~max1~0_36, ~A~0.base=v_~A~0.base_47, ~A~0.offset=v_~A~0.offset_47, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_7|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_11|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_37, #memory_int=|v_#memory_int_82|, ~N~0=v_~N~0_33} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0][23], [Black: 698#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 718#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 819#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 665#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), 33#L70-4true, Black: 1389#(and (or (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (or (< (select (select |#memory_int| ~A~0.base) 0) 1) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0)), 314#true, Black: 1443#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), 658#true, 107#L46-4true, 109#L95-1true, Black: 535#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 554#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 646#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 514#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 837#true, 1543#true, 1215#true, Black: 472#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (= ~M~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 331#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 358#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 72#L58-4true, Black: 159#(= ~max2~0 ~max1~0), 1011#true, Black: 1375#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~M~0 0)), Black: 1247#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 172#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1377#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (or (= ~max2~0 0) (< 0 ~max1~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0)), Black: 164#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 478#true, Black: 901#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 876#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 894#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 886#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 311#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 813#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1211#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)) (< 1 ~N~0))), Black: 687#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1019#(= ~max2~0 ~max1~0), Black: 694#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1382#true]) [2023-11-06 21:16:32,995 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-11-06 21:16:32,995 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-06 21:16:32,995 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-06 21:16:32,995 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-06 21:16:32,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([566] L58-4-->L58-4: Formula: (and (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_25) (let ((.cse0 (select (select |v_#memory_int_102| v_~A~0.base_51) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_51)))) (or (and (= v_~max2~0_63 .cse0) (< v_~max2~0_64 .cse0)) (and (= v_~max2~0_64 v_~max2~0_63) (<= .cse0 v_~max2~0_64) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_64, #memory_int=|v_#memory_int_102|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_63, #memory_int=|v_#memory_int_102|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0][42], [Black: 698#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 718#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 819#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 665#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), 33#L70-4true, Black: 1389#(and (or (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (or (< (select (select |#memory_int| ~A~0.base) 0) 1) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0)), 314#true, 658#true, Black: 1443#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), 107#L46-4true, 109#L95-1true, Black: 535#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 554#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 646#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 514#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 837#true, 1543#true, 1215#true, Black: 472#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (= ~M~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 331#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 358#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 72#L58-4true, Black: 159#(= ~max2~0 ~max1~0), 1011#true, Black: 1375#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~M~0 0)), Black: 1247#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 172#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1377#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (or (= ~max2~0 0) (< 0 ~max1~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0)), Black: 164#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 478#true, Black: 901#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 876#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 894#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 886#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 311#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 813#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1211#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)) (< 1 ~N~0))), Black: 687#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1019#(= ~max2~0 ~max1~0), Black: 694#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1382#true]) [2023-11-06 21:16:32,996 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-11-06 21:16:32,996 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-06 21:16:32,996 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-06 21:16:32,996 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-06 21:16:33,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([566] L58-4-->L58-4: Formula: (and (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_25) (let ((.cse0 (select (select |v_#memory_int_102| v_~A~0.base_51) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_51)))) (or (and (= v_~max2~0_63 .cse0) (< v_~max2~0_64 .cse0)) (and (= v_~max2~0_64 v_~max2~0_63) (<= .cse0 v_~max2~0_64) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_64, #memory_int=|v_#memory_int_102|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_63, #memory_int=|v_#memory_int_102|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0][42], [Black: 698#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 718#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 819#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), 33#L70-4true, Black: 665#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), Black: 1389#(and (or (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (or (< (select (select |#memory_int| ~A~0.base) 0) 1) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0)), 314#true, 658#true, Black: 1443#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), 109#L95-1true, Black: 535#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 554#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 646#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 514#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 837#true, 1543#true, 1215#true, Black: 472#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (= ~M~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 331#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 358#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 72#L58-4true, Black: 159#(= ~max2~0 ~max1~0), 1011#true, Black: 1375#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~M~0 0)), Black: 1247#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 172#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1377#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (or (= ~max2~0 0) (< 0 ~max1~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0)), Black: 164#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 478#true, Black: 901#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 876#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 894#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 886#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 85#thread1EXITtrue, Black: 311#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 813#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1211#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)) (< 1 ~N~0))), Black: 687#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1019#(= ~max2~0 ~max1~0), Black: 694#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1382#true]) [2023-11-06 21:16:33,089 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-11-06 21:16:33,089 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-06 21:16:33,089 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-06 21:16:33,089 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-06 21:16:33,193 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([566] L58-4-->L58-4: Formula: (and (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_25) (let ((.cse0 (select (select |v_#memory_int_102| v_~A~0.base_51) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_51)))) (or (and (= v_~max2~0_63 .cse0) (< v_~max2~0_64 .cse0)) (and (= v_~max2~0_64 v_~max2~0_63) (<= .cse0 v_~max2~0_64) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_64, #memory_int=|v_#memory_int_102|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_63, #memory_int=|v_#memory_int_102|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0][42], [Black: 698#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 718#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 819#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), 33#L70-4true, Black: 665#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), Black: 1389#(and (or (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (or (< (select (select |#memory_int| ~A~0.base) 0) 1) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0)), 314#true, 658#true, Black: 1443#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 535#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 554#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 646#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 514#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 837#true, 1543#true, 1215#true, Black: 472#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (= ~M~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 331#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 358#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 72#L58-4true, Black: 159#(= ~max2~0 ~max1~0), 1011#true, Black: 1375#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~M~0 0)), Black: 1247#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 172#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1377#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (or (= ~max2~0 0) (< 0 ~max1~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0)), Black: 164#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 478#true, 108#L95-2true, Black: 901#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 876#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 894#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 886#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 311#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 813#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1211#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)) (< 1 ~N~0))), Black: 687#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1019#(= ~max2~0 ~max1~0), Black: 694#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1382#true]) [2023-11-06 21:16:33,193 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-11-06 21:16:33,193 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:33,193 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:33,194 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:33,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([566] L58-4-->L58-4: Formula: (and (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_25) (let ((.cse0 (select (select |v_#memory_int_102| v_~A~0.base_51) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_51)))) (or (and (= v_~max2~0_63 .cse0) (< v_~max2~0_64 .cse0)) (and (= v_~max2~0_64 v_~max2~0_63) (<= .cse0 v_~max2~0_64) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_64, #memory_int=|v_#memory_int_102|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_63, #memory_int=|v_#memory_int_102|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0][76], [Black: 698#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 1547#(<= 2 ~N~0), Black: 718#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 819#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 665#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), 33#L70-4true, Black: 1389#(and (or (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (or (< (select (select |#memory_int| ~A~0.base) 0) 1) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0)), 314#true, 658#true, Black: 1443#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), 109#L95-1true, Black: 535#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 554#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 646#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 514#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 837#true, 1215#true, Black: 472#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (= ~M~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 331#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 358#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 72#L58-4true, Black: 159#(= ~max2~0 ~max1~0), 1011#true, Black: 1375#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~M~0 0)), 172#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1247#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), Black: 1377#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (or (= ~max2~0 0) (< 0 ~max1~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0)), Black: 164#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 478#true, Black: 901#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 876#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 894#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 886#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 85#thread1EXITtrue, Black: 311#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 813#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1211#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)) (< 1 ~N~0))), Black: 1019#(= ~max2~0 ~max1~0), Black: 687#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 694#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1382#true]) [2023-11-06 21:16:33,220 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-11-06 21:16:33,220 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:33,221 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:33,221 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:33,249 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([566] L58-4-->L58-4: Formula: (and (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_25) (let ((.cse0 (select (select |v_#memory_int_102| v_~A~0.base_51) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_51)))) (or (and (= v_~max2~0_63 .cse0) (< v_~max2~0_64 .cse0)) (and (= v_~max2~0_64 v_~max2~0_63) (<= .cse0 v_~max2~0_64) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_64, #memory_int=|v_#memory_int_102|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_63, #memory_int=|v_#memory_int_102|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0][42], [Black: 698#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 718#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 819#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), 33#L70-4true, Black: 665#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), Black: 1389#(and (or (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (or (< (select (select |#memory_int| ~A~0.base) 0) 1) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0)), 314#true, 658#true, Black: 1443#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), 79#L96-1true, Black: 535#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 554#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 646#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 514#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 837#true, 1543#true, 1215#true, Black: 472#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (= ~M~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 331#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 358#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 72#L58-4true, Black: 159#(= ~max2~0 ~max1~0), 1011#true, Black: 1375#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~M~0 0)), Black: 1247#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 172#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1377#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (or (= ~max2~0 0) (< 0 ~max1~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0)), Black: 164#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 478#true, Black: 901#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 876#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 894#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 886#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 311#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 813#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1211#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)) (< 1 ~N~0))), Black: 687#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1019#(= ~max2~0 ~max1~0), Black: 694#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1382#true]) [2023-11-06 21:16:33,249 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 21:16:33,249 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:33,249 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:33,250 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:33,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([566] L58-4-->L58-4: Formula: (and (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_25) (let ((.cse0 (select (select |v_#memory_int_102| v_~A~0.base_51) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_51)))) (or (and (= v_~max2~0_63 .cse0) (< v_~max2~0_64 .cse0)) (and (= v_~max2~0_64 v_~max2~0_63) (<= .cse0 v_~max2~0_64) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_64, #memory_int=|v_#memory_int_102|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_63, #memory_int=|v_#memory_int_102|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0][76], [Black: 698#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 1547#(<= 2 ~N~0), Black: 718#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 819#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 665#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), 33#L70-4true, Black: 1389#(and (or (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (or (< (select (select |#memory_int| ~A~0.base) 0) 1) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0)), 314#true, 658#true, Black: 1443#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 535#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 554#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 646#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 514#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 837#true, 1215#true, Black: 472#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (= ~M~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 331#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 358#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 72#L58-4true, Black: 159#(= ~max2~0 ~max1~0), 1011#true, Black: 1375#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~M~0 0)), 172#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1247#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), Black: 1377#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (or (= ~max2~0 0) (< 0 ~max1~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0)), Black: 164#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 478#true, 108#L95-2true, Black: 901#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 876#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 894#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 886#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 311#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 813#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1211#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)) (< 1 ~N~0))), Black: 1019#(= ~max2~0 ~max1~0), Black: 687#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 694#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1382#true]) [2023-11-06 21:16:33,267 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 21:16:33,267 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:33,267 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:33,267 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:33,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([566] L58-4-->L58-4: Formula: (and (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_25) (let ((.cse0 (select (select |v_#memory_int_102| v_~A~0.base_51) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_51)))) (or (and (= v_~max2~0_63 .cse0) (< v_~max2~0_64 .cse0)) (and (= v_~max2~0_64 v_~max2~0_63) (<= .cse0 v_~max2~0_64) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_64, #memory_int=|v_#memory_int_102|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_63, #memory_int=|v_#memory_int_102|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0][76], [Black: 698#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 1547#(<= 2 ~N~0), Black: 718#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 819#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 665#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), 33#L70-4true, Black: 1389#(and (or (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (or (< (select (select |#memory_int| ~A~0.base) 0) 1) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0)), 314#true, 658#true, Black: 1443#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), 79#L96-1true, Black: 535#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 554#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 646#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 514#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 837#true, 1215#true, Black: 472#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (= ~M~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 331#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 358#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 72#L58-4true, Black: 159#(= ~max2~0 ~max1~0), 1011#true, Black: 1375#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~M~0 0)), 172#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1247#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), Black: 1377#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (or (= ~max2~0 0) (< 0 ~max1~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0)), Black: 164#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 478#true, Black: 901#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 876#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 894#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 886#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 311#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 813#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1211#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)) (< 1 ~N~0))), Black: 1019#(= ~max2~0 ~max1~0), Black: 687#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 694#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1382#true]) [2023-11-06 21:16:33,292 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 21:16:33,292 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:33,292 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:33,292 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:33,340 INFO L124 PetriNetUnfolderBase]: 2525/3686 cut-off events. [2023-11-06 21:16:33,341 INFO L125 PetriNetUnfolderBase]: For 21205/21450 co-relation queries the response was YES. [2023-11-06 21:16:33,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17976 conditions, 3686 events. 2525/3686 cut-off events. For 21205/21450 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 17976 event pairs, 611 based on Foata normal form. 167/3636 useless extension candidates. Maximal degree in co-relation 17775. Up to 2424 conditions per place. [2023-11-06 21:16:33,395 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 286 selfloop transitions, 56 changer transitions 0/367 dead transitions. [2023-11-06 21:16:33,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 367 transitions, 3821 flow [2023-11-06 21:16:33,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:16:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 21:16:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1049 transitions. [2023-11-06 21:16:33,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4414983164983165 [2023-11-06 21:16:33,469 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1049 transitions. [2023-11-06 21:16:33,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1049 transitions. [2023-11-06 21:16:33,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:33,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1049 transitions. [2023-11-06 21:16:33,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.125) internal successors, (1049), 8 states have internal predecessors, (1049), 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-06 21:16:33,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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-06 21:16:33,477 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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-06 21:16:33,478 INFO L175 Difference]: Start difference. First operand has 144 places, 270 transitions, 2574 flow. Second operand 8 states and 1049 transitions. [2023-11-06 21:16:33,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 367 transitions, 3821 flow [2023-11-06 21:16:33,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 367 transitions, 3674 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-11-06 21:16:33,544 INFO L231 Difference]: Finished difference. Result has 148 places, 290 transitions, 2813 flow [2023-11-06 21:16:33,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=2427, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2813, PETRI_PLACES=148, PETRI_TRANSITIONS=290} [2023-11-06 21:16:33,545 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2023-11-06 21:16:33,545 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 290 transitions, 2813 flow [2023-11-06 21:16:33,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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-06 21:16:33,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:33,546 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:33,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:33,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 21:16:33,753 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:33,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:33,753 INFO L85 PathProgramCache]: Analyzing trace with hash 206181301, now seen corresponding path program 9 times [2023-11-06 21:16:33,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:33,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065365836] [2023-11-06 21:16:33,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:33,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:33,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:33,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065365836] [2023-11-06 21:16:33,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065365836] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:33,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55655279] [2023-11-06 21:16:33,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:16:33,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:33,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:33,917 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:33,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 21:16:34,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 21:16:34,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:34,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:16:34,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:34,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:34,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55655279] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:34,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:34,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-06 21:16:34,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274832496] [2023-11-06 21:16:34,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:34,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 21:16:34,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:34,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 21:16:34,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-06 21:16:34,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 297 [2023-11-06 21:16:34,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 290 transitions, 2813 flow. Second operand has 14 states, 14 states have (on average 125.35714285714286) internal successors, (1755), 14 states have internal predecessors, (1755), 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-06 21:16:34,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:34,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 297 [2023-11-06 21:16:34,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:34,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([566] L58-4-->L58-4: Formula: (and (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_25) (let ((.cse0 (select (select |v_#memory_int_102| v_~A~0.base_51) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_51)))) (or (and (= v_~max2~0_63 .cse0) (< v_~max2~0_64 .cse0)) (and (= v_~max2~0_64 v_~max2~0_63) (<= .cse0 v_~max2~0_64) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_64, #memory_int=|v_#memory_int_102|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_63, #memory_int=|v_#memory_int_102|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0][76], [Black: 698#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 1547#(<= 2 ~N~0), Black: 718#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 819#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 665#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), 33#L70-4true, Black: 1389#(and (or (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (or (< (select (select |#memory_int| ~A~0.base) 0) 1) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0)), 314#true, 658#true, Black: 1443#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), 109#L95-1true, Black: 535#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 554#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 646#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 514#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 837#true, 1215#true, Black: 472#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (= ~M~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 331#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1701#true, Black: 358#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 72#L58-4true, Black: 159#(= ~max2~0 ~max1~0), 1011#true, Black: 1548#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= 2 ~N~0)), Black: 1375#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~M~0 0)), 172#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1247#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), Black: 1589#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1377#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (or (= ~max2~0 0) (< 0 ~max1~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0)), Black: 164#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 478#true, Black: 901#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 876#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 894#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 886#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 85#thread1EXITtrue, Black: 311#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 813#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1211#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)) (< 1 ~N~0))), Black: 687#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1019#(= ~max2~0 ~max1~0), Black: 694#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork1_~i~1 0))]) [2023-11-06 21:16:34,951 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-11-06 21:16:34,951 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:34,952 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:34,952 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:35,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([566] L58-4-->L58-4: Formula: (and (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_25) (let ((.cse0 (select (select |v_#memory_int_102| v_~A~0.base_51) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_51)))) (or (and (= v_~max2~0_63 .cse0) (< v_~max2~0_64 .cse0)) (and (= v_~max2~0_64 v_~max2~0_63) (<= .cse0 v_~max2~0_64) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_64, #memory_int=|v_#memory_int_102|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_63, #memory_int=|v_#memory_int_102|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0][76], [Black: 698#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 1547#(<= 2 ~N~0), Black: 718#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 819#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 665#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), 33#L70-4true, Black: 1389#(and (or (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (or (< (select (select |#memory_int| ~A~0.base) 0) 1) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0)), 314#true, 658#true, Black: 1443#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 535#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 554#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 646#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 514#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 837#true, 1215#true, Black: 472#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (= ~M~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 331#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1701#true, Black: 358#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 72#L58-4true, Black: 159#(= ~max2~0 ~max1~0), 1011#true, Black: 1548#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= 2 ~N~0)), Black: 1375#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~M~0 0)), 172#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1247#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), Black: 1589#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1377#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (or (= ~max2~0 0) (< 0 ~max1~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0)), Black: 164#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 478#true, 108#L95-2true, Black: 901#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 876#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 894#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 886#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 311#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 813#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1211#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)) (< 1 ~N~0))), Black: 687#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1019#(= ~max2~0 ~max1~0), Black: 694#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork1_~i~1 0))]) [2023-11-06 21:16:35,006 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 21:16:35,006 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:35,006 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:35,006 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:35,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([566] L58-4-->L58-4: Formula: (and (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_25) (let ((.cse0 (select (select |v_#memory_int_102| v_~A~0.base_51) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_51)))) (or (and (= v_~max2~0_63 .cse0) (< v_~max2~0_64 .cse0)) (and (= v_~max2~0_64 v_~max2~0_63) (<= .cse0 v_~max2~0_64) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_64, #memory_int=|v_#memory_int_102|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_25, ~max2~0=v_~max2~0_63, #memory_int=|v_#memory_int_102|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0][76], [Black: 698#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 1547#(<= 2 ~N~0), Black: 718#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 819#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 665#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), 33#L70-4true, Black: 1389#(and (or (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (or (< (select (select |#memory_int| ~A~0.base) 0) 1) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max1~0 0)), 314#true, 658#true, Black: 1443#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), 79#L96-1true, Black: 535#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 554#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 646#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 514#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 837#true, 1215#true, Black: 472#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (= ~M~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 331#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1701#true, Black: 358#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), 72#L58-4true, Black: 159#(= ~max2~0 ~max1~0), 1011#true, Black: 1548#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= 2 ~N~0)), Black: 1375#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~M~0 0)), 172#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1247#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~max2~0 0) (= ~M~0 0)), Black: 1589#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1377#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max2~0) (or (= ~max2~0 0) (< 0 ~max1~0)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0)), Black: 164#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 478#true, Black: 901#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 876#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 894#(and (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0)), Black: 886#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 311#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 813#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1211#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)) (< 1 ~N~0))), Black: 687#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1019#(= ~max2~0 ~max1~0), Black: 694#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork1_~i~1 0))]) [2023-11-06 21:16:35,041 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,041 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,041 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,042 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,092 INFO L124 PetriNetUnfolderBase]: 2234/3364 cut-off events. [2023-11-06 21:16:35,092 INFO L125 PetriNetUnfolderBase]: For 22194/22369 co-relation queries the response was YES. [2023-11-06 21:16:35,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16498 conditions, 3364 events. 2234/3364 cut-off events. For 22194/22369 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 17181 event pairs, 473 based on Foata normal form. 238/3421 useless extension candidates. Maximal degree in co-relation 16288. Up to 1249 conditions per place. [2023-11-06 21:16:35,141 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 296 selfloop transitions, 48 changer transitions 0/369 dead transitions. [2023-11-06 21:16:35,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 369 transitions, 3926 flow [2023-11-06 21:16:35,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:16:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:16:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 924 transitions. [2023-11-06 21:16:35,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-11-06 21:16:35,146 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 924 transitions. [2023-11-06 21:16:35,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 924 transitions. [2023-11-06 21:16:35,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:35,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 924 transitions. [2023-11-06 21:16:35,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.0) internal successors, (924), 7 states have internal predecessors, (924), 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-06 21:16:35,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 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-06 21:16:35,153 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 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-06 21:16:35,154 INFO L175 Difference]: Start difference. First operand has 148 places, 290 transitions, 2813 flow. Second operand 7 states and 924 transitions. [2023-11-06 21:16:35,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 369 transitions, 3926 flow [2023-11-06 21:16:35,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 369 transitions, 3887 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-11-06 21:16:35,237 INFO L231 Difference]: Finished difference. Result has 151 places, 274 transitions, 2736 flow [2023-11-06 21:16:35,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=2593, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2736, PETRI_PLACES=151, PETRI_TRANSITIONS=274} [2023-11-06 21:16:35,239 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2023-11-06 21:16:35,239 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 274 transitions, 2736 flow [2023-11-06 21:16:35,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 125.35714285714286) internal successors, (1755), 14 states have internal predecessors, (1755), 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-06 21:16:35,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:35,240 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:35,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:35,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 21:16:35,446 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:35,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:35,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1851596730, now seen corresponding path program 10 times [2023-11-06 21:16:35,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:35,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985346325] [2023-11-06 21:16:35,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:35,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:35,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:35,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985346325] [2023-11-06 21:16:35,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985346325] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:35,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191499267] [2023-11-06 21:16:35,597 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 21:16:35,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:35,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:35,599 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:35,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 21:16:35,710 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 21:16:35,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:35,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:16:35,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:35,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:36,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191499267] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:36,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:36,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2023-11-06 21:16:36,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048691247] [2023-11-06 21:16:36,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:36,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 21:16:36,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:36,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 21:16:36,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2023-11-06 21:16:36,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 297 [2023-11-06 21:16:36,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 274 transitions, 2736 flow. Second operand has 19 states, 19 states have (on average 120.78947368421052) internal successors, (2295), 19 states have internal predecessors, (2295), 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-06 21:16:36,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:36,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 297 [2023-11-06 21:16:36,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:38,205 INFO L124 PetriNetUnfolderBase]: 2129/3244 cut-off events. [2023-11-06 21:16:38,205 INFO L125 PetriNetUnfolderBase]: For 19573/19698 co-relation queries the response was YES. [2023-11-06 21:16:38,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17221 conditions, 3244 events. 2129/3244 cut-off events. For 19573/19698 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 16688 event pairs, 245 based on Foata normal form. 208/3389 useless extension candidates. Maximal degree in co-relation 17161. Up to 1360 conditions per place. [2023-11-06 21:16:38,253 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 279 selfloop transitions, 189 changer transitions 22/500 dead transitions. [2023-11-06 21:16:38,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 500 transitions, 5583 flow [2023-11-06 21:16:38,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 21:16:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-06 21:16:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3626 transitions. [2023-11-06 21:16:38,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4209915244398003 [2023-11-06 21:16:38,261 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 3626 transitions. [2023-11-06 21:16:38,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 3626 transitions. [2023-11-06 21:16:38,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:38,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 3626 transitions. [2023-11-06 21:16:38,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 125.03448275862068) internal successors, (3626), 29 states have internal predecessors, (3626), 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-06 21:16:38,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 297.0) internal successors, (8910), 30 states have internal predecessors, (8910), 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-06 21:16:38,284 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 297.0) internal successors, (8910), 30 states have internal predecessors, (8910), 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-06 21:16:38,285 INFO L175 Difference]: Start difference. First operand has 151 places, 274 transitions, 2736 flow. Second operand 29 states and 3626 transitions. [2023-11-06 21:16:38,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 500 transitions, 5583 flow [2023-11-06 21:16:38,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 500 transitions, 5359 flow, removed 22 selfloop flow, removed 8 redundant places. [2023-11-06 21:16:38,382 INFO L231 Difference]: Finished difference. Result has 181 places, 308 transitions, 3607 flow [2023-11-06 21:16:38,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=2384, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3607, PETRI_PLACES=181, PETRI_TRANSITIONS=308} [2023-11-06 21:16:38,383 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 151 predicate places. [2023-11-06 21:16:38,383 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 308 transitions, 3607 flow [2023-11-06 21:16:38,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 120.78947368421052) internal successors, (2295), 19 states have internal predecessors, (2295), 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-06 21:16:38,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:38,384 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] [2023-11-06 21:16:38,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:38,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 21:16:38,591 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:38,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash 972492263, now seen corresponding path program 1 times [2023-11-06 21:16:38,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:38,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137678951] [2023-11-06 21:16:38,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:38,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:38,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137678951] [2023-11-06 21:16:38,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137678951] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:38,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412735821] [2023-11-06 21:16:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:38,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:38,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:38,718 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:38,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 21:16:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:38,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:16:38,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:38,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:39,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412735821] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:39,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:39,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-11-06 21:16:39,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949939458] [2023-11-06 21:16:39,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:39,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 21:16:39,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:39,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 21:16:39,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:16:39,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 297 [2023-11-06 21:16:39,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 308 transitions, 3607 flow. Second operand has 13 states, 13 states have (on average 123.76923076923077) internal successors, (1609), 13 states have internal predecessors, (1609), 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-06 21:16:39,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:39,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 297 [2023-11-06 21:16:39,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:40,111 INFO L124 PetriNetUnfolderBase]: 1763/2728 cut-off events. [2023-11-06 21:16:40,111 INFO L125 PetriNetUnfolderBase]: For 27578/27736 co-relation queries the response was YES. [2023-11-06 21:16:40,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15379 conditions, 2728 events. 1763/2728 cut-off events. For 27578/27736 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 13898 event pairs, 496 based on Foata normal form. 264/2895 useless extension candidates. Maximal degree in co-relation 15168. Up to 1586 conditions per place. [2023-11-06 21:16:40,150 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 171 selfloop transitions, 3 changer transitions 111/304 dead transitions. [2023-11-06 21:16:40,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 304 transitions, 4043 flow [2023-11-06 21:16:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:16:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:16:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions. [2023-11-06 21:16:40,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43658810325476993 [2023-11-06 21:16:40,152 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 778 transitions. [2023-11-06 21:16:40,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions. [2023-11-06 21:16:40,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:40,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions. [2023-11-06 21:16:40,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 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-06 21:16:40,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 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-06 21:16:40,158 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 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-06 21:16:40,158 INFO L175 Difference]: Start difference. First operand has 181 places, 308 transitions, 3607 flow. Second operand 6 states and 778 transitions. [2023-11-06 21:16:40,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 304 transitions, 4043 flow [2023-11-06 21:16:40,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 304 transitions, 3343 flow, removed 86 selfloop flow, removed 20 redundant places. [2023-11-06 21:16:40,290 INFO L231 Difference]: Finished difference. Result has 165 places, 193 transitions, 1885 flow [2023-11-06 21:16:40,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=2537, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1885, PETRI_PLACES=165, PETRI_TRANSITIONS=193} [2023-11-06 21:16:40,292 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2023-11-06 21:16:40,292 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 193 transitions, 1885 flow [2023-11-06 21:16:40,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 123.76923076923077) internal successors, (1609), 13 states have internal predecessors, (1609), 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-06 21:16:40,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:40,293 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, 1] [2023-11-06 21:16:40,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:40,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 21:16:40,499 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:40,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash 682633999, now seen corresponding path program 11 times [2023-11-06 21:16:40,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:40,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500094475] [2023-11-06 21:16:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:40,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:40,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:40,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500094475] [2023-11-06 21:16:40,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500094475] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:40,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716764579] [2023-11-06 21:16:40,678 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 21:16:40,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:40,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:40,680 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:40,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 21:16:40,822 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-06 21:16:40,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:40,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:16:40,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:40,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:41,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716764579] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:41,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:41,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2023-11-06 21:16:41,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175979194] [2023-11-06 21:16:41,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:41,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 21:16:41,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:41,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 21:16:41,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2023-11-06 21:16:41,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 297 [2023-11-06 21:16:41,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 193 transitions, 1885 flow. Second operand has 21 states, 21 states have (on average 113.33333333333333) internal successors, (2380), 21 states have internal predecessors, (2380), 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-06 21:16:41,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:41,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 297 [2023-11-06 21:16:41,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:45,239 INFO L124 PetriNetUnfolderBase]: 2791/3867 cut-off events. [2023-11-06 21:16:45,239 INFO L125 PetriNetUnfolderBase]: For 37902/37902 co-relation queries the response was YES. [2023-11-06 21:16:45,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24378 conditions, 3867 events. 2791/3867 cut-off events. For 37902/37902 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 16150 event pairs, 105 based on Foata normal form. 56/3909 useless extension candidates. Maximal degree in co-relation 24324. Up to 2121 conditions per place. [2023-11-06 21:16:45,297 INFO L140 encePairwiseOnDemand]: 285/297 looper letters, 357 selfloop transitions, 469 changer transitions 0/826 dead transitions. [2023-11-06 21:16:45,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 826 transitions, 9952 flow [2023-11-06 21:16:45,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-06 21:16:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2023-11-06 21:16:45,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 8568 transitions. [2023-11-06 21:16:45,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951847239518472 [2023-11-06 21:16:45,312 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 8568 transitions. [2023-11-06 21:16:45,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 8568 transitions. [2023-11-06 21:16:45,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:45,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 8568 transitions. [2023-11-06 21:16:45,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 117.36986301369863) internal successors, (8568), 73 states have internal predecessors, (8568), 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-06 21:16:45,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 297.0) internal successors, (21978), 74 states have internal predecessors, (21978), 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-06 21:16:45,433 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 297.0) internal successors, (21978), 74 states have internal predecessors, (21978), 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-06 21:16:45,433 INFO L175 Difference]: Start difference. First operand has 165 places, 193 transitions, 1885 flow. Second operand 73 states and 8568 transitions. [2023-11-06 21:16:45,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 826 transitions, 9952 flow [2023-11-06 21:16:45,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 826 transitions, 9200 flow, removed 341 selfloop flow, removed 11 redundant places. [2023-11-06 21:16:45,686 INFO L231 Difference]: Finished difference. Result has 214 places, 561 transitions, 7247 flow [2023-11-06 21:16:45,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=7247, PETRI_PLACES=214, PETRI_TRANSITIONS=561} [2023-11-06 21:16:45,686 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2023-11-06 21:16:45,686 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 561 transitions, 7247 flow [2023-11-06 21:16:45,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 113.33333333333333) internal successors, (2380), 21 states have internal predecessors, (2380), 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-06 21:16:45,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:45,687 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, 1] [2023-11-06 21:16:45,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:45,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 21:16:45,888 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:45,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:45,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2026033421, now seen corresponding path program 12 times [2023-11-06 21:16:45,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:45,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849823548] [2023-11-06 21:16:45,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:45,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:46,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:46,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849823548] [2023-11-06 21:16:46,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849823548] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:46,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655641252] [2023-11-06 21:16:46,083 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 21:16:46,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:46,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:46,085 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:46,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 21:16:46,242 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-06 21:16:46,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:46,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:16:46,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:46,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:46,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655641252] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:46,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:46,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-11-06 21:16:46,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030968376] [2023-11-06 21:16:46,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:46,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 21:16:46,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:46,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 21:16:46,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-11-06 21:16:47,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 297 [2023-11-06 21:16:47,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 561 transitions, 7247 flow. Second operand has 18 states, 18 states have (on average 118.66666666666667) internal successors, (2136), 18 states have internal predecessors, (2136), 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-06 21:16:47,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:47,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 297 [2023-11-06 21:16:47,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:48,715 INFO L124 PetriNetUnfolderBase]: 3504/4880 cut-off events. [2023-11-06 21:16:48,715 INFO L125 PetriNetUnfolderBase]: For 172086/172086 co-relation queries the response was YES. [2023-11-06 21:16:48,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45648 conditions, 4880 events. 3504/4880 cut-off events. For 172086/172086 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 21654 event pairs, 527 based on Foata normal form. 54/4920 useless extension candidates. Maximal degree in co-relation 45558. Up to 2821 conditions per place. [2023-11-06 21:16:48,925 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 738 selfloop transitions, 136 changer transitions 0/897 dead transitions. [2023-11-06 21:16:48,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 897 transitions, 13109 flow [2023-11-06 21:16:48,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:16:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 21:16:48,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1228 transitions. [2023-11-06 21:16:48,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4134680134680135 [2023-11-06 21:16:48,928 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1228 transitions. [2023-11-06 21:16:48,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1228 transitions. [2023-11-06 21:16:48,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:48,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1228 transitions. [2023-11-06 21:16:48,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.8) internal successors, (1228), 10 states have internal predecessors, (1228), 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-06 21:16:48,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-06 21:16:48,935 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-06 21:16:48,935 INFO L175 Difference]: Start difference. First operand has 214 places, 561 transitions, 7247 flow. Second operand 10 states and 1228 transitions. [2023-11-06 21:16:48,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 897 transitions, 13109 flow [2023-11-06 21:16:49,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 897 transitions, 10309 flow, removed 1269 selfloop flow, removed 8 redundant places. [2023-11-06 21:16:49,718 INFO L231 Difference]: Finished difference. Result has 219 places, 588 transitions, 6216 flow [2023-11-06 21:16:49,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=5249, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6216, PETRI_PLACES=219, PETRI_TRANSITIONS=588} [2023-11-06 21:16:49,719 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2023-11-06 21:16:49,719 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 588 transitions, 6216 flow [2023-11-06 21:16:49,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 118.66666666666667) internal successors, (2136), 18 states have internal predecessors, (2136), 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-06 21:16:49,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:49,720 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, 1] [2023-11-06 21:16:49,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:49,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 21:16:49,926 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:49,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:49,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1412619445, now seen corresponding path program 13 times [2023-11-06 21:16:49,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:49,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234980426] [2023-11-06 21:16:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:50,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:50,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234980426] [2023-11-06 21:16:50,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234980426] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:50,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073090261] [2023-11-06 21:16:50,100 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 21:16:50,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:50,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:50,101 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:50,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 21:16:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:50,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:16:50,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:50,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:50,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073090261] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:50,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:50,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-11-06 21:16:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30179598] [2023-11-06 21:16:50,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:50,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 21:16:50,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:50,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 21:16:50,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-11-06 21:16:51,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 297 [2023-11-06 21:16:51,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 588 transitions, 6216 flow. Second operand has 21 states, 21 states have (on average 117.85714285714286) internal successors, (2475), 21 states have internal predecessors, (2475), 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-06 21:16:51,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:51,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 297 [2023-11-06 21:16:51,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:53,004 INFO L124 PetriNetUnfolderBase]: 3757/5264 cut-off events. [2023-11-06 21:16:53,004 INFO L125 PetriNetUnfolderBase]: For 161816/161826 co-relation queries the response was YES. [2023-11-06 21:16:53,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43993 conditions, 5264 events. 3757/5264 cut-off events. For 161816/161826 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 24050 event pairs, 730 based on Foata normal form. 34/5285 useless extension candidates. Maximal degree in co-relation 43901. Up to 3823 conditions per place. [2023-11-06 21:16:53,097 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 630 selfloop transitions, 216 changer transitions 0/869 dead transitions. [2023-11-06 21:16:53,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 869 transitions, 11033 flow [2023-11-06 21:16:53,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 21:16:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-06 21:16:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1597 transitions. [2023-11-06 21:16:53,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41362341362341365 [2023-11-06 21:16:53,101 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1597 transitions. [2023-11-06 21:16:53,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1597 transitions. [2023-11-06 21:16:53,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:53,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1597 transitions. [2023-11-06 21:16:53,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 122.84615384615384) internal successors, (1597), 13 states have internal predecessors, (1597), 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-06 21:16:53,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 297.0) internal successors, (4158), 14 states have internal predecessors, (4158), 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-06 21:16:53,110 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 297.0) internal successors, (4158), 14 states have internal predecessors, (4158), 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-06 21:16:53,110 INFO L175 Difference]: Start difference. First operand has 219 places, 588 transitions, 6216 flow. Second operand 13 states and 1597 transitions. [2023-11-06 21:16:53,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 869 transitions, 11033 flow [2023-11-06 21:16:53,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 869 transitions, 10801 flow, removed 75 selfloop flow, removed 5 redundant places. [2023-11-06 21:16:53,994 INFO L231 Difference]: Finished difference. Result has 228 places, 701 transitions, 8271 flow [2023-11-06 21:16:53,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6058, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8271, PETRI_PLACES=228, PETRI_TRANSITIONS=701} [2023-11-06 21:16:53,996 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 198 predicate places. [2023-11-06 21:16:53,996 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 701 transitions, 8271 flow [2023-11-06 21:16:53,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 117.85714285714286) internal successors, (2475), 21 states have internal predecessors, (2475), 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-06 21:16:53,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:53,997 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, 1] [2023-11-06 21:16:54,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:54,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 21:16:54,203 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:54,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1475901295, now seen corresponding path program 14 times [2023-11-06 21:16:54,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:54,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174878179] [2023-11-06 21:16:54,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:54,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:54,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:54,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174878179] [2023-11-06 21:16:54,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174878179] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:54,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144411918] [2023-11-06 21:16:54,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:16:54,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:54,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:54,411 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:54,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 21:16:54,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:16:54,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:54,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:16:54,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:54,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144411918] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:55,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:55,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-11-06 21:16:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686964679] [2023-11-06 21:16:55,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:55,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 21:16:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 21:16:55,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-11-06 21:16:55,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 297 [2023-11-06 21:16:55,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 701 transitions, 8271 flow. Second operand has 20 states, 20 states have (on average 118.0) internal successors, (2360), 20 states have internal predecessors, (2360), 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-06 21:16:55,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:55,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 297 [2023-11-06 21:16:55,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:57,505 INFO L124 PetriNetUnfolderBase]: 3831/5384 cut-off events. [2023-11-06 21:16:57,506 INFO L125 PetriNetUnfolderBase]: For 104022/104032 co-relation queries the response was YES. [2023-11-06 21:16:57,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41629 conditions, 5384 events. 3831/5384 cut-off events. For 104022/104032 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 24917 event pairs, 725 based on Foata normal form. 56/5427 useless extension candidates. Maximal degree in co-relation 41535. Up to 3868 conditions per place. [2023-11-06 21:16:57,594 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 667 selfloop transitions, 244 changer transitions 0/934 dead transitions. [2023-11-06 21:16:57,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 934 transitions, 12442 flow [2023-11-06 21:16:57,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 21:16:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-06 21:16:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1845 transitions. [2023-11-06 21:16:57,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2023-11-06 21:16:57,598 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1845 transitions. [2023-11-06 21:16:57,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1845 transitions. [2023-11-06 21:16:57,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:57,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1845 transitions. [2023-11-06 21:16:57,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 123.0) internal successors, (1845), 15 states have internal predecessors, (1845), 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-06 21:16:57,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 297.0) internal successors, (4752), 16 states have internal predecessors, (4752), 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-06 21:16:57,607 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 297.0) internal successors, (4752), 16 states have internal predecessors, (4752), 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-06 21:16:57,608 INFO L175 Difference]: Start difference. First operand has 228 places, 701 transitions, 8271 flow. Second operand 15 states and 1845 transitions. [2023-11-06 21:16:57,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 934 transitions, 12442 flow [2023-11-06 21:16:58,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 934 transitions, 11673 flow, removed 331 selfloop flow, removed 5 redundant places. [2023-11-06 21:16:58,329 INFO L231 Difference]: Finished difference. Result has 238 places, 729 transitions, 8515 flow [2023-11-06 21:16:58,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=7636, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8515, PETRI_PLACES=238, PETRI_TRANSITIONS=729} [2023-11-06 21:16:58,331 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2023-11-06 21:16:58,331 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 729 transitions, 8515 flow [2023-11-06 21:16:58,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 118.0) internal successors, (2360), 20 states have internal predecessors, (2360), 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-06 21:16:58,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:58,331 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, 1] [2023-11-06 21:16:58,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:58,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:58,532 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:58,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:58,533 INFO L85 PathProgramCache]: Analyzing trace with hash -599753855, now seen corresponding path program 15 times [2023-11-06 21:16:58,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:58,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763983764] [2023-11-06 21:16:58,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:58,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:58,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:58,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763983764] [2023-11-06 21:16:58,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763983764] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:58,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952942325] [2023-11-06 21:16:58,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:16:58,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:58,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:58,728 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:58,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-06 21:16:58,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 21:16:58,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:58,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:16:58,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:59,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:59,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952942325] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:59,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:59,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-11-06 21:16:59,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100930616] [2023-11-06 21:16:59,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:59,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 21:16:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:59,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 21:16:59,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-11-06 21:16:59,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 297 [2023-11-06 21:16:59,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 729 transitions, 8515 flow. Second operand has 19 states, 19 states have (on average 118.05263157894737) internal successors, (2243), 19 states have internal predecessors, (2243), 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-06 21:16:59,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:59,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 297 [2023-11-06 21:16:59,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:01,755 INFO L124 PetriNetUnfolderBase]: 3776/5295 cut-off events. [2023-11-06 21:17:01,755 INFO L125 PetriNetUnfolderBase]: For 84690/84698 co-relation queries the response was YES. [2023-11-06 21:17:01,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40038 conditions, 5295 events. 3776/5295 cut-off events. For 84690/84698 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 24332 event pairs, 778 based on Foata normal form. 54/5336 useless extension candidates. Maximal degree in co-relation 39942. Up to 4099 conditions per place. [2023-11-06 21:17:01,833 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 667 selfloop transitions, 150 changer transitions 0/840 dead transitions. [2023-11-06 21:17:01,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 840 transitions, 11078 flow [2023-11-06 21:17:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:17:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 21:17:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1222 transitions. [2023-11-06 21:17:01,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41144781144781145 [2023-11-06 21:17:01,837 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1222 transitions. [2023-11-06 21:17:01,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1222 transitions. [2023-11-06 21:17:01,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:01,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1222 transitions. [2023-11-06 21:17:01,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.2) internal successors, (1222), 10 states have internal predecessors, (1222), 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-06 21:17:01,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-06 21:17:01,846 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-06 21:17:01,846 INFO L175 Difference]: Start difference. First operand has 238 places, 729 transitions, 8515 flow. Second operand 10 states and 1222 transitions. [2023-11-06 21:17:01,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 840 transitions, 11078 flow [2023-11-06 21:17:02,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 840 transitions, 10618 flow, removed 6 selfloop flow, removed 11 redundant places. [2023-11-06 21:17:02,447 INFO L231 Difference]: Finished difference. Result has 234 places, 710 transitions, 8078 flow [2023-11-06 21:17:02,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=7778, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8078, PETRI_PLACES=234, PETRI_TRANSITIONS=710} [2023-11-06 21:17:02,448 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2023-11-06 21:17:02,448 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 710 transitions, 8078 flow [2023-11-06 21:17:02,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 118.05263157894737) internal successors, (2243), 19 states have internal predecessors, (2243), 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-06 21:17:02,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:02,449 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, 1] [2023-11-06 21:17:02,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:02,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:17:02,650 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:17:02,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1060757117, now seen corresponding path program 16 times [2023-11-06 21:17:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:17:02,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849225629] [2023-11-06 21:17:02,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:17:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:02,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:17:02,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849225629] [2023-11-06 21:17:02,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849225629] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:17:02,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127248698] [2023-11-06 21:17:02,907 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 21:17:02,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:17:02,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:17:02,909 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:17:02,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-06 21:17:03,050 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 21:17:03,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:17:03,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:17:03,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:03,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:17:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:03,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127248698] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:17:03,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:17:03,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2023-11-06 21:17:03,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318917065] [2023-11-06 21:17:03,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:17:03,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 21:17:03,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:17:03,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 21:17:03,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-11-06 21:17:03,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 297 [2023-11-06 21:17:03,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 710 transitions, 8078 flow. Second operand has 19 states, 19 states have (on average 113.3157894736842) internal successors, (2153), 19 states have internal predecessors, (2153), 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-06 21:17:03,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:03,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 297 [2023-11-06 21:17:03,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:07,063 INFO L124 PetriNetUnfolderBase]: 4497/6309 cut-off events. [2023-11-06 21:17:07,063 INFO L125 PetriNetUnfolderBase]: For 105957/105957 co-relation queries the response was YES. [2023-11-06 21:17:07,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47712 conditions, 6309 events. 4497/6309 cut-off events. For 105957/105957 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 29723 event pairs, 196 based on Foata normal form. 26/6327 useless extension candidates. Maximal degree in co-relation 47616. Up to 3559 conditions per place. [2023-11-06 21:17:07,151 INFO L140 encePairwiseOnDemand]: 285/297 looper letters, 359 selfloop transitions, 651 changer transitions 0/1010 dead transitions. [2023-11-06 21:17:07,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 1010 transitions, 13717 flow [2023-11-06 21:17:07,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-06 21:17:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-11-06 21:17:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 4824 transitions. [2023-11-06 21:17:07,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3961566888396157 [2023-11-06 21:17:07,294 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 4824 transitions. [2023-11-06 21:17:07,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 4824 transitions. [2023-11-06 21:17:07,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:07,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 4824 transitions. [2023-11-06 21:17:07,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 117.65853658536585) internal successors, (4824), 41 states have internal predecessors, (4824), 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-06 21:17:07,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 297.0) internal successors, (12474), 42 states have internal predecessors, (12474), 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-06 21:17:07,325 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 297.0) internal successors, (12474), 42 states have internal predecessors, (12474), 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-06 21:17:07,325 INFO L175 Difference]: Start difference. First operand has 234 places, 710 transitions, 8078 flow. Second operand 41 states and 4824 transitions. [2023-11-06 21:17:07,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 1010 transitions, 13717 flow [2023-11-06 21:17:08,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 1010 transitions, 13369 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-06 21:17:08,142 INFO L231 Difference]: Finished difference. Result has 279 places, 816 transitions, 10852 flow [2023-11-06 21:17:08,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=7808, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=548, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=10852, PETRI_PLACES=279, PETRI_TRANSITIONS=816} [2023-11-06 21:17:08,143 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 249 predicate places. [2023-11-06 21:17:08,143 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 816 transitions, 10852 flow [2023-11-06 21:17:08,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 113.3157894736842) internal successors, (2153), 19 states have internal predecessors, (2153), 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-06 21:17:08,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:08,144 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, 1] [2023-11-06 21:17:08,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:08,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-06 21:17:08,357 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:17:08,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:08,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1140834059, now seen corresponding path program 17 times [2023-11-06 21:17:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:17:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408500542] [2023-11-06 21:17:08,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:17:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:08,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:17:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408500542] [2023-11-06 21:17:08,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408500542] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:17:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681332439] [2023-11-06 21:17:08,560 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 21:17:08,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:17:08,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:17:08,562 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:17:08,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-06 21:17:08,747 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:17:08,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:17:08,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:17:08,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:08,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:17:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681332439] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:17:08,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:17:08,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2023-11-06 21:17:08,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908184930] [2023-11-06 21:17:08,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:17:08,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 21:17:08,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:17:08,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 21:17:08,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-11-06 21:17:09,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 297 [2023-11-06 21:17:09,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 816 transitions, 10852 flow. Second operand has 17 states, 17 states have (on average 113.47058823529412) internal successors, (1929), 17 states have internal predecessors, (1929), 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-06 21:17:09,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:09,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 297 [2023-11-06 21:17:09,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:12,031 INFO L124 PetriNetUnfolderBase]: 4484/6272 cut-off events. [2023-11-06 21:17:12,031 INFO L125 PetriNetUnfolderBase]: For 128430/128430 co-relation queries the response was YES. [2023-11-06 21:17:12,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51575 conditions, 6272 events. 4484/6272 cut-off events. For 128430/128430 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 29264 event pairs, 250 based on Foata normal form. 26/6290 useless extension candidates. Maximal degree in co-relation 51466. Up to 3561 conditions per place. [2023-11-06 21:17:12,118 INFO L140 encePairwiseOnDemand]: 285/297 looper letters, 346 selfloop transitions, 559 changer transitions 0/905 dead transitions. [2023-11-06 21:17:12,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 905 transitions, 13803 flow [2023-11-06 21:17:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 21:17:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-06 21:17:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2355 transitions. [2023-11-06 21:17:12,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39646464646464646 [2023-11-06 21:17:12,123 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2355 transitions. [2023-11-06 21:17:12,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2355 transitions. [2023-11-06 21:17:12,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:12,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2355 transitions. [2023-11-06 21:17:12,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 117.75) internal successors, (2355), 20 states have internal predecessors, (2355), 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-06 21:17:12,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 297.0) internal successors, (6237), 21 states have internal predecessors, (6237), 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-06 21:17:12,135 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 297.0) internal successors, (6237), 21 states have internal predecessors, (6237), 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-06 21:17:12,136 INFO L175 Difference]: Start difference. First operand has 279 places, 816 transitions, 10852 flow. Second operand 20 states and 2355 transitions. [2023-11-06 21:17:12,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 905 transitions, 13803 flow [2023-11-06 21:17:13,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 905 transitions, 13333 flow, removed 135 selfloop flow, removed 13 redundant places. [2023-11-06 21:17:13,158 INFO L231 Difference]: Finished difference. Result has 286 places, 809 transitions, 11481 flow [2023-11-06 21:17:13,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=10303, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=557, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=11481, PETRI_PLACES=286, PETRI_TRANSITIONS=809} [2023-11-06 21:17:13,159 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 256 predicate places. [2023-11-06 21:17:13,159 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 809 transitions, 11481 flow [2023-11-06 21:17:13,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 113.47058823529412) internal successors, (1929), 17 states have internal predecessors, (1929), 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-06 21:17:13,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:13,160 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, 1] [2023-11-06 21:17:13,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:13,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:17:13,360 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:17:13,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1481398475, now seen corresponding path program 18 times [2023-11-06 21:17:13,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:17:13,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646772544] [2023-11-06 21:17:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:13,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:17:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:13,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:17:13,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646772544] [2023-11-06 21:17:13,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646772544] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:17:13,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736843630] [2023-11-06 21:17:13,547 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 21:17:13,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:17:13,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:17:13,552 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:17:13,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-06 21:17:13,725 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-06 21:17:13,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:17:13,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:17:13,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:13,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:17:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736843630] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:17:13,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:17:13,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-11-06 21:17:13,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966216915] [2023-11-06 21:17:13,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:17:13,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 21:17:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:17:14,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 21:17:14,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-11-06 21:17:14,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 297 [2023-11-06 21:17:14,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 809 transitions, 11481 flow. Second operand has 19 states, 19 states have (on average 118.05263157894737) internal successors, (2243), 19 states have internal predecessors, (2243), 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-06 21:17:14,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:14,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 297 [2023-11-06 21:17:14,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:16,680 INFO L124 PetriNetUnfolderBase]: 4353/6091 cut-off events. [2023-11-06 21:17:16,680 INFO L125 PetriNetUnfolderBase]: For 132299/132358 co-relation queries the response was YES. [2023-11-06 21:17:16,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51923 conditions, 6091 events. 4353/6091 cut-off events. For 132299/132358 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 28487 event pairs, 969 based on Foata normal form. 52/6121 useless extension candidates. Maximal degree in co-relation 51810. Up to 5044 conditions per place. [2023-11-06 21:17:16,782 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 679 selfloop transitions, 172 changer transitions 0/876 dead transitions. [2023-11-06 21:17:16,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 876 transitions, 14115 flow [2023-11-06 21:17:16,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:17:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 21:17:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1221 transitions. [2023-11-06 21:17:16,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2023-11-06 21:17:16,785 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1221 transitions. [2023-11-06 21:17:16,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1221 transitions. [2023-11-06 21:17:16,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:16,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1221 transitions. [2023-11-06 21:17:16,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.1) internal successors, (1221), 10 states have internal predecessors, (1221), 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-06 21:17:16,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-06 21:17:16,792 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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-06 21:17:16,792 INFO L175 Difference]: Start difference. First operand has 286 places, 809 transitions, 11481 flow. Second operand 10 states and 1221 transitions. [2023-11-06 21:17:16,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 876 transitions, 14115 flow [2023-11-06 21:17:17,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 876 transitions, 13363 flow, removed 0 selfloop flow, removed 13 redundant places. [2023-11-06 21:17:17,811 INFO L231 Difference]: Finished difference. Result has 283 places, 828 transitions, 11596 flow [2023-11-06 21:17:17,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=10771, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11596, PETRI_PLACES=283, PETRI_TRANSITIONS=828} [2023-11-06 21:17:17,816 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 253 predicate places. [2023-11-06 21:17:17,817 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 828 transitions, 11596 flow [2023-11-06 21:17:17,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 118.05263157894737) internal successors, (2243), 19 states have internal predecessors, (2243), 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-06 21:17:17,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:17,818 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, 1, 1] [2023-11-06 21:17:17,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:18,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:17:18,026 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:17:18,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:18,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2024938329, now seen corresponding path program 2 times [2023-11-06 21:17:18,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:17:18,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050143665] [2023-11-06 21:17:18,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:17:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:20,170 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-06 21:17:20,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:17:20,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050143665] [2023-11-06 21:17:20,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050143665] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:17:20,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745226922] [2023-11-06 21:17:20,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:17:20,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:17:20,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:17:20,173 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:17:20,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f16664a-0edd-4204-9188-018b4137edf1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-06 21:17:20,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:17:20,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:17:20,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-06 21:17:20,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:20,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:17:20,898 INFO L351 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 36 treesize of output 27 [2023-11-06 21:17:21,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:17:21,229 INFO L351 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 90 treesize of output 67 [2023-11-06 21:17:22,341 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:22,342 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 93 [2023-11-06 21:17:22,991 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-06 21:17:22,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:17:24,540 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~max2~0 1))) (and (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (= c_~max1~0 .cse0) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< 1 v_thread3Thread1of1ForFork2_~i~2_118) (< .cse0 (select .cse1 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4)))))) (< .cse0 .cse2))))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_761 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< 1 v_thread3Thread1of1ForFork2_~i~2_118) (< c_~max2~0 (select .cse3 c_~A~0.offset)) (< c_~max2~0 (select .cse3 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse4 (select .cse6 c_~A~0.offset))) (or (< .cse4 .cse2) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< 1 v_thread3Thread1of1ForFork2_~i~2_118) (< .cse5 (+ .cse4 1)) (= c_~max1~0 .cse5)))))))) (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse7 (select .cse8 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< .cse7 .cse2) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< 1 v_thread3Thread1of1ForFork2_~i~2_118) (= c_~max1~0 .cse7)))) (< c_~max2~0 (select .cse8 c_~A~0.offset))))))) is different from false [2023-11-06 21:17:25,849 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~max1~0 1)) (.cse4 (+ c_~max2~0 1)) (.cse6 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4)))) (and (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse0 (select (select .cse5 c_~A~0.base) .cse6))) (or (< .cse0 .cse1) (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse3 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse2 (select .cse3 c_~A~0.offset))) (or (= .cse2 .cse0) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (or (< .cse2 (select .cse3 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4)))) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< 1 v_thread3Thread1of1ForFork2_~i~2_118))) (< .cse2 .cse4))))))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse9 (select (select .cse8 c_~A~0.base) .cse6))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_761 (Array Int Int))) (let ((.cse7 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< 1 v_thread3Thread1of1ForFork2_~i~2_118) (< c_~max2~0 (select .cse7 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4)))) (< c_~max2~0 (select .cse7 c_~A~0.offset))))) (< .cse9 .cse1) (= .cse9 c_~max2~0))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse10 (select (select .cse14 c_~A~0.base) .cse6))) (or (< .cse10 .cse1) (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse13 (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse11 (select .cse13 c_~A~0.offset))) (or (< .cse11 .cse4) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse12 (select .cse13 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< 1 v_thread3Thread1of1ForFork2_~i~2_118) (= .cse10 .cse12) (< .cse12 (+ .cse11 1))))))))))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (or (< c_~max1~0 (select (select .cse15 c_~A~0.base) .cse6)) (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse18 (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse17 (select .cse18 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse16 (select .cse18 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< 1 v_thread3Thread1of1ForFork2_~i~2_118) (= c_~max1~0 .cse16) (< .cse16 (+ .cse17 1))))) (< .cse17 .cse4)))))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (or (< c_~max1~0 (select (select .cse19 c_~A~0.base) .cse6)) (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse21 (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse20 (select .cse21 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< .cse20 .cse4) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< 1 v_thread3Thread1of1ForFork2_~i~2_118) (= c_~max1~0 .cse20)))) (< c_~max2~0 (select .cse21 c_~A~0.offset)))))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse24 (select (select .cse25 c_~A~0.base) .cse6))) (or (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse22 (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (or (< c_~max2~0 (select .cse22 c_~A~0.offset)) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse23 (select .cse22 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< .cse23 .cse4) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< 1 v_thread3Thread1of1ForFork2_~i~2_118) (= .cse24 .cse23))))))) (< .cse24 .cse1))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (or (< c_~max1~0 (select (select .cse26 c_~A~0.base) .cse6)) (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse28 (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse27 (select .cse28 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (or (< .cse27 (select .cse28 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4)))) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< 1 v_thread3Thread1of1ForFork2_~i~2_118))) (< .cse27 .cse4) (= c_~max1~0 .cse27)))))))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse30 (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (or (< c_~max1~0 (select (select .cse29 c_~A~0.base) .cse6)) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< 1 v_thread3Thread1of1ForFork2_~i~2_118) (< c_~max2~0 (select .cse30 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4)))) (< c_~max2~0 (select .cse30 c_~A~0.offset)))))) (= c_~max1~0 c_~max2~0)))) is different from false [2023-11-06 21:17:27,046 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:27,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 2975 treesize of output 2944 [2023-11-06 21:17:27,715 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:27,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 1598 treesize of output 1592 [2023-11-06 21:17:28,044 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:28,045 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1563 treesize of output 1544 [2023-11-06 21:17:28,382 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:28,383 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1535 treesize of output 1520 [2023-11-06 21:17:28,727 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:28,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 1511 treesize of output 1521 [2023-11-06 21:17:29,015 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:29,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1492 treesize of output 1485 [2023-11-06 21:17:29,435 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:29,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 1476 treesize of output 1483 [2023-11-06 21:17:29,747 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:29,748 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1454 treesize of output 1431 [2023-11-06 21:17:30,063 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:30,064 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 1422 treesize of output 1428 [2023-11-06 21:17:30,310 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:30,311 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 1399 treesize of output 1395 [2023-11-06 21:17:30,609 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:30,612 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1366 treesize of output 1343 [2023-11-06 21:17:31,029 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:31,030 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 1334 treesize of output 1326 [2023-11-06 21:17:31,475 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:31,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 1297 treesize of output 1311 [2023-11-06 21:17:31,833 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:31,834 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1282 treesize of output 1275 [2023-11-06 21:17:32,175 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:32,176 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1266 treesize of output 1247 [2023-11-06 21:17:32,542 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:32,543 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 1238 treesize of output 1246 [2023-11-06 21:17:32,799 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:32,800 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1217 treesize of output 1202