./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/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_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/config/GemCutterReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/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_ca7f2c61-b712-48e7-ac68-b5d854490f6e/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 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c --- 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:50:43,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:50:43,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:50:43,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:50:43,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:50:43,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:50:43,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:50:43,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:50:43,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:50:43,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:50:43,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:50:43,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:50:43,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:50:43,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:50:43,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:50:43,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:50:43,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:50:43,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:50:43,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:50:43,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:50:43,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:50:43,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:50:43,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:50:43,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:50:43,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:50:43,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:50:43,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:50:43,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:50:43,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:50:43,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:50:43,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:50:43,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:50:43,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:50:43,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:50:43,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:50:43,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:50:43,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:50:43,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:50:43,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:50:43,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:50:43,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:50:43,338 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-25 18:50:43,370 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:50:43,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:50:43,371 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:50:43,371 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:50:43,372 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:50:43,373 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:50:43,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:50:43,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:50:43,374 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:50:43,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:50:43,375 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:50:43,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:50:43,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:50:43,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:50:43,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:50:43,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:50:43,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:50:43,377 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:50:43,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:50:43,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:50:43,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:50:43,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:50:43,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:50:43,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:50:43,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:50:43,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:50:43,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:50:43,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:50:43,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:50:43,381 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-25 18:50:43,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:50:43,381 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-25 18:50:43,382 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-25 18:50:43,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:50:43,382 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-25 18:50:43,382 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-25 18:50:43,383 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_ca7f2c61-b712-48e7-ac68-b5d854490f6e/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_ca7f2c61-b712-48e7-ac68-b5d854490f6e/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 -> 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c [2022-11-25 18:50:43,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:50:43,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:50:43,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:50:43,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:50:43,691 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:50:43,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-11-25 18:50:46,783 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:50:46,983 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:50:46,984 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-11-25 18:50:46,991 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/data/7749fc87d/76a76a190f6c48dbae2d2aeeefa2e4bf/FLAG8797d45e8 [2022-11-25 18:50:47,005 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/data/7749fc87d/76a76a190f6c48dbae2d2aeeefa2e4bf [2022-11-25 18:50:47,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:50:47,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:50:47,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:50:47,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:50:47,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:50:47,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:50:47" (1/1) ... [2022-11-25 18:50:47,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c541484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:47, skipping insertion in model container [2022-11-25 18:50:47,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:50:47" (1/1) ... [2022-11-25 18:50:47,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:50:47,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:50:47,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:50:47,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:50:47,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:50:47,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:50:47,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:50:47,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:50:47,242 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_ca7f2c61-b712-48e7-ac68-b5d854490f6e/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-25 18:50:47,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:50:47,263 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:50:47,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:50:47,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:50:47,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:50:47,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:50:47,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:50:47,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:50:47,286 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_ca7f2c61-b712-48e7-ac68-b5d854490f6e/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-25 18:50:47,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:50:47,306 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:50:47,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:47 WrapperNode [2022-11-25 18:50:47,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:50:47,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:50:47,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:50:47,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:50:47,316 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:50:47" (1/1) ... [2022-11-25 18:50:47,348 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:50:47" (1/1) ... [2022-11-25 18:50:47,372 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-25 18:50:47,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:50:47,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:50:47,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:50:47,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:50:47,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:47" (1/1) ... [2022-11-25 18:50:47,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:47" (1/1) ... [2022-11-25 18:50:47,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:47" (1/1) ... [2022-11-25 18:50:47,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:47" (1/1) ... [2022-11-25 18:50:47,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:47" (1/1) ... [2022-11-25 18:50:47,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:47" (1/1) ... [2022-11-25 18:50:47,419 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:47" (1/1) ... [2022-11-25 18:50:47,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:47" (1/1) ... [2022-11-25 18:50:47,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:50:47,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:50:47,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:50:47,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:50:47,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:47" (1/1) ... [2022-11-25 18:50:47,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:50:47,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:50:47,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:50:47,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:50:47,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:50:47,519 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 18:50:47,519 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 18:50:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 18:50:47,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 18:50:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-25 18:50:47,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-25 18:50:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:50:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:50:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:50:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:50:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:50:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:50:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:50:47,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:50:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:50:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:50:47,523 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:50:47,685 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:50:47,687 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:50:48,051 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:50:48,196 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:50:48,197 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 18:50:48,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:50:48 BoogieIcfgContainer [2022-11-25 18:50:48,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:50:48,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:50:48,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:50:48,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:50:48,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:50:47" (1/3) ... [2022-11-25 18:50:48,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a24644d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:50:48, skipping insertion in model container [2022-11-25 18:50:48,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:47" (2/3) ... [2022-11-25 18:50:48,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a24644d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:50:48, skipping insertion in model container [2022-11-25 18:50:48,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:50:48" (3/3) ... [2022-11-25 18:50:48,209 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-11-25 18:50:48,219 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:50:48,230 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:50:48,230 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:50:48,230 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:50:48,299 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-25 18:50:48,349 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:50:48,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-25 18:50:48,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:50:48,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-25 18:50:48,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-25 18:50:48,419 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-25 18:50:48,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-25 18:50:48,446 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;@126d89d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:50:48,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 18:50:48,779 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:50:48,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:50:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash -275952594, now seen corresponding path program 1 times [2022-11-25 18:50:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:50:48,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593829800] [2022-11-25 18:50:48,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:50:48,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:50:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:50:49,048 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:50:49,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:50:49,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593829800] [2022-11-25 18:50:49,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593829800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:50:49,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:50:49,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:50:49,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615384438] [2022-11-25 18:50:49,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:50:49,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:50:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:50:49,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:50:49,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:50:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:49,094 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:50:49,096 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:50:49,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:49,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:49,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:50:49,187 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:50:49,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:50:49,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2072012938, now seen corresponding path program 1 times [2022-11-25 18:50:49,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:50:49,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202372590] [2022-11-25 18:50:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:50:49,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:50:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:50:49,996 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:50:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:50:49,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202372590] [2022-11-25 18:50:49,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202372590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:50:49,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:50:49,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:50:49,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927185827] [2022-11-25 18:50:49,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:50:50,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:50:50,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:50:50,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:50:50,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:50:50,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:50,003 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:50:50,003 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:50:50,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:50,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:50,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:50:50,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:50:50,268 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:50:50,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:50:50,269 INFO L85 PathProgramCache]: Analyzing trace with hash 439153583, now seen corresponding path program 1 times [2022-11-25 18:50:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:50:50,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774100620] [2022-11-25 18:50:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:50:50,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:50:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:50:50,612 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:50:50,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:50:50,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774100620] [2022-11-25 18:50:50,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774100620] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:50:50,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788679399] [2022-11-25 18:50:50,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:50:50,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:50:50,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:50:50,646 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:50:50,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:50:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:50:50,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:50:50,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:50:51,131 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:50:51,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:50:51,397 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:50:51,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788679399] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:50:51,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:50:51,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-25 18:50:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425029763] [2022-11-25 18:50:51,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:50:51,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:50:51,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:50:51,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:50:51,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:50:51,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:51,405 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:50:51,405 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:50:51,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:51,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:50:51,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:51,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:51,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:50:51,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:50:51,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:50:51,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:50:51,802 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:50:51,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:50:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash 232719478, now seen corresponding path program 1 times [2022-11-25 18:50:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:50:51,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024678305] [2022-11-25 18:50:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:50:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:50:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:50:52,153 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:50:52,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:50:52,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024678305] [2022-11-25 18:50:52,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024678305] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:50:52,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396332356] [2022-11-25 18:50:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:50:52,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:50:52,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:50:52,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:50:52,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:50:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:50:52,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:50:52,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:50:52,512 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:50:52,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:50:52,783 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:50:52,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396332356] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:50:52,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:50:52,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-11-25 18:50:52,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184433279] [2022-11-25 18:50:52,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:50:52,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:50:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:50:52,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:50:52,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:50:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:52,791 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:50:52,792 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:50:52,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:52,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:50:52,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:50:52,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:53,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:50:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:50:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:50:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:50:53,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:50:53,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-25 18:50:53,233 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:50:53,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:50:53,233 INFO L85 PathProgramCache]: Analyzing trace with hash 100827375, now seen corresponding path program 1 times [2022-11-25 18:50:53,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:50:53,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310757506] [2022-11-25 18:50:53,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:50:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:50:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:50:55,565 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:50:55,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:50:55,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310757506] [2022-11-25 18:50:55,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310757506] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:50:55,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963890812] [2022-11-25 18:50:55,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:50:55,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:50:55,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:50:55,569 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:50:55,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:50:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:50:55,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-25 18:50:55,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:50:57,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:50:57,115 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:50:58,267 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:50:58,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:50:59,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:50:59,300 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:51:01,539 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:51:01,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963890812] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:51:01,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:51:01,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 19] total 52 [2022-11-25 18:51:01,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713260270] [2022-11-25 18:51:01,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:51:01,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 18:51:01,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:01,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 18:51:01,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=2174, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 18:51:01,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:01,557 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:01,558 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:51:01,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:01,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:51:01,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:51:01,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:51:01,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:51:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:51:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:51:05,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-25 18:51:05,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:51:05,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:51:05,653 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:51:05,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:05,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1303894886, now seen corresponding path program 2 times [2022-11-25 18:51:05,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:05,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486040620] [2022-11-25 18:51:05,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:05,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:06,196 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:51:06,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:06,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486040620] [2022-11-25 18:51:06,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486040620] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:51:06,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853170830] [2022-11-25 18:51:06,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:51:06,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:51:06,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:51:06,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:51:06,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:51:06,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:51:06,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:51:06,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 18:51:06,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:51:06,886 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:51:06,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:51:07,408 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:51:07,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853170830] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:51:07,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:51:07,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2022-11-25 18:51:07,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427110350] [2022-11-25 18:51:07,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:51:07,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 18:51:07,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:07,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 18:51:07,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 18:51:07,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:07,414 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:07,415 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:51:07,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:07,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:51:07,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:51:07,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:51:07,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-25 18:51:07,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:51:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:51:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:51:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-25 18:51:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 18:51:09,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 18:51:09,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:51:09,868 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:51:09,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1964803798, now seen corresponding path program 3 times [2022-11-25 18:51:09,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:09,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438747293] [2022-11-25 18:51:09,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:09,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:10,113 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:51:10,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:10,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438747293] [2022-11-25 18:51:10,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438747293] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:51:10,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507767811] [2022-11-25 18:51:10,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:51:10,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:51:10,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:51:10,116 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:51:10,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:51:10,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 18:51:10,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:51:10,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:51:10,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:51:10,624 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:51:10,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:51:10,902 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:51:10,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507767811] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:51:10,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:51:10,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-25 18:51:10,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336718510] [2022-11-25 18:51:10,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:51:10,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 18:51:10,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:10,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 18:51:10,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:51:10,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:10,906 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:10,906 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:51:10,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:10,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:51:10,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:51:10,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:51:10,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-25 18:51:10,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-25 18:51:10,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:51:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:51:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:51:12,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-25 18:51:12,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 18:51:12,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:51:12,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:51:12,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 18:51:12,502 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:51:12,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:12,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1094981842, now seen corresponding path program 1 times [2022-11-25 18:51:12,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:12,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292994781] [2022-11-25 18:51:12,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:12,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:13,107 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:51:13,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:13,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292994781] [2022-11-25 18:51:13,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292994781] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:51:13,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829562577] [2022-11-25 18:51:13,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:13,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:51:13,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:51:13,110 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:51:13,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:51:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:13,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 18:51:13,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:51:13,762 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:51:13,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:51:14,207 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:51:14,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829562577] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:51:14,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:51:14,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-11-25 18:51:14,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347466268] [2022-11-25 18:51:14,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:51:14,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-25 18:51:14,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:14,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 18:51:14,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2022-11-25 18:51:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:14,211 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:14,211 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:51:14,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:14,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:51:14,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:51:14,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:51:14,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-25 18:51:14,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-25 18:51:14,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:51:14,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:16,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:16,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:51:16,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:51:16,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:51:16,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-25 18:51:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:51:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:51:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 18:51:16,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:51:17,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:51:17,042 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:51:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:17,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1229161583, now seen corresponding path program 4 times [2022-11-25 18:51:17,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:17,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876124085] [2022-11-25 18:51:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:19,355 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:51:19,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:19,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876124085] [2022-11-25 18:51:19,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876124085] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:51:19,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92439906] [2022-11-25 18:51:19,355 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:51:19,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:51:19,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:51:19,357 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:51:19,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:51:19,478 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:51:19,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:51:19,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-25 18:51:19,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:51:20,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 18:51:21,437 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:51:21,735 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:51:22,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:22,055 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:51:22,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:22,584 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:51:23,734 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:51:23,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:51:25,678 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0))) (and (or (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (or (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse1) (not (< c_~max3~0 .cse1)) (<= .cse1 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (or .cse0 (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse2) (not (< c_~max3~0 .cse2)) (< (+ ~M~0 1) c_~N~0))))))) is different from false [2022-11-25 18:51:44,426 WARN L233 SmtUtils]: Spent 10.99s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:51:46,069 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~max2~0 c_~max3~0)) (.cse0 (= c_~max1~0 c_~max2~0)) (.cse2 (<= c_~max3~0 c_~max2~0)) (.cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (or (and (or .cse0 .cse1) (or (= c_~max1~0 c_~max3~0) .cse2)) (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max1~0 (select (select .cse3 c_~A~0.base) .cse4)) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_256 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse6 (select (select .cse7 c_~A~0.base) .cse4))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse5)) (not (< ~M~0 c_~N~0)) (<= .cse5 c_~max2~0) (= .cse6 .cse5) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse6)))))) (forall ((v_ArrVal_256 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse8 (select (select .cse10 c_~A~0.base) .cse4))) (or (not (< c_~max1~0 .cse8)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse9)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse9) (< (+ ~M~0 1) c_~N~0)))) (= c_~max2~0 .cse8))))) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse11 (select (select .cse12 c_~A~0.base) .cse4))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max1~0 .cse11)) (< c_~max3~0 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= c_~max2~0 .cse11) (< (+ ~M~0 1) c_~N~0))))) .cse1) (or .cse0 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse13)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse13) (< c_~max1~0 (select (select .cse14 c_~A~0.base) .cse4)) (< (+ ~M~0 1) c_~N~0)))))) (or .cse2 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse15 (select (select .cse16 c_~A~0.base) .cse4))) (or (= c_~max3~0 .cse15) (not (< ~M~0 c_~N~0)) (not (< c_~max1~0 .cse15)) (< c_~max3~0 (select (select (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_256 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse17 (select (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse17)) (not (< ~M~0 c_~N~0)) (<= .cse17 c_~max2~0) (= c_~max1~0 .cse17) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse18 c_~A~0.base) .cse4))))))) is different from false [2022-11-25 18:51:47,241 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (= c_~max1~0 c_~max2~0)) (.cse0 (< c_~max2~0 c_~max3~0)) (.cse7 (<= c_~max3~0 c_~max2~0))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max1~0 .cse1)) (= .cse1 c_~max2~0) (< c_~max3~0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse3)) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse4 c_~A~0.base) c_~A~0.offset)) (< c_~max2~0 .cse3) (< (+ ~M~0 1) c_~N~0))))) .cse5) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse6 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))) (and (or .cse5 .cse0) (or (= c_~max1~0 c_~max3~0) .cse7))) (forall ((v_ArrVal_256 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (< c_~max1~0 (select (select .cse8 c_~A~0.base) c_~A~0.offset)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse9 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse9)) (not (< ~M~0 c_~N~0)) (<= .cse9 c_~max2~0) (= c_~max1~0 .cse9) (< (+ ~M~0 1) c_~N~0))))))) (forall ((v_ArrVal_256 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse10 (select (select .cse12 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse10)) (= .cse10 c_~max2~0) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse11)) (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse11) (< (+ ~M~0 1) c_~N~0)))))))) (forall ((v_ArrVal_256 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse14 (select (select .cse15 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse13 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse13)) (not (< ~M~0 c_~N~0)) (<= .cse13 c_~max2~0) (= .cse14 .cse13) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse14)))))) (or .cse7 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse16 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max1~0 .cse16)) (= .cse16 c_~max3~0) (< c_~max3~0 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))))) is different from false [2022-11-25 18:51:47,713 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (< c_~max2~0 c_~max3~0)) (.cse4 (<= c_~max3~0 c_~max2~0)) (.cse3 (= c_~max1~0 c_~max2~0))) (and (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse0 (select (select .cse1 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse0)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= .cse0 c_~max2~0) (< (+ ~M~0 1) c_~N~0))))) .cse2) (or (and (or .cse3 .cse2) (or (= c_~max1~0 c_~max3~0) .cse4)) (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse5 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))))) (or .cse4 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse6 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse6)) (= .cse6 c_~max3~0) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse8 (select (select .cse10 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse8)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse9) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse9)) (< (+ ~M~0 1) c_~N~0)))) (= .cse8 c_~max2~0))))) (or .cse3 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse11) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse11)) (< c_~max1~0 (select (select .cse12 c_~A~0.base) c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse13) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse13)) (<= .cse13 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse14 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse15 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse15)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse16)) (<= .cse16 c_~max2~0) (= .cse16 .cse15) (< (+ ~M~0 1) c_~N~0)))))))))) is different from false [2022-11-25 18:51:49,966 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (= c_~max1~0 c_~max2~0)) (.cse10 (< c_~max2~0 c_~max3~0)) (.cse5 (<= c_~max3~0 c_~max2~0))) (and (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse0)) (= c_~max1~0 .cse0) (<= .cse0 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse1 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< c_~max1~0 .cse2)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse3)) (= .cse2 .cse3) (<= .cse3 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))))))) (or .cse5 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< c_~max1~0 .cse6)) (= .cse6 c_~max3~0) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< c_~max1~0 .cse8)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (= .cse8 c_~max2~0) (< (+ ~M~0 1) c_~N~0))))) .cse10) (or .cse11 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< c_~max2~0 .cse12) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse12)) (< (+ ~M~0 1) c_~N~0) (< c_~max1~0 (select (select .cse13 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))))))) (or (and (or .cse11 .cse10) (or (= c_~max1~0 c_~max3~0) .cse5)) (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0) (< c_~max1~0 (select (select .cse14 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< c_~max1~0 .cse15)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< c_~max2~0 .cse16) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse16)) (< (+ ~M~0 1) c_~N~0)))) (= .cse15 c_~max2~0))))))) is different from false [2022-11-25 18:51:50,376 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (= c_~max1~0 c_~max2~0)) (.cse8 (< c_~max2~0 c_~max3~0)) (.cse5 (<= c_~max3~0 c_~max2~0))) (and (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= .cse0 c_~max2~0) (= .cse1 .cse0) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse0)) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse1)))))) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse3 c_~max3~0) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< c_~max1~0 .cse3)) (< (+ ~M~0 1) c_~N~0))))) .cse5) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (= .cse7 c_~max2~0) (not (< c_~max1~0 .cse7)) (< (+ ~M~0 1) c_~N~0))))) .cse8) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (< c_~max1~0 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse10 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= .cse10 c_~max2~0) (= c_~max1~0 .cse10) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse10)) (< (+ ~M~0 1) c_~N~0))))))) (or .cse11 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse12) (< c_~max1~0 (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (not (< c_~max3~0 .cse12)) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< c_~max1~0 (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< (+ ~M~0 1) c_~N~0)))) (and (or .cse11 .cse8) (or (= c_~max1~0 c_~max3~0) .cse5))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse15 c_~max2~0) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse16) (not (< c_~max3~0 .cse16)) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse15)))))))) is different from false [2022-11-25 18:51:50,615 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= c_~max1~0 c_~max2~0)) (.cse5 (< c_~max2~0 c_~max3~0)) (.cse6 (<= c_~max3~0 c_~max2~0))) (and (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse0 c_~max2~0) (not (< c_~max1~0 .cse0)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |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 (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse1) (< (+ ~M~0 1) c_~N~0) (not (< c_~max3~0 .cse1))))))))) (or (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (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 (= .cse3 c_~max2~0) (not (< c_~max1~0 .cse3)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |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|))) (< (+ ~M~0 1) c_~N~0))))) .cse5) (or .cse6 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse7 c_~max3~0) (not (< c_~max1~0 .cse7)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |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|))) (< (+ ~M~0 1) c_~N~0)))))) (or .cse9 (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |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 (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse10) (< c_~max1~0 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< (+ ~M~0 1) c_~N~0) (not (< c_~max3~0 .cse10))))))) (or (and (or .cse9 .cse5) (or (= c_~max1~0 c_~max3~0) .cse6)) (forall ((~M~0 Int) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |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_~max1~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|)) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (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 (< c_~max1~0 .cse13)) (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |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 (= .cse14 .cse13) (not (< ~M~0 c_~N~0)) (<= .cse14 c_~max2~0) (< (+ ~M~0 1) c_~N~0) (not (< c_~max3~0 .cse14))))))))) (forall ((v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_256))) (or (forall ((~M~0 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_257) |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 (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse16) (<= .cse16 c_~max2~0) (< (+ ~M~0 1) c_~N~0) (not (< c_~max3~0 .cse16))))) (< c_~max1~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|))))))) is different from false [2022-11-25 18:51:53,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:53,980 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 91 treesize of output 67 [2022-11-25 18:51:54,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:54,005 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 663 treesize of output 637 [2022-11-25 18:51:54,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:54,034 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 627 treesize of output 585 [2022-11-25 18:51:54,051 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 532 treesize of output 436 [2022-11-25 18:51:54,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:54,075 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 359 treesize of output 343 [2022-11-25 18:51:56,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:56,414 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 84 treesize of output 60 [2022-11-25 18:51:56,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:56,441 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 405 treesize of output 391 [2022-11-25 18:51:56,456 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 282 treesize of output 234 [2022-11-25 18:51:56,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:56,477 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 333 treesize of output 311 [2022-11-25 18:51:56,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:56,499 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 181 treesize of output 175 [2022-11-25 18:51:57,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:57,959 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 117 treesize of output 81 [2022-11-25 18:51:57,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:57,982 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 403 treesize of output 389 [2022-11-25 18:51:58,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:58,011 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 291 treesize of output 285 [2022-11-25 18:51:58,028 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 268 treesize of output 220 [2022-11-25 18:51:58,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:58,050 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 315 treesize of output 293 [2022-11-25 18:52:01,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:01,678 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 84 treesize of output 60 [2022-11-25 18:52:01,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:01,705 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 1457 treesize of output 1387 [2022-11-25 18:52:01,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:01,737 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 1377 treesize of output 1275 [2022-11-25 18:52:01,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:01,794 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 735 treesize of output 689 [2022-11-25 18:52:01,824 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 1014 treesize of output 822 [2022-11-25 18:52:54,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:54,931 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 123 treesize of output 87 [2022-11-25 18:52:54,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:52:54,964 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:52:54,964 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 558 treesize of output 506 [2022-11-25 18:52:54,999 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:52:54,999 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 502 treesize of output 426 [2022-11-25 18:52:55,030 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:52:55,030 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 422 treesize of output 386 [2022-11-25 18:52:55,250 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:52:55,251 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 146 treesize of output 1 [2022-11-25 18:52:55,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:55,266 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 58 treesize of output 46 [2022-11-25 18:52:55,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:52:55,293 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:52:55,294 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 259 treesize of output 239 [2022-11-25 18:52:55,316 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:52:55,316 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 235 treesize of output 207 [2022-11-25 18:52:55,344 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:52:55,345 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 203 treesize of output 191 [2022-11-25 18:52:59,086 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,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92439906] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:52:59,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:52:59,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 32, 31] total 79 [2022-11-25 18:52:59,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318429078] [2022-11-25 18:52:59,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:52:59,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-25 18:52:59,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:59,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-25 18:52:59,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=4454, Unknown=13, NotChecked=1022, Total=6162 [2022-11-25 18:52:59,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:59,091 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:59,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 4.113924050632911) internal successors, (325), 79 states have internal predecessors, (325), 0 states have call successors, (0), 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:59,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:59,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:59,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:59,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:52:59,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-25 18:52:59,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:52:59,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:52:59,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-25 18:52:59,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:53:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:53:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:53:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:53:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-25 18:53:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:53:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:53:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-25 18:53:16,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-25 18:53:16,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:53:16,487 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:53:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:53:16,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1206971023, now seen corresponding path program 5 times [2022-11-25 18:53:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:53:16,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207974999] [2022-11-25 18:53:16,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:53:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:53:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:53:16,852 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:53:16,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:53:16,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207974999] [2022-11-25 18:53:16,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207974999] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:53:16,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145536373] [2022-11-25 18:53:16,853 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:53:16,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:53:16,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:53:16,855 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:53:16,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 18:53:16,988 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-11-25 18:53:16,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:53:16,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:53:16,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:53:17,327 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:53:17,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:53:17,607 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:53:17,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145536373] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:53:17,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:53:17,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-11-25 18:53:17,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659379780] [2022-11-25 18:53:17,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:53:17,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 18:53:17,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:53:17,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 18:53:17,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2022-11-25 18:53:17,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:17,611 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:53:17,611 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:53:17,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:17,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:53:17,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:53:17,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:53:17,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:53:17,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-25 18:53:17,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:53:17,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:53:17,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-25 18:53:17,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:53:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:53:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:53:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:53:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:53:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:53:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:53:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-25 18:53:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-25 18:53:22,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-25 18:53:22,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:53:22,531 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:53:22,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:53:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash 333021814, now seen corresponding path program 6 times [2022-11-25 18:53:22,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:53:22,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804028766] [2022-11-25 18:53:22,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:53:22,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:53:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:53:29,719 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:53:29,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:53:29,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804028766] [2022-11-25 18:53:29,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804028766] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:53:29,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071288584] [2022-11-25 18:53:29,719 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 18:53:29,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:53:29,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:53:29,723 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:53:29,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 18:53:29,864 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-25 18:53:29,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:53:29,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-25 18:53:29,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:53:33,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:53:33,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:53:33,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:53:33,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:53:33,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:53:33,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 84 [2022-11-25 18:53:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 18:53:33,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:53:39,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:53:39,082 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:53:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 18:53:43,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071288584] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:53:43,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:53:43,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 29, 21] total 82 [2022-11-25 18:53:43,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442586698] [2022-11-25 18:53:43,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:53:43,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-11-25 18:53:43,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:53:43,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-11-25 18:53:43,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=6197, Unknown=0, NotChecked=0, Total=6642 [2022-11-25 18:53:43,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:43,048 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:53:43,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 4.487804878048781) internal successors, (368), 82 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:53:43,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:43,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:53:43,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:53:43,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:53:43,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:53:43,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:53:43,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:53:43,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:53:43,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-25 18:53:43,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-11-25 18:53:43,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:54:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:54:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:54:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:54:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:54:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:54:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:54:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-25 18:54:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-25 18:54:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-11-25 18:54:33,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:54:33,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:54:33,491 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:33,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:54:33,491 INFO L85 PathProgramCache]: Analyzing trace with hash 648238083, now seen corresponding path program 7 times [2022-11-25 18:54:33,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:54:33,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091944315] [2022-11-25 18:54:33,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:54:33,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:54:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:54:33,845 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:54:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:54:33,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091944315] [2022-11-25 18:54:33,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091944315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:54:33,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603713273] [2022-11-25 18:54:33,846 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 18:54:33,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:54:33,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:54:33,851 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:54:33,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 18:54:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:54:33,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 18:54:33,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:54:34,451 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:54:34,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:54:34,877 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:54:34,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603713273] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:54:34,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:54:34,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-11-25 18:54:34,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709621398] [2022-11-25 18:54:34,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:54:34,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 18:54:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:54:34,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 18:54:34,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 18:54:34,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:34,880 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:54:34,880 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:54:34,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:34,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:54:34,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:54:34,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:54:34,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:54:34,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:54:34,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:54:34,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-25 18:54:34,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-25 18:54:34,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-11-25 18:54:34,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2022-11-25 18:54:34,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:54:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:54:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:54:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:54:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:54:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:54:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:54:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-25 18:54:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-25 18:54:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2022-11-25 18:54:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:54:42,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:54:42,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 18:54:42,426 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:54:42,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:54:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1304833281, now seen corresponding path program 2 times [2022-11-25 18:54:42,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:54:42,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124607249] [2022-11-25 18:54:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:54:42,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:54:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:54:42,739 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:42,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:54:42,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124607249] [2022-11-25 18:54:42,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124607249] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:54:42,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757790680] [2022-11-25 18:54:42,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:54:42,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:54:42,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:54:42,742 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:54:42,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 18:54:42,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:54:42,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:54:42,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:54:42,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:54:43,323 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:43,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:54:43,615 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:43,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757790680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:54:43,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:54:43,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-11-25 18:54:43,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407840189] [2022-11-25 18:54:43,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:54:43,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 18:54:43,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:54:43,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 18:54:43,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-11-25 18:54:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:43,618 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:54:43,618 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:43,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:43,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:54:43,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:54:43,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:54:43,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:54:43,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:54:43,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:54:43,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:54:43,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-25 18:54:43,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-11-25 18:54:43,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 154 states. [2022-11-25 18:54:43,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:54:43,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:54:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:54:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:54:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:54:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:54:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:54:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:54:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-25 18:54:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-25 18:54:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-11-25 18:54:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:54:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-25 18:54:51,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-25 18:54:51,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 18:54:51,857 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:54:51,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:54:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash 6681437, now seen corresponding path program 1 times [2022-11-25 18:54:51,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:54:51,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705434222] [2022-11-25 18:54:51,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:54:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:54:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:54:52,117 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:54:52,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:54:52,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705434222] [2022-11-25 18:54:52,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705434222] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:54:52,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763509194] [2022-11-25 18:54:52,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:54:52,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:54:52,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:54:52,120 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:54:52,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 18:54:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:54:52,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:54:52,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:54:52,554 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:54:52,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:54:52,822 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:54:52,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763509194] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:54:52,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:54:52,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-25 18:54:52,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661795280] [2022-11-25 18:54:52,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:54:52,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 18:54:52,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:54:52,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 18:54:52,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:54:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:52,825 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:54:52,825 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:54:52,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:52,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:54:52,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:54:52,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:54:52,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:54:52,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:54:52,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:54:52,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:54:52,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-25 18:54:52,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-11-25 18:54:52,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 159 states. [2022-11-25 18:54:52,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:54:52,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-11-25 18:54:52,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:54:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:54:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:54:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:54:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:54:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:54:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:54:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-25 18:54:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:54:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-11-25 18:54:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:54:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-25 18:54:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:54:53,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 18:54:53,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 18:54:53,761 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:54:53,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:54:53,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1755799160, now seen corresponding path program 2 times [2022-11-25 18:54:53,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:54:53,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109856998] [2022-11-25 18:54:53,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:54:53,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:54:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:54:58,184 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:54:58,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:54:58,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109856998] [2022-11-25 18:54:58,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109856998] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:54:58,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113834993] [2022-11-25 18:54:58,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:54:58,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:54:58,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:54:58,186 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:54:58,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca7f2c61-b712-48e7-ac68-b5d854490f6e/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 18:54:58,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:54:58,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:54:58,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 18:54:58,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:54:59,560 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:00,190 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:00,437 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:00,690 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:02,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:55:02,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:55:02,435 INFO L321 Elim1Store]: treesize reduction 24, result has 72.7 percent of original size [2022-11-25 18:55:02,436 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 143 [2022-11-25 18:55:05,472 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:05,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:55:22,136 WARN L233 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 150 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:57:01,295 WARN L233 SmtUtils]: Spent 1.52m on a formula simplification. DAG size of input: 197 DAG size of output: 168 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:57:56,559 WARN L233 SmtUtils]: Spent 42.90s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:57:59,130 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse103 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse12 (+ c_~max2~0 1))) (let ((.cse22 (<= .cse12 c_~max3~0)) (.cse38 (= c_~max1~0 c_~max2~0)) (.cse53 (= c_~max1~0 c_~max3~0)) (.cse30 (<= c_~max3~0 c_~max2~0)) (.cse3 (+ c_thread1Thread1of1ForFork2_~i~0 1)) (.cse5 (+ c_~A~0.offset .cse103 4)) (.cse6 (+ c_~A~0.offset .cse103))) (and (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse0 (select .cse4 .cse6)) (.cse1 (select .cse4 .cse5))) (or (not (< c_~max1~0 .cse0)) (not (< .cse0 .cse1)) (forall ((~M~0 Int)) (let ((.cse2 (select .cse4 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse2 .cse1) (not (< 0 ~M~0)) (< .cse3 ~M~0) (<= .cse2 c_~max2~0) (not (< c_~max3~0 .cse2))))) (< c_~max2~0 (select .cse4 c_~A~0.offset)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse5)) (.cse8 (select .cse9 c_~A~0.offset))) (or (not (< c_~max1~0 .cse7)) (not (< c_~max2~0 .cse8)) (< c_~max1~0 (select .cse9 .cse6)) (forall ((~M~0 Int)) (let ((.cse10 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse10 .cse7) (not (< 0 ~M~0)) (< .cse3 ~M~0) (<= .cse10 .cse8) (not (< c_~max3~0 .cse10))))))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse11 (select .cse14 .cse5))) (or (not (< c_~max1~0 .cse11)) (forall ((~M~0 Int)) (let ((.cse13 (select .cse14 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse12 .cse13) (< .cse3 ~M~0) (not (< c_~max3~0 .cse13))))) (= .cse11 c_~max2~0) (< c_~max1~0 (select .cse14 .cse6)) (< c_~max2~0 (select .cse14 c_~A~0.offset)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse15 (select .cse18 .cse5)) (.cse16 (select .cse18 c_~A~0.offset))) (or (= .cse15 .cse16) (not (< c_~max1~0 .cse15)) (forall ((~M~0 Int)) (let ((.cse17 (select .cse18 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ .cse16 1) .cse17) (not (< 0 ~M~0)) (< .cse3 ~M~0) (not (< c_~max3~0 .cse17))))) (not (< c_~max2~0 .cse16)) (< c_~max1~0 (select .cse18 .cse6)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse5))) (or (not (< c_~max1~0 .cse19)) (forall ((~M~0 Int)) (let ((.cse20 (select .cse21 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse20 .cse19) (not (< 0 ~M~0)) (< .cse3 ~M~0) (<= .cse20 c_~max2~0) (not (< c_~max3~0 .cse20))))) (< c_~max1~0 (select .cse21 .cse6)) (< c_~max2~0 (select .cse21 c_~A~0.offset)))))) (or .cse22 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse6)) (.cse24 (select .cse25 .cse5))) (or (not (< 0 ~M~0)) (not (< c_~max1~0 .cse23)) (not (< .cse23 .cse24)) (< .cse3 ~M~0) (= .cse24 c_~max2~0) (< c_~max3~0 (select .cse25 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse25 c_~A~0.offset))))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse26 (select .cse28 c_~A~0.offset)) (.cse29 (select .cse28 .cse6))) (or (forall ((~M~0 Int)) (let ((.cse27 (select .cse28 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ .cse26 1) .cse27) (not (< 0 ~M~0)) (< .cse3 ~M~0) (not (< c_~max3~0 .cse27))))) (not (< c_~max1~0 .cse29)) (not (< c_~max2~0 .cse26)) (< .cse29 (select .cse28 .cse5)) (= .cse26 .cse29))))) (or .cse30 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse31 (select .cse33 .cse6)) (.cse32 (select .cse33 .cse5))) (or (not (< 0 ~M~0)) (not (< c_~max1~0 .cse31)) (not (< .cse31 .cse32)) (< .cse3 ~M~0) (= .cse32 c_~max3~0) (< c_~max3~0 (select .cse33 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse33 c_~A~0.offset))))))) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse34 (select .cse35 .cse6))) (or (not (< 0 ~M~0)) (not (< c_~max1~0 .cse34)) (< .cse3 ~M~0) (< .cse34 (select .cse35 .cse5)) (= .cse34 c_~max2~0) (< c_~max3~0 (select .cse35 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse35 c_~A~0.offset)))))) .cse22) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse36 (select .cse37 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse12 .cse36) (< .cse3 ~M~0) (< c_~max1~0 (select .cse37 .cse5)) (< c_~max1~0 (select .cse37 .cse6)) (not (< c_~max3~0 .cse36)) (< c_~max2~0 (select .cse37 c_~A~0.offset)))))) .cse38) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse40 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse39 (select .cse40 .cse5))) (or (not (< c_~max1~0 .cse39)) (not (< 0 ~M~0)) (< .cse3 ~M~0) (= .cse39 c_~max2~0) (< c_~max1~0 (select .cse40 .cse6)) (< c_~max3~0 (select .cse40 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse40 c_~A~0.offset)))))) .cse22) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse41 (select .cse44 .cse6)) (.cse43 (select .cse44 .cse5)) (.cse42 (select .cse44 c_~A~0.offset))) (or (not (< c_~max1~0 .cse41)) (not (< c_~max2~0 .cse42)) (not (< .cse41 .cse43)) (= .cse43 c_~max3~0) (<= c_~max3~0 .cse42) (< c_~max3~0 (select .cse44 (+ c_~A~0.offset (* ~M~0 4)))))))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse45 (select .cse47 .cse5)) (.cse46 (select .cse47 c_~A~0.offset))) (or (= .cse45 .cse46) (not (< c_~max1~0 .cse45)) (not (< c_~max2~0 .cse46)) (<= (+ .cse46 1) c_~max3~0) (< c_~max1~0 (select .cse47 .cse6)) (< c_~max3~0 (select .cse47 (+ c_~A~0.offset (* ~M~0 4)))))))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse49 (select .cse50 c_~A~0.offset)) (.cse48 (select .cse50 .cse6))) (or (not (< c_~max1~0 .cse48)) (not (< c_~max2~0 .cse49)) (< .cse48 (select .cse50 .cse5)) (<= c_~max3~0 .cse49) (= .cse48 c_~max3~0) (< c_~max3~0 (select .cse50 (+ c_~A~0.offset (* ~M~0 4)))))))))) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse52 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse51 (select .cse52 .cse6))) (or (not (< 0 ~M~0)) (not (< c_~max1~0 .cse51)) (< .cse3 ~M~0) (< .cse51 (select .cse52 .cse5)) (= .cse51 c_~max3~0) (< c_~max3~0 (select .cse52 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse52 c_~A~0.offset)))))) .cse30) (or (and .cse53 .cse22) (and .cse38 .cse30) (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse54 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (< c_~max1~0 (select .cse54 .cse5)) (< c_~max1~0 (select .cse54 .cse6)) (< c_~max3~0 (select .cse54 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse54 c_~A~0.offset)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (or (< c_~max1~0 (select .cse55 .cse5)) (< c_~max1~0 (select .cse55 .cse6)) (< c_~max2~0 (select .cse55 c_~A~0.offset)) (forall ((~M~0 Int)) (let ((.cse56 (select .cse55 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (= .cse56 c_~max1~0) (<= .cse56 c_~max2~0) (not (< c_~max3~0 .cse56)))))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse60 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse59 (select .cse60 .cse6)) (.cse57 (select .cse60 .cse5)) (.cse58 (select .cse60 c_~A~0.offset))) (or (= .cse57 .cse58) (not (< c_~max1~0 .cse59)) (not (< c_~max2~0 .cse58)) (not (< .cse59 .cse57)) (<= (+ .cse58 1) c_~max3~0) (< c_~max3~0 (select .cse60 (+ c_~A~0.offset (* ~M~0 4)))))))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse63 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse62 (select .cse63 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse61 (select .cse63 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (= .cse61 c_~max1~0) (<= .cse61 .cse62) (not (< c_~max3~0 .cse61))))) (not (< c_~max2~0 .cse62)) (< c_~max1~0 (select .cse63 .cse5)) (< c_~max1~0 (select .cse63 .cse6)))))) (or .cse53 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse65 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse64 (select .cse65 c_~A~0.offset))) (or (not (< 0 ~M~0)) (not (< c_~max2~0 .cse64)) (< .cse3 ~M~0) (<= c_~max3~0 .cse64) (< c_~max1~0 (select .cse65 .cse5)) (< c_~max1~0 (select .cse65 .cse6)) (< c_~max3~0 (select .cse65 (+ c_~A~0.offset (* ~M~0 4))))))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse67 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse68 (select .cse67 .cse6)) (.cse69 (select .cse67 .cse5))) (or (forall ((~M~0 Int)) (let ((.cse66 (select .cse67 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse12 .cse66) (< .cse3 ~M~0) (not (< c_~max3~0 .cse66))))) (not (< c_~max1~0 .cse68)) (not (< .cse68 .cse69)) (= .cse69 c_~max2~0) (< c_~max2~0 (select .cse67 c_~A~0.offset)))))) (or .cse30 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse71 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse70 (select .cse71 .cse5))) (or (not (< c_~max1~0 .cse70)) (not (< 0 ~M~0)) (< .cse3 ~M~0) (= .cse70 c_~max3~0) (< c_~max1~0 (select .cse71 .cse6)) (< c_~max3~0 (select .cse71 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 (select .cse71 c_~A~0.offset))))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse74 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse72 (select .cse74 .cse6))) (or (not (< c_~max1~0 .cse72)) (forall ((~M~0 Int)) (let ((.cse73 (select .cse74 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (= .cse73 .cse72) (< .cse3 ~M~0) (<= .cse73 c_~max2~0) (not (< c_~max3~0 .cse73))))) (< .cse72 (select .cse74 .cse5)) (< c_~max2~0 (select .cse74 c_~A~0.offset)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse78 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse76 (select .cse78 c_~A~0.offset)) (.cse79 (select .cse78 .cse6)) (.cse75 (select .cse78 .cse5))) (or (= .cse75 .cse76) (forall ((~M~0 Int)) (let ((.cse77 (select .cse78 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ .cse76 1) .cse77) (not (< 0 ~M~0)) (< .cse3 ~M~0) (not (< c_~max3~0 .cse77))))) (not (< c_~max1~0 .cse79)) (not (< c_~max2~0 .cse76)) (not (< .cse79 .cse75)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse81 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse82 (select .cse81 .cse6))) (or (forall ((~M~0 Int)) (let ((.cse80 (select .cse81 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse12 .cse80) (< .cse3 ~M~0) (not (< c_~max3~0 .cse80))))) (not (< c_~max1~0 .cse82)) (< .cse82 (select .cse81 .cse5)) (= .cse82 c_~max2~0) (< c_~max2~0 (select .cse81 c_~A~0.offset)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse85 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse83 (select .cse85 c_~A~0.offset))) (or (= c_~max1~0 .cse83) (forall ((~M~0 Int)) (let ((.cse84 (select .cse85 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ .cse83 1) .cse84) (not (< 0 ~M~0)) (< .cse3 ~M~0) (not (< c_~max3~0 .cse84))))) (not (< c_~max2~0 .cse83)) (< c_~max1~0 (select .cse85 .cse5)) (< c_~max1~0 (select .cse85 .cse6)))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse87 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse86 (select .cse87 c_~A~0.offset))) (or (= c_~max1~0 .cse86) (not (< c_~max2~0 .cse86)) (< c_~max1~0 (select .cse87 .cse5)) (<= (+ .cse86 1) c_~max3~0) (< c_~max1~0 (select .cse87 .cse6)) (< c_~max3~0 (select .cse87 (+ c_~A~0.offset (* ~M~0 4)))))))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse90 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse88 (select .cse90 .cse6)) (.cse89 (select .cse90 c_~A~0.offset))) (or (not (< c_~max1~0 .cse88)) (not (< c_~max2~0 .cse89)) (< .cse88 (select .cse90 .cse5)) (= .cse89 .cse88) (<= (+ .cse89 1) c_~max3~0) (< c_~max3~0 (select .cse90 (+ c_~A~0.offset (* ~M~0 4)))))))) (not (< 0 ~M~0)) (< .cse3 ~M~0))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse94 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse93 (select .cse94 c_~A~0.offset)) (.cse92 (select .cse94 .cse6))) (or (forall ((~M~0 Int)) (let ((.cse91 (select .cse94 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (= .cse91 .cse92) (< .cse3 ~M~0) (<= .cse91 .cse93) (not (< c_~max3~0 .cse91))))) (not (< c_~max1~0 .cse92)) (not (< c_~max2~0 .cse93)) (< .cse92 (select .cse94 .cse5)))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (< .cse3 ~M~0) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse97 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse95 (select .cse97 .cse5)) (.cse96 (select .cse97 c_~A~0.offset))) (or (not (< c_~max1~0 .cse95)) (not (< c_~max2~0 .cse96)) (= .cse95 c_~max3~0) (<= c_~max3~0 .cse96) (< c_~max1~0 (select .cse97 .cse6)) (< c_~max3~0 (select .cse97 (+ c_~A~0.offset (* ~M~0 4)))))))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse102 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse98 (select .cse102 .cse6)) (.cse100 (select .cse102 .cse5)) (.cse99 (select .cse102 c_~A~0.offset))) (or (not (< c_~max1~0 .cse98)) (not (< c_~max2~0 .cse99)) (not (< .cse98 .cse100)) (forall ((~M~0 Int)) (let ((.cse101 (select .cse102 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse101 .cse100) (not (< 0 ~M~0)) (< .cse3 ~M~0) (<= .cse101 .cse99) (not (< c_~max3~0 .cse101)))))))))))) is different from false [2022-11-25 18:58:05,421 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~max2~0 1))) (let ((.cse3 (= c_~max1~0 c_~max3~0)) (.cse26 (= c_~max1~0 c_~max2~0)) (.cse17 (<= c_~max3~0 c_~max2~0)) (.cse2 (+ c_~A~0.offset 4)) (.cse20 (<= .cse6 c_~max3~0))) (and (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (< c_~max1~0 .cse0) (not (< 0 ~M~0)) (not (< c_~max2~0 .cse0)) (<= c_~max3~0 .cse0) (< c_~max1~0 (select .cse1 .cse2)) (< c_~max3~0 (select .cse1 (+ c_~A~0.offset (* ~M~0 4)))) (< 1 ~M~0))))) .cse3) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse5 (select .cse8 .cse2)) (.cse4 (select .cse8 c_~A~0.offset))) (or (< c_~max1~0 .cse4) (= c_~max2~0 .cse5) (not (< c_~max1~0 .cse5)) (forall ((~M~0 Int)) (let ((.cse7 (select .cse8 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse6 .cse7) (not (< c_~max3~0 .cse7)) (< 1 ~M~0)))) (< c_~max2~0 .cse4))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse9 (select .cse11 c_~A~0.offset)) (.cse10 (select .cse11 .cse2))) (or (< c_~max1~0 .cse9) (not (< c_~max2~0 .cse9)) (not (< c_~max1~0 .cse10)) (= c_~max3~0 .cse10) (< c_~max3~0 (select .cse11 (+ c_~A~0.offset (* ~M~0 4)))))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse12 (select .cse13 c_~A~0.offset))) (or (< c_~max1~0 .cse12) (not (< c_~max2~0 .cse12)) (< c_~max1~0 (select .cse13 .cse2)) (forall ((~M~0 Int)) (let ((.cse14 (select .cse13 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (= .cse14 c_~max1~0) (<= .cse14 .cse12) (not (< c_~max3~0 .cse14)) (< 1 ~M~0)))))))) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse15 (select .cse16 c_~A~0.offset))) (or (not (< 0 ~M~0)) (< .cse15 (select .cse16 .cse2)) (not (< c_~max1~0 .cse15)) (< c_~max2~0 .cse15) (< 1 ~M~0))))) .cse17) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse18 (select .cse19 c_~A~0.offset))) (or (not (< 0 ~M~0)) (= .cse18 c_~max2~0) (< .cse18 (select .cse19 .cse2)) (not (< c_~max1~0 .cse18)) (< c_~max3~0 (select .cse19 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 .cse18) (< 1 ~M~0))))) .cse20) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse2)) (.cse21 (select .cse23 c_~A~0.offset))) (or (not (< .cse21 .cse22)) (not (< c_~max2~0 .cse21)) (= c_~max3~0 .cse22) (not (< c_~max1~0 .cse21)) (< c_~max3~0 (select .cse23 (+ c_~A~0.offset (* ~M~0 4)))))))) (< 1 ~M~0))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse25 (select .cse24 c_~A~0.offset))) (or (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (not (< c_~max3~0 (select .cse24 (+ c_~A~0.offset (* ~M~0 4))))) (< 1 ~M~0))) (= .cse25 c_~max2~0) (< .cse25 (select .cse24 .cse2)) (not (< c_~max1~0 .cse25)) (< c_~max2~0 .cse25))))) (or .cse26 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse28 (select .cse29 (+ c_~A~0.offset (* ~M~0 4)))) (.cse27 (select .cse29 c_~A~0.offset))) (or (< c_~max1~0 .cse27) (not (< 0 ~M~0)) (<= .cse6 .cse28) (< c_~max1~0 (select .cse29 .cse2)) (not (< c_~max3~0 .cse28)) (< c_~max2~0 .cse27) (< 1 ~M~0)))))) (or (and .cse3 .cse20) (and .cse26 .cse17) (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse30 (select .cse31 c_~A~0.offset))) (or (< c_~max1~0 .cse30) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse31 .cse2)) (< c_~max3~0 (select .cse31 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 .cse30) (< 1 ~M~0)))))) (or .cse17 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse33 (select .cse34 .cse2)) (.cse32 (select .cse34 c_~A~0.offset))) (or (< c_~max1~0 .cse32) (not (< 0 ~M~0)) (not (< c_~max1~0 .cse33)) (= c_~max3~0 .cse33) (< c_~max3~0 (select .cse34 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 .cse32) (< 1 ~M~0)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse36 (select .cse38 .cse2)) (.cse35 (select .cse38 c_~A~0.offset))) (or (not (< .cse35 .cse36)) (= c_~max2~0 .cse36) (not (< c_~max1~0 .cse35)) (forall ((~M~0 Int)) (let ((.cse37 (select .cse38 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse6 .cse37) (not (< c_~max3~0 .cse37)) (< 1 ~M~0)))) (< c_~max2~0 .cse35))))) (or .cse20 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse41 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse40 (select .cse41 .cse2)) (.cse39 (select .cse41 c_~A~0.offset))) (or (not (< .cse39 .cse40)) (not (< 0 ~M~0)) (= c_~max2~0 .cse40) (not (< c_~max1~0 .cse39)) (< c_~max3~0 (select .cse41 (+ c_~A~0.offset (* ~M~0 4)))) (< 1 ~M~0)))))) (or .cse17 (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse43 (select .cse44 .cse2)) (.cse42 (select .cse44 c_~A~0.offset))) (or (not (< .cse42 .cse43)) (not (< 0 ~M~0)) (= c_~max3~0 .cse43) (not (< c_~max1~0 .cse42)) (< c_~max3~0 (select .cse44 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 .cse42) (< 1 ~M~0)))))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse45 (select .cse47 c_~A~0.offset))) (or (< c_~max1~0 .cse45) (forall ((~M~0 Int)) (let ((.cse46 (select .cse47 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (= .cse46 c_~max1~0) (<= .cse46 c_~max2~0) (not (< c_~max3~0 .cse46)) (< 1 ~M~0)))) (< c_~max1~0 (select .cse47 .cse2)) (< c_~max2~0 .cse45))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse49 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse48 (select .cse49 c_~A~0.offset))) (or (<= .cse48 c_~max1~0) (<= c_~max3~0 .cse48) (< .cse48 (select .cse49 .cse2)) (<= .cse48 c_~max2~0))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (forall ((v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse51 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse50 (select .cse51 c_~A~0.offset))) (or (= c_~max1~0 .cse50) (< c_~max1~0 .cse50) (not (< c_~max2~0 .cse50)) (< c_~max1~0 (select .cse51 .cse2)) (forall ((~M~0 Int)) (let ((.cse52 (select .cse51 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ .cse50 1) .cse52) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse52)) (< 1 ~M~0)))))))) (forall ((~M~0 Int) (v_ArrVal_477 (Array Int Int))) (or (forall ((v_ArrVal_478 (Array Int Int))) (let ((.cse54 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse53 (select .cse54 c_~A~0.offset))) (or (= c_~max1~0 .cse53) (< c_~max1~0 .cse53) (not (< c_~max2~0 .cse53)) (<= (+ .cse53 1) c_~max3~0) (< c_~max3~0 (select .cse54 (+ c_~A~0.offset (* ~M~0 4)))))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (or (forall ((~M~0 Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) c_~A~0.base))) (let ((.cse56 (select .cse55 .cse2))) (or (< c_~max1~0 (select .cse55 c_~A~0.offset)) (not (< 0 ~M~0)) (= c_~max2~0 .cse56) (not (< c_~max1~0 .cse56)) (< c_~max3~0 (select .cse55 (+ c_~A~0.offset (* ~M~0 4)))) (< 1 ~M~0))))) .cse20)))) is different from false [2022-11-25 18:58:16,306 WARN L233 SmtUtils]: Spent 6.97s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:58:41,197 WARN L233 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:58:50,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:58:50,503 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:50,533 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:50,534 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 5484 treesize of output 5248 [2022-11-25 18:58:50,620 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:50,621 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 5244 treesize of output 4672 [2022-11-25 18:58:50,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:58:50,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:58:50,698 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 3358 treesize of output 3214 [2022-11-25 18:58:50,754 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:58:50,755 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 4524 treesize of output 4240 [2022-11-25 18:59:08,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:59:08,808 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:59:08,835 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:59:08,836 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 629 treesize of output 605 [2022-11-25 18:59:08,871 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:59:08,872 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 601 treesize of output 569 [2022-11-25 18:59:08,908 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:59:08,909 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 565 treesize of output 497 [2022-11-25 18:59:08,943 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:59:08,943 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 305 treesize of output 291 [2022-11-25 18:59:09,595 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:09,596 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:59:09,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:59:09,617 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:59:09,650 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:59:09,650 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 1279 treesize of output 1231 [2022-11-25 18:59:09,703 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:59:09,704 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 1227 treesize of output 1167 [2022-11-25 18:59:09,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:59:09,741 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 711 treesize of output 679 [2022-11-25 18:59:09,775 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:59:09,775 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 1131 treesize of output 1007 [2022-11-25 18:59:11,934 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:11,934 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:59:11,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:59:11,975 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:59:12,003 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:59:12,004 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:59:12,042 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:59:12,043 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 877 [2022-11-25 18:59:12,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:59:12,075 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 449 treesize of output 421 [2022-11-25 18:59:12,110 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-25 18:59:12,110 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 845 treesize of output 793 [2022-11-25 18:59:13,146 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:13,146 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:59:13,162 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:13,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 1 [2022-11-25 18:59:13,183 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:13,184 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 1 [2022-11-25 18:59:13,199 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:13,199 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:59:13,213 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:13,214 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:59:13,230 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:13,230 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:59:13,243 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:13,243 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:59:13,258 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:13,258 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:59:13,273 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:13,273 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:59:13,289 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:13,289 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:59:13,304 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:13,304 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:59:13,316 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:13,317 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:59:13,331 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:59:13,332 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:59:14,076 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:59:14,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113834993] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:59:14,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:59:14,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35, 28] total 83 [2022-11-25 18:59:14,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300605869] [2022-11-25 18:59:14,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:59:14,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-25 18:59:14,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:59:14,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-25 18:59:14,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=5649, Unknown=74, NotChecked=318, Total=6806 [2022-11-25 18:59:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:59:14,081 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:59:14,082 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:59:14,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:59:14,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:59:14,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:59:14,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:59:14,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-25 18:59:14,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:59:14,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:59:14,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:59:14,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-25 18:59:14,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-25 18:59:14,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 159 states. [2022-11-25 18:59:14,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:59:14,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2022-11-25 18:59:14,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:59:14,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:59:43,607 WARN L233 SmtUtils]: Spent 14.90s on a formula simplification. DAG size of input: 515 DAG size of output: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:00:12,087 WARN L233 SmtUtils]: Spent 24.44s on a formula simplification. DAG size of input: 533 DAG size of output: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:00:28,119 WARN L233 SmtUtils]: Spent 10.36s on a formula simplification. DAG size of input: 578 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:00:39,618 WARN L233 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 574 DAG size of output: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:01:05,127 WARN L233 SmtUtils]: Spent 9.77s on a formula simplification. DAG size of input: 590 DAG size of output: 132 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:01:22,187 WARN L233 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 383 DAG size of output: 133 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:01:39,496 WARN L233 SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 411 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:59,620 WARN L233 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 413 DAG size of output: 151 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:02:02,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:02:10,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:02:13,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:02:15,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:02:17,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:02:19,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:02:24,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]