./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/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_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/config/GemCutterReach.xml -i ../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/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_65db1cb9-68ec-4208-95c7-64421a919372/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 9a1ebdea5e08fe7fb177f9715317eb0e1f1a80d35c0ea62e77ce19d6486e2cb1 --- 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:42:56,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:42:56,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:42:56,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:42:56,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:42:56,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:42:56,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:42:56,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:42:56,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:42:56,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:42:56,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:42:56,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:42:56,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:42:56,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:42:56,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:42:56,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:42:56,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:42:56,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:42:56,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:42:56,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:42:56,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:42:56,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:42:56,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:42:56,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:42:56,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:42:56,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:42:56,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:42:56,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:42:56,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:42:56,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:42:56,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:42:56,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:42:56,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:42:56,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:42:56,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:42:56,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:42:56,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:42:56,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:42:56,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:42:56,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:42:56,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:42:56,248 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-25 18:42:56,271 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:42:56,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:42:56,271 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:42:56,272 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:42:56,272 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:42:56,273 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:42:56,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:42:56,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:42:56,274 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:42:56,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:42:56,275 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:42:56,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:42:56,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:42:56,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:42:56,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:42:56,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:42:56,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:42:56,277 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:42:56,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:42:56,277 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:42:56,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:42:56,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:42:56,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:42:56,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:42:56,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:42:56,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:42:56,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:42:56,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:42:56,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:42:56,280 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-25 18:42:56,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:42:56,280 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-25 18:42:56,281 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-25 18:42:56,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:42:56,281 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-25 18:42:56,281 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-25 18:42:56,282 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_65db1cb9-68ec-4208-95c7-64421a919372/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_65db1cb9-68ec-4208-95c7-64421a919372/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 -> 9a1ebdea5e08fe7fb177f9715317eb0e1f1a80d35c0ea62e77ce19d6486e2cb1 [2022-11-25 18:42:56,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:42:56,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:42:56,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:42:56,626 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:42:56,627 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:42:56,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/../../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2022-11-25 18:42:59,811 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:43:00,004 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:43:00,004 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2022-11-25 18:43:00,015 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/data/4958057a0/a6ce7a6bf3e64f228cdb5f314470271c/FLAGa6604cb5a [2022-11-25 18:43:00,047 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/data/4958057a0/a6ce7a6bf3e64f228cdb5f314470271c [2022-11-25 18:43:00,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:43:00,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:43:00,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:43:00,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:43:00,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:43:00,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:00,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41398b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00, skipping insertion in model container [2022-11-25 18:43:00,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:00,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:43:00,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:43:00,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:43:00,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:43:00,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:43:00,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:43:00,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:43:00,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:43:00,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:43:00,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:43:00,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:43:00,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:43:00,409 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_65db1cb9-68ec-4208-95c7-64421a919372/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c[3424,3437] [2022-11-25 18:43:00,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:43:00,439 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:43:00,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:43:00,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:43:00,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:43:00,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:43:00,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:43:00,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:43:00,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:43:00,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:43:00,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:43:00,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:43:00,499 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_65db1cb9-68ec-4208-95c7-64421a919372/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c[3424,3437] [2022-11-25 18:43:00,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:43:00,527 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:43:00,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00 WrapperNode [2022-11-25 18:43:00,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:43:00,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:43:00,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:43:00,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:43:00,542 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:43:00" (1/1) ... [2022-11-25 18:43:00,568 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:43:00" (1/1) ... [2022-11-25 18:43:00,615 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2022-11-25 18:43:00,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:43:00,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:43:00,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:43:00,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:43:00,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:00,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:00,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:00,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:00,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:00,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:00,672 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:00,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:00,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:43:00,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:43:00,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:43:00,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:43:00,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:00,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:43:00,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:00,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:43:00,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:43:00,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:43:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:43:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:43:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:43:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 18:43:00,772 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 18:43:00,773 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 18:43:00,773 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 18:43:00,773 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-25 18:43:00,774 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-25 18:43:00,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:43:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:43:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:43:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:43:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:43:00,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:43:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:43:00,779 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:43:00,929 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:43:00,931 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:43:01,447 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:43:01,647 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:43:01,648 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-25 18:43:01,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:43:01 BoogieIcfgContainer [2022-11-25 18:43:01,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:43:01,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:43:01,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:43:01,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:43:01,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:43:00" (1/3) ... [2022-11-25 18:43:01,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6f8ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:43:01, skipping insertion in model container [2022-11-25 18:43:01,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (2/3) ... [2022-11-25 18:43:01,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6f8ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:43:01, skipping insertion in model container [2022-11-25 18:43:01,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:43:01" (3/3) ... [2022-11-25 18:43:01,660 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2022-11-25 18:43:01,670 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:43:01,682 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:43:01,682 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:43:01,682 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:43:01,775 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-25 18:43:01,825 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:43:01,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-25 18:43:01,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:01,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-25 18:43:01,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-25 18:43:01,871 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-25 18:43:01,886 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-25 18:43:01,894 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;@21d5aa05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:43:01,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 18:43:02,244 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:43:02,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:02,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1185307655, now seen corresponding path program 1 times [2022-11-25 18:43:02,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:02,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323655020] [2022-11-25 18:43:02,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:02,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:02,625 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:43:02,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:02,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323655020] [2022-11-25 18:43:02,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323655020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:43:02,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:43:02,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:43:02,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850523503] [2022-11-25 18:43:02,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:43:02,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:43:02,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:02,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:43:02,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:43:02,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:02,669 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:02,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 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:43:02,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:02,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:02,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:43:02,818 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:43:02,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:02,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1332082552, now seen corresponding path program 1 times [2022-11-25 18:43:02,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:02,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7587673] [2022-11-25 18:43:02,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:02,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:03,479 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:43:03,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:03,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7587673] [2022-11-25 18:43:03,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7587673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:43:03,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:43:03,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:43:03,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982244596] [2022-11-25 18:43:03,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:43:03,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:43:03,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:03,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:43:03,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:43:03,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:03,486 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:03,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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:43:03,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:03,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:43:03,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:43:03,896 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:43:03,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:03,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1981012704, now seen corresponding path program 1 times [2022-11-25 18:43:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:03,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581966776] [2022-11-25 18:43:03,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:03,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:43:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:04,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581966776] [2022-11-25 18:43:04,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581966776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:43:04,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:43:04,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:43:04,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142750230] [2022-11-25 18:43:04,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:43:04,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:43:04,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:04,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:43:04,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:43:04,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:04,278 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:04,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 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:43:04,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:04,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:43:04,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:04,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:04,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:43:04,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:43:04,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:43:04,734 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:43:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:04,735 INFO L85 PathProgramCache]: Analyzing trace with hash 557196627, now seen corresponding path program 1 times [2022-11-25 18:43:04,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:04,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679042265] [2022-11-25 18:43:04,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:43:10,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:10,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679042265] [2022-11-25 18:43:10,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679042265] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:43:10,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026120858] [2022-11-25 18:43:10,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:10,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:10,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:10,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:43:10,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:43:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:10,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-25 18:43:10,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:43:10,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:43:10,599 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:43:10,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 18:43:10,728 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:43:10,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-25 18:43:11,975 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-25 18:43:11,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 37 [2022-11-25 18:43:12,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 18:43:15,310 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-25 18:43:15,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 37 [2022-11-25 18:43:15,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:43:17,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:43:18,013 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:43:18,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:43:19,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 22 [2022-11-25 18:43:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:43:20,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:43:26,487 WARN L837 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse1 (* c_~t~0 2)) (.cse3 (* c_~q2_front~0 4)) (.cse6 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse7 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse9 (* c_~q2_back~0 4)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse11 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse8 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse10 (+ .cse11 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse2 (+ .cse9 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse5 (select .cse8 c_~q1~0.base)) (.cse0 (+ .cse4 1))) (or (not (<= .cse0 0)) (< (+ .cse1 (* 2 (select .cse2 (+ .cse3 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (+ c_~s~0 .cse4)) (not (= (select .cse5 .cse6) 0)) (not (<= (select .cse5 .cse7) .cse0)))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse16 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse10 (+ .cse11 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse14 (+ .cse9 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse15 (select .cse16 c_~q1~0.base)) (.cse12 (+ .cse13 1))) (or (not (<= .cse12 0)) (<= (+ c_~s~0 .cse13) (+ .cse1 (* 2 (select .cse14 (+ .cse3 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1)) (not (= (select .cse15 .cse6) 0)) (not (<= (select .cse15 .cse7) .cse12)))))))))) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-25 18:43:48,387 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-11-25 18:43:48,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 346 treesize of output 172 [2022-11-25 18:43:48,698 INFO L321 Elim1Store]: treesize reduction 4, result has 97.5 percent of original size [2022-11-25 18:43:48,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62574 treesize of output 58404 [2022-11-25 18:43:49,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:49,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 58224 treesize of output 45352 [2022-11-25 18:43:49,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:49,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 45264 treesize of output 38872 [2022-11-25 18:43:49,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:49,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38784 treesize of output 35632 [2022-11-25 18:45:43,613 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-11-25 18:45:43,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 347 treesize of output 173 [2022-11-25 18:45:43,890 INFO L321 Elim1Store]: treesize reduction 4, result has 97.5 percent of original size [2022-11-25 18:45:43,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 8518 treesize of output 8092 [2022-11-25 18:45:44,035 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:45:44,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7912 treesize of output 7136 [2022-11-25 18:45:44,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:45:44,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7048 treesize of output 5408 [2022-11-25 18:45:44,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:45:44,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5150 treesize of output 4806 [2022-11-25 18:47:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 18:47:23,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026120858] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:47:23,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:47:23,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 43, 43] total 111 [2022-11-25 18:47:23,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592915001] [2022-11-25 18:47:23,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:47:23,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-11-25 18:47:23,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:47:23,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-11-25 18:47:23,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1672, Invalid=10234, Unknown=88, NotChecked=216, Total=12210 [2022-11-25 18:47:23,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:23,673 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:47:23,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 4.108108108108108) internal successors, (456), 111 states have internal predecessors, (456), 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:47:23,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:47:23,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:47:23,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:47:23,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:48:30,552 WARN L233 SmtUtils]: Spent 53.18s on a formula simplification that was a NOOP. DAG size: 495 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:48:30,729 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (* c_~q2_back~0 4)) (.cse7 (* c_~q2_front~0 4))) (let ((.cse5 (* c_~t~0 2)) (.cse62 (* c_~q1_back~0 4)) (.cse63 (* c_~q1_front~0 4)) (.cse38 (+ c_~q2~0.offset .cse7)) (.cse181 (select |c_#memory_int| c_~q2~0.base)) (.cse43 (+ .cse12 c_~q2~0.offset))) (let ((.cse36 (select .cse181 .cse43)) (.cse35 (* (select .cse181 .cse38) 2)) (.cse140 (= .cse62 .cse63)) (.cse142 (< c_~s~0 (+ .cse5 1))) (.cse143 (< 0 c_~q2_back~0)) (.cse144 (and (= .cse12 .cse7) (< .cse5 (+ c_~s~0 1))))) (let ((.cse49 (let ((.cse170 (+ .cse62 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse171 (+ .cse63 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_101 (Array Int Int))) (let ((.cse175 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) v_subst_1) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse174 (select .cse175 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|))) (let ((.cse173 (select .cse174 (+ .cse12 v_subst_1)))) (let ((.cse169 (select .cse175 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse172 (+ .cse173 1))) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)) (not (= (select .cse169 .cse170) 0)) (not (<= (select .cse169 .cse171) .cse172)) (<= (+ c_~s~0 .cse173) (+ .cse5 (* (select .cse174 (+ .cse7 v_subst_1)) 2) 1)) (not (<= .cse172 0)))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_101 (Array Int Int))) (let ((.cse180 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) v_subst_2) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse178 (select .cse180 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|))) (let ((.cse179 (select .cse178 (+ .cse12 v_subst_2)))) (let ((.cse176 (select .cse180 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse177 (+ .cse179 1))) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (not (= (select .cse176 .cse170) 0)) (not (<= (select .cse176 .cse171) .cse177)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (< (+ .cse5 (* (select .cse178 (+ .cse7 v_subst_2)) 2)) (+ c_~s~0 .cse179)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)) (not (<= .cse177 0))))))))))) (.cse85 (let ((.cse168 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)))))) (and (or .cse143 (and (or .cse168 .cse140) (or .cse168 .cse142))) (or .cse168 .cse143 .cse144)))) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse2 (not (< c_~q1_back~0 c_~n1~0))) (.cse4 (+ .cse62 c_~q1~0.offset)) (.cse10 (+ .cse63 c_~q1~0.offset)) (.cse34 (+ .cse5 .cse35 1)) (.cse1 (not (< c_~q2_back~0 c_~n2~0))) (.cse32 (+ .cse36 1)) (.cse19 (not (<= 0 c_~q2_back~0)))) (and (or .cse0 .cse1 .cse2 (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse11 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse13 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse6 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse3 (select .cse11 c_~q1~0.base)) (.cse9 (+ .cse8 1))) (or (not (= (select .cse3 .cse4) 0)) (< (+ .cse5 (* (select .cse6 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2)) (+ c_~s~0 .cse8)) (not (<= .cse9 0)) (not (<= (select .cse3 .cse10) .cse9)))))))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse18 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse13 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse16 (select .cse17 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse14 (select .cse18 c_~q1~0.base)) (.cse15 (+ .cse16 1))) (or (not (= (select .cse14 .cse4) 0)) (not (<= .cse15 0)) (not (<= (select .cse14 .cse10) .cse15)) (<= (+ c_~s~0 .cse16) (+ .cse5 (* (select .cse17 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2) 1)))))))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))))) .cse19) (or .cse0 .cse1 .cse2 .cse19 (let ((.cse24 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| .cse7)) (.cse26 (+ .cse12 |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (and (forall ((v_ArrVal_99 (Array Int Int)) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse23 (select .cse25 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (let ((.cse22 (select .cse23 .cse26))) (let ((.cse20 (select .cse25 c_~q1~0.base)) (.cse21 (+ .cse22 1))) (or (not (<= (select .cse20 .cse10) .cse21)) (<= (+ c_~s~0 .cse22) (+ .cse5 (* 2 (select .cse23 .cse24)) 1)) (not (= (select .cse20 .cse4) 0)) (not (<= .cse21 0)))))))) (forall ((v_ArrVal_99 (Array Int Int)) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse29 (select .cse31 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (let ((.cse30 (select .cse29 .cse26))) (let ((.cse27 (select .cse31 c_~q1~0.base)) (.cse28 (+ .cse30 1))) (or (not (<= (select .cse27 .cse10) .cse28)) (not (= (select .cse27 .cse4) 0)) (< (+ .cse5 (* 2 (select .cse29 .cse24))) (+ c_~s~0 .cse30)) (not (<= .cse28 0))))))))))) (or (not (<= .cse32 0)) .cse1 (not (<= (select (select |c_#memory_int| c_~q1~0.base) .cse10) .cse32)) .cse19 (let ((.cse33 (+ c_~s~0 .cse36))) (and (<= .cse33 .cse34) (< (+ .cse5 .cse35) .cse33)))) (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_101 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse37 (select .cse42 c_~q2~0.base))) (let ((.cse39 (select .cse37 .cse43))) (let ((.cse40 (select .cse42 c_~q1~0.base)) (.cse41 (+ .cse39 1))) (or (< (+ .cse5 (* 2 (select .cse37 .cse38))) (+ c_~s~0 .cse39)) (not (= (select .cse40 .cse4) 0)) (not (<= .cse41 0)) (not (<= (select .cse40 .cse10) .cse41)))))))) (forall ((v_ArrVal_101 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse46 (select .cse48 c_~q2~0.base))) (let ((.cse45 (select .cse46 .cse43))) (let ((.cse44 (select .cse48 c_~q1~0.base)) (.cse47 (+ .cse45 1))) (or (not (= (select .cse44 .cse4) 0)) (<= (+ c_~s~0 .cse45) (+ .cse5 (* 2 (select .cse46 .cse38)) 1)) (not (<= .cse47 0)) (not (<= (select .cse44 .cse10) .cse47))))))))) .cse19) (or .cse0 .cse2 .cse49 .cse19) (or (let ((.cse51 (+ |c_ULTIMATE.start_main_#t~ret15#1.offset| .cse63)) (.cse53 (+ |c_ULTIMATE.start_main_#t~ret15#1.offset| .cse62))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse56 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse55 (select .cse56 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|))) (let ((.cse54 (select .cse55 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse52 (+ .cse54 1)) (.cse50 (select .cse56 |c_ULTIMATE.start_main_#t~ret15#1.base|))) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (not (<= (select .cse50 .cse51) .cse52)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (not (<= .cse52 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)) (not (= (select .cse50 .cse53) 0)) (<= (+ c_~s~0 .cse54) (+ .cse5 (* 2 (select .cse55 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1)))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse61 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse59 (select .cse61 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|))) (let ((.cse60 (select .cse59 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse58 (+ .cse60 1)) (.cse57 (select .cse61 |c_ULTIMATE.start_main_#t~ret15#1.base|))) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (not (<= (select .cse57 .cse51) .cse58)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (not (<= .cse58 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)) (< (+ .cse5 (* 2 (select .cse59 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (+ c_~s~0 .cse60)) (not (= (select .cse57 .cse53) 0)))))))))) .cse0 .cse2 .cse19) (or .cse0 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse68 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse67 (select .cse68 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|))) (let ((.cse66 (select .cse67 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse64 (+ .cse66 1)) (.cse65 (select .cse68 c_~q1~0.base))) (or (not (<= .cse64 0)) (not (<= (select .cse65 .cse10) .cse64)) (not (= (select .cse65 .cse4) 0)) (<= (+ c_~s~0 .cse66) (+ .cse5 (* 2 (select .cse67 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1)))))))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse73 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse71 (select .cse73 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|))) (let ((.cse72 (select .cse71 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse69 (+ .cse72 1)) (.cse70 (select .cse73 c_~q1~0.base))) (or (not (<= .cse69 0)) (not (<= (select .cse70 .cse10) .cse69)) (< (+ .cse5 (* 2 (select .cse71 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (+ c_~s~0 .cse72)) (not (= (select .cse70 .cse4) 0)))))))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))))) .cse1 .cse2 .cse19) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post29#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse2 .cse49 .cse19) (or .cse0 .cse1 .cse2 (let ((.cse79 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse78 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base| (store .cse79 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse77 (select .cse78 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base|))) (let ((.cse76 (select .cse77 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse75 (select .cse78 c_~q1~0.base)) (.cse74 (+ .cse76 1))) (or (not (<= .cse74 0)) (not (= (select .cse75 .cse4) 0)) (not (<= (select .cse75 .cse10) .cse74)) (<= (+ c_~s~0 .cse76) (+ .cse5 1 (* (select .cse77 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2))))))))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse84 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base| (store .cse79 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse82 (select .cse84 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base|))) (let ((.cse83 (select .cse82 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse81 (select .cse84 c_~q1~0.base)) (.cse80 (+ .cse83 1))) (or (not (<= .cse80 0)) (not (= (select .cse81 .cse4) 0)) (not (<= (select .cse81 .cse10) .cse80)) (< (+ .cse5 (* (select .cse82 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2)) (+ c_~s~0 .cse83)))))))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))))) .cse19) (or .cse0 .cse85 .cse2 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse19) (or .cse0 .cse2 .cse19 (let ((.cse87 (+ .cse62 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse91 (+ .cse63 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse92 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse89 (select .cse92 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|))) (let ((.cse90 (select .cse89 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse86 (select .cse92 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse88 (+ .cse90 1))) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (not (= (select .cse86 .cse87) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (not (<= .cse88 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)) (< (+ .cse5 (* 2 (select .cse89 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (+ c_~s~0 .cse90)) (not (<= (select .cse86 .cse91) .cse88)))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse97 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse96 (select .cse97 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|))) (let ((.cse95 (select .cse96 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse93 (select .cse97 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse94 (+ .cse95 1))) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (not (= (select .cse93 .cse87) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (not (<= .cse94 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)) (not (<= (select .cse93 .cse91) .cse94)) (<= (+ c_~s~0 .cse95) (+ .cse5 (* 2 (select .cse96 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1))))))))))) (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_99 (Array Int Int)) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse102 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse99 (select .cse102 c_~q2~0.base))) (let ((.cse100 (select .cse99 .cse43))) (let ((.cse98 (select .cse102 c_~q1~0.base)) (.cse101 (+ .cse100 1))) (or (not (= (select .cse98 .cse4) 0)) (< (+ .cse5 (* 2 (select .cse99 .cse38))) (+ c_~s~0 .cse100)) (not (<= .cse101 0)) (not (<= (select .cse98 .cse10) .cse101)))))))) (forall ((v_ArrVal_99 (Array Int Int)) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse107 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse106 (select .cse107 c_~q2~0.base))) (let ((.cse105 (select .cse106 .cse43))) (let ((.cse103 (select .cse107 c_~q1~0.base)) (.cse104 (+ .cse105 1))) (or (not (= (select .cse103 .cse4) 0)) (not (<= .cse104 0)) (<= (+ c_~s~0 .cse105) (+ .cse5 (* 2 (select .cse106 .cse38)) 1)) (not (<= (select .cse103 .cse10) .cse104))))))))) .cse19) (or .cse0 .cse1 .cse2 .cse19 (let ((.cse111 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse114 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_99 (Array Int Int)) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse113 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse110 (select .cse113 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse112 (select .cse110 .cse114))) (let ((.cse108 (select .cse113 c_~q1~0.base)) (.cse109 (+ .cse112 1))) (or (not (= (select .cse108 .cse4) 0)) (not (<= (select .cse108 .cse10) .cse109)) (< (+ .cse5 (* 2 (select .cse110 .cse111))) (+ c_~s~0 .cse112)) (not (<= .cse109 0)))))))) (forall ((v_ArrVal_99 (Array Int Int)) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse119 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse118 (select .cse119 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse117 (select .cse118 .cse114))) (let ((.cse115 (select .cse119 c_~q1~0.base)) (.cse116 (+ .cse117 1))) (or (not (= (select .cse115 .cse4) 0)) (not (<= (select .cse115 .cse10) .cse116)) (<= (+ c_~s~0 .cse117) (+ .cse5 (* 2 (select .cse118 .cse111)) 1)) (not (<= .cse116 0))))))))))) (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse124 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse122 (select .cse124 c_~q2~0.base))) (let ((.cse121 (select .cse122 .cse43))) (let ((.cse123 (select .cse124 c_~q1~0.base)) (.cse120 (+ .cse121 1))) (or (not (<= .cse120 0)) (<= (+ c_~s~0 .cse121) (+ .cse5 (* 2 (select .cse122 .cse38)) 1)) (not (= (select .cse123 .cse4) 0)) (not (<= (select .cse123 .cse10) .cse120)))))))) (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse129 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse127 (select .cse129 c_~q2~0.base))) (let ((.cse128 (select .cse127 .cse43))) (let ((.cse126 (select .cse129 c_~q1~0.base)) (.cse125 (+ .cse128 1))) (or (not (<= .cse125 0)) (not (= (select .cse126 .cse4) 0)) (< (+ .cse5 (* 2 (select .cse127 .cse38))) (+ c_~s~0 .cse128)) (not (<= (select .cse126 .cse10) .cse125))))))))) .cse19) (or .cse0 .cse2 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse134 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse132 (select .cse134 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|))) (let ((.cse133 (select .cse132 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse130 (+ .cse133 1)) (.cse131 (select .cse134 c_~q1~0.base))) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (not (<= .cse130 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)) (not (<= (select .cse131 .cse10) .cse130)) (< (+ .cse5 (* 2 (select .cse132 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (+ c_~s~0 .cse133)) (not (= (select .cse131 .cse4) 0)))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse139 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse138 (select .cse139 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|))) (let ((.cse137 (select .cse138 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse135 (+ .cse137 1)) (.cse136 (select .cse139 c_~q1~0.base))) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (not (<= .cse135 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)) (not (<= (select .cse136 .cse10) .cse135)) (not (= (select .cse136 .cse4) 0)) (<= (+ c_~s~0 .cse137) (+ .cse5 (* 2 (select .cse138 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1))))))))) .cse19) (or .cse0 (let ((.cse141 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_13| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_13| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_13| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_13|) 0)))))) (and (or (and (or .cse140 .cse141) (or .cse141 .cse142)) .cse143) (or .cse143 .cse144 .cse141))) .cse2 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse19) (or .cse0 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse149 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse147 (select .cse149 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|))) (let ((.cse148 (select .cse147 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse145 (+ .cse148 1)) (.cse146 (select .cse149 c_~q1~0.base))) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (not (<= .cse145 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)) (not (<= (select .cse146 .cse10) .cse145)) (< (+ .cse5 (* 2 (select .cse147 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (+ c_~s~0 .cse148)) (not (= (select .cse146 .cse4) 0)))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_99 (Array Int Int)) (v_ArrVal_98 Int) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse154 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_98)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse153 (select .cse154 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|))) (let ((.cse152 (select .cse153 (+ .cse12 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse150 (+ .cse152 1)) (.cse151 (select .cse154 c_~q1~0.base))) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10| |c_#StackHeapBarrier|)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 0)) (not (<= .cse150 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base_10|) 0)) (not (<= (select .cse151 .cse10) .cse150)) (not (= (select .cse151 .cse4) 0)) (<= (+ c_~s~0 .cse152) (+ .cse5 (* 2 (select .cse153 (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1))))))))) .cse1 .cse2 .cse19) (or .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse85 .cse2 .cse19) (or .cse0 .cse1 .cse2 .cse19 (let ((.cse156 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse161 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_99 (Array Int Int)) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse160 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse155 (select .cse160 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse157 (select .cse155 .cse161))) (let ((.cse158 (select .cse160 c_~q1~0.base)) (.cse159 (+ .cse157 1))) (or (< (+ .cse5 (* (select .cse155 .cse156) 2)) (+ c_~s~0 .cse157)) (not (= (select .cse158 .cse4) 0)) (not (<= .cse159 0)) (not (<= (select .cse158 .cse10) .cse159)))))))) (forall ((v_ArrVal_99 (Array Int Int)) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse166 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_99) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101))) (let ((.cse165 (select .cse166 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse164 (select .cse165 .cse161))) (let ((.cse162 (select .cse166 c_~q1~0.base)) (.cse163 (+ .cse164 1))) (or (not (= (select .cse162 .cse4) 0)) (not (<= .cse163 0)) (not (<= (select .cse162 .cse10) .cse163)) (<= (+ c_~s~0 .cse164) (+ .cse5 (* (select .cse165 .cse156) 2) 1))))))))))) (or (let ((.cse167 (+ c_~s~0 |c_thread2Thread1of1ForFork2_~j~0#1|))) (and (< .cse34 .cse167) (<= .cse167 (+ .cse5 .cse35 2)))) (not (<= |c_thread2Thread1of1ForFork2_~j~0#1| 0)) .cse1 (not (= |c_thread2Thread1of1ForFork2_~j~0#1| .cse32)) .cse19)))))) is different from false [2022-11-25 18:49:24,153 WARN L233 SmtUtils]: Spent 22.39s on a formula simplification. DAG size of input: 307 DAG size of output: 287 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:49:32,252 WARN L233 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 254 DAG size of output: 234 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:49:42,434 WARN L233 SmtUtils]: Spent 7.72s on a formula simplification. DAG size of input: 256 DAG size of output: 252 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:50:03,392 WARN L233 SmtUtils]: Spent 13.82s on a formula simplification. DAG size of input: 240 DAG size of output: 236 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:50:52,658 WARN L233 SmtUtils]: Spent 44.53s on a formula simplification. DAG size of input: 305 DAG size of output: 285 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:51:49,260 WARN L233 SmtUtils]: Spent 52.02s on a formula simplification. DAG size of input: 305 DAG size of output: 286 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:52:15,789 WARN L233 SmtUtils]: Spent 24.90s on a formula simplification that was a NOOP. DAG size: 232 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:52:17,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:52:19,303 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 18:52:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:52:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:20,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-25 18:52:20,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 18:52:20,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:20,740 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 18:52:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:52:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash -310161201, now seen corresponding path program 1 times [2022-11-25 18:52:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:52:20,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731028208] [2022-11-25 18:52:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:20,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:52:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:52:21,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:52:21,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731028208] [2022-11-25 18:52:21,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731028208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:52:21,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828106664] [2022-11-25 18:52:21,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:21,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:21,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:52:21,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:52:21,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:52:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:21,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:52:21,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:52:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 18:52:22,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:52:22,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828106664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:52:22,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:52:22,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 12 [2022-11-25 18:52:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346298059] [2022-11-25 18:52:22,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:52:22,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:52:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:52:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:52:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:22,011 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:22,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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:22,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:22,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:52:22,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:52:22,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-11-25 18:52:22,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:44,223 WARN L233 SmtUtils]: Spent 20.06s on a formula simplification that was a NOOP. DAG size: 234 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:53:54,924 WARN L233 SmtUtils]: Spent 1.12m on a formula simplification. DAG size of input: 234 DAG size of output: 227 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:54:23,577 WARN L233 SmtUtils]: Spent 24.19s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:54:51,393 WARN L233 SmtUtils]: Spent 24.84s on a formula simplification that was a NOOP. DAG size: 231 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:54:54,396 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 18:54:54,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:54,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:54:54,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:54:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-11-25 18:54:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:54:54,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 18:54:54,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:54:54,640 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:54:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:54:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1647198601, now seen corresponding path program 1 times [2022-11-25 18:54:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:54:54,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648918381] [2022-11-25 18:54:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:54:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:54:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:54:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:54:55,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:54:55,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648918381] [2022-11-25 18:54:55,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648918381] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:54:55,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507836893] [2022-11-25 18:54:55,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:54:55,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:54:55,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:54:55,171 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:54:55,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:54:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:54:55,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 18:54:55,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:54:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:54:56,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:54:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:54:57,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507836893] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:54:57,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:54:57,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-11-25 18:54:57,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079283050] [2022-11-25 18:54:57,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:54:57,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 18:54:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:54:57,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 18:54:57,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:54:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:57,669 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:54:57,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.263157894736842) internal successors, (252), 19 states have internal predecessors, (252), 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:57,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:57,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:54:57,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:54:57,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-11-25 18:54:57,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:54:57,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:55:01,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:55:42,405 WARN L233 SmtUtils]: Spent 38.76s on a formula simplification that was a NOOP. DAG size: 231 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:56:31,583 WARN L233 SmtUtils]: Spent 39.26s on a formula simplification. DAG size of input: 517 DAG size of output: 513 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:56:32,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:56:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:56:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:56:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:56:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-11-25 18:56:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:56:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:56:38,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:56:38,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 18:56:38,272 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:56:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:56:38,273 INFO L85 PathProgramCache]: Analyzing trace with hash 435959970, now seen corresponding path program 1 times [2022-11-25 18:56:38,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:56:38,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733626268] [2022-11-25 18:56:38,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:56:38,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:56:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:56:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:56:38,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:56:38,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733626268] [2022-11-25 18:56:38,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733626268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:56:38,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308511834] [2022-11-25 18:56:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:56:38,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:56:38,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:56:38,806 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:56:38,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65db1cb9-68ec-4208-95c7-64421a919372/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:56:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:56:38,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 18:56:38,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:56:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:56:39,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:56:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:56:40,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308511834] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:56:40,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:56:40,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-11-25 18:56:40,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584546182] [2022-11-25 18:56:40,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:56:40,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 18:56:40,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:56:40,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 18:56:40,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:56:40,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:56:40,825 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:56:40,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.473684210526315) internal successors, (237), 19 states have internal predecessors, (237), 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:56:40,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:56:40,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:56:40,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:56:40,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-11-25 18:56:40,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:56:40,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:56:40,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.