./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/config/GemCutterReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH --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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 --- 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-38b53e6 [2022-11-25 18:51:58,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:51:58,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:51:58,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:51:58,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:51:58,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:51:58,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:51:58,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:51:58,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:51:58,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:51:58,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:51:58,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:51:58,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:51:58,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:51:58,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:51:58,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:51:58,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:51:58,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:51:58,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:51:58,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:51:58,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:51:58,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:51:58,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:51:58,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:51:58,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:51:58,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:51:58,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:51:58,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:51:58,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:51:58,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:51:58,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:51:58,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:51:58,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:51:58,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:51:58,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:51:58,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:51:58,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:51:58,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:51:58,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:51:58,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:51:58,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:51:58,840 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-25 18:51:58,865 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:51:58,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:51:58,866 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:51:58,866 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:51:58,866 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:51:58,867 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:51:58,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:51:58,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:51:58,868 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:51:58,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:51:58,868 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:51:58,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:51:58,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:51:58,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:51:58,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:51:58,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:51:58,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:51:58,869 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:51:58,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:51:58,870 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:51:58,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:51:58,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:51:58,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:51:58,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:51:58,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:51:58,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:51:58,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:51:58,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:51:58,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:51:58,872 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-25 18:51:58,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:51:58,872 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-25 18:51:58,872 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-25 18:51:58,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:51:58,873 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-25 18:51:58,873 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-25 18:51:58,873 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_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/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_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH 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 -> GemCutter 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 -> ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 [2022-11-25 18:51:59,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:51:59,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:51:59,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:51:59,133 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:51:59,134 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:51:59,135 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2022-11-25 18:52:02,304 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:52:02,569 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:52:02,570 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2022-11-25 18:52:02,577 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/data/af65f1ed2/0e1b5fe3f93647688391451a8c2dbbd6/FLAG4cbc41a8f [2022-11-25 18:52:02,590 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/data/af65f1ed2/0e1b5fe3f93647688391451a8c2dbbd6 [2022-11-25 18:52:02,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:52:02,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:52:02,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:52:02,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:52:02,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:52:02,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:52:02" (1/1) ... [2022-11-25 18:52:02,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa34685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02, skipping insertion in model container [2022-11-25 18:52:02,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:52:02" (1/1) ... [2022-11-25 18:52:02,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:52:02,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:52:02,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:52:02,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:52:02,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:52:02,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:52:02,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:52:02,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:52:02,803 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_47b2ab64-7b94-47db-971f-4f830fa499f5/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-11-25 18:52:02,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:52:02,823 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:52:02,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:52:02,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:52:02,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:52:02,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:52:02,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:52:02,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:52:02,850 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_47b2ab64-7b94-47db-971f-4f830fa499f5/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-11-25 18:52:02,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:52:02,869 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:52:02,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02 WrapperNode [2022-11-25 18:52:02,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:52:02,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:52:02,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:52:02,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:52:02,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02" (1/1) ... [2022-11-25 18:52:02,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02" (1/1) ... [2022-11-25 18:52:02,908 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-25 18:52:02,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:52:02,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:52:02,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:52:02,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:52:02,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02" (1/1) ... [2022-11-25 18:52:02,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02" (1/1) ... [2022-11-25 18:52:02,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02" (1/1) ... [2022-11-25 18:52:02,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02" (1/1) ... [2022-11-25 18:52:02,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02" (1/1) ... [2022-11-25 18:52:02,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02" (1/1) ... [2022-11-25 18:52:02,936 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02" (1/1) ... [2022-11-25 18:52:02,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02" (1/1) ... [2022-11-25 18:52:02,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:52:02,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:52:02,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:52:02,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:52:02,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02" (1/1) ... [2022-11-25 18:52:02,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:52:02,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:52:02,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:52:02,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:52:03,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:52:03,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 18:52:03,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 18:52:03,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 18:52:03,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 18:52:03,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-25 18:52:03,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-25 18:52:03,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:52:03,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:52:03,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:52:03,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:52:03,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:52:03,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:52:03,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:52:03,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:52:03,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:52:03,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:52:03,027 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:52:03,136 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:52:03,139 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:52:03,511 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:52:03,613 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:52:03,613 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 18:52:03,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:52:03 BoogieIcfgContainer [2022-11-25 18:52:03,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:52:03,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:52:03,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:52:03,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:52:03,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:52:02" (1/3) ... [2022-11-25 18:52:03,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f68283f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:52:03, skipping insertion in model container [2022-11-25 18:52:03,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:52:02" (2/3) ... [2022-11-25 18:52:03,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f68283f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:52:03, skipping insertion in model container [2022-11-25 18:52:03,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:52:03" (3/3) ... [2022-11-25 18:52:03,639 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-11-25 18:52:03,647 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:52:03,655 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:52:03,655 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:52:03,655 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:52:03,725 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-25 18:52:03,774 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:52:03,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-25 18:52:03,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:52:03,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-25 18:52:03,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-25 18:52:03,880 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-25 18:52:03,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-25 18:52:03,898 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=PARTIAL_ORDER_FA, 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;@62c92465, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:52:03,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 18:52:04,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:52:04,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:52:04,247 INFO L85 PathProgramCache]: Analyzing trace with hash -275952594, now seen corresponding path program 1 times [2022-11-25 18:52:04,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:52:04,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14256146] [2022-11-25 18:52:04,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:04,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:52:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:04,559 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-25 18:52:04,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:52:04,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14256146] [2022-11-25 18:52:04,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14256146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:52:04,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:52:04,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:52:04,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230052646] [2022-11-25 18:52:04,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:52:04,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:52:04,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:04,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:52:04,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:52:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:04,607 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:04,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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-25 18:52:04,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:04,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:52:04,667 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:52:04,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:52:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2072012938, now seen corresponding path program 1 times [2022-11-25 18:52:04,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:52:04,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696996941] [2022-11-25 18:52:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:52:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:05,539 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-25 18:52:05,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:52:05,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696996941] [2022-11-25 18:52:05,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696996941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:52:05,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:52:05,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:52:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392044083] [2022-11-25 18:52:05,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:52:05,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:52:05,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:05,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:52:05,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:52:05,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:05,549 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:05,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 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-25 18:52:05,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:05,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:05,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:05,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:05,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:52:05,867 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:52:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:52:05,868 INFO L85 PathProgramCache]: Analyzing trace with hash 439153583, now seen corresponding path program 1 times [2022-11-25 18:52:05,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:52:05,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386650816] [2022-11-25 18:52:05,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:05,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:52:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:06,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:52:06,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386650816] [2022-11-25 18:52:06,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386650816] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:52:06,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501774153] [2022-11-25 18:52:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:06,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:06,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:52:06,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:52:06,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:52:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:06,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:52:06,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:52:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:06,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:52:06,862 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-25 18:52:06,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501774153] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:52:06,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:52:06,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-25 18:52:06,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583437346] [2022-11-25 18:52:06,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:52:06,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:52:06,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:06,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:52:06,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:52:06,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:06,866 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:06,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:52:06,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:06,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:06,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:07,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:07,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:07,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:07,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:52:07,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:07,230 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:52:07,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:52:07,231 INFO L85 PathProgramCache]: Analyzing trace with hash 232719478, now seen corresponding path program 1 times [2022-11-25 18:52:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:52:07,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004426693] [2022-11-25 18:52:07,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:07,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:52:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:52:07,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004426693] [2022-11-25 18:52:07,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004426693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:52:07,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938915082] [2022-11-25 18:52:07,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:07,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:07,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:52:07,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:52:07,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:52:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:07,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:52:07,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:52:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:07,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:52:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:08,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938915082] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:52:08,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:52:08,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-11-25 18:52:08,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558239330] [2022-11-25 18:52:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:52:08,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:52:08,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:08,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:52:08,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:52:08,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:08,301 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:08,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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-25 18:52:08,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:08,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:08,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:08,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:08,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:52:08,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:52:08,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:08,738 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:52:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:52:08,738 INFO L85 PathProgramCache]: Analyzing trace with hash 100827375, now seen corresponding path program 1 times [2022-11-25 18:52:08,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:52:08,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908123846] [2022-11-25 18:52:08,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:08,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:52:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:11,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:52:11,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908123846] [2022-11-25 18:52:11,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908123846] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:52:11,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197863308] [2022-11-25 18:52:11,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:11,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:11,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:52:11,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:52:11,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:52:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:11,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-25 18:52:11,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:52:12,815 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:12,816 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 69 treesize of output 43 [2022-11-25 18:52:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:13,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:52:14,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:14,978 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 127 treesize of output 75 [2022-11-25 18:52:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:17,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197863308] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:52:17,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:52:17,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 19] total 52 [2022-11-25 18:52:17,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390755367] [2022-11-25 18:52:17,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:52:17,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 18:52:17,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:17,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 18:52:17,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=2175, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 18:52:17,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:17,214 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:17,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.865384615384615) internal successors, (305), 52 states have internal predecessors, (305), 0 states have call successors, (0), 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-25 18:52:17,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:17,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:17,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:17,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:52:17,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:52:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-25 18:52:21,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:52:21,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:21,238 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:52:21,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:52:21,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1303894886, now seen corresponding path program 2 times [2022-11-25 18:52:21,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:52:21,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248685456] [2022-11-25 18:52:21,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:21,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:52:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:21,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:52:21,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248685456] [2022-11-25 18:52:21,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248685456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:52:21,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605484705] [2022-11-25 18:52:21,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:52:21,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:21,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:52:21,727 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:52:21,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:52:21,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:52:21,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:52:21,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 18:52:21,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:52:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:52:22,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:52:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:52:23,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605484705] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:52:23,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:52:23,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2022-11-25 18:52:23,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184758761] [2022-11-25 18:52:23,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:52:23,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 18:52:23,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:23,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 18:52:23,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 18:52:23,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:23,049 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:23,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.666666666666667) internal successors, (253), 33 states have internal predecessors, (253), 0 states have call successors, (0), 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-25 18:52:23,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:23,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:23,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:23,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:52:23,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-25 18:52:23,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:52:25,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-25 18:52:25,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 18:52:25,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:52:25,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:25,659 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:52:25,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:52:25,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1964803798, now seen corresponding path program 3 times [2022-11-25 18:52:25,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:52:25,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131039149] [2022-11-25 18:52:25,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:52:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:25,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:52:25,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131039149] [2022-11-25 18:52:25,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131039149] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:52:25,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592593129] [2022-11-25 18:52:25,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:52:25,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:25,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:52:25,966 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:52:25,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:52:26,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 18:52:26,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:52:26,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:52:26,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:52:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:26,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:52:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:26,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592593129] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:52:26,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:52:26,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-25 18:52:26,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605363475] [2022-11-25 18:52:26,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:52:26,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 18:52:26,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:26,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 18:52:26,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:52:26,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:26,785 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:26,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.125) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 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-25 18:52:26,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:26,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:26,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:26,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:52:26,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-25 18:52:26,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-25 18:52:26,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:28,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:28,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:28,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:28,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:52:28,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-25 18:52:28,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 18:52:28,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:52:28,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:52:28,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:28,408 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:52:28,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:52:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1094981842, now seen corresponding path program 1 times [2022-11-25 18:52:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:52:28,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552171135] [2022-11-25 18:52:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:28,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:52:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:29,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:52:29,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552171135] [2022-11-25 18:52:29,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552171135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:52:29,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464427300] [2022-11-25 18:52:29,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:29,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:29,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:52:29,035 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:52:29,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:52:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:29,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 18:52:29,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:52:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:29,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:52:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:30,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464427300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:52:30,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:52:30,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-11-25 18:52:30,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296529447] [2022-11-25 18:52:30,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:52:30,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-25 18:52:30,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:30,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 18:52:30,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2022-11-25 18:52:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:30,182 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:30,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.435897435897436) internal successors, (290), 39 states have internal predecessors, (290), 0 states have call successors, (0), 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-25 18:52:30,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:30,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:52:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-11-25 18:52:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-25 18:52:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:52:30,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:52:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:52:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:52:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:52:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 18:52:32,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:52:32,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:32,963 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:52:32,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:52:32,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1229161583, now seen corresponding path program 4 times [2022-11-25 18:52:32,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:52:32,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272358049] [2022-11-25 18:52:32,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:32,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:52:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:35,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:52:35,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272358049] [2022-11-25 18:52:35,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272358049] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:52:35,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259581018] [2022-11-25 18:52:35,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:52:35,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:35,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:52:35,451 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:52:35,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:52:35,567 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:52:35,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:52:35,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-25 18:52:35,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:52:37,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:52:37,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 18:52:37,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:37,808 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 63 treesize of output 43 [2022-11-25 18:52:38,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:38,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:52:40,325 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~min2~0 c_~min1~0))) (and (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (<= c_~min2~0 .cse0) (= c_~min1~0 .cse0) (not (< .cse0 c_~min3~0)) (< (+ ~M~0 1) c_~N~0)))) (or .cse1 (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (< .cse2 c_~min2~0) (not (< .cse2 c_~min3~0)) (< (+ ~M~0 1) c_~N~0))))) (or (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse1 (< c_~min3~0 c_~min2~0))) (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))))) is different from false [2022-11-25 18:52:40,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:40,455 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 276 treesize of output 276 [2022-11-25 18:52:40,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 163 [2022-11-25 18:52:40,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 157 [2022-11-25 18:52:40,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 145 [2022-11-25 18:52:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:47,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259581018] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:52:47,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:52:47,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 71 [2022-11-25 18:52:47,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503678122] [2022-11-25 18:52:47,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:52:47,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-25 18:52:47,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:47,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-25 18:52:47,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=638, Invalid=4195, Unknown=1, NotChecked=136, Total=4970 [2022-11-25 18:52:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:47,315 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:47,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 4.295774647887324) internal successors, (305), 71 states have internal predecessors, (305), 0 states have call successors, (0), 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-25 18:52:47,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:47,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:47,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:47,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:52:47,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:52:47,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:52:47,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:52:47,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-25 18:52:47,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:52:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:52:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:52:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:52:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 18:52:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-25 18:52:52,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:52:52,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:52,503 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:52:52,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:52:52,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1717655339, now seen corresponding path program 5 times [2022-11-25 18:52:52,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:52:52,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675096399] [2022-11-25 18:52:52,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:52,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:52:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:55,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:52:55,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675096399] [2022-11-25 18:52:55,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675096399] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:52:55,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584706682] [2022-11-25 18:52:55,273 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:52:55,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:55,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:52:55,274 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:52:55,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 18:52:55,414 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:52:55,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:52:55,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-25 18:52:55,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:52:55,513 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-25 18:52:55,578 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:52:55,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 18:52:56,005 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 18:52:56,006 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 16 treesize of output 18 [2022-11-25 18:52:56,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:52:56,745 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-25 18:52:57,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 18:52:57,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 18:52:58,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:58,101 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 63 treesize of output 43 [2022-11-25 18:52:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:52:59,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:53:00,510 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0))) (and (or .cse0 (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int)) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse1 c_~min2~0) (not (< .cse1 c_~min3~0)) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))))) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int)) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse2) (not (< .cse2 c_~min3~0)) (<= c_~min2~0 .cse2) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))) (or (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse0 (< c_~min3~0 c_~min2~0))) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))))) is different from false [2022-11-25 18:53:06,722 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~min2~0 c_~min3~0)) (.cse2 (< c_~min3~0 c_~min2~0)) (.cse1 (= c_~min2~0 c_~min1~0))) (and (or (and (or .cse0 (= c_~min1~0 c_~min3~0)) (or .cse1 .cse2)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (< 0 ~M~0) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select (select .cse3 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< ~M~0 0))))) (or .cse0 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse4 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (= .cse4 c_~min3~0) (< 0 ~M~0) (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< ~M~0 0) (not (< .cse4 c_~min1~0))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse6 (select (select .cse8 c_~A~0.base) c_~A~0.offset))) (or (= c_~min2~0 .cse6) (not (< .cse6 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (< .cse7 c_~min2~0) (not (< .cse7 c_~min3~0))))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse9 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (<= c_~min2~0 .cse9) (< ~M~0 0) (not (< .cse9 c_~min3~0)) (= c_~min1~0 .cse9)))) (< (select (select .cse10 c_~A~0.base) c_~A~0.offset) c_~min1~0)))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse12 (select (select .cse11 c_~A~0.base) c_~A~0.offset))) (or (< 0 ~M~0) (< (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= c_~min2~0 .cse12) (< ~M~0 0) (not (< .cse12 c_~min1~0)))))) .cse2) (or .cse1 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse14 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< (select (select .cse13 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< ~M~0 0) (< .cse14 c_~min2~0) (not (< .cse14 c_~min3~0))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse16 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse15 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse15 .cse16) (< 0 ~M~0) (<= c_~min2~0 .cse15) (< ~M~0 0) (not (< .cse15 c_~min3~0))))) (not (< .cse16 c_~min1~0)))))))) is different from false [2022-11-25 18:53:08,822 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_~min2~0 c_~min1~0)) (.cse3 (<= c_~min2~0 c_~min3~0)) (.cse5 (< c_~min3~0 c_~min2~0))) (and (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0)))) (not (< .cse2 c_~min1~0)) (= c_~min2~0 .cse2))))) (or (and (or .cse3 (= c_~min1~0 c_~min3~0)) (or .cse4 .cse5)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (< 0 ~M~0) (< (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0) (< ~M~0 0) (< (select (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0))))) (or .cse4 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse7 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse7 c_~min3~0)) (< .cse7 c_~min2~0) (< (select (select .cse8 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse10 (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= .cse9 .cse10) (< 0 ~M~0) (< ~M~0 0) (<= c_~min2~0 .cse10) (not (< .cse10 c_~min3~0))))) (not (< .cse9 c_~min1~0)))))) (or .cse3 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< 0 ~M~0) (< (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0) (< ~M~0 0) (not (< .cse13 c_~min1~0)) (= .cse13 c_~min3~0)))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< 0 ~M~0) (< (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0) (< ~M~0 0) (not (< .cse15 c_~min1~0)) (= c_~min2~0 .cse15))))) .cse5) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse16 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= c_~min1~0 .cse16) (< 0 ~M~0) (< ~M~0 0) (<= c_~min2~0 .cse16) (not (< .cse16 c_~min3~0))))) (< (select (select .cse17 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))))) is different from false [2022-11-25 18:53:09,286 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (<= c_~min2~0 c_~min3~0)) (.cse2 (< c_~min3~0 c_~min2~0)) (.cse11 (= c_~min2~0 c_~min1~0))) (and (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min2~0 .cse0) (< 0 ~M~0) (< ~M~0 0) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (not (< .cse0 c_~min1~0)))))) .cse2) (or .cse3 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< 0 ~M~0) (= .cse4 c_~min3~0) (< ~M~0 0) (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (not (< .cse4 c_~min1~0))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min2~0 .cse6) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse7 c_~min3~0)) (< .cse7 c_~min2~0)))) (not (< .cse6 c_~min1~0)))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse9 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse9 c_~min3~0)) (<= c_~min2~0 .cse9) (= c_~min1~0 .cse9)))) (< (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0)))) (or (and (or .cse3 (= c_~min1~0 c_~min3~0)) (or .cse11 .cse2)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (< (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (< (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse14 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse13 .cse14) (< 0 ~M~0) (< ~M~0 0) (not (< .cse14 c_~min3~0)) (<= c_~min2~0 .cse14)))) (not (< .cse13 c_~min1~0)))))) (or .cse11 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse17 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse17 c_~min3~0)) (< .cse17 c_~min2~0)))))))) is different from false [2022-11-25 18:53:09,542 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (<= c_~min2~0 c_~min3~0)) (.cse5 (< c_~min3~0 c_~min2~0)) (.cse11 (= c_~min2~0 c_~min1~0))) (and (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< 0 ~M~0) (<= c_~min2~0 .cse0) (< ~M~0 0) (not (< .cse0 c_~min3~0)) (= c_~min1~0 .cse0)))) (< (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (or .cse2 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse3 c_~min1~0)) (= c_~min3~0 .cse3) (< 0 ~M~0) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< ~M~0 0)))))) (or .cse5 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse6 c_~min1~0)) (< 0 ~M~0) (= c_~min2~0 .cse6) (< (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< ~M~0 0)))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse8 c_~min1~0)) (= c_~min2~0 .cse8) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse9 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse9 c_~min3~0)) (< .cse9 c_~min2~0)))))))) (or (and (or .cse2 (= c_~min1~0 c_~min3~0)) (or .cse11 .cse5)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (< 0 ~M~0) (< (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< ~M~0 0) (< (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse13 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse14 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< 0 ~M~0) (<= c_~min2~0 .cse14) (< ~M~0 0) (not (< .cse14 c_~min3~0)) (= .cse14 .cse13)))))))) (or .cse11 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse16 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse16 c_~min3~0)) (< .cse16 c_~min2~0) (< (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))))))) is different from false [2022-11-25 18:53:10,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:53:10,701 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 1 case distinctions, treesize of input 78 treesize of output 54 [2022-11-25 18:53:10,715 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:53:10,715 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 189 treesize of output 177 [2022-11-25 18:53:10,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2022-11-25 18:53:10,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 100 [2022-11-25 18:53:10,749 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:53:10,750 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 82 treesize of output 76 [2022-11-25 18:53:10,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:53:10,932 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 1 case distinctions, treesize of input 120 treesize of output 84 [2022-11-25 18:53:10,954 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:53:10,955 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 930 treesize of output 882 [2022-11-25 18:53:10,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 861 treesize of output 789 [2022-11-25 18:53:11,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:53:11,015 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 552 treesize of output 514 [2022-11-25 18:53:11,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 753 treesize of output 609 [2022-11-25 18:53:12,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:53:12,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 64 [2022-11-25 18:53:12,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:53:12,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:53:12,171 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:53:12,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 67 [2022-11-25 18:53:12,186 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:53:12,187 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 47 treesize of output 37 [2022-11-25 18:53:12,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:53:12,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2022-11-25 18:53:12,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:53:12,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:53:12,274 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:53:12,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 63 [2022-11-25 18:53:12,289 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:53:12,290 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 43 treesize of output 37 [2022-11-25 18:53:12,359 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:53:12,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 1 [2022-11-25 18:53:12,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:53:12,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2022-11-25 18:53:12,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:53:12,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:53:12,390 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:53:12,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2022-11-25 18:53:12,425 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:53:12,426 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 23 treesize of output 19 [2022-11-25 18:53:12,459 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:53:12,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 1 [2022-11-25 18:53:13,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-11-25 18:53:13,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-11-25 18:53:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 18:53:14,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584706682] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:53:14,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:53:14,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 27] total 75 [2022-11-25 18:53:14,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067026816] [2022-11-25 18:53:14,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:53:14,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-25 18:53:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:53:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-25 18:53:14,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=4193, Unknown=17, NotChecked=700, Total=5550 [2022-11-25 18:53:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:14,037 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:53:14,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.413333333333333) internal successors, (331), 75 states have internal predecessors, (331), 0 states have call successors, (0), 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-25 18:53:14,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:14,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:53:14,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:53:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:53:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:53:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:53:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:53:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-25 18:53:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-25 18:53:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:54:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:54:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:54:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:54:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-25 18:54:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:54:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:54:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-25 18:54:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-25 18:54:34,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 18:54:35,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 18:54:35,143 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:54:35,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:54:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1206971023, now seen corresponding path program 6 times [2022-11-25 18:54:35,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:54:35,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041340177] [2022-11-25 18:54:35,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:54:35,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:54:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:54:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:54:35,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:54:35,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041340177] [2022-11-25 18:54:35,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041340177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:54:35,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320189644] [2022-11-25 18:54:35,521 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 18:54:35,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:54:35,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:54:35,527 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:54:35,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 18:54:35,690 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-25 18:54:35,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:54:35,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:54:35,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:54:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 18:54:36,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:54:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 18:54:36,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320189644] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:54:36,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:54:36,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-11-25 18:54:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078090150] [2022-11-25 18:54:36,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:54:36,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 18:54:36,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:54:36,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 18:54:36,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2022-11-25 18:54:36,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:36,364 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:54:36,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.275862068965518) internal successors, (240), 29 states have internal predecessors, (240), 0 states have call successors, (0), 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-25 18:54:36,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:36,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:54:36,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:54:36,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:54:36,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:54:36,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-25 18:54:36,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:54:36,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:54:36,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-25 18:54:36,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2022-11-25 18:54:36,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:54:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:54:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:54:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:54:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:54:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:54:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:54:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-25 18:54:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-25 18:54:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-25 18:54:41,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:54:41,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:54:41,201 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:54:41,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:54:41,201 INFO L85 PathProgramCache]: Analyzing trace with hash 333021814, now seen corresponding path program 7 times [2022-11-25 18:54:41,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:54:41,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045945890] [2022-11-25 18:54:41,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:54:41,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:54:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:54:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:54:45,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:54:45,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045945890] [2022-11-25 18:54:45,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045945890] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:54:45,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573787445] [2022-11-25 18:54:45,758 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 18:54:45,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:54:45,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:54:45,759 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:54:45,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 18:54:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:54:45,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-25 18:54:45,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:54:49,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:54:49,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:54:49,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 108 [2022-11-25 18:54:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:54:51,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:54:57,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:54:57,046 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 621 treesize of output 265 [2022-11-25 18:55:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:55:02,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573787445] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:55:02,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:55:02,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 27] total 81 [2022-11-25 18:55:02,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697703344] [2022-11-25 18:55:02,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:55:02,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-25 18:55:02,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:55:02,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-25 18:55:02,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=5859, Unknown=0, NotChecked=0, Total=6480 [2022-11-25 18:55:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:02,594 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:55:02,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 4.518518518518518) internal successors, (366), 81 states have internal predecessors, (366), 0 states have call successors, (0), 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-25 18:55:02,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:02,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:55:02,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:55:02,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:55:02,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:55:02,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:55:02,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:55:02,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:55:02,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-25 18:55:02,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2022-11-25 18:55:02,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-11-25 18:55:02,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:17,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:55:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:55:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:55:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:55:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:55:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:55:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:55:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-25 18:55:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-25 18:55:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-25 18:55:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-25 18:55:17,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:55:17,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 18:55:17,554 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:55:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:55:17,555 INFO L85 PathProgramCache]: Analyzing trace with hash 648238083, now seen corresponding path program 8 times [2022-11-25 18:55:17,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:55:17,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738539612] [2022-11-25 18:55:17,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:55:17,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:55:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:55:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:55:17,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:55:17,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738539612] [2022-11-25 18:55:17,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738539612] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:55:17,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027246420] [2022-11-25 18:55:17,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:55:17,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:55:17,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:55:17,903 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:55:17,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 18:55:18,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:55:18,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:55:18,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 18:55:18,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:55:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:55:18,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:55:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:55:19,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027246420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:55:19,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:55:19,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-11-25 18:55:19,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072010041] [2022-11-25 18:55:19,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:55:19,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 18:55:19,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:55:19,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 18:55:19,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 18:55:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:19,030 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:55:19,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.647058823529412) internal successors, (260), 34 states have internal predecessors, (260), 0 states have call successors, (0), 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-25 18:55:19,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:19,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:55:19,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:55:19,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:55:19,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:55:19,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:55:19,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:55:19,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:55:19,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-25 18:55:19,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2022-11-25 18:55:19,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-11-25 18:55:19,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-11-25 18:55:19,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:55:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:55:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:55:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:55:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:55:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:55:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:55:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-25 18:55:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-11-25 18:55:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-25 18:55:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-25 18:55:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:55:25,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 18:55:25,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 18:55:25,592 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:55:25,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:55:25,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1304833281, now seen corresponding path program 2 times [2022-11-25 18:55:25,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:55:25,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326557554] [2022-11-25 18:55:25,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:55:25,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:55:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:55:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:55:25,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:55:25,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326557554] [2022-11-25 18:55:25,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326557554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:55:25,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24654976] [2022-11-25 18:55:25,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:55:25,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:55:25,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:55:25,883 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:55:25,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 18:55:26,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:55:26,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:55:26,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:55:26,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:55:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 18:55:26,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:55:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 18:55:26,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24654976] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:55:26,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:55:26,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-11-25 18:55:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859924589] [2022-11-25 18:55:26,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:55:26,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 18:55:26,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:55:26,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 18:55:26,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-11-25 18:55:26,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:26,739 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:55:26,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.275862068965518) internal successors, (240), 29 states have internal predecessors, (240), 0 states have call successors, (0), 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-25 18:55:26,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:26,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:55:26,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:55:26,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:55:26,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:55:26,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:55:26,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:55:26,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:55:26,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-11-25 18:55:26,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2022-11-25 18:55:26,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-11-25 18:55:26,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-25 18:55:26,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:55:26,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:55:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:55:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:55:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:55:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:55:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:55:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:55:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-25 18:55:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-11-25 18:55:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-25 18:55:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:55:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:55:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-25 18:55:33,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 18:55:33,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:55:33,558 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:55:33,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:55:33,559 INFO L85 PathProgramCache]: Analyzing trace with hash 6681437, now seen corresponding path program 1 times [2022-11-25 18:55:33,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:55:33,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813739085] [2022-11-25 18:55:33,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:55:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:55:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:55:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:55:33,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:55:33,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813739085] [2022-11-25 18:55:33,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813739085] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:55:33,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577981768] [2022-11-25 18:55:33,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:55:33,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:55:33,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:55:33,810 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:55:33,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 18:55:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:55:33,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:55:33,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:55:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:55:34,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:55:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:55:34,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577981768] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:55:34,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:55:34,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-25 18:55:34,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924608925] [2022-11-25 18:55:34,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:55:34,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 18:55:34,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:55:34,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 18:55:34,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:55:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:34,560 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:55:34,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.5) internal successors, (228), 24 states have internal predecessors, (228), 0 states have call successors, (0), 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-25 18:55:34,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:34,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:55:34,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:55:34,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:55:34,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:55:34,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:55:34,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:55:34,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:55:34,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-11-25 18:55:34,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2022-11-25 18:55:34,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-11-25 18:55:34,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:55:34,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:55:34,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-11-25 18:55:34,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:55:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:55:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:55:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:55:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:55:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:55:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:55:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-25 18:55:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-11-25 18:55:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:55:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:55:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:55:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-25 18:55:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:55:35,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-25 18:55:35,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:55:35,354 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:55:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:55:35,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1755799160, now seen corresponding path program 2 times [2022-11-25 18:55:35,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:55:35,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541626907] [2022-11-25 18:55:35,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:55:35,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:55:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:55:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:55:39,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:55:39,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541626907] [2022-11-25 18:55:39,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541626907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:55:39,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630678209] [2022-11-25 18:55:39,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:55:39,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:55:39,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:55:39,277 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:55:39,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b2ab64-7b94-47db-971f-4f830fa499f5/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 18:55:39,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:55:39,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:55:39,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 18:55:39,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:55:40,576 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 13 treesize of output 9 [2022-11-25 18:55:41,209 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-25 18:55:41,480 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-25 18:55:41,753 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-25 18:55:43,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:55:43,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:43,480 INFO L321 Elim1Store]: treesize reduction 28, result has 68.2 percent of original size [2022-11-25 18:55:43,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 139 [2022-11-25 18:55:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:55:46,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:56:38,280 WARN L233 SmtUtils]: Spent 35.35s on a formula simplification that was a NOOP. DAG size: 167 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:57:43,562 WARN L233 SmtUtils]: Spent 51.65s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:57:46,222 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse103 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse41 (+ c_~min3~0 1))) (let ((.cse25 (<= c_~min2~0 c_~min3~0)) (.cse55 (= c_~min1~0 c_~min3~0)) (.cse0 (= c_~min2~0 c_~min1~0)) (.cse11 (<= .cse41 c_~min2~0)) (.cse4 (+ c_thread1Thread1of1ForFork2_~i~0 1)) (.cse5 (+ c_~A~0.offset .cse103)) (.cse2 (+ c_~A~0.offset .cse103 4))) (and (or .cse0 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse3 (select .cse1 (+ c_~A~0.offset (* ~M~0 4))))) (or (< (select .cse1 c_~A~0.offset) c_~min2~0) (< (select .cse1 .cse2) c_~min1~0) (not (< 0 ~M~0)) (not (< .cse3 c_~min3~0)) (< .cse4 ~M~0) (<= (+ .cse3 1) c_~min2~0) (< (select .cse1 .cse5) c_~min1~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse6 (select .cse10 .cse5)) (.cse8 (select .cse10 c_~A~0.offset)) (.cse7 (select .cse10 .cse2))) (or (not (< .cse6 c_~min1~0)) (not (< .cse7 .cse6)) (not (< .cse8 c_~min2~0)) (forall ((~M~0 Int)) (let ((.cse9 (select .cse10 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse9 c_~min3~0)) (<= .cse8 .cse9) (= .cse7 .cse9) (< .cse4 ~M~0)))))))) (or .cse11 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse2))) (or (= c_~min2~0 .cse12) (< (select .cse13 c_~A~0.offset) c_~min2~0) (not (< 0 ~M~0)) (not (< .cse12 c_~min1~0)) (< .cse4 ~M~0) (< (select .cse13 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse13 .cse5) c_~min1~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse15 (select .cse14 c_~A~0.offset))) (or (< (select .cse14 .cse2) c_~min1~0) (not (< .cse15 c_~min2~0)) (< (select .cse14 .cse5) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse16 (select .cse14 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse16 c_~min3~0)) (<= .cse15 .cse16) (< .cse4 ~M~0) (= c_~min1~0 .cse16)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse18 (select .cse19 c_~A~0.offset)) (.cse17 (select .cse19 .cse5))) (or (not (< .cse17 c_~min1~0)) (not (< .cse18 c_~min2~0)) (< (select .cse19 .cse2) .cse17) (forall ((~M~0 Int)) (let ((.cse20 (select .cse19 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse20 c_~min3~0)) (<= .cse18 .cse20) (< .cse4 ~M~0) (= .cse17 .cse20)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse22 (select .cse21 .cse5)) (.cse23 (select .cse21 .cse2))) (or (< (select .cse21 c_~A~0.offset) c_~min2~0) (not (< .cse22 c_~min1~0)) (not (< .cse23 .cse22)) (forall ((~M~0 Int)) (let ((.cse24 (select .cse21 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= c_~min2~0 .cse24) (not (< 0 ~M~0)) (not (< .cse24 c_~min3~0)) (= .cse23 .cse24) (< .cse4 ~M~0)))))))) (or .cse25 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse27 (select .cse26 .cse5))) (or (< (select .cse26 c_~A~0.offset) c_~min2~0) (not (< 0 ~M~0)) (not (< .cse27 c_~min1~0)) (< .cse4 ~M~0) (= .cse27 c_~min3~0) (< (select .cse26 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse26 .cse2) .cse27)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse29 (select .cse28 .cse2))) (or (< (select .cse28 c_~A~0.offset) c_~min2~0) (not (< .cse29 c_~min1~0)) (< (select .cse28 .cse5) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse30 (select .cse28 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= c_~min2~0 .cse30) (not (< 0 ~M~0)) (not (< .cse30 c_~min3~0)) (= .cse29 .cse30) (< .cse4 ~M~0)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse32 (select .cse33 c_~A~0.offset)) (.cse31 (select .cse33 .cse2))) (or (not (< .cse31 c_~min1~0)) (not (< .cse32 c_~min2~0)) (< (select .cse33 .cse5) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse34 (select .cse33 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse34 c_~min3~0)) (<= .cse32 .cse34) (= .cse31 .cse34) (< .cse4 ~M~0)))))))) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse4 ~M~0) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse35 (select .cse37 .cse5)) (.cse36 (select .cse37 c_~A~0.offset))) (or (not (< .cse35 c_~min1~0)) (= .cse35 c_~min3~0) (not (< .cse36 c_~min2~0)) (< (select .cse37 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse37 .cse2) .cse35) (<= .cse36 c_~min3~0))))))) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse4 ~M~0) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse39 (select .cse42 .cse2)) (.cse40 (select .cse42 .cse5)) (.cse38 (select .cse42 c_~A~0.offset))) (or (= .cse38 .cse39) (not (< .cse40 c_~min1~0)) (<= .cse41 .cse38) (not (< .cse39 .cse40)) (not (< .cse38 c_~min2~0)) (< (select .cse42 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse45 (select .cse44 .cse2)) (.cse46 (select .cse44 .cse5))) (or (forall ((~M~0 Int)) (let ((.cse43 (select .cse44 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse43 c_~min3~0)) (< .cse4 ~M~0) (<= (+ .cse43 1) c_~min2~0)))) (= c_~min2~0 .cse45) (< (select .cse44 c_~A~0.offset) c_~min2~0) (not (< .cse46 c_~min1~0)) (not (< .cse45 .cse46)))))) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse4 ~M~0) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse49 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse47 (select .cse49 .cse2)) (.cse48 (select .cse49 c_~A~0.offset))) (or (not (< .cse47 c_~min1~0)) (= c_~min3~0 .cse47) (not (< .cse48 c_~min2~0)) (< (select .cse49 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse49 .cse5) c_~min1~0) (<= .cse48 c_~min3~0))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse51 (select .cse50 c_~A~0.offset))) (or (< (select .cse50 .cse2) c_~min1~0) (= c_~min1~0 .cse51) (not (< .cse51 c_~min2~0)) (< (select .cse50 .cse5) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse52 (select .cse50 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse52 c_~min3~0)) (< .cse4 ~M~0) (<= (+ .cse52 1) .cse51)))))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse53 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse54 (select .cse53 c_~A~0.offset))) (or (< (select .cse53 .cse2) c_~min1~0) (not (< 0 ~M~0)) (< .cse4 ~M~0) (not (< .cse54 c_~min2~0)) (< (select .cse53 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse53 .cse5) c_~min1~0) (<= .cse54 c_~min3~0))))) .cse55) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse4 ~M~0) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse59 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse56 (select .cse59 .cse2)) (.cse57 (select .cse59 .cse5)) (.cse58 (select .cse59 c_~A~0.offset))) (or (= c_~min3~0 .cse56) (not (< .cse57 c_~min1~0)) (not (< .cse56 .cse57)) (not (< .cse58 c_~min2~0)) (< (select .cse59 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (<= .cse58 c_~min3~0))))))) (or .cse25 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse60 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse61 (select .cse60 .cse2))) (or (< (select .cse60 c_~A~0.offset) c_~min2~0) (not (< 0 ~M~0)) (not (< .cse61 c_~min1~0)) (= c_~min3~0 .cse61) (< .cse4 ~M~0) (< (select .cse60 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse60 .cse5) c_~min1~0)))))) (or .cse25 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse62 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse63 (select .cse62 .cse2)) (.cse64 (select .cse62 .cse5))) (or (< (select .cse62 c_~A~0.offset) c_~min2~0) (not (< 0 ~M~0)) (= c_~min3~0 .cse63) (not (< .cse64 c_~min1~0)) (< .cse4 ~M~0) (not (< .cse63 .cse64)) (< (select .cse62 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse65 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse66 (select .cse65 .cse5))) (or (< (select .cse65 c_~A~0.offset) c_~min2~0) (not (< 0 ~M~0)) (= c_~min2~0 .cse66) (not (< .cse66 c_~min1~0)) (< .cse4 ~M~0) (< (select .cse65 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse65 .cse2) .cse66))))) .cse11) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse68 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse69 (select .cse68 .cse2))) (or (forall ((~M~0 Int)) (let ((.cse67 (select .cse68 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse67 c_~min3~0)) (< .cse4 ~M~0) (<= (+ .cse67 1) c_~min2~0)))) (= c_~min2~0 .cse69) (< (select .cse68 c_~A~0.offset) c_~min2~0) (not (< .cse69 c_~min1~0)) (< (select .cse68 .cse5) c_~min1~0))))) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse72 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse70 (select .cse72 .cse2)) (.cse71 (select .cse72 c_~A~0.offset))) (or (not (< .cse70 c_~min1~0)) (= .cse71 .cse70) (<= .cse41 .cse71) (not (< .cse71 c_~min2~0)) (< (select .cse72 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse72 .cse5) c_~min1~0))))) (not (< 0 ~M~0)) (< .cse4 ~M~0))) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse4 ~M~0) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse75 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse74 (select .cse75 c_~A~0.offset)) (.cse73 (select .cse75 .cse5))) (or (= .cse73 .cse74) (not (< .cse73 c_~min1~0)) (<= .cse41 .cse74) (not (< .cse74 c_~min2~0)) (< (select .cse75 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse75 .cse2) .cse73))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse77 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse78 (select .cse77 .cse5))) (or (forall ((~M~0 Int)) (let ((.cse76 (select .cse77 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse76 c_~min3~0)) (< .cse4 ~M~0) (<= (+ .cse76 1) c_~min2~0)))) (< (select .cse77 c_~A~0.offset) c_~min2~0) (= c_~min2~0 .cse78) (not (< .cse78 c_~min1~0)) (< (select .cse77 .cse2) .cse78))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse79 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (or (< (select .cse79 c_~A~0.offset) c_~min2~0) (< (select .cse79 .cse2) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse80 (select .cse79 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= c_~min2~0 .cse80) (not (< 0 ~M~0)) (not (< .cse80 c_~min3~0)) (< .cse4 ~M~0) (= c_~min1~0 .cse80)))) (< (select .cse79 .cse5) c_~min1~0)))) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse81 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse82 (select .cse81 c_~A~0.offset))) (or (< (select .cse81 .cse2) c_~min1~0) (= c_~min1~0 .cse82) (<= .cse41 .cse82) (not (< .cse82 c_~min2~0)) (< (select .cse81 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse81 .cse5) c_~min1~0))))) (< .cse4 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse85 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse83 (select .cse85 .cse5)) (.cse84 (select .cse85 c_~A~0.offset))) (or (= .cse83 .cse84) (not (< .cse83 c_~min1~0)) (not (< .cse84 c_~min2~0)) (< (select .cse85 .cse2) .cse83) (forall ((~M~0 Int)) (let ((.cse86 (select .cse85 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse86 c_~min3~0)) (< .cse4 ~M~0) (<= (+ .cse86 1) .cse84)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse87 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse89 (select .cse87 .cse5))) (or (< (select .cse87 c_~A~0.offset) c_~min2~0) (forall ((~M~0 Int)) (let ((.cse88 (select .cse87 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= c_~min2~0 .cse88) (not (< 0 ~M~0)) (not (< .cse88 c_~min3~0)) (< .cse4 ~M~0) (= .cse89 .cse88)))) (not (< .cse89 c_~min1~0)) (< (select .cse87 .cse2) .cse89))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse92 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse90 (select .cse92 .cse2)) (.cse91 (select .cse92 c_~A~0.offset))) (or (not (< .cse90 c_~min1~0)) (= .cse91 .cse90) (not (< .cse91 c_~min2~0)) (< (select .cse92 .cse5) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse93 (select .cse92 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse93 c_~min3~0)) (< .cse4 ~M~0) (<= (+ .cse93 1) .cse91)))))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse94 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (or (< (select .cse94 c_~A~0.offset) c_~min2~0) (< (select .cse94 .cse2) c_~min1~0) (not (< 0 ~M~0)) (< .cse4 ~M~0) (< (select .cse94 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse94 .cse5) c_~min1~0)))) (and (or .cse25 .cse55) (or .cse0 .cse11))) (or .cse11 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse96 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse95 (select .cse96 .cse2)) (.cse97 (select .cse96 .cse5))) (or (= c_~min2~0 .cse95) (< (select .cse96 c_~A~0.offset) c_~min2~0) (not (< 0 ~M~0)) (not (< .cse97 c_~min1~0)) (< .cse4 ~M~0) (not (< .cse95 .cse97)) (< (select .cse96 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse102 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse99 (select .cse102 .cse2)) (.cse100 (select .cse102 .cse5)) (.cse98 (select .cse102 c_~A~0.offset))) (or (= .cse98 .cse99) (not (< .cse100 c_~min1~0)) (not (< .cse99 .cse100)) (not (< .cse98 c_~min2~0)) (forall ((~M~0 Int)) (let ((.cse101 (select .cse102 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse101 c_~min3~0)) (< .cse4 ~M~0) (<= (+ .cse101 1) .cse98))))))))))) is different from false [2022-11-25 18:57:52,374 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (+ c_~min3~0 1))) (let ((.cse3 (+ c_~A~0.offset 4)) (.cse4 (<= c_~min2~0 c_~min3~0)) (.cse22 (= c_~min1~0 c_~min3~0)) (.cse21 (= c_~min2~0 c_~min1~0)) (.cse15 (<= .cse13 c_~min2~0))) (and (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset))) (or (= c_~min1~0 .cse0) (forall ((~M~0 Int)) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse1 c_~min3~0)) (<= (+ .cse1 1) .cse0) (< 1 ~M~0)))) (not (< .cse0 c_~min2~0)) (< .cse0 c_~min1~0) (< (select .cse2 .cse3) c_~min1~0))))) (or .cse4 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse5 (select .cse7 c_~A~0.offset)) (.cse6 (select .cse7 .cse3))) (or (not (< .cse5 c_~min1~0)) (< .cse5 c_~min2~0) (not (< 0 ~M~0)) (not (< .cse6 .cse5)) (< (select .cse7 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= .cse6 c_~min3~0) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse8 (select .cse11 c_~A~0.offset)) (.cse9 (select .cse11 .cse3))) (or (not (< .cse8 c_~min1~0)) (< .cse8 c_~min2~0) (not (< .cse9 .cse8)) (forall ((~M~0 Int)) (let ((.cse10 (select .cse11 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse10 c_~min3~0)) (<= (+ .cse10 1) c_~min2~0) (< 1 ~M~0)))) (= c_~min2~0 .cse9))))) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< 1 ~M~0) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse12 (select .cse14 c_~A~0.offset))) (or (= c_~min1~0 .cse12) (<= .cse13 .cse12) (not (< .cse12 c_~min2~0)) (< .cse12 c_~min1~0) (< (select .cse14 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0))))))) (or .cse15 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse3))) (or (not (< 0 ~M~0)) (not (< .cse16 c_~min1~0)) (< (select .cse17 c_~A~0.offset) c_~min1~0) (< (select .cse17 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= c_~min2~0 .cse16) (< 1 ~M~0)))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse19 (select .cse20 (+ c_~A~0.offset (* ~M~0 4)))) (.cse18 (select .cse20 c_~A~0.offset))) (or (< .cse18 c_~min2~0) (not (< 0 ~M~0)) (not (< .cse19 c_~min3~0)) (<= (+ .cse19 1) c_~min2~0) (< .cse18 c_~min1~0) (< (select .cse20 .cse3) c_~min1~0) (< 1 ~M~0))))) .cse21) (or .cse22 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse23 (select .cse24 c_~A~0.offset))) (or (not (< 0 ~M~0)) (not (< .cse23 c_~min2~0)) (< .cse23 c_~min1~0) (< (select .cse24 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse24 .cse3) c_~min1~0) (< 1 ~M~0) (<= .cse23 c_~min3~0)))))) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse26 (select .cse27 c_~A~0.offset)) (.cse25 (select .cse27 .cse3))) (or (not (< .cse25 c_~min1~0)) (not (< .cse26 c_~min2~0)) (< .cse26 c_~min1~0) (< (select .cse27 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= .cse25 c_~min3~0))))) (< 1 ~M~0))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse28 (select .cse29 c_~A~0.offset))) (or (not (< .cse28 c_~min1~0)) (< .cse28 c_~min2~0) (not (< 0 ~M~0)) (< (select .cse29 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= c_~min2~0 .cse28) (< (select .cse29 .cse3) .cse28) (< 1 ~M~0))))) .cse15) (or .cse4 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse30 (select .cse31 c_~A~0.offset))) (or (not (< .cse30 c_~min1~0)) (< .cse30 c_~min2~0) (not (< 0 ~M~0)) (< (select .cse31 .cse3) .cse30) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse33 (select .cse34 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse32 (select .cse34 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse32 c_~min3~0)) (<= .cse33 .cse32) (= c_~min1~0 .cse32) (< 1 ~M~0)))) (not (< .cse33 c_~min2~0)) (< .cse33 c_~min1~0) (< (select .cse34 .cse3) c_~min1~0))))) (or .cse4 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse35 (select .cse37 c_~A~0.offset)) (.cse36 (select .cse37 .cse3))) (or (< .cse35 c_~min2~0) (not (< 0 ~M~0)) (not (< .cse36 c_~min1~0)) (< .cse35 c_~min1~0) (< (select .cse37 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= .cse36 c_~min3~0) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse41 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse38 (select .cse41 c_~A~0.offset)) (.cse39 (select .cse41 .cse3))) (or (< .cse38 c_~min2~0) (not (< .cse39 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse40 (select .cse41 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse40 c_~min3~0)) (<= (+ .cse40 1) c_~min2~0) (< 1 ~M~0)))) (< .cse38 c_~min1~0) (= c_~min2~0 .cse39))))) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse43 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse42 (select .cse43 c_~A~0.offset))) (or (<= c_~min2~0 .cse42) (< (select .cse43 .cse3) .cse42) (<= .cse42 c_~min3~0) (<= c_~min1~0 .cse42))))) (< 1 ~M~0))) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse46 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse44 (select .cse46 c_~A~0.offset)) (.cse45 (select .cse46 .cse3))) (or (not (< .cse44 c_~min1~0)) (not (< .cse45 .cse44)) (not (< .cse44 c_~min2~0)) (< (select .cse46 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= .cse45 c_~min3~0))))) (< 1 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse47 (select .cse48 c_~A~0.offset))) (or (not (< .cse47 c_~min1~0)) (< .cse47 c_~min2~0) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (not (< (select .cse48 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)) (< 1 ~M~0))) (= c_~min2~0 .cse47) (< (select .cse48 .cse3) .cse47))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse51 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse49 (select .cse51 c_~A~0.offset))) (or (< .cse49 c_~min2~0) (forall ((~M~0 Int)) (let ((.cse50 (select .cse51 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= c_~min2~0 .cse50) (not (< 0 ~M~0)) (not (< .cse50 c_~min3~0)) (= c_~min1~0 .cse50) (< 1 ~M~0)))) (< .cse49 c_~min1~0) (< (select .cse51 .cse3) c_~min1~0))))) (or .cse15 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse54 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse52 (select .cse54 c_~A~0.offset)) (.cse53 (select .cse54 .cse3))) (or (not (< .cse52 c_~min1~0)) (not (< 0 ~M~0)) (not (< .cse53 .cse52)) (< (select .cse54 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= c_~min2~0 .cse53) (< 1 ~M~0)))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (let ((.cse56 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base))) (let ((.cse55 (select .cse56 c_~A~0.offset))) (or (< .cse55 c_~min2~0) (not (< 0 ~M~0)) (< .cse55 c_~min1~0) (< (select .cse56 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse56 .cse3) c_~min1~0) (< 1 ~M~0))))) (and (or .cse4 .cse22) (or .cse21 .cse15)))))) is different from false [2022-11-25 18:58:15,498 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ c_~min3~0 1))) (let ((.cse28 (<= c_~min2~0 c_~min3~0)) (.cse25 (= c_~min1~0 c_~min3~0)) (.cse51 (= c_~min2~0 c_~min1~0)) (.cse8 (<= .cse18 c_~min2~0)) (.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< (select .cse0 .cse1) .cse2) (<= c_~min1~0 .cse2) (<= .cse2 c_~min3~0) (<= c_~min2~0 .cse2))))) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int) (v_ArrVal_511 (Array Int Int))) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse3 (select .cse5 .cse1)) (.cse4 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse3 .cse4)) (< (select .cse5 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (= c_~min3~0 .cse3) (not (< .cse4 c_~min2~0)) (not (< .cse4 c_~min1~0)))))) (< 1 ~M~0))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse7 (select .cse6 .cse1))) (or (< (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (= c_~min2~0 .cse7) (< (select .cse6 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (not (< 0 ~M~0)) (not (< .cse7 c_~min1~0)) (< 1 ~M~0))))) .cse8) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< (select .cse9 .cse1) .cse10) (not (< .cse10 c_~min1~0)) (= c_~min2~0 .cse10) (< .cse10 c_~min2~0) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (not (< (select .cse9 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0)) (< 1 ~M~0))))))) (or .cse8 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< (select .cse11 .cse1) .cse12) (< (select .cse11 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (not (< 0 ~M~0)) (not (< .cse12 c_~min1~0)) (= c_~min2~0 .cse12) (< .cse12 c_~min2~0) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse13 c_~min1~0) (< (select .cse14 .cse1) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse15 (select .cse14 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< 0 ~M~0)) (<= (+ .cse15 1) .cse13) (not (< .cse15 c_~min3~0)) (< 1 ~M~0)))) (not (< .cse13 c_~min2~0)) (= c_~min1~0 .cse13))))) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int) (v_ArrVal_511 (Array Int Int))) (or (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse16 c_~min1~0) (< (select .cse17 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (not (< .cse16 c_~min2~0)) (= c_~min1~0 .cse16) (<= .cse18 .cse16))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (forall ((v_ArrVal_512 (Array Int Int)) (~M~0 Int) (v_ArrVal_511 (Array Int Int))) (or (not (< 0 ~M~0)) (< 1 ~M~0) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse21 (select .cse20 .cse1))) (or (< .cse19 c_~min1~0) (< (select .cse20 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (= c_~min3~0 .cse21) (not (< .cse19 c_~min2~0)) (not (< .cse21 c_~min1~0)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse22 c_~min1~0) (< (select .cse23 .cse1) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse24 (select .cse23 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= c_~min1~0 .cse24) (not (< 0 ~M~0)) (<= c_~min2~0 .cse24) (not (< .cse24 c_~min3~0)) (< 1 ~M~0)))) (< .cse22 c_~min2~0))))) (or .cse25 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse26 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse26 c_~min1~0) (< (select .cse27 .cse1) c_~min1~0) (< (select .cse27 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (not (< 0 ~M~0)) (<= .cse26 c_~min3~0) (not (< .cse26 c_~min2~0)) (< 1 ~M~0)))))) (or .cse28 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse29 (select .cse31 .cse1)) (.cse30 (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse29 .cse30)) (< (select .cse31 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (not (< 0 ~M~0)) (= c_~min3~0 .cse29) (not (< .cse30 c_~min1~0)) (< .cse30 c_~min2~0) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse32 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse32 c_~min1~0) (< (select .cse33 .cse1) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse34 (select .cse33 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= c_~min1~0 .cse34) (not (< 0 ~M~0)) (not (< .cse34 c_~min3~0)) (< 1 ~M~0) (<= .cse32 .cse34)))) (not (< .cse32 c_~min2~0)))))) (or .cse28 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse36 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse35 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse37 (select .cse36 .cse1))) (or (< .cse35 c_~min1~0) (< (select .cse36 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (not (< 0 ~M~0)) (= c_~min3~0 .cse37) (< .cse35 c_~min2~0) (not (< .cse37 c_~min1~0)) (< 1 ~M~0)))))) (or .cse8 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse38 (select .cse40 .cse1)) (.cse39 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse38 .cse39)) (= c_~min2~0 .cse38) (< (select .cse40 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (not (< 0 ~M~0)) (not (< .cse39 c_~min1~0)) (< 1 ~M~0)))))) (or .cse28 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (let ((.cse41 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< (select .cse41 .cse1) .cse42) (not (< .cse42 c_~min1~0)) (< .cse42 c_~min2~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (let ((.cse46 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse43 (select .cse46 .cse1)) (.cse44 (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse43 .cse44)) (= c_~min2~0 .cse43) (not (< .cse44 c_~min1~0)) (< .cse44 c_~min2~0) (forall ((~M~0 Int)) (let ((.cse45 (select .cse46 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< 0 ~M~0)) (<= (+ .cse45 1) c_~min2~0) (not (< .cse45 c_~min3~0)) (< 1 ~M~0)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse47 (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse48 (select .cse50 .cse1))) (or (< .cse47 c_~min1~0) (= c_~min2~0 .cse48) (< .cse47 c_~min2~0) (forall ((~M~0 Int)) (let ((.cse49 (select .cse50 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< 0 ~M~0)) (<= (+ .cse49 1) c_~min2~0) (not (< .cse49 c_~min3~0)) (< 1 ~M~0)))) (not (< .cse48 c_~min1~0)))))) (or .cse51 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse53 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse52 (select .cse53 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse54 (select .cse53 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse52 c_~min1~0) (< (select .cse53 .cse1) c_~min1~0) (not (< 0 ~M~0)) (< .cse52 c_~min2~0) (<= (+ .cse54 1) c_~min2~0) (not (< .cse54 c_~min3~0)) (< 1 ~M~0)))))) (or (and (or .cse28 .cse25) (or .cse51 .cse8)) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse56 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse55 (select .cse56 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse55 c_~min1~0) (< (select .cse56 .cse1) c_~min1~0) (< (select .cse56 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (not (< 0 ~M~0)) (< .cse55 c_~min2~0) (< 1 ~M~0))))))))) is different from false [2022-11-25 18:58:25,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:58:25,309 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 1 case distinctions, treesize of input 148 treesize of output 100 [2022-11-25 18:58:25,325 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:58:25,326 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 613 treesize of output 589 [2022-11-25 18:58:25,345 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:58:25,346 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 589 treesize of output 533 [2022-11-25 18:58:25,370 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:58:25,371 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 533 treesize of output 505 [2022-11-25 18:58:25,400 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:58:25,400 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 309 treesize of output 295 [2022-11-25 18:58:27,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:58:27,277 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 1 case distinctions, treesize of input 150 treesize of output 102 [2022-11-25 18:58:27,309 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:27,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2675 treesize of output 2567 [2022-11-25 18:58:27,380 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:27,381 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 2563 treesize of output 2279 [2022-11-25 18:58:27,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:58:27,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2057 treesize of output 1985 [2022-11-25 18:58:27,515 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:27,516 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 2203 treesize of output 2063 [2022-11-25 18:58:32,978 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:58:32,978 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 1 case distinctions, treesize of input 176 treesize of output 1 [2022-11-25 18:58:32,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:58:32,994 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 1 case distinctions, treesize of input 148 treesize of output 100 [2022-11-25 18:58:33,030 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:33,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4647 treesize of output 4427 [2022-11-25 18:58:33,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:58:33,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3323 treesize of output 3179 [2022-11-25 18:58:33,163 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:33,163 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 4279 treesize of output 3707 [2022-11-25 18:58:33,236 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:33,237 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 3703 treesize of output 3419 [2022-11-25 18:58:45,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:58:45,532 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 1 case distinctions, treesize of input 174 treesize of output 114 [2022-11-25 18:58:45,557 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:45,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 640 treesize of output 614 [2022-11-25 18:58:45,590 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:45,591 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 610 treesize of output 542 [2022-11-25 18:58:45,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:58:45,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 387 treesize of output 369 [2022-11-25 18:58:45,656 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:45,656 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 520 treesize of output 488 [2022-11-25 18:58:47,652 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:58:47,653 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 1 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 18:58:47,667 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:58:47,667 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 1 case distinctions, treesize of input 140 treesize of output 1 [2022-11-25 18:58:47,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:58:47,687 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 1 case distinctions, treesize of input 122 treesize of output 86 [2022-11-25 18:58:47,719 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:47,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 518 treesize of output 498 [2022-11-25 18:58:47,755 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:47,756 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 494 treesize of output 434 [2022-11-25 18:58:47,791 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:47,791 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 430 treesize of output 402 [2022-11-25 18:58:47,830 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:47,830 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 257 treesize of output 245 [2022-11-25 18:58:48,774 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:58:48,775 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 1 case distinctions, treesize of input 151 treesize of output 1 [2022-11-25 18:58:48,788 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:58:48,788 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 1 case distinctions, treesize of input 208 treesize of output 1 [2022-11-25 18:58:48,801 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:58:48,802 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 1 case distinctions, treesize of input 210 treesize of output 1 [2022-11-25 18:58:48,815 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:58:48,815 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 1 case distinctions, treesize of input 177 treesize of output 1 [2022-11-25 18:58:48,826 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:58:48,826 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 1 case distinctions, treesize of input 113 treesize of output 1 [2022-11-25 18:58:48,841 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:58:48,841 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 1 case distinctions, treesize of input 119 treesize of output 83 [2022-11-25 18:58:48,872 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:48,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1029 treesize of output 989 [2022-11-25 18:58:48,915 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:48,915 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 985 treesize of output 933 [2022-11-25 18:58:48,958 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:48,959 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 929 treesize of output 821 [2022-11-25 18:58:49,009 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:49,009 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 421 treesize of output 397 [2022-11-25 18:58:50,040 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:58:50,040 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 1 case distinctions, treesize of input 211 treesize of output 1 [2022-11-25 18:58:50,056 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:58:50,057 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 1 case distinctions, treesize of input 184 treesize of output 1 [2022-11-25 18:58:50,072 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:58:50,073 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 1 case distinctions, treesize of input 148 treesize of output 1 [2022-11-25 18:58:50,095 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:58:50,095 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 1 case distinctions, treesize of input 154 treesize of output 1 [2022-11-25 18:58:50,114 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:58:50,115 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 1 case distinctions, treesize of input 173 treesize of output 1 [2022-11-25 18:58:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:58:50,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630678209] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:58:50,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:58:50,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35, 28] total 83 [2022-11-25 18:58:50,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232775102] [2022-11-25 18:58:50,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:58:50,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-25 18:58:50,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:58:50,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-25 18:58:50,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=5717, Unknown=84, NotChecked=474, Total=6806 [2022-11-25 18:58:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:58:50,870 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:58:50,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 4.433734939759036) internal successors, (368), 83 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:58:50,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:58:50,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:58:50,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:58:50,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:58:50,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:58:50,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:58:50,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:58:50,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:58:50,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-11-25 18:58:50,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2022-11-25 18:58:50,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:58:50,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:58:50,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:58:50,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2022-11-25 18:58:50,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:58:50,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:59:25,477 WARN L233 SmtUtils]: Spent 11.91s on a formula simplification. DAG size of input: 507 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:59:35,718 WARN L233 SmtUtils]: Spent 8.60s on a formula simplification. DAG size of input: 523 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:59:51,962 WARN L233 SmtUtils]: Spent 14.72s on a formula simplification. DAG size of input: 528 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:00:06,131 WARN L233 SmtUtils]: Spent 12.41s on a formula simplification. DAG size of input: 586 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:00:17,644 WARN L233 SmtUtils]: Spent 9.84s on a formula simplification. DAG size of input: 573 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:00:28,478 WARN L233 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 539 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:00:46,048 WARN L233 SmtUtils]: Spent 8.62s on a formula simplification. DAG size of input: 534 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:01:00,820 WARN L233 SmtUtils]: Spent 12.91s on a formula simplification. DAG size of input: 592 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:01:07,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:01:14,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:01:22,043 WARN L233 SmtUtils]: Spent 5.75s on a formula simplification. DAG size of input: 392 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:01:41,005 WARN L233 SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 421 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:01:43,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:01:49,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:01:52,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:02:00,176 WARN L233 SmtUtils]: Spent 5.94s on a formula simplification. DAG size of input: 425 DAG size of output: 164 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:02:02,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:02:12,522 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 423 DAG size of output: 168 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:02:28,012 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 397 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:02:32,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:02:46,847 WARN L233 SmtUtils]: Spent 11.27s on a formula simplification. DAG size of input: 591 DAG size of output: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)