./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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme --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-26 12:05:24,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:05:24,543 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 12:05:24,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:05:24,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:05:24,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:05:24,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:05:24,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:05:24,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:05:24,575 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:05:24,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:05:24,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:05:24,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:05:24,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:05:24,578 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:05:24,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:05:24,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:05:24,580 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:05:24,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:05:24,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:05:24,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:05:24,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:05:24,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:05:24,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:05:24,584 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:05:24,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:05:24,585 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:05:24,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:05:24,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:05:24,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:05:24,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:05:24,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:05:24,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:05:24,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:05:24,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:05:24,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:05:24,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:05:24,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:05:24,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:05:24,592 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:05:24,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:05:24,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:05:24,597 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_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/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_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme 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-26 12:05:24,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:05:24,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:05:24,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:05:24,908 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:05:24,908 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:05:24,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2023-11-26 12:05:28,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:05:28,408 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:05:28,410 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2023-11-26 12:05:28,424 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/data/a62778cc7/4d3f638172054af3af386358d8fa37d1/FLAGc4165252f [2023-11-26 12:05:28,442 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/data/a62778cc7/4d3f638172054af3af386358d8fa37d1 [2023-11-26 12:05:28,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:05:28,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:05:28,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:05:28,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:05:28,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:05:28,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7741cf29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28, skipping insertion in model container [2023-11-26 12:05:28,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,511 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:05:28,738 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_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c[3463,3476] [2023-11-26 12:05:28,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:05:28,759 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:05:28,788 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_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c[3463,3476] [2023-11-26 12:05:28,792 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:05:28,801 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:05:28,801 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:05:28,809 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:05:28,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28 WrapperNode [2023-11-26 12:05:28,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:05:28,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:05:28,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:05:28,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:05:28,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,867 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 257 [2023-11-26 12:05:28,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:05:28,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:05:28,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:05:28,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:05:28,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,906 INFO L175 MemorySlicer]: Split 15 memory accesses to 5 slices as follows [2, 2, 7, 2, 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, 2, 1, 1]. [2023-11-26 12:05:28,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:05:28,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:05:28,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:05:28,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:05:28,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:05:28,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:05:28,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:05:28,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:05:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:05:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:05:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 12:05:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 12:05:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 12:05:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 12:05:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 12:05:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 12:05:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 12:05:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 12:05:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-26 12:05:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-26 12:05:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-26 12:05:29,022 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-26 12:05:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-26 12:05:29,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-26 12:05:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-26 12:05:29,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-26 12:05:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:05:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 12:05:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 12:05:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 12:05:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 12:05:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 12:05:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 12:05:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 12:05:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:05:29,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:05:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:05:29,027 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 12:05:29,239 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:05:29,241 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:05:29,773 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:05:30,167 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:05:30,167 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-26 12:05:30,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:30 BoogieIcfgContainer [2023-11-26 12:05:30,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:05:30,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:05:30,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:05:30,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:05:30,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:05:28" (1/3) ... [2023-11-26 12:05:30,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c392a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:30, skipping insertion in model container [2023-11-26 12:05:30,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28" (2/3) ... [2023-11-26 12:05:30,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c392a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:30, skipping insertion in model container [2023-11-26 12:05:30,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:30" (3/3) ... [2023-11-26 12:05:30,184 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2023-11-26 12:05:30,194 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 12:05:30,206 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:05:30,206 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 12:05:30,207 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:05:30,272 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-26 12:05:30,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 46 transitions, 113 flow [2023-11-26 12:05:30,377 INFO L124 PetriNetUnfolderBase]: 7/43 cut-off events. [2023-11-26 12:05:30,378 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 12:05:30,382 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-26 12:05:30,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 46 transitions, 113 flow [2023-11-26 12:05:30,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 42 transitions, 102 flow [2023-11-26 12:05:30,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:05:30,413 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;@55ef094c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:05:30,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-26 12:05:30,442 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:05:30,442 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2023-11-26 12:05:30,442 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 12:05:30,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:30,443 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-26 12:05:30,444 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-26 12:05:30,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:30,451 INFO L85 PathProgramCache]: Analyzing trace with hash -123258178, now seen corresponding path program 1 times [2023-11-26 12:05:30,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:30,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733183881] [2023-11-26 12:05:30,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:30,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:30,812 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-26 12:05:30,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:30,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733183881] [2023-11-26 12:05:30,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733183881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:30,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:30,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:30,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439794183] [2023-11-26 12:05:30,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:30,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 12:05:30,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:30,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 12:05:30,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:05:30,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-26 12:05:30,868 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-26 12:05:30,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:30,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-26 12:05:30,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:31,212 INFO L124 PetriNetUnfolderBase]: 761/1311 cut-off events. [2023-11-26 12:05:31,214 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-26 12:05:31,225 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-26 12:05:31,238 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 30 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2023-11-26 12:05:31,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 158 flow [2023-11-26 12:05:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 12:05:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 12:05:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2023-11-26 12:05:31,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2023-11-26 12:05:31,292 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 58 transitions. [2023-11-26 12:05:31,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 58 transitions. [2023-11-26 12:05:31,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:31,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 58 transitions. [2023-11-26 12:05:31,300 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-26 12:05:31,305 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-26 12:05:31,306 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-26 12:05:31,308 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 102 flow. Second operand 2 states and 58 transitions. [2023-11-26 12:05:31,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 158 flow [2023-11-26 12:05:31,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 146 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-26 12:05:31,326 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 86 flow [2023-11-26 12:05:31,328 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-26 12:05:31,333 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-26 12:05:31,333 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 86 flow [2023-11-26 12:05:31,335 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-26 12:05:31,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:31,336 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-26 12:05:31,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:05:31,336 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-26 12:05:31,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1722189346, now seen corresponding path program 1 times [2023-11-26 12:05:31,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:31,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719860211] [2023-11-26 12:05:31,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:31,637 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-26 12:05:31,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:31,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719860211] [2023-11-26 12:05:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719860211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:31,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:31,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:31,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077328001] [2023-11-26 12:05:31,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:31,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:31,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:31,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:31,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:31,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-26 12:05:31,644 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-26 12:05:31,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:31,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-26 12:05:31,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:31,900 INFO L124 PetriNetUnfolderBase]: 767/1295 cut-off events. [2023-11-26 12:05:31,900 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-26 12:05:31,905 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-26 12:05:31,916 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 39 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-11-26 12:05:31,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 196 flow [2023-11-26 12:05:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2023-11-26 12:05:31,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2023-11-26 12:05:31,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 82 transitions. [2023-11-26 12:05:31,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 82 transitions. [2023-11-26 12:05:31,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:31,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 82 transitions. [2023-11-26 12:05:31,931 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-26 12:05:31,932 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-26 12:05:31,932 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-26 12:05:31,932 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 86 flow. Second operand 3 states and 82 transitions. [2023-11-26 12:05:31,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 196 flow [2023-11-26 12:05:31,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:05:31,939 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 105 flow [2023-11-26 12:05:31,940 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-26 12:05:31,941 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-26 12:05:31,941 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 105 flow [2023-11-26 12:05:31,941 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-26 12:05:31,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:31,942 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-26 12:05:31,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:05:31,943 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-26 12:05:31,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1626921496, now seen corresponding path program 2 times [2023-11-26 12:05:31,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:31,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646275258] [2023-11-26 12:05:31,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:32,151 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-26 12:05:32,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:32,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646275258] [2023-11-26 12:05:32,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646275258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:32,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:32,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:32,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132451772] [2023-11-26 12:05:32,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:32,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:32,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:32,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:32,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:32,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-26 12:05:32,156 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-26 12:05:32,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:32,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-26 12:05:32,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:32,436 INFO L124 PetriNetUnfolderBase]: 699/1289 cut-off events. [2023-11-26 12:05:32,436 INFO L125 PetriNetUnfolderBase]: For 210/213 co-relation queries the response was YES. [2023-11-26 12:05:32,441 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-26 12:05:32,451 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 43 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-26 12:05:32,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 229 flow [2023-11-26 12:05:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2023-11-26 12:05:32,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2023-11-26 12:05:32,456 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 83 transitions. [2023-11-26 12:05:32,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 83 transitions. [2023-11-26 12:05:32,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:32,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 83 transitions. [2023-11-26 12:05:32,460 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-26 12:05:32,461 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-26 12:05:32,462 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-26 12:05:32,462 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 105 flow. Second operand 3 states and 83 transitions. [2023-11-26 12:05:32,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 229 flow [2023-11-26 12:05:32,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:05:32,466 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 114 flow [2023-11-26 12:05:32,468 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-26 12:05:32,470 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-11-26 12:05:32,470 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 114 flow [2023-11-26 12:05:32,471 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-26 12:05:32,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:32,473 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-26 12:05:32,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:05:32,474 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-26 12:05:32,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1393848606, now seen corresponding path program 3 times [2023-11-26 12:05:32,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:32,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291905444] [2023-11-26 12:05:32,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:32,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:32,796 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-26 12:05:32,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:32,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291905444] [2023-11-26 12:05:32,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291905444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:32,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:32,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:05:32,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602480026] [2023-11-26 12:05:32,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:32,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:05:32,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:32,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:05:32,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:05:32,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-26 12:05:32,810 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-26 12:05:32,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:32,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-26 12:05:32,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:33,173 INFO L124 PetriNetUnfolderBase]: 748/1382 cut-off events. [2023-11-26 12:05:33,173 INFO L125 PetriNetUnfolderBase]: For 299/301 co-relation queries the response was YES. [2023-11-26 12:05:33,177 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-26 12:05:33,187 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 32 selfloop transitions, 2 changer transitions 15/59 dead transitions. [2023-11-26 12:05:33,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 247 flow [2023-11-26 12:05:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:05:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:05:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2023-11-26 12:05:33,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49130434782608695 [2023-11-26 12:05:33,192 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 113 transitions. [2023-11-26 12:05:33,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 113 transitions. [2023-11-26 12:05:33,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:33,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 113 transitions. [2023-11-26 12:05:33,195 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-26 12:05:33,198 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-26 12:05:33,199 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-26 12:05:33,199 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 114 flow. Second operand 5 states and 113 transitions. [2023-11-26 12:05:33,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 247 flow [2023-11-26 12:05:33,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:05:33,204 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 132 flow [2023-11-26 12:05:33,205 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-26 12:05:33,206 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2023-11-26 12:05:33,207 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 132 flow [2023-11-26 12:05:33,208 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-26 12:05:33,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:33,208 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-26 12:05:33,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:05:33,214 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-26 12:05:33,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1054773014, now seen corresponding path program 1 times [2023-11-26 12:05:33,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:33,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473666820] [2023-11-26 12:05:33,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:33,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:33,410 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-26 12:05:33,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:33,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473666820] [2023-11-26 12:05:33,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473666820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:33,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:33,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:05:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359979854] [2023-11-26 12:05:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:33,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:05:33,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:33,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:05:33,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:05:33,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-26 12:05:33,416 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-26 12:05:33,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:33,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-26 12:05:33,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:33,736 INFO L124 PetriNetUnfolderBase]: 948/1719 cut-off events. [2023-11-26 12:05:33,737 INFO L125 PetriNetUnfolderBase]: For 490/495 co-relation queries the response was YES. [2023-11-26 12:05:33,743 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-26 12:05:33,752 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 31 selfloop transitions, 4 changer transitions 20/65 dead transitions. [2023-11-26 12:05:33,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 306 flow [2023-11-26 12:05:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:05:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:05:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2023-11-26 12:05:33,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043478260869565 [2023-11-26 12:05:33,754 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 116 transitions. [2023-11-26 12:05:33,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 116 transitions. [2023-11-26 12:05:33,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:33,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 116 transitions. [2023-11-26 12:05:33,755 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-26 12:05:33,756 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-26 12:05:33,756 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-26 12:05:33,757 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 132 flow. Second operand 5 states and 116 transitions. [2023-11-26 12:05:33,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 306 flow [2023-11-26 12:05:33,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 286 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-11-26 12:05:33,760 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 140 flow [2023-11-26 12:05:33,761 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-26 12:05:33,761 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-11-26 12:05:33,762 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 140 flow [2023-11-26 12:05:33,762 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-26 12:05:33,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:33,762 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-26 12:05:33,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:05:33,763 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-26 12:05:33,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:33,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1089529007, now seen corresponding path program 1 times [2023-11-26 12:05:33,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:33,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528341583] [2023-11-26 12:05:33,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:33,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:36,053 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-26 12:05:36,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:36,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528341583] [2023-11-26 12:05:36,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528341583] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:05:36,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457785025] [2023-11-26 12:05:36,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:36,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:05:36,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:05:36,060 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:05:36,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 12:05:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:36,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-26 12:05:36,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:36,489 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-26 12:05:37,802 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-26 12:05:37,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:05:39,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 12:05:39,728 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-26 12:05:39,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 12:05:39,855 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-26 12:05:39,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 12:05:39,968 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-26 12:05:40,789 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-26 12:05:40,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457785025] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:05:40,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:05:40,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2023-11-26 12:05:40,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072039198] [2023-11-26 12:05:40,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:05:40,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-26 12:05:40,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:40,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-26 12:05:40,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2023-11-26 12:05:40,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2023-11-26 12:05:40,985 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-26 12:05:40,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:40,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2023-11-26 12:05:40,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:48,137 INFO L124 PetriNetUnfolderBase]: 3667/5976 cut-off events. [2023-11-26 12:05:48,137 INFO L125 PetriNetUnfolderBase]: For 1177/1184 co-relation queries the response was YES. [2023-11-26 12:05:48,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12914 conditions, 5976 events. 3667/5976 cut-off events. For 1177/1184 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 33856 event pairs, 199 based on Foata normal form. 8/5804 useless extension candidates. Maximal degree in co-relation 12905. Up to 1524 conditions per place. [2023-11-26 12:05:48,194 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 319 selfloop transitions, 79 changer transitions 3/406 dead transitions. [2023-11-26 12:05:48,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 406 transitions, 1867 flow [2023-11-26 12:05:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-26 12:05:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-11-26 12:05:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 708 transitions. [2023-11-26 12:05:48,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40503432494279173 [2023-11-26 12:05:48,199 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 708 transitions. [2023-11-26 12:05:48,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 708 transitions. [2023-11-26 12:05:48,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:48,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 708 transitions. [2023-11-26 12:05:48,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 18.63157894736842) internal successors, (708), 38 states have internal predecessors, (708), 0 states have call successors, (0), 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-26 12:05:48,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 46.0) internal successors, (1794), 39 states have internal predecessors, (1794), 0 states have call successors, (0), 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-26 12:05:48,209 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 46.0) internal successors, (1794), 39 states have internal predecessors, (1794), 0 states have call successors, (0), 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-26 12:05:48,209 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 140 flow. Second operand 38 states and 708 transitions. [2023-11-26 12:05:48,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 406 transitions, 1867 flow [2023-11-26 12:05:48,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 406 transitions, 1851 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-26 12:05:48,224 INFO L231 Difference]: Finished difference. Result has 96 places, 125 transitions, 669 flow [2023-11-26 12:05:48,225 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=38, PETRI_FLOW=669, PETRI_PLACES=96, PETRI_TRANSITIONS=125} [2023-11-26 12:05:48,228 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2023-11-26 12:05:48,229 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 125 transitions, 669 flow [2023-11-26 12:05:48,231 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-26 12:05:48,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:48,231 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-26 12:05:48,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 12:05:48,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:05:48,439 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-26 12:05:48,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash -802934279, now seen corresponding path program 2 times [2023-11-26 12:05:48,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:48,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418277281] [2023-11-26 12:05:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:48,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:50,695 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-26 12:05:50,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:50,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418277281] [2023-11-26 12:05:50,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418277281] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:05:50,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441738232] [2023-11-26 12:05:50,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 12:05:50,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:05:50,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:05:50,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:05:50,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 12:05:50,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-26 12:05:50,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 12:05:50,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-26 12:05:50,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:51,499 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-26 12:05:51,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:05:51,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441738232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:51,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 12:05:51,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 20 [2023-11-26 12:05:51,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160394078] [2023-11-26 12:05:51,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:51,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 12:05:51,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:51,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 12:05:51,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2023-11-26 12:05:51,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2023-11-26 12:05:51,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 125 transitions, 669 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-26 12:05:51,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:51,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2023-11-26 12:05:51,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:52,991 INFO L124 PetriNetUnfolderBase]: 3519/5976 cut-off events. [2023-11-26 12:05:52,991 INFO L125 PetriNetUnfolderBase]: For 7070/7127 co-relation queries the response was YES. [2023-11-26 12:05:53,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16506 conditions, 5976 events. 3519/5976 cut-off events. For 7070/7127 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 36135 event pairs, 985 based on Foata normal form. 101/6047 useless extension candidates. Maximal degree in co-relation 16488. Up to 3678 conditions per place. [2023-11-26 12:05:53,059 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 136 selfloop transitions, 26 changer transitions 2/172 dead transitions. [2023-11-26 12:05:53,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 172 transitions, 1096 flow [2023-11-26 12:05:53,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:05:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:05:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2023-11-26 12:05:53,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4701086956521739 [2023-11-26 12:05:53,063 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 173 transitions. [2023-11-26 12:05:53,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 173 transitions. [2023-11-26 12:05:53,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:53,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 173 transitions. [2023-11-26 12:05:53,064 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-26 12:05:53,066 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-26 12:05:53,066 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-26 12:05:53,066 INFO L175 Difference]: Start difference. First operand has 96 places, 125 transitions, 669 flow. Second operand 8 states and 173 transitions. [2023-11-26 12:05:53,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 172 transitions, 1096 flow [2023-11-26 12:05:53,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 172 transitions, 980 flow, removed 42 selfloop flow, removed 7 redundant places. [2023-11-26 12:05:53,175 INFO L231 Difference]: Finished difference. Result has 96 places, 114 transitions, 622 flow [2023-11-26 12:05:53,175 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-26 12:05:53,176 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2023-11-26 12:05:53,176 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 114 transitions, 622 flow [2023-11-26 12:05:53,176 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-26 12:05:53,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:53,177 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-26 12:05:53,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 12:05:53,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:05:53,385 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-26 12:05:53,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:53,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1068932853, now seen corresponding path program 1 times [2023-11-26 12:05:53,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:53,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896066630] [2023-11-26 12:05:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:53,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:53,595 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-26 12:05:53,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:53,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896066630] [2023-11-26 12:05:53,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896066630] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:05:53,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240649294] [2023-11-26 12:05:53,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:53,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:05:53,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:05:53,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:05:53,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 12:05:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:53,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 12:05:53,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:53,840 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-26 12:05:53,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:05:53,922 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-26 12:05:53,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240649294] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:05:53,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:05:53,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-26 12:05:53,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800064880] [2023-11-26 12:05:53,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:05:53,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 12:05:53,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:53,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 12:05:53,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-26 12:05:53,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-26 12:05:53,926 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-26 12:05:53,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:53,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-26 12:05:53,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:55,465 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#2_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, #memory_int#2=|v_#memory_int#2_82|, ~q2_back~0=v_~q2_back~0_90} 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|, #memory_int#2=|v_#memory_int#2_82|, ~q2_back~0=v_~q2_back~0_90} 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, 378#true, 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)), 52#true, Black: 326#(and (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#2| ~q2~0.base) (* ~q2_back~0 4)) 1))) (= |thread2Thread1of1ForFork0_~j~0#1| (+ 2 (* 2 (select (select |#memory_int#2| ~q2~0.base) (* 4 ~q2_front~0))))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (<= ~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)), Black: 350#(and (or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) ~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) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 338#(and (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) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), 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: 252#(or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) ~s~0) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), Black: 460#(and (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#2| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 444#(and (= (select (select |#memory_int#2| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 348#(and (or (not (= 0 ~q2_front~0)) (< ~n2~0 2) (< ~q2_back~0 1)) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= ~s~0 (+ 2 (* 2 (select (select |#memory_int#2| ~q2~0.base) (* 4 ~q2_front~0))))) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~t~0 0) (= ~q2~0.offset 0) (or (and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~s~0 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#2| ~q2~0.base) (* ~q2_back~0 4)) 1)))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ 2 (* 2 (select (select |#memory_int#2| ~q2~0.base) (* 4 ~q2_front~0)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), 507#true, Black: 97#(= (+ (* 2 ~t~0) 2) ~s~0), Black: 472#(and (= (+ ~t~0 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~s~0 0)), 28#L92true, Black: 464#(and (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#2| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= 0 (+ (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0)), Black: 468#(and (= (+ |thread3Thread1of1ForFork1_~k~0#1| 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0)), Black: 57#(<= ~q1_back~0 ~q1_front~0)]) [2023-11-26 12:05:55,465 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-26 12:05:55,465 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 12:05:55,466 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 12:05:55,466 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 12:05:55,488 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#2_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, #memory_int#2=|v_#memory_int#2_82|, ~q2_back~0=v_~q2_back~0_90} 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|, #memory_int#2=|v_#memory_int#2_82|, ~q2_back~0=v_~q2_back~0_90} 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))), 378#true, 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)), 52#true, Black: 326#(and (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#2| ~q2~0.base) (* ~q2_back~0 4)) 1))) (= |thread2Thread1of1ForFork0_~j~0#1| (+ 2 (* 2 (select (select |#memory_int#2| ~q2~0.base) (* 4 ~q2_front~0))))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (<= ~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)), Black: 350#(and (or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) ~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) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 338#(and (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) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), 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: 460#(and (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#2| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 252#(or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) ~s~0) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), 507#true, Black: 444#(and (= (select (select |#memory_int#2| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 348#(and (or (not (= 0 ~q2_front~0)) (< ~n2~0 2) (< ~q2_back~0 1)) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= ~s~0 (+ 2 (* 2 (select (select |#memory_int#2| ~q2~0.base) (* 4 ~q2_front~0))))) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~t~0 0) (= ~q2~0.offset 0) (or (and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~s~0 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#2| ~q2~0.base) (* ~q2_back~0 4)) 1)))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ 2 (* 2 (select (select |#memory_int#2| ~q2~0.base) (* 4 ~q2_front~0)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), 28#L92true, Black: 97#(= (+ (* 2 ~t~0) 2) ~s~0), Black: 472#(and (= (+ ~t~0 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~s~0 0)), Black: 464#(and (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#2| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= 0 (+ (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0)), Black: 468#(and (= (+ |thread3Thread1of1ForFork1_~k~0#1| 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0)), Black: 57#(<= ~q1_back~0 ~q1_front~0)]) [2023-11-26 12:05:55,488 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-26 12:05:55,489 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 12:05:55,489 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 12:05:55,489 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 12:05:55,490 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#2_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, #memory_int#2=|v_#memory_int#2_82|, ~q2_back~0=v_~q2_back~0_90} 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|, #memory_int#2=|v_#memory_int#2_82|, ~q2_back~0=v_~q2_back~0_90} 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))), 378#true, Black: 67#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 52#true, Black: 326#(and (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#2| ~q2~0.base) (* ~q2_back~0 4)) 1))) (= |thread2Thread1of1ForFork0_~j~0#1| (+ 2 (* 2 (select (select |#memory_int#2| ~q2~0.base) (* 4 ~q2_front~0))))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (<= ~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)), Black: 350#(and (or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) ~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) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 338#(and (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) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), 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: 460#(and (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#2| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 252#(or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) ~s~0) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), 507#true, Black: 444#(and (= (select (select |#memory_int#2| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 348#(and (or (not (= 0 ~q2_front~0)) (< ~n2~0 2) (< ~q2_back~0 1)) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= ~s~0 (+ 2 (* 2 (select (select |#memory_int#2| ~q2~0.base) (* 4 ~q2_front~0))))) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~t~0 0) (= ~q2~0.offset 0) (or (and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~s~0 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#2| ~q2~0.base) (* ~q2_back~0 4)) 1)))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ 2 (* 2 (select (select |#memory_int#2| ~q2~0.base) (* 4 ~q2_front~0)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 97#(= (+ (* 2 ~t~0) 2) ~s~0), Black: 472#(and (= (+ ~t~0 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~s~0 0)), 28#L92true, Black: 464#(and (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#2| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= 0 (+ (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0)), Black: 468#(and (= (+ |thread3Thread1of1ForFork1_~k~0#1| 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0)), 13#L123-2true, Black: 57#(<= ~q1_back~0 ~q1_front~0)]) [2023-11-26 12:05:55,490 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-26 12:05:55,491 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 12:05:55,491 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 12:05:55,491 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 12:05:55,503 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#2_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, #memory_int#2=|v_#memory_int#2_82|, ~q2_back~0=v_~q2_back~0_90} 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|, #memory_int#2=|v_#memory_int#2_82|, ~q2_back~0=v_~q2_back~0_90} 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))), 378#true, Black: 67#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 52#true, Black: 326#(and (or (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#2| ~q2~0.base) (* ~q2_back~0 4)) 1))) (= |thread2Thread1of1ForFork0_~j~0#1| (+ 2 (* 2 (select (select |#memory_int#2| ~q2~0.base) (* 4 ~q2_front~0))))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (<= ~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)), Black: 350#(and (or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) ~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) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), Black: 338#(and (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) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), 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: 460#(and (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#2| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 252#(or (= (+ (* 2 ~t~0) (* (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2) 2) ~s~0) (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)), 507#true, Black: 444#(and (= (select (select |#memory_int#2| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 348#(and (or (not (= 0 ~q2_front~0)) (< ~n2~0 2) (< ~q2_back~0 1)) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= ~s~0 (+ 2 (* 2 (select (select |#memory_int#2| ~q2~0.base) (* 4 ~q2_front~0))))) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (< (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< ~q2_front~0 1)) (= ~t~0 0) (= ~q2~0.offset 0) (or (and (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~s~0 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#2| ~q2~0.base) (* ~q2_back~0 4)) 1)))) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (+ 2 (* 2 (select (select |#memory_int#2| ~q2~0.base) (* 4 ~q2_front~0)))) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|))), 28#L92true, Black: 97#(= (+ (* 2 ~t~0) 2) ~s~0), Black: 472#(and (= (+ ~t~0 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~s~0 0)), Black: 464#(and (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#2| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= 0 (+ (select (select |#memory_int#2| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0)), Black: 468#(and (= (+ |thread3Thread1of1ForFork1_~k~0#1| 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0)), Black: 57#(<= ~q1_back~0 ~q1_front~0)]) [2023-11-26 12:05:55,503 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-26 12:05:55,503 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 12:05:55,504 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 12:05:55,504 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 12:05:55,525 INFO L124 PetriNetUnfolderBase]: 3901/7785 cut-off events. [2023-11-26 12:05:55,525 INFO L125 PetriNetUnfolderBase]: For 10865/10949 co-relation queries the response was YES. [2023-11-26 12:05:55,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20452 conditions, 7785 events. 3901/7785 cut-off events. For 10865/10949 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 61270 event pairs, 2203 based on Foata normal form. 297/7652 useless extension candidates. Maximal degree in co-relation 20431. Up to 3312 conditions per place. [2023-11-26 12:05:55,613 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 116 selfloop transitions, 8 changer transitions 9/170 dead transitions. [2023-11-26 12:05:55,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 170 transitions, 1144 flow [2023-11-26 12:05:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:05:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 12:05:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2023-11-26 12:05:55,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-26 12:05:55,615 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 161 transitions. [2023-11-26 12:05:55,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 161 transitions. [2023-11-26 12:05:55,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:55,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 161 transitions. [2023-11-26 12:05:55,617 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-26 12:05:55,618 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-26 12:05:55,618 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-26 12:05:55,619 INFO L175 Difference]: Start difference. First operand has 96 places, 114 transitions, 622 flow. Second operand 7 states and 161 transitions. [2023-11-26 12:05:55,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 170 transitions, 1144 flow [2023-11-26 12:05:55,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 170 transitions, 1123 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-26 12:05:55,725 INFO L231 Difference]: Finished difference. Result has 103 places, 115 transitions, 664 flow [2023-11-26 12:05:55,726 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-26 12:05:55,730 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 58 predicate places. [2023-11-26 12:05:55,730 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 115 transitions, 664 flow [2023-11-26 12:05:55,730 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-26 12:05:55,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:55,731 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-26 12:05:55,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-26 12:05:55,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:05:55,938 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-26 12:05:55,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash 53086447, now seen corresponding path program 2 times [2023-11-26 12:05:55,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:55,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055577136] [2023-11-26 12:05:55,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:55,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:56,692 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-26 12:05:56,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:56,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055577136] [2023-11-26 12:05:56,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055577136] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:05:56,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272439587] [2023-11-26 12:05:56,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 12:05:56,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:05:56,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:05:56,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:05:56,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 12:05:57,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 12:05:57,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 12:05:57,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-26 12:05:57,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:57,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 12:05:57,431 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-26 12:05:57,632 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-26 12:05:57,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:05:57,861 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-26 12:05:57,861 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-26 12:05:58,167 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-26 12:05:58,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272439587] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:05:58,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:05:58,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-11-26 12:05:58,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701754799] [2023-11-26 12:05:58,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:05:58,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-26 12:05:58,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:58,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-26 12:05:58,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-11-26 12:05:58,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2023-11-26 12:05:58,214 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-26 12:05:58,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:58,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2023-11-26 12:05:58,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:06:03,594 INFO L124 PetriNetUnfolderBase]: 13679/24627 cut-off events. [2023-11-26 12:06:03,594 INFO L125 PetriNetUnfolderBase]: For 42099/42384 co-relation queries the response was YES. [2023-11-26 12:06:03,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69605 conditions, 24627 events. 13679/24627 cut-off events. For 42099/42384 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 208337 event pairs, 2387 based on Foata normal form. 501/24213 useless extension candidates. Maximal degree in co-relation 69581. Up to 2749 conditions per place. [2023-11-26 12:06:03,799 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 421 selfloop transitions, 111 changer transitions 0/563 dead transitions. [2023-11-26 12:06:03,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 563 transitions, 3880 flow [2023-11-26 12:06:03,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-26 12:06:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-26 12:06:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 630 transitions. [2023-11-26 12:06:03,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267558528428093 [2023-11-26 12:06:03,802 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 630 transitions. [2023-11-26 12:06:03,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 630 transitions. [2023-11-26 12:06:03,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:06:03,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 630 transitions. [2023-11-26 12:06:03,805 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-26 12:06:03,808 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-26 12:06:03,809 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-26 12:06:03,809 INFO L175 Difference]: Start difference. First operand has 103 places, 115 transitions, 664 flow. Second operand 26 states and 630 transitions. [2023-11-26 12:06:03,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 563 transitions, 3880 flow [2023-11-26 12:06:04,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 563 transitions, 3723 flow, removed 74 selfloop flow, removed 4 redundant places. [2023-11-26 12:06:04,274 INFO L231 Difference]: Finished difference. Result has 140 places, 231 transitions, 1996 flow [2023-11-26 12:06:04,274 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-26 12:06:04,274 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 95 predicate places. [2023-11-26 12:06:04,275 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 231 transitions, 1996 flow [2023-11-26 12:06:04,275 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-26 12:06:04,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:06:04,275 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-26 12:06:04,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-26 12:06:04,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-26 12:06:04,476 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-26 12:06:04,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1501014379, now seen corresponding path program 1 times [2023-11-26 12:06:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:06:04,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579751223] [2023-11-26 12:06:04,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:04,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:06:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:04,652 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-26 12:06:04,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:06:04,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579751223] [2023-11-26 12:06:04,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579751223] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:06:04,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655104680] [2023-11-26 12:06:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:04,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:06:04,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:06:04,654 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:06:04,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de85a6b3-5861-48c6-9d74-1fe2cc4cd0fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-26 12:06:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:04,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:06:04,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:06:04,874 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-26 12:06:04,875 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:06:04,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655104680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:06:04,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 12:06:04,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2023-11-26 12:06:04,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257436163] [2023-11-26 12:06:04,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:06:04,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:06:04,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:06:04,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:06:04,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:06:04,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2023-11-26 12:06:04,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 231 transitions, 1996 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-26 12:06:04,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:06:04,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2023-11-26 12:06:04,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:06:10,764 INFO L124 PetriNetUnfolderBase]: 16034/31502 cut-off events. [2023-11-26 12:06:10,765 INFO L125 PetriNetUnfolderBase]: For 125811/126493 co-relation queries the response was YES. [2023-11-26 12:06:10,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102880 conditions, 31502 events. 16034/31502 cut-off events. For 125811/126493 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 300062 event pairs, 4155 based on Foata normal form. 1042/31221 useless extension candidates. Maximal degree in co-relation 102842. Up to 8758 conditions per place. [2023-11-26 12:06:11,173 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 267 selfloop transitions, 11 changer transitions 45/367 dead transitions. [2023-11-26 12:06:11,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 367 transitions, 3849 flow [2023-11-26 12:06:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:06:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:06:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2023-11-26 12:06:11,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6630434782608695 [2023-11-26 12:06:11,175 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 122 transitions. [2023-11-26 12:06:11,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 122 transitions. [2023-11-26 12:06:11,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:06:11,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 122 transitions. [2023-11-26 12:06:11,176 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-26 12:06:11,177 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-26 12:06:11,178 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-26 12:06:11,178 INFO L175 Difference]: Start difference. First operand has 140 places, 231 transitions, 1996 flow. Second operand 4 states and 122 transitions. [2023-11-26 12:06:11,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 367 transitions, 3849 flow