./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:01:49,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:01:49,276 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:01:49,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:01:49,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:01:49,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:01:49,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:01:49,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:01:49,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:01:49,312 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:01:49,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:01:49,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:01:49,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:01:49,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:01:49,315 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:01:49,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:01:49,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:01:49,317 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:01:49,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:01:49,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:01:49,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:01:49,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:01:49,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:01:49,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:01:49,321 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:01:49,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:01:49,322 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:01:49,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:01:49,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:01:49,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:01:49,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:01:49,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:01:49,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:01:49,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:01:49,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:01:49,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:01:49,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:01:49,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:01:49,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:01:49,327 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:01:49,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:01:49,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:01:49,328 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_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/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_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d [2023-11-29 01:01:49,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:01:49,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:01:49,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:01:49,591 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:01:49,591 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:01:49,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2023-11-29 01:01:52,475 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:01:52,699 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:01:52,699 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2023-11-29 01:01:52,706 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/data/10f144621/c93a423d51664596ae4acbace9d4b9fa/FLAG848c739c2 [2023-11-29 01:01:52,717 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/data/10f144621/c93a423d51664596ae4acbace9d4b9fa [2023-11-29 01:01:52,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:01:52,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:01:52,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:01:52,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:01:52,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:01:52,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:52,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d5c552b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52, skipping insertion in model container [2023-11-29 01:01:52,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:52,757 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:01:52,931 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_e9dab88a-90c5-48fb-9415-f448cf1918b0/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c[3463,3476] [2023-11-29 01:01:52,941 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:01:52,951 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:01:52,979 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_e9dab88a-90c5-48fb-9415-f448cf1918b0/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c[3463,3476] [2023-11-29 01:01:52,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:01:52,990 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:01:52,991 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:01:52,997 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:01:52,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52 WrapperNode [2023-11-29 01:01:52,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:01:52,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:01:52,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:01:52,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:01:53,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:53,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:53,041 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 257 [2023-11-29 01:01:53,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:01:53,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:01:53,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:01:53,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:01:53,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:53,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:53,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:53,077 INFO L175 MemorySlicer]: Split 15 memory accesses to 5 slices as follows [2, 2, 2, 7, 2]. 47 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 5 writes are split as follows [0, 1, 1, 2, 1]. [2023-11-29 01:01:53,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:53,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:53,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:53,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:53,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:53,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:53,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:01:53,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:01:53,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:01:53,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:01:53,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52" (1/1) ... [2023-11-29 01:01:53,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:01:53,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:01:53,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:01:53,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:01:53,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:01:53,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:01:53,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:01:53,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:01:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 01:01:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 01:01:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 01:01:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:01:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:01:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 01:01:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 01:01:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 01:01:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 01:01:53,184 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 01:01:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 01:01:53,184 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 01:01:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 01:01:53,185 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 01:01:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:01:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:01:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 01:01:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 01:01:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 01:01:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 01:01:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 01:01:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:01:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:01:53,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:01:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:01:53,189 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 01:01:53,333 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:01:53,336 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:01:53,677 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:01:54,045 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:01:54,046 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 01:01:54,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:01:54 BoogieIcfgContainer [2023-11-29 01:01:54,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:01:54,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:01:54,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:01:54,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:01:54,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:01:52" (1/3) ... [2023-11-29 01:01:54,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fd82bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:01:54, skipping insertion in model container [2023-11-29 01:01:54,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:01:52" (2/3) ... [2023-11-29 01:01:54,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fd82bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:01:54, skipping insertion in model container [2023-11-29 01:01:54,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:01:54" (3/3) ... [2023-11-29 01:01:54,057 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2023-11-29 01:01:54,067 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 01:01:54,078 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:01:54,078 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:01:54,078 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 01:01:54,134 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 01:01:54,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 46 transitions, 113 flow [2023-11-29 01:01:54,209 INFO L124 PetriNetUnfolderBase]: 7/43 cut-off events. [2023-11-29 01:01:54,209 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 01:01:54,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 43 events. 7/43 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2023-11-29 01:01:54,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 46 transitions, 113 flow [2023-11-29 01:01:54,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 42 transitions, 102 flow [2023-11-29 01:01:54,228 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:01:54,236 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9271293, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:01:54,236 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 01:01:54,254 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:01:54,255 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2023-11-29 01:01:54,255 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 01:01:54,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:01:54,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:01:54,257 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-29 01:01:54,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:01:54,263 INFO L85 PathProgramCache]: Analyzing trace with hash -123258178, now seen corresponding path program 1 times [2023-11-29 01:01:54,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:01:54,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052049459] [2023-11-29 01:01:54,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:54,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:01:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:54,549 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-29 01:01:54,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:01:54,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052049459] [2023-11-29 01:01:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052049459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:01:54,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:01:54,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:01:54,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136873708] [2023-11-29 01:01:54,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:01:54,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:01:54,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:01:54,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:01:54,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:01:54,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-29 01:01:54,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 102 flow. Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-29 01:01:54,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:01:54,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-29 01:01:54,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:01:54,923 INFO L124 PetriNetUnfolderBase]: 761/1311 cut-off events. [2023-11-29 01:01:54,924 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-29 01:01:54,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 1311 events. 761/1311 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6627 event pairs, 629 based on Foata normal form. 140/1309 useless extension candidates. Maximal degree in co-relation 2182. Up to 1049 conditions per place. [2023-11-29 01:01:54,944 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 30 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2023-11-29 01:01:54,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 158 flow [2023-11-29 01:01:54,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:01:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 01:01:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2023-11-29 01:01:54,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2023-11-29 01:01:54,957 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 58 transitions. [2023-11-29 01:01:54,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 58 transitions. [2023-11-29 01:01:54,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:01:54,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 58 transitions. [2023-11-29 01:01:54,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-29 01:01:54,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-29 01:01:54,966 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-29 01:01:54,968 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 102 flow. Second operand 2 states and 58 transitions. [2023-11-29 01:01:54,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 158 flow [2023-11-29 01:01:54,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 146 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 01:01:54,978 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 86 flow [2023-11-29 01:01:54,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2023-11-29 01:01:54,984 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-29 01:01:54,984 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 86 flow [2023-11-29 01:01:54,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-29 01:01:54,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:01:54,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:01:54,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:01:54,986 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-29 01:01:54,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:01:54,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1722189346, now seen corresponding path program 1 times [2023-11-29 01:01:54,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:01:54,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249026544] [2023-11-29 01:01:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:54,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:01:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:55,170 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-29 01:01:55,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:01:55,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249026544] [2023-11-29 01:01:55,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249026544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:01:55,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:01:55,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:01:55,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906668205] [2023-11-29 01:01:55,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:01:55,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:01:55,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:01:55,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:01:55,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:01:55,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-29 01:01:55,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-29 01:01:55,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:01:55,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-29 01:01:55,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:01:55,388 INFO L124 PetriNetUnfolderBase]: 767/1295 cut-off events. [2023-11-29 01:01:55,388 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-29 01:01:55,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 1295 events. 767/1295 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6300 event pairs, 201 based on Foata normal form. 27/1243 useless extension candidates. Maximal degree in co-relation 2425. Up to 933 conditions per place. [2023-11-29 01:01:55,397 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 39 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-11-29 01:01:55,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 196 flow [2023-11-29 01:01:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:01:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:01:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2023-11-29 01:01:55,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2023-11-29 01:01:55,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 82 transitions. [2023-11-29 01:01:55,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 82 transitions. [2023-11-29 01:01:55,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:01:55,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 82 transitions. [2023-11-29 01:01:55,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-29 01:01:55,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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-29 01:01:55,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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-29 01:01:55,403 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 86 flow. Second operand 3 states and 82 transitions. [2023-11-29 01:01:55,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 196 flow [2023-11-29 01:01:55,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:01:55,406 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 105 flow [2023-11-29 01:01:55,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2023-11-29 01:01:55,407 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-29 01:01:55,408 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 105 flow [2023-11-29 01:01:55,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-29 01:01:55,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:01:55,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:01:55,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:01:55,409 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-29 01:01:55,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:01:55,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1626921496, now seen corresponding path program 2 times [2023-11-29 01:01:55,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:01:55,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280609811] [2023-11-29 01:01:55,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:55,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:01:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:55,527 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-29 01:01:55,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:01:55,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280609811] [2023-11-29 01:01:55,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280609811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:01:55,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:01:55,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:01:55,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800987895] [2023-11-29 01:01:55,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:01:55,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:01:55,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:01:55,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:01:55,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:01:55,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-29 01:01:55,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-29 01:01:55,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:01:55,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-29 01:01:55,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:01:55,757 INFO L124 PetriNetUnfolderBase]: 699/1289 cut-off events. [2023-11-29 01:01:55,757 INFO L125 PetriNetUnfolderBase]: For 210/213 co-relation queries the response was YES. [2023-11-29 01:01:55,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 1289 events. 699/1289 cut-off events. For 210/213 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6464 event pairs, 261 based on Foata normal form. 29/1219 useless extension candidates. Maximal degree in co-relation 2587. Up to 597 conditions per place. [2023-11-29 01:01:55,765 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 43 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 01:01:55,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 229 flow [2023-11-29 01:01:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:01:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:01:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2023-11-29 01:01:55,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2023-11-29 01:01:55,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 83 transitions. [2023-11-29 01:01:55,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 83 transitions. [2023-11-29 01:01:55,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:01:55,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 83 transitions. [2023-11-29 01:01:55,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-29 01:01:55,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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-29 01:01:55,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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-29 01:01:55,770 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 105 flow. Second operand 3 states and 83 transitions. [2023-11-29 01:01:55,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 229 flow [2023-11-29 01:01:55,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:01:55,773 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 114 flow [2023-11-29 01:01:55,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-11-29 01:01:55,774 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-11-29 01:01:55,774 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 114 flow [2023-11-29 01:01:55,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-29 01:01:55,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:01:55,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:01:55,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:01:55,775 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-29 01:01:55,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:01:55,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1393848606, now seen corresponding path program 3 times [2023-11-29 01:01:55,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:01:55,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442306660] [2023-11-29 01:01:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:55,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:01:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:55,941 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-29 01:01:55,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:01:55,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442306660] [2023-11-29 01:01:55,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442306660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:01:55,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:01:55,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:01:55,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454195301] [2023-11-29 01:01:55,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:01:55,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:01:55,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:01:55,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:01:55,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:01:55,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-29 01:01:55,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-29 01:01:55,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:01:55,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-29 01:01:55,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:01:56,175 INFO L124 PetriNetUnfolderBase]: 748/1382 cut-off events. [2023-11-29 01:01:56,176 INFO L125 PetriNetUnfolderBase]: For 299/301 co-relation queries the response was YES. [2023-11-29 01:01:56,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 1382 events. 748/1382 cut-off events. For 299/301 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6925 event pairs, 550 based on Foata normal form. 27/1311 useless extension candidates. Maximal degree in co-relation 2922. Up to 1005 conditions per place. [2023-11-29 01:01:56,185 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 32 selfloop transitions, 2 changer transitions 15/59 dead transitions. [2023-11-29 01:01:56,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 247 flow [2023-11-29 01:01:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:01:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:01:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2023-11-29 01:01:56,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49130434782608695 [2023-11-29 01:01:56,188 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 113 transitions. [2023-11-29 01:01:56,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 113 transitions. [2023-11-29 01:01:56,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:01:56,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 113 transitions. [2023-11-29 01:01:56,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-29 01:01:56,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 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-29 01:01:56,191 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 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-29 01:01:56,192 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 114 flow. Second operand 5 states and 113 transitions. [2023-11-29 01:01:56,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 247 flow [2023-11-29 01:01:56,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:01:56,195 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 132 flow [2023-11-29 01:01:56,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-11-29 01:01:56,196 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2023-11-29 01:01:56,197 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 132 flow [2023-11-29 01:01:56,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-29 01:01:56,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:01:56,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:01:56,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:01:56,198 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-29 01:01:56,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:01:56,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1054773014, now seen corresponding path program 1 times [2023-11-29 01:01:56,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:01:56,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475773708] [2023-11-29 01:01:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:56,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:01:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:56,360 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-29 01:01:56,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:01:56,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475773708] [2023-11-29 01:01:56,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475773708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:01:56,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:01:56,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:01:56,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907617003] [2023-11-29 01:01:56,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:01:56,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:01:56,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:01:56,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:01:56,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:01:56,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-29 01:01:56,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-29 01:01:56,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:01:56,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-29 01:01:56,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:01:56,647 INFO L124 PetriNetUnfolderBase]: 948/1719 cut-off events. [2023-11-29 01:01:56,647 INFO L125 PetriNetUnfolderBase]: For 490/495 co-relation queries the response was YES. [2023-11-29 01:01:56,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3732 conditions, 1719 events. 948/1719 cut-off events. For 490/495 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 9005 event pairs, 712 based on Foata normal form. 34/1655 useless extension candidates. Maximal degree in co-relation 3723. Up to 1003 conditions per place. [2023-11-29 01:01:56,658 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 31 selfloop transitions, 4 changer transitions 20/65 dead transitions. [2023-11-29 01:01:56,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 306 flow [2023-11-29 01:01:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:01:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:01:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2023-11-29 01:01:56,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043478260869565 [2023-11-29 01:01:56,661 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 116 transitions. [2023-11-29 01:01:56,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 116 transitions. [2023-11-29 01:01:56,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:01:56,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 116 transitions. [2023-11-29 01:01:56,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-29 01:01:56,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 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-29 01:01:56,664 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 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-29 01:01:56,664 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 132 flow. Second operand 5 states and 116 transitions. [2023-11-29 01:01:56,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 306 flow [2023-11-29 01:01:56,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 286 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-11-29 01:01:56,668 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 140 flow [2023-11-29 01:01:56,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2023-11-29 01:01:56,669 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-11-29 01:01:56,669 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 140 flow [2023-11-29 01:01:56,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-29 01:01:56,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:01:56,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:01:56,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:01:56,670 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-29 01:01:56,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:01:56,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1089529007, now seen corresponding path program 1 times [2023-11-29 01:01:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:01:56,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252373668] [2023-11-29 01:01:56,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:01:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:01:58,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:01:58,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252373668] [2023-11-29 01:01:58,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252373668] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:01:58,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181982959] [2023-11-29 01:01:58,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:58,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:01:58,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:01:58,726 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:01:58,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:01:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:58,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 01:01:58,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:01:59,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:02:00,053 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-29 01:02:00,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:02:01,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:02:01,421 INFO L378 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 194 treesize of output 188 [2023-11-29 01:02:01,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:02:01,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2023-11-29 01:02:01,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:02:01,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 125 [2023-11-29 01:02:02,158 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-29 01:02:02,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181982959] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:02:02,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:02:02,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2023-11-29 01:02:02,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91714700] [2023-11-29 01:02:02,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:02:02,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 01:02:02,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:02,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 01:02:02,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 01:02:02,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2023-11-29 01:02:02,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 140 flow. Second operand has 35 states, 35 states have (on average 10.514285714285714) internal successors, (368), 35 states have internal predecessors, (368), 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-29 01:02:02,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:02,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2023-11-29 01:02:02,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:08,621 INFO L124 PetriNetUnfolderBase]: 3729/6070 cut-off events. [2023-11-29 01:02:08,621 INFO L125 PetriNetUnfolderBase]: For 1182/1189 co-relation queries the response was YES. [2023-11-29 01:02:08,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13108 conditions, 6070 events. 3729/6070 cut-off events. For 1182/1189 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 34428 event pairs, 199 based on Foata normal form. 8/5892 useless extension candidates. Maximal degree in co-relation 13099. Up to 1550 conditions per place. [2023-11-29 01:02:08,670 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 323 selfloop transitions, 84 changer transitions 3/415 dead transitions. [2023-11-29 01:02:08,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 415 transitions, 1906 flow [2023-11-29 01:02:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 01:02:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-11-29 01:02:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 725 transitions. [2023-11-29 01:02:08,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041248606465998 [2023-11-29 01:02:08,676 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 725 transitions. [2023-11-29 01:02:08,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 725 transitions. [2023-11-29 01:02:08,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:08,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 725 transitions. [2023-11-29 01:02:08,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 18.58974358974359) internal successors, (725), 39 states have internal predecessors, (725), 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-29 01:02:08,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 46.0) internal successors, (1840), 40 states have internal predecessors, (1840), 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-29 01:02:08,689 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 46.0) internal successors, (1840), 40 states have internal predecessors, (1840), 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-29 01:02:08,689 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 140 flow. Second operand 39 states and 725 transitions. [2023-11-29 01:02:08,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 415 transitions, 1906 flow [2023-11-29 01:02:08,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 415 transitions, 1890 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-29 01:02:08,702 INFO L231 Difference]: Finished difference. Result has 97 places, 130 transitions, 694 flow [2023-11-29 01:02:08,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=694, PETRI_PLACES=97, PETRI_TRANSITIONS=130} [2023-11-29 01:02:08,704 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 52 predicate places. [2023-11-29 01:02:08,704 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 130 transitions, 694 flow [2023-11-29 01:02:08,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.514285714285714) internal successors, (368), 35 states have internal predecessors, (368), 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-29 01:02:08,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:08,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:08,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:02:08,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 01:02:08,906 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-29 01:02:08,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:08,907 INFO L85 PathProgramCache]: Analyzing trace with hash -802934279, now seen corresponding path program 2 times [2023-11-29 01:02:08,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:08,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122754157] [2023-11-29 01:02:08,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:08,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:02:10,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:10,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122754157] [2023-11-29 01:02:10,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122754157] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:02:10,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250920434] [2023-11-29 01:02:10,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:02:10,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:02:10,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:02:10,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:02:10,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:02:10,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 01:02:10,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:02:10,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 01:02:10,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:11,238 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-29 01:02:11,238 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:02:11,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250920434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:02:11,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:02:11,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2023-11-29 01:02:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41913595] [2023-11-29 01:02:11,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:02:11,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:02:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:11,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:02:11,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2023-11-29 01:02:11,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2023-11-29 01:02:11,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 130 transitions, 694 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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-29 01:02:11,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:11,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2023-11-29 01:02:11,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:12,271 INFO L124 PetriNetUnfolderBase]: 3519/5970 cut-off events. [2023-11-29 01:02:12,272 INFO L125 PetriNetUnfolderBase]: For 6996/7041 co-relation queries the response was YES. [2023-11-29 01:02:12,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16536 conditions, 5970 events. 3519/5970 cut-off events. For 6996/7041 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 36050 event pairs, 997 based on Foata normal form. 101/6041 useless extension candidates. Maximal degree in co-relation 16518. Up to 3678 conditions per place. [2023-11-29 01:02:12,310 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 136 selfloop transitions, 26 changer transitions 2/172 dead transitions. [2023-11-29 01:02:12,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 172 transitions, 1096 flow [2023-11-29 01:02:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:02:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 01:02:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2023-11-29 01:02:12,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4701086956521739 [2023-11-29 01:02:12,312 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 173 transitions. [2023-11-29 01:02:12,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 173 transitions. [2023-11-29 01:02:12,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:12,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 173 transitions. [2023-11-29 01:02:12,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 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-29 01:02:12,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 46.0) internal successors, (414), 9 states have internal predecessors, (414), 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-29 01:02:12,314 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 46.0) internal successors, (414), 9 states have internal predecessors, (414), 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-29 01:02:12,314 INFO L175 Difference]: Start difference. First operand has 97 places, 130 transitions, 694 flow. Second operand 8 states and 173 transitions. [2023-11-29 01:02:12,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 172 transitions, 1096 flow [2023-11-29 01:02:12,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 172 transitions, 980 flow, removed 42 selfloop flow, removed 7 redundant places. [2023-11-29 01:02:12,354 INFO L231 Difference]: Finished difference. Result has 96 places, 114 transitions, 622 flow [2023-11-29 01:02:12,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=622, PETRI_PLACES=96, PETRI_TRANSITIONS=114} [2023-11-29 01:02:12,355 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2023-11-29 01:02:12,355 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 114 transitions, 622 flow [2023-11-29 01:02:12,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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-29 01:02:12,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:12,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:12,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:02:12,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:02:12,556 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-29 01:02:12,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1689090181, now seen corresponding path program 1 times [2023-11-29 01:02:12,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:12,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730700982] [2023-11-29 01:02:12,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:12,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:12,740 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-29 01:02:12,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:12,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730700982] [2023-11-29 01:02:12,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730700982] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:02:12,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881718948] [2023-11-29 01:02:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:12,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:02:12,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:02:12,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:02:12,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:02:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:12,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 01:02:12,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:02:12,951 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:02:13,044 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-29 01:02:13,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881718948] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:02:13,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:02:13,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-29 01:02:13,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66924535] [2023-11-29 01:02:13,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:02:13,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:02:13,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:13,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:02:13,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:02:13,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-29 01:02:13,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 114 transitions, 622 flow. Second operand has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 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-29 01:02:13,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:13,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-29 01:02:13,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:13,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([736] L88-->L92: Formula: (and (not (= (ite (and (< v_~q2_front~0_81 v_~q2_back~0_90) (< v_~q2_front~0_81 v_~n2~0_56) (<= 0 v_~q2_front~0_81)) 1 0) 0)) (= (select (select |v_#memory_int#3_82| v_~q2~0.base_79) (+ v_~q2~0.offset_79 (* 4 v_~q2_front~0_81))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (= (+ v_~q2_front~0_81 1) v_~q2_front~0_80)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_79, ~q2_front~0=v_~q2_front~0_81, ~q2~0.base=v_~q2~0.base_79, ~q2_back~0=v_~q2_back~0_90, #memory_int#3=|v_#memory_int#3_82|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_79, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_80, ~q2~0.base=v_~q2~0.base_79, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_90, #memory_int#3=|v_#memory_int#3_82|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][132], [8#L122-2true, 319#(or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))), 20#thread2EXITtrue, Black: 67#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 508#true, 52#true, Black: 326#(and (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= ~t~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 350#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 338#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 346#(and (= (+ (* 2 ~t~0) (* 2 |thread3Thread1of1ForFork1_~k~0#1|) 2) ~s~0) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 192#(and (= (+ ~t~0 1) 0) (= ~s~0 0)), Black: 461#(and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#3| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), 28#L92true, Black: 445#(and (= (select (select |#memory_int#3| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 252#(or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 465#(and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= (+ (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) 0) (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#3| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= ~s~0 0)), 380#true, Black: 348#(and (or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 1) (+ ~s~0 (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)))) (< ~q2_front~0 0) (< (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1) (select (select |#memory_int#3| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (< 0 (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (or (not (= 0 ~q2_front~0)) (and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (or (and (= ~t~0 0) (or (not (= (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1) 0)) (= ~s~0 0))) (and (or (< ~n2~0 2) (< ~q2_back~0 1)) (not (= ~q2_back~0 0)))))) (or (< ~q2_front~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (= ~q2_back~0 ~q2_front~0) (< ~q2_back~0 0)) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (= ~s~0 (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))) (= ~q2~0.offset 0) (or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 1) (+ ~s~0 (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)))) (< ~q2_front~0 0) (< ~n2~0 (+ ~q2_back~0 1)) (forall ((v_subst_4 Int) (v_subst_3 Int)) (or (< (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1) (select (select |#memory_int#3| v_subst_4) (+ (* ~q1_front~0 4) v_subst_3))) (not (= (select (select |#memory_int#3| v_subst_4) (+ (* ~q1_back~0 4) v_subst_3)) 0)))) (< ~q2_back~0 0) (< 0 (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 97#(= (+ (* 2 ~t~0) 2) ~s~0), Black: 469#(and (= (+ |thread3Thread1of1ForFork1_~k~0#1| 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0)), Black: 473#(and (= (+ ~t~0 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~s~0 0)), Black: 57#(<= ~q1_back~0 ~q1_front~0)]) [2023-11-29 01:02:13,992 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 01:02:13,992 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 01:02:13,992 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 01:02:13,992 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 01:02:14,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([736] L88-->L92: Formula: (and (not (= (ite (and (< v_~q2_front~0_81 v_~q2_back~0_90) (< v_~q2_front~0_81 v_~n2~0_56) (<= 0 v_~q2_front~0_81)) 1 0) 0)) (= (select (select |v_#memory_int#3_82| v_~q2~0.base_79) (+ v_~q2~0.offset_79 (* 4 v_~q2_front~0_81))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (= (+ v_~q2_front~0_81 1) v_~q2_front~0_80)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_79, ~q2_front~0=v_~q2_front~0_81, ~q2~0.base=v_~q2~0.base_79, ~q2_back~0=v_~q2_back~0_90, #memory_int#3=|v_#memory_int#3_82|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_79, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_80, ~q2~0.base=v_~q2~0.base_79, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_90, #memory_int#3=|v_#memory_int#3_82|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][132], [319#(or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))), 20#thread2EXITtrue, 44#L123-1true, Black: 67#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 508#true, 52#true, Black: 326#(and (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= ~t~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 350#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 338#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 346#(and (= (+ (* 2 ~t~0) (* 2 |thread3Thread1of1ForFork1_~k~0#1|) 2) ~s~0) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 192#(and (= (+ ~t~0 1) 0) (= ~s~0 0)), Black: 461#(and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#3| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 252#(or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 445#(and (= (select (select |#memory_int#3| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), 28#L92true, Black: 348#(and (or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 1) (+ ~s~0 (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)))) (< ~q2_front~0 0) (< (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1) (select (select |#memory_int#3| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (< 0 (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (or (not (= 0 ~q2_front~0)) (and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (or (and (= ~t~0 0) (or (not (= (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1) 0)) (= ~s~0 0))) (and (or (< ~n2~0 2) (< ~q2_back~0 1)) (not (= ~q2_back~0 0)))))) (or (< ~q2_front~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (= ~q2_back~0 ~q2_front~0) (< ~q2_back~0 0)) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (= ~s~0 (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))) (= ~q2~0.offset 0) (or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 1) (+ ~s~0 (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)))) (< ~q2_front~0 0) (< ~n2~0 (+ ~q2_back~0 1)) (forall ((v_subst_4 Int) (v_subst_3 Int)) (or (< (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1) (select (select |#memory_int#3| v_subst_4) (+ (* ~q1_front~0 4) v_subst_3))) (not (= (select (select |#memory_int#3| v_subst_4) (+ (* ~q1_back~0 4) v_subst_3)) 0)))) (< ~q2_back~0 0) (< 0 (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 465#(and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= (+ (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) 0) (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#3| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= ~s~0 0)), 380#true, Black: 97#(= (+ (* 2 ~t~0) 2) ~s~0), Black: 469#(and (= (+ |thread3Thread1of1ForFork1_~k~0#1| 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0)), Black: 473#(and (= (+ ~t~0 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~s~0 0)), Black: 57#(<= ~q1_back~0 ~q1_front~0)]) [2023-11-29 01:02:14,003 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 01:02:14,003 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 01:02:14,003 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 01:02:14,003 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 01:02:14,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([736] L88-->L92: Formula: (and (not (= (ite (and (< v_~q2_front~0_81 v_~q2_back~0_90) (< v_~q2_front~0_81 v_~n2~0_56) (<= 0 v_~q2_front~0_81)) 1 0) 0)) (= (select (select |v_#memory_int#3_82| v_~q2~0.base_79) (+ v_~q2~0.offset_79 (* 4 v_~q2_front~0_81))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (= (+ v_~q2_front~0_81 1) v_~q2_front~0_80)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_79, ~q2_front~0=v_~q2_front~0_81, ~q2~0.base=v_~q2~0.base_79, ~q2_back~0=v_~q2_back~0_90, #memory_int#3=|v_#memory_int#3_82|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_79, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_80, ~q2~0.base=v_~q2~0.base_79, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_90, #memory_int#3=|v_#memory_int#3_82|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][132], [319#(or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))), Black: 67#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 508#true, 52#true, Black: 326#(and (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= ~t~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 350#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 338#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 346#(and (= (+ (* 2 ~t~0) (* 2 |thread3Thread1of1ForFork1_~k~0#1|) 2) ~s~0) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 192#(and (= (+ ~t~0 1) 0) (= ~s~0 0)), Black: 461#(and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#3| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 252#(or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 445#(and (= (select (select |#memory_int#3| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), 28#L92true, Black: 348#(and (or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 1) (+ ~s~0 (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)))) (< ~q2_front~0 0) (< (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1) (select (select |#memory_int#3| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (< 0 (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (or (not (= 0 ~q2_front~0)) (and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (or (and (= ~t~0 0) (or (not (= (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1) 0)) (= ~s~0 0))) (and (or (< ~n2~0 2) (< ~q2_back~0 1)) (not (= ~q2_back~0 0)))))) (or (< ~q2_front~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (= ~q2_back~0 ~q2_front~0) (< ~q2_back~0 0)) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (= ~s~0 (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))) (= ~q2~0.offset 0) (or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 1) (+ ~s~0 (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)))) (< ~q2_front~0 0) (< ~n2~0 (+ ~q2_back~0 1)) (forall ((v_subst_4 Int) (v_subst_3 Int)) (or (< (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1) (select (select |#memory_int#3| v_subst_4) (+ (* ~q1_front~0 4) v_subst_3))) (not (= (select (select |#memory_int#3| v_subst_4) (+ (* ~q1_back~0 4) v_subst_3)) 0)))) (< ~q2_back~0 0) (< 0 (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 465#(and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= (+ (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) 0) (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#3| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= ~s~0 0)), 380#true, Black: 97#(= (+ (* 2 ~t~0) 2) ~s~0), Black: 469#(and (= (+ |thread3Thread1of1ForFork1_~k~0#1| 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0)), 13#L123-2true, Black: 473#(and (= (+ ~t~0 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~s~0 0)), Black: 57#(<= ~q1_back~0 ~q1_front~0)]) [2023-11-29 01:02:14,004 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-29 01:02:14,004 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 01:02:14,004 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 01:02:14,004 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 01:02:14,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([736] L88-->L92: Formula: (and (not (= (ite (and (< v_~q2_front~0_81 v_~q2_back~0_90) (< v_~q2_front~0_81 v_~n2~0_56) (<= 0 v_~q2_front~0_81)) 1 0) 0)) (= (select (select |v_#memory_int#3_82| v_~q2~0.base_79) (+ v_~q2~0.offset_79 (* 4 v_~q2_front~0_81))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (= (+ v_~q2_front~0_81 1) v_~q2_front~0_80)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_79, ~q2_front~0=v_~q2_front~0_81, ~q2~0.base=v_~q2~0.base_79, ~q2_back~0=v_~q2_back~0_90, #memory_int#3=|v_#memory_int#3_82|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_79, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_80, ~q2~0.base=v_~q2~0.base_79, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_90, #memory_int#3=|v_#memory_int#3_82|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][132], [9#L124-1true, 319#(or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))), Black: 67#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 508#true, 52#true, Black: 326#(and (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= ~t~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 350#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 338#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 346#(and (= (+ (* 2 ~t~0) (* 2 |thread3Thread1of1ForFork1_~k~0#1|) 2) ~s~0) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 192#(and (= (+ ~t~0 1) 0) (= ~s~0 0)), Black: 461#(and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#3| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 252#(or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 445#(and (= (select (select |#memory_int#3| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), 28#L92true, Black: 348#(and (or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 1) (+ ~s~0 (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)))) (< ~q2_front~0 0) (< (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1) (select (select |#memory_int#3| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (< 0 (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (or (not (= 0 ~q2_front~0)) (and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (or (and (= ~t~0 0) (or (not (= (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1) 0)) (= ~s~0 0))) (and (or (< ~n2~0 2) (< ~q2_back~0 1)) (not (= ~q2_back~0 0)))))) (or (< ~q2_front~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ ~q2_back~0 1)) (= ~q2_back~0 ~q2_front~0) (< ~q2_back~0 0)) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (or (= ~s~0 (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))) (= ~q2~0.offset 0) (or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 1) (+ ~s~0 (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)))) (< ~q2_front~0 0) (< ~n2~0 (+ ~q2_back~0 1)) (forall ((v_subst_4 Int) (v_subst_3 Int)) (or (< (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1) (select (select |#memory_int#3| v_subst_4) (+ (* ~q1_front~0 4) v_subst_3))) (not (= (select (select |#memory_int#3| v_subst_4) (+ (* ~q1_back~0 4) v_subst_3)) 0)))) (< ~q2_back~0 0) (< 0 (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 465#(and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= (+ (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) 0) (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#3| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= ~s~0 0)), 380#true, Black: 97#(= (+ (* 2 ~t~0) 2) ~s~0), Black: 469#(and (= (+ |thread3Thread1of1ForFork1_~k~0#1| 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0)), Black: 473#(and (= (+ ~t~0 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~s~0 0)), Black: 57#(<= ~q1_back~0 ~q1_front~0)]) [2023-11-29 01:02:14,010 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 01:02:14,010 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 01:02:14,010 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 01:02:14,010 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 01:02:14,022 INFO L124 PetriNetUnfolderBase]: 3901/7737 cut-off events. [2023-11-29 01:02:14,022 INFO L125 PetriNetUnfolderBase]: For 10870/10954 co-relation queries the response was YES. [2023-11-29 01:02:14,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20428 conditions, 7737 events. 3901/7737 cut-off events. For 10870/10954 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 60303 event pairs, 2193 based on Foata normal form. 297/7616 useless extension candidates. Maximal degree in co-relation 20407. Up to 3300 conditions per place. [2023-11-29 01:02:14,069 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 116 selfloop transitions, 8 changer transitions 9/170 dead transitions. [2023-11-29 01:02:14,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 170 transitions, 1144 flow [2023-11-29 01:02:14,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:02:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 01:02:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2023-11-29 01:02:14,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-29 01:02:14,071 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 161 transitions. [2023-11-29 01:02:14,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 161 transitions. [2023-11-29 01:02:14,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:14,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 161 transitions. [2023-11-29 01:02:14,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-29 01:02:14,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 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-29 01:02:14,073 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 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-29 01:02:14,073 INFO L175 Difference]: Start difference. First operand has 96 places, 114 transitions, 622 flow. Second operand 7 states and 161 transitions. [2023-11-29 01:02:14,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 170 transitions, 1144 flow [2023-11-29 01:02:14,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 170 transitions, 1123 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-29 01:02:14,143 INFO L231 Difference]: Finished difference. Result has 103 places, 115 transitions, 664 flow [2023-11-29 01:02:14,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=664, PETRI_PLACES=103, PETRI_TRANSITIONS=115} [2023-11-29 01:02:14,144 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 58 predicate places. [2023-11-29 01:02:14,144 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 115 transitions, 664 flow [2023-11-29 01:02:14,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 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-29 01:02:14,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:14,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:14,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 01:02:14,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:02:14,346 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-29 01:02:14,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash -484406409, now seen corresponding path program 2 times [2023-11-29 01:02:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:14,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517631735] [2023-11-29 01:02:14,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:14,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:14,946 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-29 01:02:14,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:14,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517631735] [2023-11-29 01:02:14,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517631735] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:02:14,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596894872] [2023-11-29 01:02:14,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:02:14,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:02:14,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:02:14,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:02:14,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 01:02:15,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:02:15,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:02:15,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 01:02:15,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:15,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:02:15,547 INFO L378 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 23 treesize of output 15 [2023-11-29 01:02:15,750 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-29 01:02:15,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:02:15,942 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 01:02:15,943 INFO L378 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 24 treesize of output 11 [2023-11-29 01:02:16,165 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-29 01:02:16,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596894872] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:02:16,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:02:16,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-11-29 01:02:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774352051] [2023-11-29 01:02:16,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:02:16,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 01:02:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:16,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 01:02:16,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-11-29 01:02:16,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2023-11-29 01:02:16,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 115 transitions, 664 flow. Second operand has 23 states, 23 states have (on average 14.73913043478261) internal successors, (339), 23 states have internal predecessors, (339), 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-29 01:02:16,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:16,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2023-11-29 01:02:16,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:21,097 INFO L124 PetriNetUnfolderBase]: 13632/24431 cut-off events. [2023-11-29 01:02:21,097 INFO L125 PetriNetUnfolderBase]: For 42250/42494 co-relation queries the response was YES. [2023-11-29 01:02:21,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69328 conditions, 24431 events. 13632/24431 cut-off events. For 42250/42494 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 205516 event pairs, 2398 based on Foata normal form. 487/24139 useless extension candidates. Maximal degree in co-relation 69304. Up to 2737 conditions per place. [2023-11-29 01:02:21,288 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 421 selfloop transitions, 111 changer transitions 0/563 dead transitions. [2023-11-29 01:02:21,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 563 transitions, 3880 flow [2023-11-29 01:02:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 01:02:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-29 01:02:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 630 transitions. [2023-11-29 01:02:21,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267558528428093 [2023-11-29 01:02:21,292 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 630 transitions. [2023-11-29 01:02:21,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 630 transitions. [2023-11-29 01:02:21,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:21,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 630 transitions. [2023-11-29 01:02:21,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 24.23076923076923) internal successors, (630), 26 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:02:21,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 46.0) internal successors, (1242), 27 states have internal predecessors, (1242), 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-29 01:02:21,297 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 46.0) internal successors, (1242), 27 states have internal predecessors, (1242), 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-29 01:02:21,297 INFO L175 Difference]: Start difference. First operand has 103 places, 115 transitions, 664 flow. Second operand 26 states and 630 transitions. [2023-11-29 01:02:21,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 563 transitions, 3880 flow [2023-11-29 01:02:21,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 563 transitions, 3723 flow, removed 74 selfloop flow, removed 4 redundant places. [2023-11-29 01:02:21,675 INFO L231 Difference]: Finished difference. Result has 140 places, 231 transitions, 1996 flow [2023-11-29 01:02:21,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1996, PETRI_PLACES=140, PETRI_TRANSITIONS=231} [2023-11-29 01:02:21,676 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 95 predicate places. [2023-11-29 01:02:21,676 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 231 transitions, 1996 flow [2023-11-29 01:02:21,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.73913043478261) internal successors, (339), 23 states have internal predecessors, (339), 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-29 01:02:21,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:21,676 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:21,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 01:02:21,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:02:21,877 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-29 01:02:21,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:21,878 INFO L85 PathProgramCache]: Analyzing trace with hash -300802027, now seen corresponding path program 3 times [2023-11-29 01:02:21,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:21,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354791598] [2023-11-29 01:02:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:21,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:22,390 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-29 01:02:22,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:22,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354791598] [2023-11-29 01:02:22,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354791598] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:02:22,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907201381] [2023-11-29 01:02:22,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:02:22,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:02:22,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:02:22,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:02:22,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 01:02:22,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 01:02:22,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:02:22,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 01:02:22,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:22,906 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 01:02:22,906 INFO L378 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 23 treesize of output 10 [2023-11-29 01:02:22,938 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-29 01:02:22,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:02:23,124 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 01:02:23,124 INFO L378 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 24 treesize of output 11 [2023-11-29 01:02:23,391 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-29 01:02:23,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907201381] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:02:23,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:02:23,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-11-29 01:02:23,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203780323] [2023-11-29 01:02:23,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:02:23,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 01:02:23,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:23,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 01:02:23,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2023-11-29 01:02:23,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2023-11-29 01:02:23,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 231 transitions, 1996 flow. Second operand has 23 states, 23 states have (on average 14.73913043478261) internal successors, (339), 23 states have internal predecessors, (339), 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-29 01:02:23,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:23,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2023-11-29 01:02:23,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:29,625 INFO L124 PetriNetUnfolderBase]: 18874/33008 cut-off events. [2023-11-29 01:02:29,625 INFO L125 PetriNetUnfolderBase]: For 143557/143824 co-relation queries the response was YES. [2023-11-29 01:02:29,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111312 conditions, 33008 events. 18874/33008 cut-off events. For 143557/143824 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 281749 event pairs, 5440 based on Foata normal form. 260/32322 useless extension candidates. Maximal degree in co-relation 111274. Up to 7770 conditions per place. [2023-11-29 01:02:29,918 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 395 selfloop transitions, 159 changer transitions 0/585 dead transitions. [2023-11-29 01:02:29,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 585 transitions, 5383 flow [2023-11-29 01:02:29,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 01:02:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-29 01:02:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 467 transitions. [2023-11-29 01:02:29,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076086956521739 [2023-11-29 01:02:29,921 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 467 transitions. [2023-11-29 01:02:29,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 467 transitions. [2023-11-29 01:02:29,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:02:29,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 467 transitions. [2023-11-29 01:02:29,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 23.35) internal successors, (467), 20 states have internal predecessors, (467), 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-29 01:02:29,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 46.0) internal successors, (966), 21 states have internal predecessors, (966), 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-29 01:02:29,926 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 46.0) internal successors, (966), 21 states have internal predecessors, (966), 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-29 01:02:29,926 INFO L175 Difference]: Start difference. First operand has 140 places, 231 transitions, 1996 flow. Second operand 20 states and 467 transitions. [2023-11-29 01:02:29,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 585 transitions, 5383 flow [2023-11-29 01:02:31,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 585 transitions, 5186 flow, removed 95 selfloop flow, removed 3 redundant places. [2023-11-29 01:02:31,102 INFO L231 Difference]: Finished difference. Result has 165 places, 316 transitions, 3401 flow [2023-11-29 01:02:31,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1855, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3401, PETRI_PLACES=165, PETRI_TRANSITIONS=316} [2023-11-29 01:02:31,103 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 120 predicate places. [2023-11-29 01:02:31,103 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 316 transitions, 3401 flow [2023-11-29 01:02:31,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.73913043478261) internal successors, (339), 23 states have internal predecessors, (339), 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-29 01:02:31,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:02:31,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:02:31,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 01:02:31,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:02:31,305 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-29 01:02:31,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:02:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1741956679, now seen corresponding path program 4 times [2023-11-29 01:02:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:02:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346275082] [2023-11-29 01:02:31,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:02:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:02:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:31,800 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-29 01:02:31,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:02:31,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346275082] [2023-11-29 01:02:31,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346275082] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:02:31,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521868139] [2023-11-29 01:02:31,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:02:31,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:02:31,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:02:31,802 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:02:31,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 01:02:31,914 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:02:31,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:02:31,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 01:02:31,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:32,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:02:32,521 INFO L378 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 36 treesize of output 31 [2023-11-29 01:02:32,614 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-29 01:02:32,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:02:33,312 INFO L349 Elim1Store]: treesize reduction 9, result has 90.3 percent of original size [2023-11-29 01:02:33,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 110 [2023-11-29 01:02:34,170 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-29 01:02:34,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521868139] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:02:34,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:02:34,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 13] total 30 [2023-11-29 01:02:34,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662385263] [2023-11-29 01:02:34,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:02:34,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 01:02:34,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:02:34,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 01:02:34,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2023-11-29 01:02:34,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2023-11-29 01:02:34,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 316 transitions, 3401 flow. Second operand has 31 states, 31 states have (on average 11.129032258064516) internal successors, (345), 31 states have internal predecessors, (345), 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-29 01:02:34,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:02:34,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2023-11-29 01:02:34,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:02:39,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:02:43,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:02:47,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:02:56,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:03:00,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:03:05,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:03:10,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:03:16,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:03:21,627 INFO L124 PetriNetUnfolderBase]: 37147/59287 cut-off events. [2023-11-29 01:03:21,627 INFO L125 PetriNetUnfolderBase]: For 354336/354657 co-relation queries the response was YES. [2023-11-29 01:03:22,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219532 conditions, 59287 events. 37147/59287 cut-off events. For 354336/354657 co-relation queries the response was YES. Maximal size of possible extension queue 1538. Compared 446039 event pairs, 5826 based on Foata normal form. 1307/60547 useless extension candidates. Maximal degree in co-relation 219485. Up to 22286 conditions per place. [2023-11-29 01:03:22,224 INFO L140 encePairwiseOnDemand]: 27/46 looper letters, 788 selfloop transitions, 371 changer transitions 136/1300 dead transitions. [2023-11-29 01:03:22,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 1300 transitions, 14039 flow [2023-11-29 01:03:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-11-29 01:03:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-11-29 01:03:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 1000 transitions. [2023-11-29 01:03:22,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2023-11-29 01:03:22,229 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 1000 transitions. [2023-11-29 01:03:22,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 1000 transitions. [2023-11-29 01:03:22,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:03:22,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 1000 transitions. [2023-11-29 01:03:22,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 20.0) internal successors, (1000), 50 states have internal predecessors, (1000), 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-29 01:03:22,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 46.0) internal successors, (2346), 51 states have internal predecessors, (2346), 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-29 01:03:22,237 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 46.0) internal successors, (2346), 51 states have internal predecessors, (2346), 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-29 01:03:22,237 INFO L175 Difference]: Start difference. First operand has 165 places, 316 transitions, 3401 flow. Second operand 50 states and 1000 transitions. [2023-11-29 01:03:22,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 1300 transitions, 14039 flow [2023-11-29 01:03:26,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 1300 transitions, 13156 flow, removed 424 selfloop flow, removed 7 redundant places. [2023-11-29 01:03:26,421 INFO L231 Difference]: Finished difference. Result has 248 places, 605 transitions, 7980 flow [2023-11-29 01:03:26,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2995, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=7980, PETRI_PLACES=248, PETRI_TRANSITIONS=605} [2023-11-29 01:03:26,423 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 203 predicate places. [2023-11-29 01:03:26,423 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 605 transitions, 7980 flow [2023-11-29 01:03:26,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.129032258064516) internal successors, (345), 31 states have internal predecessors, (345), 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-29 01:03:26,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:03:26,423 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:03:26,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 01:03:26,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 01:03:26,624 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-29 01:03:26,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:03:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash -802943925, now seen corresponding path program 1 times [2023-11-29 01:03:26,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:03:26,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506360134] [2023-11-29 01:03:26,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:03:26,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:03:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:03:26,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:03:26,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506360134] [2023-11-29 01:03:26,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506360134] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:03:26,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345666460] [2023-11-29 01:03:26,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:03:26,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:03:26,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:03:26,742 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:03:26,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 01:03:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:26,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:03:26,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:03:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:03:26,922 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:03:26,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345666460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:03:26,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:03:26,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2023-11-29 01:03:26,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938742328] [2023-11-29 01:03:26,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:03:26,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:03:26,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:03:26,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:03:26,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:03:26,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-29 01:03:26,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 605 transitions, 7980 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-29 01:03:26,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:03:26,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-29 01:03:26,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:03:39,552 INFO L124 PetriNetUnfolderBase]: 26213/50541 cut-off events. [2023-11-29 01:03:39,552 INFO L125 PetriNetUnfolderBase]: For 570208/572262 co-relation queries the response was YES. [2023-11-29 01:03:40,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231612 conditions, 50541 events. 26213/50541 cut-off events. For 570208/572262 co-relation queries the response was YES. Maximal size of possible extension queue 1416. Compared 486700 event pairs, 6511 based on Foata normal form. 2365/50776 useless extension candidates. Maximal degree in co-relation 231525. Up to 16226 conditions per place. [2023-11-29 01:03:40,454 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 600 selfloop transitions, 24 changer transitions 62/808 dead transitions. [2023-11-29 01:03:40,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 808 transitions, 12263 flow [2023-11-29 01:03:40,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:03:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 01:03:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2023-11-29 01:03:40,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6630434782608695 [2023-11-29 01:03:40,456 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 122 transitions. [2023-11-29 01:03:40,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 122 transitions. [2023-11-29 01:03:40,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:03:40,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 122 transitions. [2023-11-29 01:03:40,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-29 01:03:40,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-29 01:03:40,457 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-29 01:03:40,458 INFO L175 Difference]: Start difference. First operand has 248 places, 605 transitions, 7980 flow. Second operand 4 states and 122 transitions. [2023-11-29 01:03:40,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 808 transitions, 12263 flow [2023-11-29 01:03:47,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 808 transitions, 11561 flow, removed 318 selfloop flow, removed 16 redundant places. [2023-11-29 01:03:47,557 INFO L231 Difference]: Finished difference. Result has 228 places, 484 transitions, 6272 flow [2023-11-29 01:03:47,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6694, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6272, PETRI_PLACES=228, PETRI_TRANSITIONS=484} [2023-11-29 01:03:47,558 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 183 predicate places. [2023-11-29 01:03:47,559 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 484 transitions, 6272 flow [2023-11-29 01:03:47,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-29 01:03:47,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:03:47,559 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:03:47,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 01:03:47,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 01:03:47,760 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-29 01:03:47,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:03:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1203739863, now seen corresponding path program 5 times [2023-11-29 01:03:47,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:03:47,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602930876] [2023-11-29 01:03:47,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:03:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:03:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:03:48,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:03:48,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602930876] [2023-11-29 01:03:48,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602930876] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:03:48,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862811033] [2023-11-29 01:03:48,392 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:03:48,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:03:48,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:03:48,394 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:03:48,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 01:03:48,547 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-29 01:03:48,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:03:48,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 01:03:48,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:03:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:03:48,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:03:48,674 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 01:03:48,675 INFO L378 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 24 treesize of output 11 [2023-11-29 01:03:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:03:48,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862811033] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:03:48,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:03:48,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 14 [2023-11-29 01:03:48,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994062180] [2023-11-29 01:03:48,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:03:48,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 01:03:48,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:03:48,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 01:03:48,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:03:48,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2023-11-29 01:03:48,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 484 transitions, 6272 flow. Second operand has 15 states, 15 states have (on average 15.666666666666666) internal successors, (235), 15 states have internal predecessors, (235), 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-29 01:03:48,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:03:48,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2023-11-29 01:03:48,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:04:01,823 INFO L124 PetriNetUnfolderBase]: 30660/54715 cut-off events. [2023-11-29 01:04:01,823 INFO L125 PetriNetUnfolderBase]: For 616255/617944 co-relation queries the response was YES. [2023-11-29 01:04:02,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259259 conditions, 54715 events. 30660/54715 cut-off events. For 616255/617944 co-relation queries the response was YES. Maximal size of possible extension queue 1571. Compared 490536 event pairs, 4666 based on Foata normal form. 289/52972 useless extension candidates. Maximal degree in co-relation 259178. Up to 23650 conditions per place. [2023-11-29 01:04:02,663 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 338 selfloop transitions, 268 changer transitions 2/655 dead transitions. [2023-11-29 01:04:02,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 655 transitions, 9151 flow [2023-11-29 01:04:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:04:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 01:04:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 280 transitions. [2023-11-29 01:04:02,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4682274247491639 [2023-11-29 01:04:02,664 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 280 transitions. [2023-11-29 01:04:02,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 280 transitions. [2023-11-29 01:04:02,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:04:02,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 280 transitions. [2023-11-29 01:04:02,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 21.53846153846154) internal successors, (280), 13 states have internal predecessors, (280), 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-29 01:04:02,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 46.0) internal successors, (644), 14 states have internal predecessors, (644), 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-29 01:04:02,667 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 46.0) internal successors, (644), 14 states have internal predecessors, (644), 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-29 01:04:02,667 INFO L175 Difference]: Start difference. First operand has 228 places, 484 transitions, 6272 flow. Second operand 13 states and 280 transitions. [2023-11-29 01:04:02,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 655 transitions, 9151 flow [2023-11-29 01:04:10,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 655 transitions, 8822 flow, removed 134 selfloop flow, removed 17 redundant places. [2023-11-29 01:04:10,599 INFO L231 Difference]: Finished difference. Result has 197 places, 505 transitions, 7198 flow [2023-11-29 01:04:10,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5954, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7198, PETRI_PLACES=197, PETRI_TRANSITIONS=505} [2023-11-29 01:04:10,601 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 152 predicate places. [2023-11-29 01:04:10,601 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 505 transitions, 7198 flow [2023-11-29 01:04:10,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.666666666666666) internal successors, (235), 15 states have internal predecessors, (235), 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-29 01:04:10,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:04:10,601 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:04:10,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 01:04:10,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 01:04:10,802 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-29 01:04:10,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:04:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1468539032, now seen corresponding path program 1 times [2023-11-29 01:04:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:04:10,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191607860] [2023-11-29 01:04:10,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:04:10,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:04:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:04:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 01:04:10,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:04:10,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191607860] [2023-11-29 01:04:10,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191607860] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:04:10,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626532942] [2023-11-29 01:04:10,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:04:10,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:04:10,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:04:10,958 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:04:10,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 01:04:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:04:11,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 01:04:11,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:04:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 01:04:11,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:04:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 01:04:11,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626532942] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:04:11,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:04:11,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-29 01:04:11,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270597527] [2023-11-29 01:04:11,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:04:11,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:04:11,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:04:11,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:04:11,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:04:11,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-29 01:04:11,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 505 transitions, 7198 flow. Second operand has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 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-29 01:04:11,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:04:11,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-29 01:04:11,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:04:16,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([727] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#3_84| v_~q1~0.base_104) (+ (* 4 v_~q1_front~0_93) v_~q1~0.offset_104))) (not (= (ite (and (< v_~q1_front~0_93 v_~q1_back~0_134) (<= 0 v_~q1_front~0_93) (< v_~q1_front~0_93 v_~n1~0_67)) 1 0) 0)) (= (+ v_~q1_front~0_93 1) v_~q1_front~0_92)) InVars {~q1~0.offset=v_~q1~0.offset_104, ~q1_front~0=v_~q1_front~0_93, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_67, ~q1~0.base=v_~q1~0.base_104, #memory_int#3=|v_#memory_int#3_84|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_104, ~q1_front~0=v_~q1_front~0_92, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_67, ~q1~0.base=v_~q1~0.base_104, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#3=|v_#memory_int#3_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][138], [Black: 1643#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (= (+ (* 2 ~t~0) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q2_back~0 ~q2_front~0) (forall ((v_subst_15 Int) (v_subst_16 Int)) (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| v_subst_15) (+ (* 4 ~q2_front~0) v_subst_16)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| v_subst_15) (+ v_subst_16 (* ~q2_back~0 4))) 1))))) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), 1345#true, Black: 1527#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 1663#(and (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (= 2 ~s~0) (= ~t~0 0) (= |thread3Thread1of1ForFork1_~k~0#1| 1) (not (= ~q1_front~0 0)) (= ~q1_back~0 ~n1~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (<= ~n1~0 2)), 84#true, Black: 1509#(or (= (+ (* 2 ~t~0) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 1615#(and (or (< ~q2_back~0 ~q2_front~0) (< ~q2_front~0 0) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q2_back~0 ~q2_front~0) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))))) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 1649#(and (or (< ~q2_back~0 ~q2_front~0) (< ~q2_front~0 0) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (= |thread2Thread1of1ForFork0_~j~0#1| 2) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (not (= ~q1_front~0 0))) (= ~q1~0.offset 0)), Black: 1034#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 1653#(and (exists ((v_~q2_back~0_101 Int)) (and (<= v_~q2_back~0_101 ~q2_front~0) (<= ~q2_back~0 (+ v_~q2_back~0_101 1)) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* 4 v_~q2_back~0_101))) 1)))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (= ~t~0 0) (not (= ~q1_front~0 0)) (= ~q1_back~0 ~n1~0) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (<= ~q2_back~0 ~q2_front~0) (exists ((v_subst_17 Int)) (= 2 (select (select |#memory_int#3| v_subst_17) (+ (* ~q1_back~0 4) (- 4))))) (<= ~n1~0 2) (= ~s~0 0)), Black: 1018#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (exists ((v_~q1_back~0_145 Int)) (and (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_145 4))) (<= ~q1_front~0 v_~q1_back~0_145) (<= (+ v_~q1_back~0_145 1) ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (<= ~n1~0 2)), Black: 1655#(and (= |thread2Thread1of1ForFork0_~j~0#1| (+ ~t~0 1)) (<= 1 ~q1_back~0) (<= ~q1_back~0 ~n1~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (= ~q1~0.offset 0) (not (= ~q1_front~0 0)) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (= |thread2Thread1of1ForFork0_~j~0#1| ~s~0) (or (= ~q1_back~0 ~n1~0) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= ~n1~0 2)), Black: 1020#(and (<= 1 ~n1~0) (or (not (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1)) (= (select (select |#memory_int#3| ~q1~0.base) 0) 2)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (<= ~n1~0 2)), Black: 1645#(and (exists ((v_~q2_back~0_101 Int)) (and (<= v_~q2_back~0_101 ~q2_front~0) (<= ~q2_back~0 (+ v_~q2_back~0_101 1)) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* 4 v_~q2_back~0_101))) 1)))) (<= 1 ~q1_back~0) (or (= 2 ~s~0) (= ~q1_back~0 ~n1~0)) (exists ((~q1~0.base Int)) (= 2 (select (select |#memory_int#3| ~q1~0.base) (+ (* ~q1_back~0 4) (- 4))))) (<= ~q1_back~0 ~n1~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (= ~q1~0.offset 0) (= ~t~0 0) (not (= ~q1_front~0 0)) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (= |thread2Thread1of1ForFork0_~j~0#1| ~s~0) (= |thread2Thread1of1ForFork0_~j~0#1| (+ |thread3Thread1of1ForFork1_~k~0#1| 1)) (<= ~n1~0 2)), Black: 1016#(and (<= ~q1_front~0 ~q1_back~0) (or (= |thread2Thread1of1ForFork0_~j~0#1| 2) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q1~0.offset 0) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#3| ~q1~0.base) (* ~q1_front~0 4))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 1008#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1633#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (= (+ (* 2 ~t~0) (* 2 |thread3Thread1of1ForFork1_~k~0#1|) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (= (+ (* 2 ~t~0) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q2_back~0 ~q2_front~0) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|) (forall ((v_subst_12 Int) (v_subst_11 Int)) (or (= (+ (* 2 (select (select |#memory_int#3| v_subst_11) (+ (* 4 ~q2_front~0) v_subst_12))) (* 2 ~t~0) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (not (= (+ (select (select |#memory_int#3| v_subst_11) (+ v_subst_12 (* ~q2_back~0 4))) 1) |thread2Thread1of1ForFork0_~j~0#1|)))))), Black: 1026#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#3| ~q1~0.base) (* ~q1_front~0 4))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (<= ~n1~0 2)), Black: 1036#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#3| ~q1~0.base) (* ~q1_front~0 4))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 1030#(and (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (exists ((v_~q1_back~0_145 Int)) (and (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_145 4))) (<= ~q1_front~0 v_~q1_back~0_145) (<= (+ v_~q1_back~0_145 1) ~q1_back~0))) (<= ~n1~0 2)), Black: 1619#(and (<= 1 ~q1_back~0) (exists ((~q1~0.base Int)) (= 2 (select (select |#memory_int#3| ~q1~0.base) (+ (* ~q1_back~0 4) (- 4))))) (<= ~q1_back~0 ~n1~0) (= ~q1~0.offset 0) (= ~t~0 0) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1_back~0 ~q1_front~0) (<= ~q2_back~0 ~q2_front~0) (or (= ~q1_back~0 ~n1~0) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= ~n1~0 2) (= ~s~0 0)), Black: 1022#(and (<= ~q1_front~0 ~q1_back~0) (or (= |thread2Thread1of1ForFork0_~j~0#1| 2) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#3| ~q1~0.base) (* ~q1_front~0 4))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 1534#(or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 933#(or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 1403#(and (<= 0 ~q1_front~0) (= (select (select |#memory_int#3| ~q1~0.base) (* ~q1_front~0 4)) 2) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2) (= ~s~0 0)), Black: 1639#(and (exists ((v_~q2_back~0_101 Int)) (and (<= v_~q2_back~0_101 ~q2_front~0) (<= ~q2_back~0 (+ v_~q2_back~0_101 1)) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* 4 v_~q2_back~0_101))) 1)))) (<= 1 ~q1_back~0) (exists ((~q1~0.base Int)) (= 2 (select (select |#memory_int#3| ~q1~0.base) (+ (* ~q1_back~0 4) (- 4))))) (<= ~q1_back~0 ~n1~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (= ~q1~0.offset 0) (= ~t~0 0) (not (= ~q1_front~0 0)) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~q2_back~0 ~q2_front~0) (or (= ~q1_back~0 ~n1~0) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= ~n1~0 2) (= ~s~0 0)), Black: 1641#(and (= (+ (* 2 ~t~0) 2) ~s~0) (or (< ~q1_back~0 1) (not (= ~q1_front~0 0))) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (or (not (= ~q1_front~0 0)) (= (select (select |#memory_int#3| ~q1~0.base) 0) 2))), Black: 899#(< 0 |thread2Thread1of1ForFork0_~j~0#1|), Black: 1004#(and (<= ~q1_front~0 ~q1_back~0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1609#(and (or (< ~q2_back~0 ~q2_front~0) (< ~q2_front~0 0) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 1627#(and (exists ((v_~q2_back~0_101 Int)) (and (<= v_~q2_back~0_101 ~q2_front~0) (<= ~q2_back~0 (+ v_~q2_back~0_101 1)) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* 4 v_~q2_back~0_101))) 1)))) (<= 1 ~q1_back~0) (exists ((~q1~0.base Int)) (= 2 (select (select |#memory_int#3| ~q1~0.base) (+ (* ~q1_back~0 4) (- 4))))) (<= ~q1_back~0 ~n1~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (= ~q1~0.offset 0) (= ~t~0 0) (not (= ~q1_front~0 0)) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (= |thread2Thread1of1ForFork0_~j~0#1| ~s~0) (or (= ~q1_back~0 ~n1~0) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= ~n1~0 2)), Black: 1665#(and (= |thread2Thread1of1ForFork0_~j~0#1| (+ ~t~0 1)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1_front~0 0)) (= ~q1_back~0 ~n1~0) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| ~s~0) (<= ~n1~0 2)), Black: 1352#(and (or (= |thread2Thread1of1ForFork0_~j~0#1| 2) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q1~0.offset 0)), Black: 1621#(and (exists ((v_~q2_back~0_101 Int)) (and (<= v_~q2_back~0_101 ~q2_front~0) (<= ~q2_back~0 (+ v_~q2_back~0_101 1)) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* 4 v_~q2_back~0_101))) 1)))) (<= 1 ~q1_back~0) (exists ((~q1~0.base Int)) (= 2 (select (select |#memory_int#3| ~q1~0.base) (+ (* ~q1_back~0 4) (- 4))))) (<= ~q1_back~0 ~n1~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (= ~q1~0.offset 0) (= ~t~0 0) (not (= ~q1_front~0 0)) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (or (= ~q1_back~0 ~n1~0) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= ~n1~0 2) (= ~s~0 0)), Black: 1647#(and (= (+ (* 2 ~t~0) 2) ~s~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (or (< ~q1_back~0 1) (not (= ~q1_front~0 0))) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)), Black: 1561#(or (< ~q2_back~0 ~q2_front~0) (< ~q2_front~0 0) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 1651#(and (or (= (+ (* 2 ~t~0) (* 2 |thread3Thread1of1ForFork1_~k~0#1|) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (= (+ (* 2 ~t~0) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 1783#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 1554#(or (< ~q2_back~0 ~q2_front~0) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (or (= (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~s~0) (+ (* 2 ~t~0) (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) 1)) (< 0 (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1)) (< (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int#3| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 1538#(or (< ~q2_back~0 ~q2_front~0) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))))) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 1637#(and (exists ((v_~q2_back~0_101 Int)) (and (<= v_~q2_back~0_101 ~q2_front~0) (<= ~q2_back~0 (+ v_~q2_back~0_101 1)) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* 4 v_~q2_back~0_101))) 1)))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (= ~t~0 0) (not (= ~q1_front~0 0)) (= ~q1_back~0 ~n1~0) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| ~s~0) (<= ~n1~0 2) (exists ((v_subst_14 Int)) (= 2 (select (select |#memory_int#3| v_subst_14) (+ (* ~q1_back~0 4) (- 4)))))), Black: 1513#(or (= (+ (* 2 ~t~0) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), 52#true, Black: 1661#(and (or (= |thread2Thread1of1ForFork0_~j~0#1| 2) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (= ~q1~0.offset 0) (or (not (= ~q1_front~0 0)) (= (select (select |#memory_int#3| ~q1~0.base) 0) 2)) (or (< ~q2_back~0 ~q2_front~0) (< ~q2_front~0 0) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (or (= (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~s~0) (+ (* 2 ~t~0) (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) 1)) (< 0 (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1)) (< (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int#3| ~q1~0.base) (* ~q1_front~0 4))))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 2093#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0)), Black: 2089#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2091#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 3)) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1322#(and (exists ((v_~q1_back~0_148 Int)) (and (<= ~q1_front~0 v_~q1_back~0_148) (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_148 4))) (<= (+ v_~q1_back~0_148 1) ~q1_back~0))) (<= 1 ~n1~0) (exists ((v_~q1_back~0_148 Int)) (and (<= ~q1_front~0 v_~q1_back~0_148) (<= (+ 2 v_~q1_back~0_148) ~n1~0) (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_148 4))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 1330#(and (exists ((v_~q1_back~0_148 Int)) (and (<= ~q1_front~0 v_~q1_back~0_148) (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_148 4))) (<= (+ v_~q1_back~0_148 1) ~q1_back~0))) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (<= ~n1~0 2)), 2103#true, Black: 1320#(and (exists ((v_~q1_back~0_148 Int)) (and (<= ~q1_front~0 v_~q1_back~0_148) (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_148 4))) (<= (+ v_~q1_back~0_148 1) ~q1_back~0))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 1328#(and (exists ((v_~q1_back~0_148 Int)) (and (<= ~q1_front~0 v_~q1_back~0_148) (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_148 4))) (<= (+ v_~q1_back~0_148 1) ~q1_back~0))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (<= ~n1~0 2)), Black: 57#(<= ~q1_back~0 ~q1_front~0), Black: 1207#(< 0 |thread2Thread1of1ForFork0_~j~0#1|), Black: 1318#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 1248#(or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#3| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 1324#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (<= ~n1~0 2)), 42#L70true, 1835#true, 44#L123-1true, Black: 67#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 1056#true, 748#true, 29#thread3EXITtrue, 1719#(<= ~q2_back~0 ~q2_front~0), Black: 326#(and (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= ~t~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 350#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 338#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 319#(or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))), Black: 252#(or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))]) [2023-11-29 01:04:16,198 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-29 01:04:16,199 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 01:04:16,199 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 01:04:16,199 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 01:04:16,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([727] L66-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#3_84| v_~q1~0.base_104) (+ (* 4 v_~q1_front~0_93) v_~q1~0.offset_104))) (not (= (ite (and (< v_~q1_front~0_93 v_~q1_back~0_134) (<= 0 v_~q1_front~0_93) (< v_~q1_front~0_93 v_~n1~0_67)) 1 0) 0)) (= (+ v_~q1_front~0_93 1) v_~q1_front~0_92)) InVars {~q1~0.offset=v_~q1~0.offset_104, ~q1_front~0=v_~q1_front~0_93, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_67, ~q1~0.base=v_~q1~0.base_104, #memory_int#3=|v_#memory_int#3_84|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_104, ~q1_front~0=v_~q1_front~0_92, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_67, ~q1~0.base=v_~q1~0.base_104, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#3=|v_#memory_int#3_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 1643#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (= (+ (* 2 ~t~0) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q2_back~0 ~q2_front~0) (forall ((v_subst_15 Int) (v_subst_16 Int)) (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| v_subst_15) (+ (* 4 ~q2_front~0) v_subst_16)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| v_subst_15) (+ v_subst_16 (* ~q2_back~0 4))) 1))))) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), 1345#true, Black: 1527#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 1663#(and (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (= 2 ~s~0) (= ~t~0 0) (= |thread3Thread1of1ForFork1_~k~0#1| 1) (not (= ~q1_front~0 0)) (= ~q1_back~0 ~n1~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (<= ~n1~0 2)), 84#true, Black: 1509#(or (= (+ (* 2 ~t~0) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 1615#(and (or (< ~q2_back~0 ~q2_front~0) (< ~q2_front~0 0) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q2_back~0 ~q2_front~0) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))))) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 1649#(and (or (< ~q2_back~0 ~q2_front~0) (< ~q2_front~0 0) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (= |thread2Thread1of1ForFork0_~j~0#1| 2) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (not (= ~q1_front~0 0))) (= ~q1~0.offset 0)), Black: 1034#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 1653#(and (exists ((v_~q2_back~0_101 Int)) (and (<= v_~q2_back~0_101 ~q2_front~0) (<= ~q2_back~0 (+ v_~q2_back~0_101 1)) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* 4 v_~q2_back~0_101))) 1)))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (= ~t~0 0) (not (= ~q1_front~0 0)) (= ~q1_back~0 ~n1~0) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (<= ~q2_back~0 ~q2_front~0) (exists ((v_subst_17 Int)) (= 2 (select (select |#memory_int#3| v_subst_17) (+ (* ~q1_back~0 4) (- 4))))) (<= ~n1~0 2) (= ~s~0 0)), Black: 1018#(and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (exists ((v_~q1_back~0_145 Int)) (and (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_145 4))) (<= ~q1_front~0 v_~q1_back~0_145) (<= (+ v_~q1_back~0_145 1) ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (<= ~n1~0 2)), Black: 1655#(and (= |thread2Thread1of1ForFork0_~j~0#1| (+ ~t~0 1)) (<= 1 ~q1_back~0) (<= ~q1_back~0 ~n1~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (= ~q1~0.offset 0) (not (= ~q1_front~0 0)) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (= |thread2Thread1of1ForFork0_~j~0#1| ~s~0) (or (= ~q1_back~0 ~n1~0) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= ~n1~0 2)), Black: 1020#(and (<= 1 ~n1~0) (or (not (= ~q1_front~0 0)) (< ~n1~0 (+ ~q1_back~0 1)) (= (select (select |#memory_int#3| ~q1~0.base) 0) 2)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (<= ~n1~0 2)), Black: 1645#(and (exists ((v_~q2_back~0_101 Int)) (and (<= v_~q2_back~0_101 ~q2_front~0) (<= ~q2_back~0 (+ v_~q2_back~0_101 1)) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* 4 v_~q2_back~0_101))) 1)))) (<= 1 ~q1_back~0) (or (= 2 ~s~0) (= ~q1_back~0 ~n1~0)) (exists ((~q1~0.base Int)) (= 2 (select (select |#memory_int#3| ~q1~0.base) (+ (* ~q1_back~0 4) (- 4))))) (<= ~q1_back~0 ~n1~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (= ~q1~0.offset 0) (= ~t~0 0) (not (= ~q1_front~0 0)) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (= |thread2Thread1of1ForFork0_~j~0#1| ~s~0) (= |thread2Thread1of1ForFork0_~j~0#1| (+ |thread3Thread1of1ForFork1_~k~0#1| 1)) (<= ~n1~0 2)), Black: 1016#(and (<= ~q1_front~0 ~q1_back~0) (or (= |thread2Thread1of1ForFork0_~j~0#1| 2) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q1~0.offset 0) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#3| ~q1~0.base) (* ~q1_front~0 4))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 1633#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (= (+ (* 2 ~t~0) (* 2 |thread3Thread1of1ForFork1_~k~0#1|) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (= (+ (* 2 ~t~0) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q2_back~0 ~q2_front~0) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|) (forall ((v_subst_12 Int) (v_subst_11 Int)) (or (= (+ (* 2 (select (select |#memory_int#3| v_subst_11) (+ (* 4 ~q2_front~0) v_subst_12))) (* 2 ~t~0) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (not (= (+ (select (select |#memory_int#3| v_subst_11) (+ v_subst_12 (* ~q2_back~0 4))) 1) |thread2Thread1of1ForFork0_~j~0#1|)))))), Black: 1008#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1026#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#3| ~q1~0.base) (* ~q1_front~0 4))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (<= ~n1~0 2)), Black: 1036#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#3| ~q1~0.base) (* ~q1_front~0 4))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 1030#(and (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (exists ((v_~q1_back~0_145 Int)) (and (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_145 4))) (<= ~q1_front~0 v_~q1_back~0_145) (<= (+ v_~q1_back~0_145 1) ~q1_back~0))) (<= ~n1~0 2)), Black: 1619#(and (<= 1 ~q1_back~0) (exists ((~q1~0.base Int)) (= 2 (select (select |#memory_int#3| ~q1~0.base) (+ (* ~q1_back~0 4) (- 4))))) (<= ~q1_back~0 ~n1~0) (= ~q1~0.offset 0) (= ~t~0 0) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1_back~0 ~q1_front~0) (<= ~q2_back~0 ~q2_front~0) (or (= ~q1_back~0 ~n1~0) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= ~n1~0 2) (= ~s~0 0)), Black: 1022#(and (<= ~q1_front~0 ~q1_back~0) (or (= |thread2Thread1of1ForFork0_~j~0#1| 2) (< ~n1~0 (+ ~q1_back~0 1))) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|)) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#3| ~q1~0.base) (* ~q1_front~0 4))) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 1534#(or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 1403#(and (<= 0 ~q1_front~0) (= (select (select |#memory_int#3| ~q1~0.base) (* ~q1_front~0 4)) 2) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2) (= ~s~0 0)), Black: 933#(or (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 1639#(and (exists ((v_~q2_back~0_101 Int)) (and (<= v_~q2_back~0_101 ~q2_front~0) (<= ~q2_back~0 (+ v_~q2_back~0_101 1)) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* 4 v_~q2_back~0_101))) 1)))) (<= 1 ~q1_back~0) (exists ((~q1~0.base Int)) (= 2 (select (select |#memory_int#3| ~q1~0.base) (+ (* ~q1_back~0 4) (- 4))))) (<= ~q1_back~0 ~n1~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (= ~q1~0.offset 0) (= ~t~0 0) (not (= ~q1_front~0 0)) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (<= ~q2_back~0 ~q2_front~0) (or (= ~q1_back~0 ~n1~0) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= ~n1~0 2) (= ~s~0 0)), Black: 1641#(and (= (+ (* 2 ~t~0) 2) ~s~0) (or (< ~q1_back~0 1) (not (= ~q1_front~0 0))) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (or (not (= ~q1_front~0 0)) (= (select (select |#memory_int#3| ~q1~0.base) 0) 2))), Black: 899#(< 0 |thread2Thread1of1ForFork0_~j~0#1|), Black: 1004#(and (<= ~q1_front~0 ~q1_back~0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (< ~q1_front~0 0) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1609#(and (or (< ~q2_back~0 ~q2_front~0) (< ~q2_front~0 0) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 1627#(and (exists ((v_~q2_back~0_101 Int)) (and (<= v_~q2_back~0_101 ~q2_front~0) (<= ~q2_back~0 (+ v_~q2_back~0_101 1)) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* 4 v_~q2_back~0_101))) 1)))) (<= 1 ~q1_back~0) (exists ((~q1~0.base Int)) (= 2 (select (select |#memory_int#3| ~q1~0.base) (+ (* ~q1_back~0 4) (- 4))))) (<= ~q1_back~0 ~n1~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (= ~q1~0.offset 0) (= ~t~0 0) (not (= ~q1_front~0 0)) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (= |thread2Thread1of1ForFork0_~j~0#1| ~s~0) (or (= ~q1_back~0 ~n1~0) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= ~n1~0 2)), Black: 1665#(and (= |thread2Thread1of1ForFork0_~j~0#1| (+ ~t~0 1)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1_front~0 0)) (= ~q1_back~0 ~n1~0) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| ~s~0) (<= ~n1~0 2)), Black: 1352#(and (or (= |thread2Thread1of1ForFork0_~j~0#1| 2) (< ~n1~0 (+ ~q1_back~0 1))) (= ~q1~0.offset 0)), Black: 1621#(and (exists ((v_~q2_back~0_101 Int)) (and (<= v_~q2_back~0_101 ~q2_front~0) (<= ~q2_back~0 (+ v_~q2_back~0_101 1)) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* 4 v_~q2_back~0_101))) 1)))) (<= 1 ~q1_back~0) (exists ((~q1~0.base Int)) (= 2 (select (select |#memory_int#3| ~q1~0.base) (+ (* ~q1_back~0 4) (- 4))))) (<= ~q1_back~0 ~n1~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (= ~q1~0.offset 0) (= ~t~0 0) (not (= ~q1_front~0 0)) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (or (= ~q1_back~0 ~n1~0) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= ~n1~0 2) (= ~s~0 0)), Black: 1647#(and (= (+ (* 2 ~t~0) 2) ~s~0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (or (< ~q1_back~0 1) (not (= ~q1_front~0 0))) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)), Black: 1561#(or (< ~q2_back~0 ~q2_front~0) (< ~q2_front~0 0) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 1651#(and (or (= (+ (* 2 ~t~0) (* 2 |thread3Thread1of1ForFork1_~k~0#1|) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (= (+ (* 2 ~t~0) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 1783#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 1554#(or (< ~q2_back~0 ~q2_front~0) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (or (= (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~s~0) (+ (* 2 ~t~0) (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) 1)) (< 0 (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1)) (< (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int#3| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 1538#(or (< ~q2_back~0 ~q2_front~0) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))))) (< ~q2_front~0 0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 1637#(and (exists ((v_~q2_back~0_101 Int)) (and (<= v_~q2_back~0_101 ~q2_front~0) (<= ~q2_back~0 (+ v_~q2_back~0_101 1)) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* 4 v_~q2_back~0_101))) 1)))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (= ~t~0 0) (not (= ~q1_front~0 0)) (= ~q1_back~0 ~n1~0) (<= 2 |thread2Thread1of1ForFork0_~j~0#1|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| ~s~0) (<= ~n1~0 2) (exists ((v_subst_14 Int)) (= 2 (select (select |#memory_int#3| v_subst_14) (+ (* ~q1_back~0 4) (- 4)))))), Black: 1513#(or (= (+ (* 2 ~t~0) 2) ~s~0) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), 52#true, Black: 1661#(and (or (= |thread2Thread1of1ForFork0_~j~0#1| 2) (< ~n1~0 (+ ~q1_back~0 1))) (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (= ~q1~0.offset 0) (or (not (= ~q1_front~0 0)) (= (select (select |#memory_int#3| ~q1~0.base) 0) 2)) (or (< ~q2_back~0 ~q2_front~0) (< ~q2_front~0 0) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (or (= (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~s~0) (+ (* 2 ~t~0) (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) 1)) (< 0 (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1)) (< (+ (select (select |#memory_int#3| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int#3| ~q1~0.base) (* ~q1_front~0 4))))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 2093#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0)), Black: 2089#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2091#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 3)) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1322#(and (exists ((v_~q1_back~0_148 Int)) (and (<= ~q1_front~0 v_~q1_back~0_148) (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_148 4))) (<= (+ v_~q1_back~0_148 1) ~q1_back~0))) (<= 1 ~n1~0) (exists ((v_~q1_back~0_148 Int)) (and (<= ~q1_front~0 v_~q1_back~0_148) (<= (+ 2 v_~q1_back~0_148) ~n1~0) (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_148 4))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 1330#(and (exists ((v_~q1_back~0_148 Int)) (and (<= ~q1_front~0 v_~q1_back~0_148) (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_148 4))) (<= (+ v_~q1_back~0_148 1) ~q1_back~0))) (<= 1 |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (<= ~n1~0 2)), 2103#true, Black: 1320#(and (exists ((v_~q1_back~0_148 Int)) (and (<= ~q1_front~0 v_~q1_back~0_148) (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_148 4))) (<= (+ v_~q1_back~0_148 1) ~q1_back~0))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 1328#(and (exists ((v_~q1_back~0_148 Int)) (and (<= ~q1_front~0 v_~q1_back~0_148) (= 2 (select (select |#memory_int#3| ~q1~0.base) (* v_~q1_back~0_148 4))) (<= (+ v_~q1_back~0_148 1) ~q1_back~0))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (<= ~n1~0 2)), Black: 57#(<= ~q1_back~0 ~q1_front~0), Black: 1207#(< 0 |thread2Thread1of1ForFork0_~j~0#1|), Black: 1318#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 1248#(or (< ~q1_front~0 0) (< 0 (select (select |#memory_int#3| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 1324#(and (<= ~q1_front~0 ~q1_back~0) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (<= ~n1~0 2)), 42#L70true, 1835#true, 44#L123-1true, Black: 67#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 1056#true, 748#true, 29#thread3EXITtrue, 1719#(<= ~q2_back~0 ~q2_front~0), Black: 326#(and (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= ~t~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#3| ~q2~0.base) (* ~q2_back~0 4)) 1))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (* (select (select |#memory_int#3| ~q2~0.base) (* 4 ~q2_front~0)) 2) 2)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 350#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 338#(and (or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 319#(or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))), Black: 252#(or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int#3| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))]) [2023-11-29 01:04:16,530 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 01:04:16,530 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 01:04:16,530 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 01:04:16,530 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 01:04:24,734 INFO L124 PetriNetUnfolderBase]: 31431/58859 cut-off events. [2023-11-29 01:04:24,734 INFO L125 PetriNetUnfolderBase]: For 642582/644894 co-relation queries the response was YES. [2023-11-29 01:04:25,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270228 conditions, 58859 events. 31431/58859 cut-off events. For 642582/644894 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 559840 event pairs, 14952 based on Foata normal form. 1247/57544 useless extension candidates. Maximal degree in co-relation 270159. Up to 34157 conditions per place. [2023-11-29 01:04:25,722 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 362 selfloop transitions, 11 changer transitions 145/645 dead transitions. [2023-11-29 01:04:25,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 645 transitions, 9964 flow [2023-11-29 01:04:25,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:04:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 01:04:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2023-11-29 01:04:25,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4468599033816425 [2023-11-29 01:04:25,724 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 185 transitions. [2023-11-29 01:04:25,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 185 transitions. [2023-11-29 01:04:25,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:04:25,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 185 transitions. [2023-11-29 01:04:25,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 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-29 01:04:25,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 46.0) internal successors, (460), 10 states have internal predecessors, (460), 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-29 01:04:25,726 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 46.0) internal successors, (460), 10 states have internal predecessors, (460), 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-29 01:04:25,726 INFO L175 Difference]: Start difference. First operand has 197 places, 505 transitions, 7198 flow. Second operand 9 states and 185 transitions. [2023-11-29 01:04:25,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 645 transitions, 9964 flow [2023-11-29 01:04:31,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 645 transitions, 9958 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 01:04:31,673 INFO L231 Difference]: Finished difference. Result has 205 places, 500 transitions, 7168 flow [2023-11-29 01:04:31,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7192, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7168, PETRI_PLACES=205, PETRI_TRANSITIONS=500} [2023-11-29 01:04:31,674 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 160 predicate places. [2023-11-29 01:04:31,675 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 500 transitions, 7168 flow [2023-11-29 01:04:31,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 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-29 01:04:31,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:04:31,675 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:04:31,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 01:04:31,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:04:31,876 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-29 01:04:31,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:04:31,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1103596743, now seen corresponding path program 2 times [2023-11-29 01:04:31,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:04:31,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780495123] [2023-11-29 01:04:31,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:04:31,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:04:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:04:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:04:33,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:04:33,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780495123] [2023-11-29 01:04:33,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780495123] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:04:33,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648044674] [2023-11-29 01:04:33,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:04:33,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:04:33,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:04:33,228 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:04:33,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 01:04:33,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:04:33,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:04:33,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 01:04:33,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:04:34,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:04:34,338 INFO L378 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 22 treesize of output 22 [2023-11-29 01:04:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:04:34,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:04:35,325 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-11-29 01:04:35,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 101 [2023-11-29 01:04:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:04:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648044674] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:04:36,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:04:36,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 40 [2023-11-29 01:04:36,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499519388] [2023-11-29 01:04:36,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:04:36,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-29 01:04:36,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:04:36,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 01:04:36,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1447, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 01:04:36,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2023-11-29 01:04:36,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 500 transitions, 7168 flow. Second operand has 41 states, 41 states have (on average 11.317073170731707) internal successors, (464), 41 states have internal predecessors, (464), 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-29 01:04:36,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:04:36,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2023-11-29 01:04:36,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:05:23,764 INFO L124 PetriNetUnfolderBase]: 94941/157276 cut-off events. [2023-11-29 01:05:23,764 INFO L125 PetriNetUnfolderBase]: For 1930562/1932596 co-relation queries the response was YES. [2023-11-29 01:05:25,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742453 conditions, 157276 events. 94941/157276 cut-off events. For 1930562/1932596 co-relation queries the response was YES. Maximal size of possible extension queue 3625. Compared 1444154 event pairs, 7850 based on Foata normal form. 610/150752 useless extension candidates. Maximal degree in co-relation 742381. Up to 42990 conditions per place. [2023-11-29 01:05:26,432 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 1427 selfloop transitions, 579 changer transitions 3/2054 dead transitions. [2023-11-29 01:05:26,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 2054 transitions, 30163 flow [2023-11-29 01:05:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-29 01:05:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2023-11-29 01:05:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 1252 transitions. [2023-11-29 01:05:26,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43202208419599725 [2023-11-29 01:05:26,437 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 1252 transitions. [2023-11-29 01:05:26,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 1252 transitions. [2023-11-29 01:05:26,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:05:26,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 1252 transitions. [2023-11-29 01:05:26,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 19.873015873015873) internal successors, (1252), 63 states have internal predecessors, (1252), 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-29 01:05:26,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 46.0) internal successors, (2944), 64 states have internal predecessors, (2944), 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-29 01:05:26,451 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 46.0) internal successors, (2944), 64 states have internal predecessors, (2944), 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-29 01:05:26,451 INFO L175 Difference]: Start difference. First operand has 205 places, 500 transitions, 7168 flow. Second operand 63 states and 1252 transitions. [2023-11-29 01:05:26,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 2054 transitions, 30163 flow [2023-11-29 01:05:56,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 2054 transitions, 30055 flow, removed 36 selfloop flow, removed 9 redundant places. [2023-11-29 01:05:56,131 INFO L231 Difference]: Finished difference. Result has 295 places, 1008 transitions, 16575 flow [2023-11-29 01:05:56,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7126, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=16575, PETRI_PLACES=295, PETRI_TRANSITIONS=1008} [2023-11-29 01:05:56,132 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 250 predicate places. [2023-11-29 01:05:56,132 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 1008 transitions, 16575 flow [2023-11-29 01:05:56,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 11.317073170731707) internal successors, (464), 41 states have internal predecessors, (464), 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-29 01:05:56,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:05:56,133 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:05:56,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 01:05:56,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 01:05:56,333 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-29 01:05:56,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:05:56,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2137452107, now seen corresponding path program 3 times [2023-11-29 01:05:56,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:05:56,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498463516] [2023-11-29 01:05:56,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:56,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:05:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:05:58,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:05:58,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498463516] [2023-11-29 01:05:58,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498463516] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:05:58,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145617383] [2023-11-29 01:05:58,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:05:58,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:05:58,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:05:58,040 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:05:58,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 01:05:58,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 01:05:58,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:05:58,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 01:05:58,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 01:05:59,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:05:59,682 INFO L349 Elim1Store]: treesize reduction 12, result has 87.1 percent of original size [2023-11-29 01:05:59,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 97 [2023-11-29 01:06:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 01:06:00,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145617383] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:06:00,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:06:00,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 37 [2023-11-29 01:06:00,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427422035] [2023-11-29 01:06:00,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:06:00,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 01:06:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:06:00,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 01:06:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 01:06:00,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2023-11-29 01:06:00,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 1008 transitions, 16575 flow. Second operand has 38 states, 38 states have (on average 10.736842105263158) internal successors, (408), 38 states have internal predecessors, (408), 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-29 01:06:00,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:06:00,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2023-11-29 01:06:00,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:07:28,750 INFO L124 PetriNetUnfolderBase]: 138585/220647 cut-off events. [2023-11-29 01:07:28,750 INFO L125 PetriNetUnfolderBase]: For 7631527/7632003 co-relation queries the response was YES. [2023-11-29 01:07:31,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1412068 conditions, 220647 events. 138585/220647 cut-off events. For 7631527/7632003 co-relation queries the response was YES. Maximal size of possible extension queue 4627. Compared 1970800 event pairs, 11195 based on Foata normal form. 2766/222989 useless extension candidates. Maximal degree in co-relation 1411960. Up to 45034 conditions per place. [2023-11-29 01:07:32,917 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 2019 selfloop transitions, 1226 changer transitions 3/3283 dead transitions. [2023-11-29 01:07:32,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 3283 transitions, 54079 flow [2023-11-29 01:07:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 01:07:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2023-11-29 01:07:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 1944 transitions. [2023-11-29 01:07:32,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45935727788279773 [2023-11-29 01:07:32,922 INFO L72 ComplementDD]: Start complementDD. Operand 92 states and 1944 transitions. [2023-11-29 01:07:32,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 1944 transitions. [2023-11-29 01:07:32,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:07:32,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 92 states and 1944 transitions. [2023-11-29 01:07:32,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 93 states, 92 states have (on average 21.130434782608695) internal successors, (1944), 92 states have internal predecessors, (1944), 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-29 01:07:32,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 93 states, 93 states have (on average 46.0) internal successors, (4278), 93 states have internal predecessors, (4278), 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-29 01:07:32,931 INFO L81 ComplementDD]: Finished complementDD. Result has 93 states, 93 states have (on average 46.0) internal successors, (4278), 93 states have internal predecessors, (4278), 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-29 01:07:32,932 INFO L175 Difference]: Start difference. First operand has 295 places, 1008 transitions, 16575 flow. Second operand 92 states and 1944 transitions. [2023-11-29 01:07:32,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 3283 transitions, 54079 flow [2023-11-29 01:10:44,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 3283 transitions, 52313 flow, removed 866 selfloop flow, removed 10 redundant places. [2023-11-29 01:10:44,141 INFO L231 Difference]: Finished difference. Result has 442 places, 1712 transitions, 32524 flow [2023-11-29 01:10:44,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=15553, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=559, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=92, PETRI_FLOW=32524, PETRI_PLACES=442, PETRI_TRANSITIONS=1712} [2023-11-29 01:10:44,143 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 397 predicate places. [2023-11-29 01:10:44,143 INFO L495 AbstractCegarLoop]: Abstraction has has 442 places, 1712 transitions, 32524 flow [2023-11-29 01:10:44,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 10.736842105263158) internal successors, (408), 38 states have internal predecessors, (408), 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-29 01:10:44,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:10:44,143 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:44,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 01:10:44,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 01:10:44,344 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-29 01:10:44,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1150149524, now seen corresponding path program 4 times [2023-11-29 01:10:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:44,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362541389] [2023-11-29 01:10:44,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:44,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:10:45,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:45,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362541389] [2023-11-29 01:10:45,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362541389] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:45,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993599734] [2023-11-29 01:10:45,780 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:10:45,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:45,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:45,781 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:45,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dab88a-90c5-48fb-9415-f448cf1918b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 01:10:45,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:10:45,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:10:45,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 01:10:45,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:46,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:10:46,247 INFO L378 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 34 treesize of output 30 [2023-11-29 01:10:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:10:46,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:46,590 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-11-29 01:10:46,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 101 [2023-11-29 01:10:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 01:10:46,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993599734] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:10:46,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:10:46,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 6] total 26 [2023-11-29 01:10:46,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435685388] [2023-11-29 01:10:46,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:46,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 01:10:46,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:46,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 01:10:46,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2023-11-29 01:10:47,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2023-11-29 01:10:47,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 1712 transitions, 32524 flow. Second operand has 27 states, 27 states have (on average 12.962962962962964) internal successors, (350), 27 states have internal predecessors, (350), 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-29 01:10:47,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:10:47,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2023-11-29 01:10:47,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand