./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:51:31,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:51:31,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:51:31,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:51:31,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:51:31,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:51:31,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:51:32,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:51:32,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:51:32,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:51:32,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:51:32,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:51:32,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:51:32,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:51:32,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:51:32,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:51:32,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:51:32,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:51:32,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:51:32,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:51:32,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:51:32,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:51:32,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:51:32,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:51:32,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:51:32,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:51:32,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:51:32,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:51:32,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:51:32,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:51:32,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:51:32,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:51:32,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:51:32,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:51:32,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:51:32,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:51:32,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:51:32,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:51:32,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:51:32,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:51:32,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:51:32,034 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:51:32,055 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:51:32,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:51:32,056 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:51:32,056 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:51:32,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:51:32,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:51:32,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:51:32,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:51:32,058 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:51:32,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:51:32,059 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:51:32,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:51:32,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:51:32,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:51:32,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:51:32,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:51:32,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:51:32,060 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:51:32,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:51:32,061 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:51:32,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:51:32,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:51:32,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:51:32,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:51:32,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:51:32,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:51:32,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:51:32,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:51:32,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:51:32,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:51:32,063 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:51:32,063 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:51:32,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:51:32,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/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_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 [2022-11-21 16:51:32,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:51:32,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:51:32,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:51:32,342 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:51:32,343 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:51:32,344 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2022-11-21 16:51:35,630 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:51:35,856 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:51:35,857 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2022-11-21 16:51:35,866 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/data/1eee2d9fe/099fb46491d24e64a447d1fe811888bd/FLAGcbaceac00 [2022-11-21 16:51:35,885 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/data/1eee2d9fe/099fb46491d24e64a447d1fe811888bd [2022-11-21 16:51:35,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:51:35,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:51:35,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:51:35,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:51:35,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:51:35,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:51:35" (1/1) ... [2022-11-21 16:51:35,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3181d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:35, skipping insertion in model container [2022-11-21 16:51:35,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:51:35" (1/1) ... [2022-11-21 16:51:35,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:51:35,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:51:36,153 WARN L237 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_d092455a-8580-43f6-ac4e-e38f0940ba50/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-11-21 16:51:36,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:51:36,188 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:51:36,215 WARN L237 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_d092455a-8580-43f6-ac4e-e38f0940ba50/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-11-21 16:51:36,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:51:36,235 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:51:36,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:36 WrapperNode [2022-11-21 16:51:36,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:51:36,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:51:36,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:51:36,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:51:36,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:36" (1/1) ... [2022-11-21 16:51:36,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:36" (1/1) ... [2022-11-21 16:51:36,291 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 200 [2022-11-21 16:51:36,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:51:36,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:51:36,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:51:36,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:51:36,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:36" (1/1) ... [2022-11-21 16:51:36,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:36" (1/1) ... [2022-11-21 16:51:36,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:36" (1/1) ... [2022-11-21 16:51:36,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:36" (1/1) ... [2022-11-21 16:51:36,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:36" (1/1) ... [2022-11-21 16:51:36,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:36" (1/1) ... [2022-11-21 16:51:36,323 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:36" (1/1) ... [2022-11-21 16:51:36,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:36" (1/1) ... [2022-11-21 16:51:36,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:51:36,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:51:36,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:51:36,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:51:36,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:36" (1/1) ... [2022-11-21 16:51:36,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:51:36,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:51:36,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:51:36,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:51:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:51:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-21 16:51:36,408 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-21 16:51:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-21 16:51:36,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-21 16:51:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:51:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:51:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:51:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:51:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:51:36,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:51:36,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:51:36,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:51:36,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:51:36,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:51:36,412 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:51:36,533 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:51:36,535 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:51:36,986 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:51:37,187 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:51:37,188 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-21 16:51:37,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:51:37 BoogieIcfgContainer [2022-11-21 16:51:37,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:51:37,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:51:37,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:51:37,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:51:37,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:51:35" (1/3) ... [2022-11-21 16:51:37,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1713ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:51:37, skipping insertion in model container [2022-11-21 16:51:37,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:36" (2/3) ... [2022-11-21 16:51:37,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1713ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:51:37, skipping insertion in model container [2022-11-21 16:51:37,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:51:37" (3/3) ... [2022-11-21 16:51:37,202 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2022-11-21 16:51:37,211 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 16:51:37,222 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:51:37,222 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:51:37,222 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:51:37,316 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-21 16:51:37,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 178 transitions, 372 flow [2022-11-21 16:51:37,491 INFO L130 PetriNetUnfolder]: 13/176 cut-off events. [2022-11-21 16:51:37,491 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 16:51:37,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 176 events. 13/176 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2022-11-21 16:51:37,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 178 transitions, 372 flow [2022-11-21 16:51:37,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 167 transitions, 346 flow [2022-11-21 16:51:37,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:51:37,530 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6eaa0e23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:51:37,530 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-21 16:51:37,585 INFO L130 PetriNetUnfolder]: 13/166 cut-off events. [2022-11-21 16:51:37,586 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 16:51:37,586 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:37,587 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:37,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 16:51:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:37,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1458705349, now seen corresponding path program 1 times [2022-11-21 16:51:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:37,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771282484] [2022-11-21 16:51:37,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:37,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:37,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:37,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771282484] [2022-11-21 16:51:37,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771282484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:37,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:37,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:51:37,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801149732] [2022-11-21 16:51:37,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:37,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:51:37,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:37,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:51:37,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:51:37,972 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 178 [2022-11-21 16:51:37,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 167 transitions, 346 flow. Second operand has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:37,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:37,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 178 [2022-11-21 16:51:37,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:38,080 INFO L130 PetriNetUnfolder]: 17/189 cut-off events. [2022-11-21 16:51:38,080 INFO L131 PetriNetUnfolder]: For 17/20 co-relation queries the response was YES. [2022-11-21 16:51:38,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 189 events. 17/189 cut-off events. For 17/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 194 event pairs, 8 based on Foata normal form. 15/191 useless extension candidates. Maximal degree in co-relation 137. Up to 25 conditions per place. [2022-11-21 16:51:38,083 INFO L137 encePairwiseOnDemand]: 169/178 looper letters, 8 selfloop transitions, 0 changer transitions 5/158 dead transitions. [2022-11-21 16:51:38,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 158 transitions, 344 flow [2022-11-21 16:51:38,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:51:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 16:51:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2022-11-21 16:51:38,102 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9466292134831461 [2022-11-21 16:51:38,103 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2022-11-21 16:51:38,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2022-11-21 16:51:38,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:38,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2022-11-21 16:51:38,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:38,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:38,130 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:38,135 INFO L175 Difference]: Start difference. First operand has 161 places, 167 transitions, 346 flow. Second operand 2 states and 337 transitions. [2022-11-21 16:51:38,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 158 transitions, 344 flow [2022-11-21 16:51:38,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 158 transitions, 336 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 16:51:38,151 INFO L231 Difference]: Finished difference. Result has 158 places, 153 transitions, 310 flow [2022-11-21 16:51:38,154 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=310, PETRI_PLACES=158, PETRI_TRANSITIONS=153} [2022-11-21 16:51:38,165 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, -3 predicate places. [2022-11-21 16:51:38,165 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 153 transitions, 310 flow [2022-11-21 16:51:38,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:38,166 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:38,167 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:38,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:51:38,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 16:51:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:38,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1666625947, now seen corresponding path program 1 times [2022-11-21 16:51:38,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:38,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310129575] [2022-11-21 16:51:38,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:38,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:39,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:39,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310129575] [2022-11-21 16:51:39,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310129575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:39,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:39,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:51:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590797525] [2022-11-21 16:51:39,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:39,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:51:39,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:39,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:51:39,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:51:39,133 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 178 [2022-11-21 16:51:39,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 153 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:39,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:39,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 178 [2022-11-21 16:51:39,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:39,496 INFO L130 PetriNetUnfolder]: 112/418 cut-off events. [2022-11-21 16:51:39,496 INFO L131 PetriNetUnfolder]: For 20/33 co-relation queries the response was YES. [2022-11-21 16:51:39,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 418 events. 112/418 cut-off events. For 20/33 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1480 event pairs, 33 based on Foata normal form. 3/374 useless extension candidates. Maximal degree in co-relation 673. Up to 120 conditions per place. [2022-11-21 16:51:39,500 INFO L137 encePairwiseOnDemand]: 171/178 looper letters, 59 selfloop transitions, 5 changer transitions 4/183 dead transitions. [2022-11-21 16:51:39,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 183 transitions, 511 flow [2022-11-21 16:51:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:51:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 16:51:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 819 transitions. [2022-11-21 16:51:39,512 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7668539325842697 [2022-11-21 16:51:39,512 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 819 transitions. [2022-11-21 16:51:39,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 819 transitions. [2022-11-21 16:51:39,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:39,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 819 transitions. [2022-11-21 16:51:39,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:39,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:39,525 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:39,525 INFO L175 Difference]: Start difference. First operand has 158 places, 153 transitions, 310 flow. Second operand 6 states and 819 transitions. [2022-11-21 16:51:39,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 183 transitions, 511 flow [2022-11-21 16:51:39,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 183 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:51:39,530 INFO L231 Difference]: Finished difference. Result has 161 places, 156 transitions, 339 flow [2022-11-21 16:51:39,530 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=161, PETRI_TRANSITIONS=156} [2022-11-21 16:51:39,531 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 0 predicate places. [2022-11-21 16:51:39,531 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 156 transitions, 339 flow [2022-11-21 16:51:39,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:39,536 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:39,536 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:39,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:51:39,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 16:51:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1017288057, now seen corresponding path program 1 times [2022-11-21 16:51:39,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:39,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244896424] [2022-11-21 16:51:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:39,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:39,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:39,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244896424] [2022-11-21 16:51:39,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244896424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:39,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:39,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:51:39,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582382162] [2022-11-21 16:51:39,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:39,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:51:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:39,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:51:39,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:51:39,861 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 178 [2022-11-21 16:51:39,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 156 transitions, 339 flow. Second operand has 5 states, 5 states have (on average 150.2) internal successors, (751), 5 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:39,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:39,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 178 [2022-11-21 16:51:39,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:40,055 INFO L130 PetriNetUnfolder]: 109/423 cut-off events. [2022-11-21 16:51:40,055 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-11-21 16:51:40,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 423 events. 109/423 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1595 event pairs, 48 based on Foata normal form. 0/381 useless extension candidates. Maximal degree in co-relation 706. Up to 117 conditions per place. [2022-11-21 16:51:40,063 INFO L137 encePairwiseOnDemand]: 168/178 looper letters, 37 selfloop transitions, 11 changer transitions 4/184 dead transitions. [2022-11-21 16:51:40,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 184 transitions, 515 flow [2022-11-21 16:51:40,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:51:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 16:51:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 789 transitions. [2022-11-21 16:51:40,067 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8865168539325843 [2022-11-21 16:51:40,067 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 789 transitions. [2022-11-21 16:51:40,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 789 transitions. [2022-11-21 16:51:40,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:40,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 789 transitions. [2022-11-21 16:51:40,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,075 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,075 INFO L175 Difference]: Start difference. First operand has 161 places, 156 transitions, 339 flow. Second operand 5 states and 789 transitions. [2022-11-21 16:51:40,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 184 transitions, 515 flow [2022-11-21 16:51:40,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 184 transitions, 511 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-21 16:51:40,084 INFO L231 Difference]: Finished difference. Result has 163 places, 160 transitions, 392 flow [2022-11-21 16:51:40,085 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=392, PETRI_PLACES=163, PETRI_TRANSITIONS=160} [2022-11-21 16:51:40,092 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 2 predicate places. [2022-11-21 16:51:40,093 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 160 transitions, 392 flow [2022-11-21 16:51:40,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.2) internal successors, (751), 5 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,094 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:40,094 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:40,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:51:40,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 16:51:40,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1113997575, now seen corresponding path program 2 times [2022-11-21 16:51:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:40,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861405056] [2022-11-21 16:51:40,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:40,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:40,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:40,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861405056] [2022-11-21 16:51:40,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861405056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:40,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:40,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:51:40,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781900528] [2022-11-21 16:51:40,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:40,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:51:40,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:40,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:51:40,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:51:40,344 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 178 [2022-11-21 16:51:40,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 160 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 149.66666666666666) internal successors, (898), 6 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:40,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 178 [2022-11-21 16:51:40,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:40,508 INFO L130 PetriNetUnfolder]: 91/366 cut-off events. [2022-11-21 16:51:40,508 INFO L131 PetriNetUnfolder]: For 116/126 co-relation queries the response was YES. [2022-11-21 16:51:40,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 366 events. 91/366 cut-off events. For 116/126 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1173 event pairs, 28 based on Foata normal form. 12/370 useless extension candidates. Maximal degree in co-relation 682. Up to 116 conditions per place. [2022-11-21 16:51:40,513 INFO L137 encePairwiseOnDemand]: 170/178 looper letters, 33 selfloop transitions, 7 changer transitions 6/178 dead transitions. [2022-11-21 16:51:40,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 178 transitions, 532 flow [2022-11-21 16:51:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:51:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 16:51:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 929 transitions. [2022-11-21 16:51:40,516 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8698501872659176 [2022-11-21 16:51:40,516 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 929 transitions. [2022-11-21 16:51:40,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 929 transitions. [2022-11-21 16:51:40,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:40,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 929 transitions. [2022-11-21 16:51:40,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,528 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,528 INFO L175 Difference]: Start difference. First operand has 163 places, 160 transitions, 392 flow. Second operand 6 states and 929 transitions. [2022-11-21 16:51:40,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 178 transitions, 532 flow [2022-11-21 16:51:40,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 178 transitions, 518 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 16:51:40,538 INFO L231 Difference]: Finished difference. Result has 166 places, 158 transitions, 385 flow [2022-11-21 16:51:40,538 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=166, PETRI_TRANSITIONS=158} [2022-11-21 16:51:40,540 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 5 predicate places. [2022-11-21 16:51:40,544 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 158 transitions, 385 flow [2022-11-21 16:51:40,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.66666666666666) internal successors, (898), 6 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,546 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:40,546 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:40,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:51:40,547 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 16:51:40,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:40,548 INFO L85 PathProgramCache]: Analyzing trace with hash -373622335, now seen corresponding path program 1 times [2022-11-21 16:51:40,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:40,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49629904] [2022-11-21 16:51:40,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:40,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:40,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:40,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49629904] [2022-11-21 16:51:40,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49629904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:40,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:40,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:51:40,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258164714] [2022-11-21 16:51:40,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:40,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:51:40,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:40,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:51:40,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:51:40,776 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 178 [2022-11-21 16:51:40,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 158 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:40,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 178 [2022-11-21 16:51:40,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:40,936 INFO L130 PetriNetUnfolder]: 31/275 cut-off events. [2022-11-21 16:51:40,936 INFO L131 PetriNetUnfolder]: For 53/59 co-relation queries the response was YES. [2022-11-21 16:51:40,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 275 events. 31/275 cut-off events. For 53/59 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 568 event pairs, 14 based on Foata normal form. 5/271 useless extension candidates. Maximal degree in co-relation 462. Up to 56 conditions per place. [2022-11-21 16:51:40,938 INFO L137 encePairwiseOnDemand]: 169/178 looper letters, 35 selfloop transitions, 6 changer transitions 4/166 dead transitions. [2022-11-21 16:51:40,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 166 transitions, 493 flow [2022-11-21 16:51:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:51:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-21 16:51:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 982 transitions. [2022-11-21 16:51:40,941 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7881219903691814 [2022-11-21 16:51:40,942 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 982 transitions. [2022-11-21 16:51:40,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 982 transitions. [2022-11-21 16:51:40,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:40,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 982 transitions. [2022-11-21 16:51:40,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.28571428571428) internal successors, (982), 7 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,949 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,949 INFO L175 Difference]: Start difference. First operand has 166 places, 158 transitions, 385 flow. Second operand 7 states and 982 transitions. [2022-11-21 16:51:40,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 166 transitions, 493 flow [2022-11-21 16:51:40,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 473 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-21 16:51:40,957 INFO L231 Difference]: Finished difference. Result has 170 places, 159 transitions, 389 flow [2022-11-21 16:51:40,957 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=389, PETRI_PLACES=170, PETRI_TRANSITIONS=159} [2022-11-21 16:51:40,960 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 9 predicate places. [2022-11-21 16:51:40,960 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 159 transitions, 389 flow [2022-11-21 16:51:40,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:40,961 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:40,961 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:40,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:51:40,962 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 16:51:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1152719248, now seen corresponding path program 1 times [2022-11-21 16:51:40,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:40,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359721258] [2022-11-21 16:51:40,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:51:41,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:41,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359721258] [2022-11-21 16:51:41,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359721258] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:51:41,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117537421] [2022-11-21 16:51:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:41,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:51:41,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:51:41,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:51:41,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:51:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:41,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:51:41,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:51:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:51:42,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:51:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:51:42,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117537421] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:51:42,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:51:42,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-11-21 16:51:42,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362262106] [2022-11-21 16:51:42,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:51:42,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:51:42,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:42,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:51:42,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:51:42,301 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 178 [2022-11-21 16:51:42,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 159 transitions, 389 flow. Second operand has 11 states, 11 states have (on average 150.9090909090909) internal successors, (1660), 11 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:42,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:42,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 178 [2022-11-21 16:51:42,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:42,601 INFO L130 PetriNetUnfolder]: 110/441 cut-off events. [2022-11-21 16:51:42,601 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2022-11-21 16:51:42,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 441 events. 110/441 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1471 event pairs, 20 based on Foata normal form. 7/444 useless extension candidates. Maximal degree in co-relation 861. Up to 70 conditions per place. [2022-11-21 16:51:42,606 INFO L137 encePairwiseOnDemand]: 170/178 looper letters, 58 selfloop transitions, 19 changer transitions 0/210 dead transitions. [2022-11-21 16:51:42,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 210 transitions, 713 flow [2022-11-21 16:51:42,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:51:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-21 16:51:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1843 transitions. [2022-11-21 16:51:42,612 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8628277153558053 [2022-11-21 16:51:42,612 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1843 transitions. [2022-11-21 16:51:42,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1843 transitions. [2022-11-21 16:51:42,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:42,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1843 transitions. [2022-11-21 16:51:42,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 153.58333333333334) internal successors, (1843), 12 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:42,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 178.0) internal successors, (2314), 13 states have internal predecessors, (2314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:42,623 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 178.0) internal successors, (2314), 13 states have internal predecessors, (2314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:42,624 INFO L175 Difference]: Start difference. First operand has 170 places, 159 transitions, 389 flow. Second operand 12 states and 1843 transitions. [2022-11-21 16:51:42,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 210 transitions, 713 flow [2022-11-21 16:51:42,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 210 transitions, 703 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 16:51:42,632 INFO L231 Difference]: Finished difference. Result has 181 places, 170 transitions, 498 flow [2022-11-21 16:51:42,633 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=498, PETRI_PLACES=181, PETRI_TRANSITIONS=170} [2022-11-21 16:51:42,636 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 20 predicate places. [2022-11-21 16:51:42,637 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 170 transitions, 498 flow [2022-11-21 16:51:42,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 150.9090909090909) internal successors, (1660), 11 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:42,640 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:42,640 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:42,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 16:51:42,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 16:51:42,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 16:51:42,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:42,848 INFO L85 PathProgramCache]: Analyzing trace with hash -17716140, now seen corresponding path program 1 times [2022-11-21 16:51:42,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:42,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136983587] [2022-11-21 16:51:42,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:42,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:51:43,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:43,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136983587] [2022-11-21 16:51:43,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136983587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:43,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:43,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:51:43,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024043989] [2022-11-21 16:51:43,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:43,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:51:43,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:43,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:51:43,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:51:43,093 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 178 [2022-11-21 16:51:43,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 170 transitions, 498 flow. Second operand has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:43,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:43,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 178 [2022-11-21 16:51:43,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:43,294 INFO L130 PetriNetUnfolder]: 46/388 cut-off events. [2022-11-21 16:51:43,294 INFO L131 PetriNetUnfolder]: For 233/236 co-relation queries the response was YES. [2022-11-21 16:51:43,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 388 events. 46/388 cut-off events. For 233/236 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1006 event pairs, 21 based on Foata normal form. 4/381 useless extension candidates. Maximal degree in co-relation 737. Up to 90 conditions per place. [2022-11-21 16:51:43,298 INFO L137 encePairwiseOnDemand]: 167/178 looper letters, 40 selfloop transitions, 8 changer transitions 17/191 dead transitions. [2022-11-21 16:51:43,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 191 transitions, 682 flow [2022-11-21 16:51:43,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:51:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 16:51:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1262 transitions. [2022-11-21 16:51:43,302 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.787765293383271 [2022-11-21 16:51:43,302 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1262 transitions. [2022-11-21 16:51:43,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1262 transitions. [2022-11-21 16:51:43,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:43,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1262 transitions. [2022-11-21 16:51:43,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 140.22222222222223) internal successors, (1262), 9 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:43,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 178.0) internal successors, (1780), 10 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:43,311 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 178.0) internal successors, (1780), 10 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:43,311 INFO L175 Difference]: Start difference. First operand has 181 places, 170 transitions, 498 flow. Second operand 9 states and 1262 transitions. [2022-11-21 16:51:43,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 191 transitions, 682 flow [2022-11-21 16:51:43,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 191 transitions, 645 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-11-21 16:51:43,320 INFO L231 Difference]: Finished difference. Result has 187 places, 171 transitions, 491 flow [2022-11-21 16:51:43,320 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=491, PETRI_PLACES=187, PETRI_TRANSITIONS=171} [2022-11-21 16:51:43,321 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 26 predicate places. [2022-11-21 16:51:43,321 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 171 transitions, 491 flow [2022-11-21 16:51:43,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:43,322 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:43,322 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:43,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:51:43,323 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 16:51:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1730991474, now seen corresponding path program 1 times [2022-11-21 16:51:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:43,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044868434] [2022-11-21 16:51:43,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:43,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:49,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:49,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044868434] [2022-11-21 16:51:49,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044868434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:51:49,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896296613] [2022-11-21 16:51:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:49,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:51:49,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:51:49,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:51:49,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:51:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:49,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-21 16:51:49,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:51:54,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:51:54,059 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:51:54,060 INFO L350 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 48 treesize of output 18 [2022-11-21 16:51:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:54,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:51:55,833 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-11-21 16:51:55,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 236 [2022-11-21 16:52:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:52:05,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896296613] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:52:05,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:52:05,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 31] total 103 [2022-11-21 16:52:05,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971849454] [2022-11-21 16:52:05,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:52:05,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-11-21 16:52:05,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-11-21 16:52:05,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=9461, Unknown=0, NotChecked=0, Total=10506 [2022-11-21 16:52:05,667 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 178 [2022-11-21 16:52:05,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 171 transitions, 491 flow. Second operand has 103 states, 103 states have (on average 66.63106796116504) internal successors, (6863), 103 states have internal predecessors, (6863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:52:05,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:52:05,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 178 [2022-11-21 16:52:05,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:52:44,359 INFO L130 PetriNetUnfolder]: 1657/3507 cut-off events. [2022-11-21 16:52:44,359 INFO L131 PetriNetUnfolder]: For 2342/2342 co-relation queries the response was YES. [2022-11-21 16:52:44,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8853 conditions, 3507 events. 1657/3507 cut-off events. For 2342/2342 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 24826 event pairs, 19 based on Foata normal form. 53/3552 useless extension candidates. Maximal degree in co-relation 8836. Up to 531 conditions per place. [2022-11-21 16:52:44,389 INFO L137 encePairwiseOnDemand]: 121/178 looper letters, 516 selfloop transitions, 437 changer transitions 53/1060 dead transitions. [2022-11-21 16:52:44,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 1060 transitions, 5522 flow [2022-11-21 16:52:44,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2022-11-21 16:52:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2022-11-21 16:52:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 14375 transitions. [2022-11-21 16:52:44,427 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3864039567765174 [2022-11-21 16:52:44,428 INFO L72 ComplementDD]: Start complementDD. Operand 209 states and 14375 transitions. [2022-11-21 16:52:44,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 14375 transitions. [2022-11-21 16:52:44,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:52:44,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 209 states and 14375 transitions. [2022-11-21 16:52:44,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 210 states, 209 states have (on average 68.77990430622009) internal successors, (14375), 209 states have internal predecessors, (14375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:52:44,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 210 states, 210 states have (on average 178.0) internal successors, (37380), 210 states have internal predecessors, (37380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:52:44,534 INFO L81 ComplementDD]: Finished complementDD. Result has 210 states, 210 states have (on average 178.0) internal successors, (37380), 210 states have internal predecessors, (37380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:52:44,535 INFO L175 Difference]: Start difference. First operand has 187 places, 171 transitions, 491 flow. Second operand 209 states and 14375 transitions. [2022-11-21 16:52:44,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 1060 transitions, 5522 flow [2022-11-21 16:52:44,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 1060 transitions, 5172 flow, removed 136 selfloop flow, removed 7 redundant places. [2022-11-21 16:52:44,576 INFO L231 Difference]: Finished difference. Result has 464 places, 612 transitions, 3516 flow [2022-11-21 16:52:44,579 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=209, PETRI_FLOW=3516, PETRI_PLACES=464, PETRI_TRANSITIONS=612} [2022-11-21 16:52:44,582 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 303 predicate places. [2022-11-21 16:52:44,582 INFO L495 AbstractCegarLoop]: Abstraction has has 464 places, 612 transitions, 3516 flow [2022-11-21 16:52:44,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 66.63106796116504) internal successors, (6863), 103 states have internal predecessors, (6863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:52:44,586 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:52:44,586 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:52:44,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:52:44,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:44,794 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 16:52:44,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash -877048930, now seen corresponding path program 2 times [2022-11-21 16:52:44,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:44,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796113236] [2022-11-21 16:52:44,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:44,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:52:49,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:49,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796113236] [2022-11-21 16:52:49,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796113236] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:52:49,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752873153] [2022-11-21 16:52:49,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:52:49,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:49,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:52:49,816 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:52:49,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d092455a-8580-43f6-ac4e-e38f0940ba50/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:52:49,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:52:49,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:52:49,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-21 16:52:49,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:52:50,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:52:51,496 INFO L350 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 11 [2022-11-21 16:52:53,210 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:52:53,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 16:52:53,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 16:52:54,902 INFO L350 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 6 treesize of output 5 [2022-11-21 16:52:55,163 INFO L350 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 6 treesize of output 5 [2022-11-21 16:52:55,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 16 [2022-11-21 16:52:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:52:56,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:53:11,625 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-11-21 16:53:11,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 98 [2022-11-21 16:53:11,716 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2022-11-21 16:53:11,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 250 treesize of output 307 [2022-11-21 16:53:11,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:53:11,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 204 [2022-11-21 16:53:11,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:53:11,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 161 [2022-11-21 16:53:18,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:53:18,969 INFO L350 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 41 treesize of output 46 [2022-11-21 16:53:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:53:20,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752873153] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:53:20,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:53:20,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 45, 44] total 120 [2022-11-21 16:53:20,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947652564] [2022-11-21 16:53:20,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:53:20,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 120 states [2022-11-21 16:53:20,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:53:20,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2022-11-21 16:53:20,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=12456, Unknown=74, NotChecked=0, Total=14280 [2022-11-21 16:53:20,241 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 178 [2022-11-21 16:53:20,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 612 transitions, 3516 flow. Second operand has 120 states, 120 states have (on average 56.333333333333336) internal successors, (6760), 120 states have internal predecessors, (6760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:53:20,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:53:20,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 178 [2022-11-21 16:53:20,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:54:01,740 WARN L233 SmtUtils]: Spent 39.72s on a formula simplification. DAG size of input: 377 DAG size of output: 375 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:54:49,361 WARN L233 SmtUtils]: Spent 44.63s on a formula simplification. DAG size of input: 383 DAG size of output: 381 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:55:37,785 WARN L233 SmtUtils]: Spent 39.75s on a formula simplification. DAG size of input: 366 DAG size of output: 364 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:55:40,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:56:42,057 WARN L233 SmtUtils]: Spent 26.85s on a formula simplification. DAG size of input: 402 DAG size of output: 257 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:57:14,135 WARN L233 SmtUtils]: Spent 24.69s on a formula simplification that was a NOOP. DAG size: 393 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:57:17,367 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~i~0 1)) (.cse26 (* c_~q1_back~0 4)) (.cse27 (* c_~q1_front~0 4)) (.cse10 (* c_~q2_front~0 4))) (let ((.cse21 (select |c_#memory_int| c_~q2~0.base)) (.cse39 (+ c_~q2~0.offset .cse10)) (.cse55 (= .cse26 .cse27)) (.cse57 (< c_~j~0 .cse8)) (.cse12 (* c_~q2_back~0 4))) (let ((.cse22 (+ .cse12 c_~q2~0.offset)) (.cse51 (< 0 c_~q2_front~0)) (.cse53 (< 0 c_~q2_back~0)) (.cse52 (and .cse55 .cse57)) (.cse24 (select .cse21 .cse39)) (.cse34 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse54 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse11 (+ .cse26 c_~q1~0.offset)) (.cse7 (+ .cse27 c_~q1~0.offset)) (.cse1 (not (< c_~q2_back~0 c_~n2~0))) (.cse2 (not (< c_~q1_back~0 c_~n1~0))) (.cse3 (<= c_~n2~0 c_~q2_front~0)) (.cse4 (< c_~q2_front~0 0)) (.cse5 (not (<= 0 c_~q2_back~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base| (store .cse14 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse6 (select .cse13 c_~q1~0.base)) (.cse9 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base|))) (or (< (select .cse6 .cse7) .cse8) (< (select .cse9 (+ .cse10 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= (select .cse6 .cse11) c_~j~0)) (not (= (select .cse9 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base| (store .cse14 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse15 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base|)) (.cse16 (select .cse17 c_~q1~0.base))) (or (< (select .cse15 (+ .cse10 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse8) (not (= (select .cse16 .cse11) c_~j~0)) (not (= (select .cse15 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (< (select .cse16 .cse7) c_~i~0)))))))))) (= c_~q2~0.offset 0) (or .cse0 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse18 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse19 (select .cse18 c_~q1~0.base))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_front~0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (= c_~i~0 (select (select .cse18 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (= c_~j~0 (select .cse19 .cse11))) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (< (select .cse19 .cse7) .cse8))))) .cse2 .cse4 .cse5) (let ((.cse20 (select |c_#memory_int| c_~q1~0.base))) (or (not (= (select .cse20 .cse11) c_~j~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= c_~i~0 (select .cse21 .cse22))) (let ((.cse23 (select .cse20 .cse7))) (and (or (< .cse23 .cse8) (< .cse24 c_~i~0)) (or (< .cse24 .cse8) (< .cse23 c_~i~0)))))) (< 0 (+ c_~q2~0.offset .cse10 1)) (or .cse0 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse28 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse25 (select .cse28 |c_ULTIMATE.start_main_#t~ret16#1.base|))) (or (not (= (select .cse25 (+ .cse26 |c_ULTIMATE.start_main_#t~ret16#1.offset|)) c_~j~0)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_front~0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (< (select .cse25 (+ .cse27 |c_ULTIMATE.start_main_#t~ret16#1.offset|)) .cse8) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (= c_~i~0 (select (select .cse28 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)))))) .cse2 .cse4 .cse5) (or .cse0 .cse2 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| Int) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse30 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse29 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_front~0) (< (select .cse29 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse8) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (= c_~j~0 (select .cse29 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= c_~i~0 (select (select .cse30 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|)))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)))))) .cse4 .cse5) (or .cse0 .cse1 .cse2 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse34 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse31 (select .cse33 c_~q1~0.base)) (.cse32 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse31 .cse7) .cse8) (not (= c_~j~0 (select .cse31 .cse11))) (not (= (select .cse32 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (< (select .cse32 (+ .cse10 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse34 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse36 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse35 (select .cse37 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse35 .cse11))) (< (select .cse36 (+ .cse10 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse8) (not (= (select .cse36 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (< (select .cse35 .cse7) c_~i~0)))))))) .cse3 .cse4 .cse5) (= c_~q1~0.offset 0) (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse38 (select .cse41 c_~q2~0.base)) (.cse40 (select .cse41 c_~q1~0.base))) (or (< (select .cse38 .cse39) c_~i~0) (not (= c_~i~0 (select .cse38 .cse22))) (not (= (select .cse40 .cse11) c_~j~0)) (< (select .cse40 .cse7) .cse8))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse44 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse42 (select .cse44 c_~q2~0.base)) (.cse43 (select .cse44 c_~q1~0.base))) (or (< (select .cse42 .cse39) .cse8) (< (select .cse43 .cse7) c_~i~0) (not (= c_~i~0 (select .cse42 .cse22))) (not (= (select .cse43 .cse11) c_~j~0))))))) .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse47 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse45 (select .cse47 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|)) (.cse46 (select .cse47 c_~q1~0.base))) (or (< (select .cse45 (+ .cse10 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse8) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (= c_~i~0 (select .cse45 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (= c_~j~0 (select .cse46 .cse11))) (< (select .cse46 .cse7) c_~i~0) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse50 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse48 (select .cse50 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|)) (.cse49 (select .cse50 c_~q1~0.base))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (< (select .cse48 (+ .cse10 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= c_~i~0 (select .cse48 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (= c_~j~0 (select .cse49 .cse11))) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (< (select .cse49 .cse7) .cse8) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)))))) .cse4 .cse5) (<= c_~q2_front~0 0) (<= 1 c_~N~0) (or .cse51 .cse0 .cse2 .cse52 .cse53 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse4 .cse5) (or .cse51 .cse0 .cse2 .cse53 .cse54 (let ((.cse56 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)))))) (and (or .cse55 .cse56) (or .cse57 .cse56))) .cse4 .cse5) (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse59 (select .cse60 c_~q1~0.base)) (.cse58 (select .cse60 c_~q2~0.base))) (or (not (= (select .cse58 .cse22) c_~i~0)) (< (select .cse59 .cse7) .cse8) (not (= c_~j~0 (select .cse59 .cse11))) (< (select .cse58 .cse39) c_~i~0))))) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse61 (select .cse63 c_~q2~0.base)) (.cse62 (select .cse63 c_~q1~0.base))) (or (not (= (select .cse61 .cse22) c_~i~0)) (not (= c_~j~0 (select .cse62 .cse11))) (< (select .cse61 .cse39) .cse8) (< (select .cse62 .cse7) c_~i~0)))))) .cse3 .cse4 .cse5) (or .cse51 .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse52 .cse53 .cse4 .cse5) (or (not (= .cse11 0)) (let ((.cse64 (= .cse7 0))) (and (or (not .cse64) (= c_~j~0 0)) (or (and (<= (+ c_~q1_front~0 c_~n1~0) (+ c_~q1_back~0 1)) (< 0 (+ .cse27 c_~q1~0.offset 1))) .cse64)))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse67 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse65 (select .cse67 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|)) (.cse66 (select .cse67 c_~q1~0.base))) (or (< (select .cse65 (+ .cse10 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= c_~i~0 (select .cse65 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= c_~j~0 (select .cse66 .cse11))) (< (select .cse66 .cse7) .cse8))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse70 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse68 (select .cse70 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|)) (.cse69 (select .cse70 c_~q1~0.base))) (or (< (select .cse68 (+ .cse10 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse8) (not (= c_~i~0 (select .cse68 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= c_~j~0 (select .cse69 .cse11))) (< (select .cse69 .cse7) c_~i~0))))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)))))) (or .cse0 .cse2 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse72 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse71 (select .cse72 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_front~0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (< (select .cse71 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) .cse8) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (= c_~i~0 (select (select .cse72 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= c_~j~0 (select .cse71 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)))))) .cse4 .cse5) (or .cse0 .cse52 (< 0 c_~q1_back~0)) (or .cse0 .cse1 .cse2 .cse3 (let ((.cse74 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| .cse10)) (.cse75 (+ .cse12 |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse77 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse73 (select .cse77 |c_ULTIMATE.start_main_#t~ret17#1.base|)) (.cse76 (select .cse77 c_~q1~0.base))) (or (< (select .cse73 .cse74) c_~i~0) (not (= (select .cse73 .cse75) c_~i~0)) (not (= (select .cse76 .cse11) c_~j~0)) (< (select .cse76 .cse7) .cse8))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse80 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse78 (select .cse80 |c_ULTIMATE.start_main_#t~ret17#1.base|)) (.cse79 (select .cse80 c_~q1~0.base))) (or (< (select .cse78 .cse74) .cse8) (not (= (select .cse78 .cse75) c_~i~0)) (< (select .cse79 .cse7) c_~i~0) (not (= (select .cse79 .cse11) c_~j~0)))))))) .cse4 .cse5) (= .cse24 0) (or (<= c_~n1~0 1) (<= .cse11 0)) (or .cse0 (let ((.cse82 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse83 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse85 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse81 (select .cse85 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse84 (select .cse85 c_~q1~0.base))) (or (not (= c_~i~0 (select .cse81 .cse82))) (< (select .cse81 .cse83) .cse8) (< (select .cse84 .cse7) c_~i~0) (not (= (select .cse84 .cse11) c_~j~0)))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse88 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse86 (select .cse88 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse87 (select .cse88 c_~q1~0.base))) (or (not (= c_~i~0 (select .cse86 .cse82))) (< (select .cse86 .cse83) c_~i~0) (not (= (select .cse87 .cse11) c_~j~0)) (< (select .cse87 .cse7) .cse8))))))) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 (let ((.cse92 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse91 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse34 (+ .cse92 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse90 (select .cse91 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse89 (select .cse91 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse89 .cse11))) (not (= c_~i~0 (select .cse90 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select .cse90 (+ .cse10 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse8) (< (select .cse89 .cse7) c_~i~0))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse95 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse34 (+ .cse92 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse94 (select .cse95 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse93 (select .cse95 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse93 .cse11))) (not (= c_~i~0 (select .cse94 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select .cse94 (+ .cse10 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse93 .cse7) .cse8))))))) .cse2 .cse54 .cse3 .cse4 .cse5) (or .cse0 (let ((.cse97 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse99 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse100 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse96 (select .cse100 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse98 (select .cse100 c_~q1~0.base))) (or (< (select .cse96 .cse97) .cse8) (< (select .cse98 .cse7) c_~i~0) (not (= (select .cse96 .cse99) c_~i~0)) (not (= (select .cse98 .cse11) c_~j~0)))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse103 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse101 (select .cse103 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse102 (select .cse103 c_~q1~0.base))) (or (< (select .cse101 .cse97) c_~i~0) (not (= (select .cse101 .cse99) c_~i~0)) (not (= (select .cse102 .cse11) c_~j~0)) (< (select .cse102 .cse7) .cse8))))))) .cse1 .cse2 .cse3 .cse4 .cse5))))) is different from false [2022-11-21 16:57:19,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:57:21,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:57:53,200 WARN L233 SmtUtils]: Spent 24.50s on a formula simplification. DAG size of input: 399 DAG size of output: 251 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:58:24,991 WARN L233 SmtUtils]: Spent 20.62s on a formula simplification that was a NOOP. DAG size: 383 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:58:57,200 WARN L233 SmtUtils]: Spent 19.89s on a formula simplification. DAG size of input: 406 DAG size of output: 249 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:58:59,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:59:01,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:59:03,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:59:40,918 WARN L233 SmtUtils]: Spent 31.29s on a formula simplification. DAG size of input: 385 DAG size of output: 382 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:00:24,439 WARN L233 SmtUtils]: Spent 28.15s on a formula simplification. DAG size of input: 421 DAG size of output: 249 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:00:26,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:00:28,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:01:03,954 WARN L233 SmtUtils]: Spent 25.90s on a formula simplification. DAG size of input: 387 DAG size of output: 384 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:01:43,700 WARN L233 SmtUtils]: Spent 34.64s on a formula simplification. DAG size of input: 389 DAG size of output: 385 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:02:21,198 WARN L233 SmtUtils]: Spent 29.96s on a formula simplification. DAG size of input: 391 DAG size of output: 389 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:02:26,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:02:28,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:02:30,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:02:35,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:02:38,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:03:27,281 WARN L233 SmtUtils]: Spent 38.24s on a formula simplification. DAG size of input: 399 DAG size of output: 380 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:04:06,853 WARN L233 SmtUtils]: Spent 25.20s on a formula simplification. DAG size of input: 276 DAG size of output: 269 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:04:39,079 WARN L233 SmtUtils]: Spent 21.44s on a formula simplification. DAG size of input: 405 DAG size of output: 384 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:04:59,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:06:00,035 WARN L233 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 158 DAG size of output: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)