./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:31:23,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:31:23,478 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 15:31:23,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:31:23,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:31:23,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:31:23,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:31:23,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:31:23,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:31:23,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:31:23,510 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:31:23,510 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:31:23,511 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:31:23,511 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:31:23,512 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:31:23,512 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:31:23,513 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:31:23,513 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:31:23,514 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:31:23,514 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:31:23,515 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:31:23,516 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:31:23,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:31:23,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:31:23,517 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:31:23,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:31:23,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:31:23,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:31:23,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:31:23,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:31:23,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:31:23,520 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:31:23,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:31:23,520 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:31:23,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:31:23,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:31:23,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:31:23,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:31:23,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:31:23,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:31:23,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:31:23,522 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:31:23,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:31:23,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:31:23,523 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:31:23,523 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:31:23,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:31:23,523 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/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_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2023-12-02 15:31:23,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:31:23,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:31:23,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:31:23,758 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:31:23,758 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:31:23,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2023-12-02 15:31:26,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:31:26,729 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:31:26,729 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2023-12-02 15:31:26,743 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/data/4b710da49/1ea59292766e4a54ae4aadb3fb92ef51/FLAGb585ce7c5 [2023-12-02 15:31:27,063 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/data/4b710da49/1ea59292766e4a54ae4aadb3fb92ef51 [2023-12-02 15:31:27,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:31:27,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:31:27,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:31:27,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:31:27,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:31:27,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:31:27" (1/1) ... [2023-12-02 15:31:27,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@728bf1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27, skipping insertion in model container [2023-12-02 15:31:27,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:31:27" (1/1) ... [2023-12-02 15:31:27,118 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:31:27,341 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2023-12-02 15:31:27,347 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2023-12-02 15:31:27,347 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2023-12-02 15:31:27,349 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2023-12-02 15:31:27,350 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2023-12-02 15:31:27,351 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2023-12-02 15:31:27,352 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2023-12-02 15:31:27,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:31:27,366 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:31:27,399 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2023-12-02 15:31:27,400 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2023-12-02 15:31:27,401 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2023-12-02 15:31:27,402 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2023-12-02 15:31:27,403 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2023-12-02 15:31:27,404 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2023-12-02 15:31:27,405 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2023-12-02 15:31:27,408 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:31:27,434 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:31:27,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27 WrapperNode [2023-12-02 15:31:27,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:31:27,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:31:27,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:31:27,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:31:27,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27" (1/1) ... [2023-12-02 15:31:27,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27" (1/1) ... [2023-12-02 15:31:27,475 INFO L138 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 151 [2023-12-02 15:31:27,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:31:27,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:31:27,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:31:27,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:31:27,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27" (1/1) ... [2023-12-02 15:31:27,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27" (1/1) ... [2023-12-02 15:31:27,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27" (1/1) ... [2023-12-02 15:31:27,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27" (1/1) ... [2023-12-02 15:31:27,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27" (1/1) ... [2023-12-02 15:31:27,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27" (1/1) ... [2023-12-02 15:31:27,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27" (1/1) ... [2023-12-02 15:31:27,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27" (1/1) ... [2023-12-02 15:31:27,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:31:27,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:31:27,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:31:27,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:31:27,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27" (1/1) ... [2023-12-02 15:31:27,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:31:27,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:31:27,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:31:27,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:31:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 15:31:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 15:31:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:31:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:31:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:31:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:31:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:31:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:31:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:31:27,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:31:27,689 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:31:27,691 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:31:27,904 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:31:27,971 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:31:27,971 INFO L309 CfgBuilder]: Removed 17 assume(true) statements. [2023-12-02 15:31:27,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:31:27 BoogieIcfgContainer [2023-12-02 15:31:27,973 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:31:27,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:31:27,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:31:27,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:31:27,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:31:27" (1/3) ... [2023-12-02 15:31:27,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2396f9bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:31:27, skipping insertion in model container [2023-12-02 15:31:27,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:31:27" (2/3) ... [2023-12-02 15:31:27,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2396f9bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:31:27, skipping insertion in model container [2023-12-02 15:31:27,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:31:27" (3/3) ... [2023-12-02 15:31:27,982 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2023-12-02 15:31:28,002 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:31:28,002 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-12-02 15:31:28,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:31:28,058 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6ffc3532, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:31:28,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-02 15:31:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 33 states have (on average 2.0) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:31:28,069 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:28,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:31:28,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-02 15:31:28,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash 205424031, now seen corresponding path program 1 times [2023-12-02 15:31:28,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:28,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058954929] [2023-12-02 15:31:28,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:28,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:28,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:28,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058954929] [2023-12-02 15:31:28,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058954929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:28,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:31:28,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:31:28,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631119645] [2023-12-02 15:31:28,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:28,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 15:31:28,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:28,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 15:31:28,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:31:28,293 INFO L87 Difference]: Start difference. First operand has 41 states, 33 states have (on average 2.0) internal successors, (66), 40 states have internal predecessors, (66), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:28,366 INFO L93 Difference]: Finished difference Result 81 states and 131 transitions. [2023-12-02 15:31:28,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 15:31:28,369 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2023-12-02 15:31:28,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:28,375 INFO L225 Difference]: With dead ends: 81 [2023-12-02 15:31:28,375 INFO L226 Difference]: Without dead ends: 39 [2023-12-02 15:31:28,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:31:28,381 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:28,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:31:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-02 15:31:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-02 15:31:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.28125) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2023-12-02 15:31:28,410 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 5 [2023-12-02 15:31:28,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:28,411 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2023-12-02 15:31:28,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2023-12-02 15:31:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:31:28,412 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:28,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:31:28,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:31:28,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-02 15:31:28,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:28,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2010283149, now seen corresponding path program 1 times [2023-12-02 15:31:28,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:28,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013751403] [2023-12-02 15:31:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:28,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:28,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:28,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013751403] [2023-12-02 15:31:28,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013751403] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:28,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:31:28,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:31:28,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247912286] [2023-12-02 15:31:28,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:28,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:31:28,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:28,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:31:28,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:31:28,539 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:28,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:28,672 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2023-12-02 15:31:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:31:28,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2023-12-02 15:31:28,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:28,674 INFO L225 Difference]: With dead ends: 42 [2023-12-02 15:31:28,674 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 15:31:28,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:31:28,676 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:28,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 33 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:31:28,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 15:31:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2023-12-02 15:31:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2023-12-02 15:31:28,684 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 6 [2023-12-02 15:31:28,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:28,685 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2023-12-02 15:31:28,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2023-12-02 15:31:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:31:28,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:28,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:31:28,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:31:28,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-02 15:31:28,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2015621602, now seen corresponding path program 1 times [2023-12-02 15:31:28,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:28,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415065917] [2023-12-02 15:31:28,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:28,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:29,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415065917] [2023-12-02 15:31:29,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415065917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:29,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:31:29,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:31:29,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203288460] [2023-12-02 15:31:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:29,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:31:29,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:29,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:31:29,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:31:29,163 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:29,400 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2023-12-02 15:31:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:31:29,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Word has length 6 [2023-12-02 15:31:29,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:29,402 INFO L225 Difference]: With dead ends: 35 [2023-12-02 15:31:29,403 INFO L226 Difference]: Without dead ends: 33 [2023-12-02 15:31:29,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:31:29,405 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:29,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:31:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-02 15:31:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-02 15:31:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2023-12-02 15:31:29,413 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 6 [2023-12-02 15:31:29,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:29,413 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2023-12-02 15:31:29,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2023-12-02 15:31:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 15:31:29,414 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:29,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:31:29,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 15:31:29,415 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-02 15:31:29,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:29,415 INFO L85 PathProgramCache]: Analyzing trace with hash -674685519, now seen corresponding path program 1 times [2023-12-02 15:31:29,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:29,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127245712] [2023-12-02 15:31:29,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:29,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:29,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:29,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127245712] [2023-12-02 15:31:29,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127245712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:29,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:31:29,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:31:29,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675174079] [2023-12-02 15:31:29,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:29,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:31:29,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:29,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:31:29,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:31:29,502 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:29,771 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2023-12-02 15:31:29,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:31:29,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2023-12-02 15:31:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:29,773 INFO L225 Difference]: With dead ends: 58 [2023-12-02 15:31:29,773 INFO L226 Difference]: Without dead ends: 56 [2023-12-02 15:31:29,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:31:29,775 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:29,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 81 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:31:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-02 15:31:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2023-12-02 15:31:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-12-02 15:31:29,786 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 9 [2023-12-02 15:31:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:29,786 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-12-02 15:31:29,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-12-02 15:31:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 15:31:29,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:29,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:31:29,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 15:31:29,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-02 15:31:29,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash -550678749, now seen corresponding path program 1 times [2023-12-02 15:31:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:29,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753488786] [2023-12-02 15:31:29,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:29,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:30,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:30,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753488786] [2023-12-02 15:31:30,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753488786] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:30,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:31:30,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:31:30,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325232189] [2023-12-02 15:31:30,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:30,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:31:30,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:30,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:31:30,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:31:30,528 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:31,214 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2023-12-02 15:31:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:31:31,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2023-12-02 15:31:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:31,215 INFO L225 Difference]: With dead ends: 40 [2023-12-02 15:31:31,215 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 15:31:31,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:31:31,216 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:31,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 15:31:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 15:31:31,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-02 15:31:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2023-12-02 15:31:31,225 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 9 [2023-12-02 15:31:31,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:31,225 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2023-12-02 15:31:31,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2023-12-02 15:31:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 15:31:31,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:31,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:31:31,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 15:31:31,227 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-02 15:31:31,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:31,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1964955224, now seen corresponding path program 1 times [2023-12-02 15:31:31,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:31,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220618509] [2023-12-02 15:31:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:31,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:31,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:31,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220618509] [2023-12-02 15:31:31,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220618509] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:31,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:31:31,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:31:31,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641513358] [2023-12-02 15:31:31,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:31,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:31:31,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:31,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:31:31,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:31:31,277 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:32,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:32,378 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2023-12-02 15:31:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:31:32,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) Word has length 13 [2023-12-02 15:31:32,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:32,379 INFO L225 Difference]: With dead ends: 53 [2023-12-02 15:31:32,379 INFO L226 Difference]: Without dead ends: 41 [2023-12-02 15:31:32,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:31:32,380 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:32,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 15:31:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-02 15:31:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-12-02 15:31:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-12-02 15:31:32,389 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2023-12-02 15:31:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:32,390 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-12-02 15:31:32,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-12-02 15:31:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 15:31:32,391 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:32,391 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:31:32,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 15:31:32,392 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-02 15:31:32,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1304035415, now seen corresponding path program 1 times [2023-12-02 15:31:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:32,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193256003] [2023-12-02 15:31:32,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:32,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:32,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:32,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193256003] [2023-12-02 15:31:32,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193256003] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:31:32,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851750494] [2023-12-02 15:31:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:32,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:31:32,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:31:32,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:31:32,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:31:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:32,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 15:31:32,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:31:32,637 INFO L378 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 21 treesize of output 15 [2023-12-02 15:31:32,647 INFO L378 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 25 treesize of output 7 [2023-12-02 15:31:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:32,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:31:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:32,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851750494] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:31:32,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1944565651] [2023-12-02 15:31:32,918 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-12-02 15:31:32,918 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:31:32,921 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:31:32,926 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:31:32,926 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:31:33,598 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:31:34,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1944565651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:34,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:31:34,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4, 4] total 11 [2023-12-02 15:31:34,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324329959] [2023-12-02 15:31:34,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:34,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:31:34,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:34,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:31:34,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:31:34,992 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:36,215 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2023-12-02 15:31:36,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:31:36,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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) Word has length 16 [2023-12-02 15:31:36,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:36,216 INFO L225 Difference]: With dead ends: 58 [2023-12-02 15:31:36,216 INFO L226 Difference]: Without dead ends: 35 [2023-12-02 15:31:36,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:31:36,217 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:36,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 15:31:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-02 15:31:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-02 15:31:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:36,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2023-12-02 15:31:36,224 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 16 [2023-12-02 15:31:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:36,224 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2023-12-02 15:31:36,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:36,225 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2023-12-02 15:31:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 15:31:36,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:36,225 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:31:36,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-02 15:31:36,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:31:36,431 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-02 15:31:36,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:36,432 INFO L85 PathProgramCache]: Analyzing trace with hash 56104159, now seen corresponding path program 1 times [2023-12-02 15:31:36,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:36,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083511285] [2023-12-02 15:31:36,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:36,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:37,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:37,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083511285] [2023-12-02 15:31:37,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083511285] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:31:37,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754657077] [2023-12-02 15:31:37,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:37,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:31:37,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:31:37,404 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:31:37,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 15:31:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:37,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 15:31:37,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:31:37,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:31:37,579 INFO L378 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 [2023-12-02 15:31:37,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:31:37,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 365 [2023-12-02 15:31:37,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:31:37,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 289 [2023-12-02 15:31:37,817 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-12-02 15:31:37,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 311 treesize of output 291 [2023-12-02 15:31:37,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:31:37,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 330 [2023-12-02 15:31:37,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:31:37,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 288 [2023-12-02 15:31:37,968 INFO L349 Elim1Store]: treesize reduction 109, result has 33.9 percent of original size [2023-12-02 15:31:37,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 269 treesize of output 332 [2023-12-02 15:31:38,036 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-12-02 15:31:38,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 271 [2023-12-02 15:31:38,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:31:38,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-12-02 15:31:38,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:31:38,387 INFO L349 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2023-12-02 15:31:38,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 11 [2023-12-02 15:31:38,416 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-12-02 15:31:38,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 17 [2023-12-02 15:31:38,449 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:31:38,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 123 [2023-12-02 15:31:38,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 84 [2023-12-02 15:31:38,595 INFO L349 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2023-12-02 15:31:38,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 173 [2023-12-02 15:31:38,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:38,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 114 treesize of output 184 [2023-12-02 15:31:58,241 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-12-02 15:31:58,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 5154 treesize of output 4841 [2023-12-02 15:31:58,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:58,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4695 treesize of output 4400 [2023-12-02 15:32:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:32:02,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:32:03,181 INFO L349 Elim1Store]: treesize reduction 20, result has 73.0 percent of original size [2023-12-02 15:32:03,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 888 treesize of output 930 [2023-12-02 15:32:03,411 INFO L349 Elim1Store]: treesize reduction 36, result has 70.7 percent of original size [2023-12-02 15:32:03,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1070 treesize of output 1206 [2023-12-02 15:32:03,786 INFO L349 Elim1Store]: treesize reduction 14, result has 68.2 percent of original size [2023-12-02 15:32:03,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 807 treesize of output 842 [2023-12-02 15:32:04,025 INFO L349 Elim1Store]: treesize reduction 73, result has 31.8 percent of original size [2023-12-02 15:32:04,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 866 treesize of output 1035 [2023-12-02 15:32:04,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:04,496 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 147 [2023-12-02 15:32:04,610 INFO L378 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 9 treesize of output 1 [2023-12-02 15:32:05,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-12-02 15:32:05,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:05,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:05,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 455 treesize of output 427 [2023-12-02 15:32:05,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:05,475 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 191 [2023-12-02 15:32:05,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:05,516 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 15:32:05,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 4 [2023-12-02 15:32:05,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:05,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 95 [2023-12-02 15:32:05,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:05,763 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 147 [2023-12-02 15:32:05,873 INFO L378 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 9 treesize of output 1 [2023-12-02 15:32:06,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-12-02 15:32:06,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:06,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:06,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2023-12-02 15:32:06,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:06,707 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 15:32:06,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 4 [2023-12-02 15:32:06,716 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:32:06,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 91 [2023-12-02 15:32:06,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:06,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 163 [2023-12-02 15:32:07,052 INFO L378 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 9 treesize of output 1 [2023-12-02 15:32:07,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-12-02 15:32:08,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 165 [2023-12-02 15:32:08,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:08,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:08,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 572 treesize of output 542 [2023-12-02 15:32:08,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-12-02 15:32:08,493 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:32:08,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 266 [2023-12-02 15:32:08,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:08,811 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 147 [2023-12-02 15:32:08,924 INFO L378 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 9 treesize of output 1 [2023-12-02 15:32:09,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-12-02 15:32:09,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:09,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:09,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2023-12-02 15:32:09,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:09,764 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 15:32:09,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 4 [2023-12-02 15:32:09,772 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:32:09,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 91 [2023-12-02 15:32:09,907 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:09,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:09,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 203 [2023-12-02 15:32:10,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 1 [2023-12-02 15:32:10,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-12-02 15:32:10,945 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:10,946 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:10,948 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:10,948 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:10,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:10,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 458 treesize of output 394 [2023-12-02 15:32:10,972 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:10,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:10,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 163 treesize of output 182 [2023-12-02 15:32:10,991 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:10,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:10,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 150 [2023-12-02 15:32:11,011 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:11,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:11,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 133 treesize of output 155 [2023-12-02 15:32:11,137 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:11,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 13 [2023-12-02 15:32:11,150 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:11,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 25 [2023-12-02 15:32:11,187 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:11,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-12-02 15:32:11,194 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:11,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 4 [2023-12-02 15:32:11,197 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:11,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2023-12-02 15:32:11,208 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 15:32:11,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 176 [2023-12-02 15:32:11,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-02 15:32:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:32:11,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754657077] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:32:11,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1181173805] [2023-12-02 15:32:11,810 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 15:32:11,810 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:32:11,810 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:32:11,811 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:32:11,811 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:32:33,266 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:32:35,457 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (let ((.cse14 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8))) (let ((.cse17 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) .cse14)) (.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse14))) (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet2#1_28| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2#1_28| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet2#1_28| 0)) (<= |v_ULTIMATE.start_main_#t~nondet2#1_28| 2147483647))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_13| Int) (|v_ULTIMATE.start_main_#t~mem8#1.base_22| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| Int) (|v_#length_25| (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.base_60| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_#memory_int_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc7#1.offset_22| Int) (|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#valid_35| (Array Int Int)) (|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.base_22| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_60| Int) (|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.offset_22| Int)) (let ((.cse6 (let ((.cse22 (store |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~end~0#1.base_60| (store (select |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)))) (store .cse22 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse22 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |v_ULTIMATE.start_main_~end~0#1.base_60|))))) (let ((.cse2 (let ((.cse21 (store |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~end~0#1.base_60| (store (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60| 0)))) (store .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |v_ULTIMATE.start_main_~end~0#1.offset_60|)))) (.cse3 (select (select .cse6 |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60|))) (let ((.cse10 (select |v_#memory_int_45| .cse3)) (.cse1 (select (select .cse2 |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60|))) (and (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (= (select |v_#valid_35| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 0) (= |v_#memory_int_50| (store |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 (select (select |v_#memory_int_50| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4)))) (<= (+ |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_51| (store |v_#memory_int_126| |v_ULTIMATE.start_main_~end~0#1.base_60| (store (select |v_#memory_int_126| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60| (select (select |v_#memory_int_51| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60|)))) (let ((.cse4 (store (select .cse2 .cse3) .cse1 0)) (.cse0 (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (.cse8 (store |v_#valid_35| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1)) (.cse9 (store |v_#length_25| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 12)) (.cse7 (store (select .cse6 .cse3) .cse1 0)) (.cse5 (+ 8 .cse1))) (or (and (not .cse0) (= |v_ULTIMATE.start_main_#t~mem8#1.base_22| |c_ULTIMATE.start_main_#t~mem8#1.base|) (= |c_ULTIMATE.start_main_#t~mem9#1.offset| |v_ULTIMATE.start_main_#t~mem9#1.offset_22|) (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_33| |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_#memory_$Pointer$.offset| (store .cse2 .cse3 (store .cse4 .cse5 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse5)))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| |v_ULTIMATE.start_main_#t~mem9#1.base_22|) (= |c_ULTIMATE.start_main_#t~mem8#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (= |c_#memory_$Pointer$.base| (store .cse6 .cse3 (store .cse7 .cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse5)))) (= |c_#valid| .cse8) (= .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) (= .cse9 |c_#length|) (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_22| |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (= (store |v_#memory_int_45| .cse3 (store .cse10 .cse5 1)) |c_#memory_int|)) (let ((.cse12 (select |v_#memory_$Pointer$.offset_31| .cse3)) (.cse18 (select |v_#memory_$Pointer$.base_31| .cse3))) (let ((.cse13 (let ((.cse20 (store |v_#memory_$Pointer$.base_31| .cse3 (store .cse18 .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)))) (store .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse3)))) (.cse16 (select |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse11 (let ((.cse19 (store |v_#memory_$Pointer$.offset_31| .cse3 (store .cse12 .cse1 0)))) (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse1))))) (and (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select .cse11 .cse3) .cse1)) (= (store |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 (select (select |v_#memory_int_46| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4))) |v_#memory_int_46|) (= (store .cse2 .cse3 (store .cse4 .cse5 (select .cse12 .cse5))) |v_#memory_$Pointer$.offset_31|) (= |c_#memory_$Pointer$.base| (store .cse13 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse14 .cse15))) (= |v_#memory_int_48| (store |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select .cse16 |c_ULTIMATE.start_main_~end~0#1.offset|)))) .cse0 (= (select .cse8 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0) (= |c_#valid| (store .cse8 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1)) (= |c_#length| (store .cse9 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 12)) (= (select (select .cse13 .cse3) .cse1) |c_ULTIMATE.start_main_~end~0#1.base|) (= (store |v_#memory_int_45| .cse3 (store (store .cse10 .cse5 0) .cse1 (select (select |v_#memory_int_47| .cse3) .cse1))) |v_#memory_int_47|) (<= (+ |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) |c_#StackHeapBarrier|) (= (store |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse16 .cse14 1)) |c_#memory_int|) (= (store .cse11 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse14 .cse17)) |c_#memory_$Pointer$.offset|) (= (store .cse6 .cse3 (store .cse7 .cse5 (select .cse18 .cse5))) |v_#memory_$Pointer$.base_31|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 0))))))) (= |v_#memory_int_45| (store |v_#memory_int_50| .cse3 (store (select |v_#memory_int_50| .cse3) .cse1 (select .cse10 .cse1)))) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648)))))))) (and (exists ((|v_ULTIMATE.start_main_#t~nondet2#1_24| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet2#1_24| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2#1_24| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet2#1_24| 2147483647))) (<= (+ |c_ULTIMATE.start_main_~list~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_#t~mem9#1.offset_19| Int) (|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_32| (Array Int (Array Int Int))) (|v_#memory_int_33| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_13| Int) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.base_19| Int) (|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.offset_19| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_#memory_int_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#valid_31| (Array Int Int)) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_#length_21| (Array Int Int)) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.base_19| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.offset_19| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int)) (let ((.cse45 (select |v_#memory_$Pointer$.base_49| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse34 (let ((.cse48 (store |v_#memory_$Pointer$.base_49| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse45 0 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)))) (store .cse48 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse48 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |c_ULTIMATE.start_main_~list~0#1.base|)))) (.cse46 (select |v_#memory_$Pointer$.offset_49| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse38 (let ((.cse47 (store |v_#memory_$Pointer$.offset_49| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse46 0 0)))) (store .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 0)))) (.cse28 (select (select .cse34 |c_ULTIMATE.start_main_~list~0#1.base|) 0))) (let ((.cse43 (store |v_#valid_31| |c_ULTIMATE.start_main_~list~0#1.base| 1)) (.cse44 (select |v_#memory_int_33| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse23 (select |v_#memory_int_32| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse30 (select |v_#memory_int_45| .cse28)) (.cse29 (select (select .cse38 |c_ULTIMATE.start_main_~list~0#1.base|) 0)) (.cse24 (select |v_#memory_int_116| 1))) (and (= |v_#memory_int_51| (store |v_#memory_int_32| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse23 8 1) 0 (select (select |v_#memory_int_51| |c_ULTIMATE.start_main_~list~0#1.base|) 0)))) (= (select .cse24 1) 0) (let ((.cse33 (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (.cse35 (store (select .cse34 .cse28) .cse29 0)) (.cse39 (store (select .cse38 .cse28) .cse29 0)) (.cse32 (store .cse43 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1)) (.cse37 (store (store |v_#length_21| |c_ULTIMATE.start_main_~list~0#1.base| 12) |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 12)) (.cse31 (+ 8 .cse29))) (or (let ((.cse36 (select |v_#memory_$Pointer$.base_31| .cse28)) (.cse40 (select |v_#memory_$Pointer$.offset_31| .cse28))) (let ((.cse25 (let ((.cse42 (store |v_#memory_$Pointer$.offset_31| .cse28 (store .cse40 .cse29 0)))) (store .cse42 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse42 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse29)))) (.cse27 (let ((.cse41 (store |v_#memory_$Pointer$.base_31| .cse28 (store .cse36 .cse29 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)))) (store .cse41 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse41 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse28)))) (.cse26 (select |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (store |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 (select (select |v_#memory_int_46| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4))) |v_#memory_int_46|) (= |c_#memory_$Pointer$.offset| (store .cse25 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse14 .cse17))) (= |v_#memory_int_48| (store |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select .cse26 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select .cse27 .cse28) .cse29) |c_ULTIMATE.start_main_~end~0#1.base|) (= (store |v_#memory_int_45| .cse28 (store (store .cse30 .cse31 0) .cse29 (select (select |v_#memory_int_47| .cse28) .cse29))) |v_#memory_int_47|) (= (select .cse32 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0) .cse33 (= (store .cse34 .cse28 (store .cse35 .cse31 (select .cse36 .cse31))) |v_#memory_$Pointer$.base_31|) (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select .cse25 .cse28) .cse29)) (<= (+ |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) |c_#StackHeapBarrier|) (= (store .cse27 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse14 .cse15)) |c_#memory_$Pointer$.base|) (= (store |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse26 .cse14 1)) |c_#memory_int|) (= |c_#valid| (store .cse32 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1)) (= (store .cse37 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 12) |c_#length|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 0)) (= |v_#memory_$Pointer$.offset_31| (store .cse38 .cse28 (store .cse39 .cse31 (select .cse40 .cse31))))))) (and (not .cse33) (= (store .cse34 .cse28 (store .cse35 .cse31 (select (select |c_#memory_$Pointer$.base| .cse28) .cse31))) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store .cse38 .cse28 (store .cse39 .cse31 (select (select |c_#memory_$Pointer$.offset| .cse28) .cse31)))) (= |c_#valid| .cse32) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_29| |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_ULTIMATE.start_main_#t~mem9#1.base| |v_ULTIMATE.start_main_#t~mem9#1.base_19|) (= |c_ULTIMATE.start_main_#t~mem9#1.offset| |v_ULTIMATE.start_main_#t~mem9#1.offset_19|) (= |c_ULTIMATE.start_main_~end~0#1.base| .cse28) (= |v_ULTIMATE.start_main_#t~mem8#1.base_19| |c_ULTIMATE.start_main_#t~mem8#1.base|) (= .cse37 |c_#length|) (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_19| |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (= |c_ULTIMATE.start_main_#t~mem8#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_19|) (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse29) (= (store |v_#memory_int_45| .cse28 (store .cse30 .cse31 1)) |c_#memory_int|)))) (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (= 2 (select |v_#length_21| 1)) (= |v_#memory_int_50| (store |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 (select (select |v_#memory_int_50| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4)))) (= (select |v_#valid_31| 0) 0) (= (select |v_#valid_31| 2) 1) (= (store |v_#memory_int_116| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_116| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse44 0))) |v_#memory_int_33|) (= (select |v_#valid_31| 1) 1) (= (select .cse43 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 0) (<= (+ |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_32| (store |v_#memory_int_33| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse44 4 (select .cse23 4)))) (= (store |v_#memory_int_50| .cse28 (store (select |v_#memory_int_50| .cse28) .cse29 (select .cse30 .cse29))) |v_#memory_int_45|) (= (store |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 (select .cse45 8))) |v_#memory_$Pointer$.base_49|) (= (select |v_#valid_31| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 0)) (= (store |v_#memory_$Pointer$.offset_48| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_48| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 (select .cse46 8))) |v_#memory_$Pointer$.offset_49|) (= (select |v_#length_21| 2) 19) (= (select .cse24 0) 48) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648))))))))))))) is different from false [2023-12-02 15:32:37,534 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8))) (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (let ((.cse17 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) .cse14)) (.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse14))) (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet2#1_28| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2#1_28| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet2#1_28| 0)) (<= |v_ULTIMATE.start_main_#t~nondet2#1_28| 2147483647))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_13| Int) (|v_ULTIMATE.start_main_#t~mem8#1.base_22| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| Int) (|v_#length_25| (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.base_60| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_#memory_int_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc7#1.offset_22| Int) (|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#valid_35| (Array Int Int)) (|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.base_22| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_60| Int) (|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.offset_22| Int)) (let ((.cse6 (let ((.cse22 (store |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~end~0#1.base_60| (store (select |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)))) (store .cse22 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse22 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |v_ULTIMATE.start_main_~end~0#1.base_60|))))) (let ((.cse2 (let ((.cse21 (store |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~end~0#1.base_60| (store (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60| 0)))) (store .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |v_ULTIMATE.start_main_~end~0#1.offset_60|)))) (.cse3 (select (select .cse6 |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60|))) (let ((.cse10 (select |v_#memory_int_45| .cse3)) (.cse1 (select (select .cse2 |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60|))) (and (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (= (select |v_#valid_35| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 0) (= |v_#memory_int_50| (store |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 (select (select |v_#memory_int_50| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4)))) (<= (+ |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_51| (store |v_#memory_int_126| |v_ULTIMATE.start_main_~end~0#1.base_60| (store (select |v_#memory_int_126| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60| (select (select |v_#memory_int_51| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60|)))) (let ((.cse4 (store (select .cse2 .cse3) .cse1 0)) (.cse0 (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (.cse8 (store |v_#valid_35| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1)) (.cse9 (store |v_#length_25| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 12)) (.cse7 (store (select .cse6 .cse3) .cse1 0)) (.cse5 (+ 8 .cse1))) (or (and (not .cse0) (= |v_ULTIMATE.start_main_#t~mem8#1.base_22| |c_ULTIMATE.start_main_#t~mem8#1.base|) (= |c_ULTIMATE.start_main_#t~mem9#1.offset| |v_ULTIMATE.start_main_#t~mem9#1.offset_22|) (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_33| |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_#memory_$Pointer$.offset| (store .cse2 .cse3 (store .cse4 .cse5 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse5)))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| |v_ULTIMATE.start_main_#t~mem9#1.base_22|) (= |c_ULTIMATE.start_main_#t~mem8#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (= |c_#memory_$Pointer$.base| (store .cse6 .cse3 (store .cse7 .cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse5)))) (= |c_#valid| .cse8) (= .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) (= .cse9 |c_#length|) (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_22| |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (= (store |v_#memory_int_45| .cse3 (store .cse10 .cse5 1)) |c_#memory_int|)) (let ((.cse12 (select |v_#memory_$Pointer$.offset_31| .cse3)) (.cse18 (select |v_#memory_$Pointer$.base_31| .cse3))) (let ((.cse13 (let ((.cse20 (store |v_#memory_$Pointer$.base_31| .cse3 (store .cse18 .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)))) (store .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse3)))) (.cse16 (select |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse11 (let ((.cse19 (store |v_#memory_$Pointer$.offset_31| .cse3 (store .cse12 .cse1 0)))) (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse1))))) (and (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select .cse11 .cse3) .cse1)) (= (store |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 (select (select |v_#memory_int_46| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4))) |v_#memory_int_46|) (= (store .cse2 .cse3 (store .cse4 .cse5 (select .cse12 .cse5))) |v_#memory_$Pointer$.offset_31|) (= |c_#memory_$Pointer$.base| (store .cse13 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse14 .cse15))) (= |v_#memory_int_48| (store |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select .cse16 |c_ULTIMATE.start_main_~end~0#1.offset|)))) .cse0 (= (select .cse8 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0) (= |c_#valid| (store .cse8 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1)) (= |c_#length| (store .cse9 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 12)) (= (select (select .cse13 .cse3) .cse1) |c_ULTIMATE.start_main_~end~0#1.base|) (= (store |v_#memory_int_45| .cse3 (store (store .cse10 .cse5 0) .cse1 (select (select |v_#memory_int_47| .cse3) .cse1))) |v_#memory_int_47|) (<= (+ |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) |c_#StackHeapBarrier|) (= (store |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse16 .cse14 1)) |c_#memory_int|) (= (store .cse11 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse14 .cse17)) |c_#memory_$Pointer$.offset|) (= (store .cse6 .cse3 (store .cse7 .cse5 (select .cse18 .cse5))) |v_#memory_$Pointer$.base_31|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 0))))))) (= |v_#memory_int_45| (store |v_#memory_int_50| .cse3 (store (select |v_#memory_int_50| .cse3) .cse1 (select .cse10 .cse1)))) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648)))))))) (and (exists ((|v_ULTIMATE.start_main_#t~nondet2#1_24| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet2#1_24| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2#1_24| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet2#1_24| 2147483647))) (<= (+ |c_ULTIMATE.start_main_~list~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_#t~mem9#1.offset_19| Int) (|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_32| (Array Int (Array Int Int))) (|v_#memory_int_33| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_13| Int) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.base_19| Int) (|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.offset_19| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_#memory_int_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#valid_31| (Array Int Int)) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_#length_21| (Array Int Int)) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.base_19| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.offset_19| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int)) (let ((.cse45 (select |v_#memory_$Pointer$.base_49| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse34 (let ((.cse48 (store |v_#memory_$Pointer$.base_49| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse45 0 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)))) (store .cse48 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse48 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |c_ULTIMATE.start_main_~list~0#1.base|)))) (.cse46 (select |v_#memory_$Pointer$.offset_49| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse38 (let ((.cse47 (store |v_#memory_$Pointer$.offset_49| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse46 0 0)))) (store .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 0)))) (.cse28 (select (select .cse34 |c_ULTIMATE.start_main_~list~0#1.base|) 0))) (let ((.cse43 (store |v_#valid_31| |c_ULTIMATE.start_main_~list~0#1.base| 1)) (.cse44 (select |v_#memory_int_33| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse23 (select |v_#memory_int_32| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse30 (select |v_#memory_int_45| .cse28)) (.cse29 (select (select .cse38 |c_ULTIMATE.start_main_~list~0#1.base|) 0)) (.cse24 (select |v_#memory_int_116| 1))) (and (= |v_#memory_int_51| (store |v_#memory_int_32| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse23 8 1) 0 (select (select |v_#memory_int_51| |c_ULTIMATE.start_main_~list~0#1.base|) 0)))) (= (select .cse24 1) 0) (let ((.cse33 (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (.cse35 (store (select .cse34 .cse28) .cse29 0)) (.cse39 (store (select .cse38 .cse28) .cse29 0)) (.cse32 (store .cse43 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1)) (.cse37 (store (store |v_#length_21| |c_ULTIMATE.start_main_~list~0#1.base| 12) |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 12)) (.cse31 (+ 8 .cse29))) (or (let ((.cse36 (select |v_#memory_$Pointer$.base_31| .cse28)) (.cse40 (select |v_#memory_$Pointer$.offset_31| .cse28))) (let ((.cse25 (let ((.cse42 (store |v_#memory_$Pointer$.offset_31| .cse28 (store .cse40 .cse29 0)))) (store .cse42 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse42 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse29)))) (.cse27 (let ((.cse41 (store |v_#memory_$Pointer$.base_31| .cse28 (store .cse36 .cse29 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)))) (store .cse41 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse41 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse28)))) (.cse26 (select |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (store |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 (select (select |v_#memory_int_46| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4))) |v_#memory_int_46|) (= |c_#memory_$Pointer$.offset| (store .cse25 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse14 .cse17))) (= |v_#memory_int_48| (store |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select .cse26 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select .cse27 .cse28) .cse29) |c_ULTIMATE.start_main_~end~0#1.base|) (= (store |v_#memory_int_45| .cse28 (store (store .cse30 .cse31 0) .cse29 (select (select |v_#memory_int_47| .cse28) .cse29))) |v_#memory_int_47|) (= (select .cse32 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0) .cse33 (= (store .cse34 .cse28 (store .cse35 .cse31 (select .cse36 .cse31))) |v_#memory_$Pointer$.base_31|) (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select .cse25 .cse28) .cse29)) (<= (+ |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) |c_#StackHeapBarrier|) (= (store .cse27 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse14 .cse15)) |c_#memory_$Pointer$.base|) (= (store |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse26 .cse14 1)) |c_#memory_int|) (= |c_#valid| (store .cse32 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1)) (= (store .cse37 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 12) |c_#length|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 0)) (= |v_#memory_$Pointer$.offset_31| (store .cse38 .cse28 (store .cse39 .cse31 (select .cse40 .cse31))))))) (and (not .cse33) (= (store .cse34 .cse28 (store .cse35 .cse31 (select (select |c_#memory_$Pointer$.base| .cse28) .cse31))) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store .cse38 .cse28 (store .cse39 .cse31 (select (select |c_#memory_$Pointer$.offset| .cse28) .cse31)))) (= |c_#valid| .cse32) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_29| |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_ULTIMATE.start_main_#t~mem9#1.base| |v_ULTIMATE.start_main_#t~mem9#1.base_19|) (= |c_ULTIMATE.start_main_#t~mem9#1.offset| |v_ULTIMATE.start_main_#t~mem9#1.offset_19|) (= |c_ULTIMATE.start_main_~end~0#1.base| .cse28) (= |v_ULTIMATE.start_main_#t~mem8#1.base_19| |c_ULTIMATE.start_main_#t~mem8#1.base|) (= .cse37 |c_#length|) (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_19| |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (= |c_ULTIMATE.start_main_#t~mem8#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_19|) (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse29) (= (store |v_#memory_int_45| .cse28 (store .cse30 .cse31 1)) |c_#memory_int|)))) (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (= 2 (select |v_#length_21| 1)) (= |v_#memory_int_50| (store |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 (select (select |v_#memory_int_50| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4)))) (= (select |v_#valid_31| 0) 0) (= (select |v_#valid_31| 2) 1) (= (store |v_#memory_int_116| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_116| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse44 0))) |v_#memory_int_33|) (= (select |v_#valid_31| 1) 1) (= (select .cse43 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 0) (<= (+ |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_32| (store |v_#memory_int_33| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse44 4 (select .cse23 4)))) (= (store |v_#memory_int_50| .cse28 (store (select |v_#memory_int_50| .cse28) .cse29 (select .cse30 .cse29))) |v_#memory_int_45|) (= (store |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 (select .cse45 8))) |v_#memory_$Pointer$.base_49|) (= (select |v_#valid_31| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 0)) (= (store |v_#memory_$Pointer$.offset_48| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_48| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 (select .cse46 8))) |v_#memory_$Pointer$.offset_49|) (= (select |v_#length_21| 2) 19) (= (select .cse24 0) 48) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648))))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) .cse14) |c_ULTIMATE.start_main_#t~mem10#1|))) is different from false [2023-12-02 15:32:39,559 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8))) (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) .cse0) 1) (<= 1 |c_#StackHeapBarrier|) (let ((.cse17 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) .cse0)) (.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse0))) (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet2#1_28| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2#1_28| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet2#1_28| 0)) (<= |v_ULTIMATE.start_main_#t~nondet2#1_28| 2147483647))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_13| Int) (|v_ULTIMATE.start_main_#t~mem8#1.base_22| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| Int) (|v_#length_25| (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.base_60| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_#memory_int_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc7#1.offset_22| Int) (|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#valid_35| (Array Int Int)) (|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.base_22| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_60| Int) (|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.offset_22| Int)) (let ((.cse7 (let ((.cse22 (store |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~end~0#1.base_60| (store (select |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)))) (store .cse22 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse22 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |v_ULTIMATE.start_main_~end~0#1.base_60|))))) (let ((.cse3 (let ((.cse21 (store |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~end~0#1.base_60| (store (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60| 0)))) (store .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |v_ULTIMATE.start_main_~end~0#1.offset_60|)))) (.cse4 (select (select .cse7 |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60|))) (let ((.cse11 (select |v_#memory_int_45| .cse4)) (.cse2 (select (select .cse3 |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60|))) (and (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (= (select |v_#valid_35| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 0) (= |v_#memory_int_50| (store |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 (select (select |v_#memory_int_50| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4)))) (<= (+ |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_51| (store |v_#memory_int_126| |v_ULTIMATE.start_main_~end~0#1.base_60| (store (select |v_#memory_int_126| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60| (select (select |v_#memory_int_51| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60|)))) (let ((.cse5 (store (select .cse3 .cse4) .cse2 0)) (.cse1 (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (.cse9 (store |v_#valid_35| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1)) (.cse10 (store |v_#length_25| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 12)) (.cse8 (store (select .cse7 .cse4) .cse2 0)) (.cse6 (+ 8 .cse2))) (or (and (not .cse1) (= |v_ULTIMATE.start_main_#t~mem8#1.base_22| |c_ULTIMATE.start_main_#t~mem8#1.base|) (= |c_ULTIMATE.start_main_#t~mem9#1.offset| |v_ULTIMATE.start_main_#t~mem9#1.offset_22|) (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse2) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_33| |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_#memory_$Pointer$.offset| (store .cse3 .cse4 (store .cse5 .cse6 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse6)))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| |v_ULTIMATE.start_main_#t~mem9#1.base_22|) (= |c_ULTIMATE.start_main_#t~mem8#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (= |c_#memory_$Pointer$.base| (store .cse7 .cse4 (store .cse8 .cse6 (select (select |c_#memory_$Pointer$.base| .cse4) .cse6)))) (= |c_#valid| .cse9) (= .cse4 |c_ULTIMATE.start_main_~end~0#1.base|) (= .cse10 |c_#length|) (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_22| |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (= (store |v_#memory_int_45| .cse4 (store .cse11 .cse6 1)) |c_#memory_int|)) (let ((.cse13 (select |v_#memory_$Pointer$.offset_31| .cse4)) (.cse18 (select |v_#memory_$Pointer$.base_31| .cse4))) (let ((.cse14 (let ((.cse20 (store |v_#memory_$Pointer$.base_31| .cse4 (store .cse18 .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)))) (store .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse4)))) (.cse16 (select |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse12 (let ((.cse19 (store |v_#memory_$Pointer$.offset_31| .cse4 (store .cse13 .cse2 0)))) (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse2))))) (and (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select .cse12 .cse4) .cse2)) (= (store |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 (select (select |v_#memory_int_46| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4))) |v_#memory_int_46|) (= (store .cse3 .cse4 (store .cse5 .cse6 (select .cse13 .cse6))) |v_#memory_$Pointer$.offset_31|) (= |c_#memory_$Pointer$.base| (store .cse14 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse0 .cse15))) (= |v_#memory_int_48| (store |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select .cse16 |c_ULTIMATE.start_main_~end~0#1.offset|)))) .cse1 (= (select .cse9 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0) (= |c_#valid| (store .cse9 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1)) (= |c_#length| (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 12)) (= (select (select .cse14 .cse4) .cse2) |c_ULTIMATE.start_main_~end~0#1.base|) (= (store |v_#memory_int_45| .cse4 (store (store .cse11 .cse6 0) .cse2 (select (select |v_#memory_int_47| .cse4) .cse2))) |v_#memory_int_47|) (<= (+ |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) |c_#StackHeapBarrier|) (= (store |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse16 .cse0 1)) |c_#memory_int|) (= (store .cse12 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse0 .cse17)) |c_#memory_$Pointer$.offset|) (= (store .cse7 .cse4 (store .cse8 .cse6 (select .cse18 .cse6))) |v_#memory_$Pointer$.base_31|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 0))))))) (= |v_#memory_int_45| (store |v_#memory_int_50| .cse4 (store (select |v_#memory_int_50| .cse4) .cse2 (select .cse11 .cse2)))) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648)))))))) (and (exists ((|v_ULTIMATE.start_main_#t~nondet2#1_24| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet2#1_24| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2#1_24| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet2#1_24| 2147483647))) (<= (+ |c_ULTIMATE.start_main_~list~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_#t~mem9#1.offset_19| Int) (|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_32| (Array Int (Array Int Int))) (|v_#memory_int_33| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_13| Int) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.base_19| Int) (|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.offset_19| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_#memory_int_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#valid_31| (Array Int Int)) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_#length_21| (Array Int Int)) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.base_19| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.offset_19| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int)) (let ((.cse45 (select |v_#memory_$Pointer$.base_49| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse34 (let ((.cse48 (store |v_#memory_$Pointer$.base_49| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse45 0 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)))) (store .cse48 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse48 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |c_ULTIMATE.start_main_~list~0#1.base|)))) (.cse46 (select |v_#memory_$Pointer$.offset_49| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse38 (let ((.cse47 (store |v_#memory_$Pointer$.offset_49| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse46 0 0)))) (store .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 0)))) (.cse28 (select (select .cse34 |c_ULTIMATE.start_main_~list~0#1.base|) 0))) (let ((.cse43 (store |v_#valid_31| |c_ULTIMATE.start_main_~list~0#1.base| 1)) (.cse44 (select |v_#memory_int_33| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse23 (select |v_#memory_int_32| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse30 (select |v_#memory_int_45| .cse28)) (.cse29 (select (select .cse38 |c_ULTIMATE.start_main_~list~0#1.base|) 0)) (.cse24 (select |v_#memory_int_116| 1))) (and (= |v_#memory_int_51| (store |v_#memory_int_32| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse23 8 1) 0 (select (select |v_#memory_int_51| |c_ULTIMATE.start_main_~list~0#1.base|) 0)))) (= (select .cse24 1) 0) (let ((.cse33 (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (.cse35 (store (select .cse34 .cse28) .cse29 0)) (.cse39 (store (select .cse38 .cse28) .cse29 0)) (.cse32 (store .cse43 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1)) (.cse37 (store (store |v_#length_21| |c_ULTIMATE.start_main_~list~0#1.base| 12) |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 12)) (.cse31 (+ 8 .cse29))) (or (let ((.cse36 (select |v_#memory_$Pointer$.base_31| .cse28)) (.cse40 (select |v_#memory_$Pointer$.offset_31| .cse28))) (let ((.cse25 (let ((.cse42 (store |v_#memory_$Pointer$.offset_31| .cse28 (store .cse40 .cse29 0)))) (store .cse42 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse42 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse29)))) (.cse27 (let ((.cse41 (store |v_#memory_$Pointer$.base_31| .cse28 (store .cse36 .cse29 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)))) (store .cse41 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse41 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse28)))) (.cse26 (select |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (store |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 (select (select |v_#memory_int_46| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4))) |v_#memory_int_46|) (= |c_#memory_$Pointer$.offset| (store .cse25 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse0 .cse17))) (= |v_#memory_int_48| (store |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select .cse26 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select .cse27 .cse28) .cse29) |c_ULTIMATE.start_main_~end~0#1.base|) (= (store |v_#memory_int_45| .cse28 (store (store .cse30 .cse31 0) .cse29 (select (select |v_#memory_int_47| .cse28) .cse29))) |v_#memory_int_47|) (= (select .cse32 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0) .cse33 (= (store .cse34 .cse28 (store .cse35 .cse31 (select .cse36 .cse31))) |v_#memory_$Pointer$.base_31|) (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select .cse25 .cse28) .cse29)) (<= (+ |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) |c_#StackHeapBarrier|) (= (store .cse27 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse0 .cse15)) |c_#memory_$Pointer$.base|) (= (store |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse26 .cse0 1)) |c_#memory_int|) (= |c_#valid| (store .cse32 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1)) (= (store .cse37 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 12) |c_#length|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 0)) (= |v_#memory_$Pointer$.offset_31| (store .cse38 .cse28 (store .cse39 .cse31 (select .cse40 .cse31))))))) (and (not .cse33) (= (store .cse34 .cse28 (store .cse35 .cse31 (select (select |c_#memory_$Pointer$.base| .cse28) .cse31))) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store .cse38 .cse28 (store .cse39 .cse31 (select (select |c_#memory_$Pointer$.offset| .cse28) .cse31)))) (= |c_#valid| .cse32) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_29| |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_ULTIMATE.start_main_#t~mem9#1.base| |v_ULTIMATE.start_main_#t~mem9#1.base_19|) (= |c_ULTIMATE.start_main_#t~mem9#1.offset| |v_ULTIMATE.start_main_#t~mem9#1.offset_19|) (= |c_ULTIMATE.start_main_~end~0#1.base| .cse28) (= |v_ULTIMATE.start_main_#t~mem8#1.base_19| |c_ULTIMATE.start_main_#t~mem8#1.base|) (= .cse37 |c_#length|) (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_19| |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (= |c_ULTIMATE.start_main_#t~mem8#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_19|) (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse29) (= (store |v_#memory_int_45| .cse28 (store .cse30 .cse31 1)) |c_#memory_int|)))) (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (= 2 (select |v_#length_21| 1)) (= |v_#memory_int_50| (store |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 (select (select |v_#memory_int_50| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4)))) (= (select |v_#valid_31| 0) 0) (= (select |v_#valid_31| 2) 1) (= (store |v_#memory_int_116| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_116| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse44 0))) |v_#memory_int_33|) (= (select |v_#valid_31| 1) 1) (= (select .cse43 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 0) (<= (+ |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_32| (store |v_#memory_int_33| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse44 4 (select .cse23 4)))) (= (store |v_#memory_int_50| .cse28 (store (select |v_#memory_int_50| .cse28) .cse29 (select .cse30 .cse29))) |v_#memory_int_45|) (= (store |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 (select .cse45 8))) |v_#memory_$Pointer$.base_49|) (= (select |v_#valid_31| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 0)) (= (store |v_#memory_$Pointer$.offset_48| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_48| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 (select .cse46 8))) |v_#memory_$Pointer$.offset_49|) (= (select |v_#length_21| 2) 19) (= (select .cse24 0) 48) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648))))))))))))) is different from false [2023-12-02 15:32:41,581 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) (.cse49 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse50 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) .cse0) 1) (<= 1 |c_#StackHeapBarrier|) (let ((.cse17 (select .cse50 .cse0)) (.cse15 (select .cse49 .cse0))) (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet2#1_28| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2#1_28| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet2#1_28| 0)) (<= |v_ULTIMATE.start_main_#t~nondet2#1_28| 2147483647))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_13| Int) (|v_ULTIMATE.start_main_#t~mem8#1.base_22| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| Int) (|v_#length_25| (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.base_60| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_#memory_int_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc7#1.offset_22| Int) (|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#valid_35| (Array Int Int)) (|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.base_22| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_60| Int) (|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.offset_22| Int) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.offset_22| Int)) (let ((.cse7 (let ((.cse22 (store |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~end~0#1.base_60| (store (select |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)))) (store .cse22 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse22 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |v_ULTIMATE.start_main_~end~0#1.base_60|))))) (let ((.cse3 (let ((.cse21 (store |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~end~0#1.base_60| (store (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60| 0)))) (store .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |v_ULTIMATE.start_main_~end~0#1.offset_60|)))) (.cse4 (select (select .cse7 |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60|))) (let ((.cse11 (select |v_#memory_int_45| .cse4)) (.cse2 (select (select .cse3 |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60|))) (and (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (= (select |v_#valid_35| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 0) (= |v_#memory_int_50| (store |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 (select (select |v_#memory_int_50| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4)))) (<= (+ |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_51| (store |v_#memory_int_126| |v_ULTIMATE.start_main_~end~0#1.base_60| (store (select |v_#memory_int_126| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60| (select (select |v_#memory_int_51| |v_ULTIMATE.start_main_~end~0#1.base_60|) |v_ULTIMATE.start_main_~end~0#1.offset_60|)))) (let ((.cse5 (store (select .cse3 .cse4) .cse2 0)) (.cse1 (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (.cse9 (store |v_#valid_35| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1)) (.cse10 (store |v_#length_25| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 12)) (.cse8 (store (select .cse7 .cse4) .cse2 0)) (.cse6 (+ 8 .cse2))) (or (and (not .cse1) (= |v_ULTIMATE.start_main_#t~mem8#1.base_22| |c_ULTIMATE.start_main_#t~mem8#1.base|) (= |c_ULTIMATE.start_main_#t~mem9#1.offset| |v_ULTIMATE.start_main_#t~mem9#1.offset_22|) (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse2) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_33| |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_#memory_$Pointer$.offset| (store .cse3 .cse4 (store .cse5 .cse6 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse6)))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| |v_ULTIMATE.start_main_#t~mem9#1.base_22|) (= |c_ULTIMATE.start_main_#t~mem8#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_22|) (= |c_#memory_$Pointer$.base| (store .cse7 .cse4 (store .cse8 .cse6 (select (select |c_#memory_$Pointer$.base| .cse4) .cse6)))) (= |c_#valid| .cse9) (= .cse4 |c_ULTIMATE.start_main_~end~0#1.base|) (= .cse10 |c_#length|) (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_22| |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (= (store |v_#memory_int_45| .cse4 (store .cse11 .cse6 1)) |c_#memory_int|)) (let ((.cse13 (select |v_#memory_$Pointer$.offset_31| .cse4)) (.cse18 (select |v_#memory_$Pointer$.base_31| .cse4))) (let ((.cse14 (let ((.cse20 (store |v_#memory_$Pointer$.base_31| .cse4 (store .cse18 .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)))) (store .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse4)))) (.cse16 (select |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse12 (let ((.cse19 (store |v_#memory_$Pointer$.offset_31| .cse4 (store .cse13 .cse2 0)))) (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse2))))) (and (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select .cse12 .cse4) .cse2)) (= (store |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 (select (select |v_#memory_int_46| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4))) |v_#memory_int_46|) (= (store .cse3 .cse4 (store .cse5 .cse6 (select .cse13 .cse6))) |v_#memory_$Pointer$.offset_31|) (= |c_#memory_$Pointer$.base| (store .cse14 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse0 .cse15))) (= |v_#memory_int_48| (store |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select .cse16 |c_ULTIMATE.start_main_~end~0#1.offset|)))) .cse1 (= (select .cse9 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0) (= |c_#valid| (store .cse9 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1)) (= |c_#length| (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 12)) (= (select (select .cse14 .cse4) .cse2) |c_ULTIMATE.start_main_~end~0#1.base|) (= (store |v_#memory_int_45| .cse4 (store (store .cse11 .cse6 0) .cse2 (select (select |v_#memory_int_47| .cse4) .cse2))) |v_#memory_int_47|) (<= (+ |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) |c_#StackHeapBarrier|) (= (store |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse16 .cse0 1)) |c_#memory_int|) (= (store .cse12 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse0 .cse17)) |c_#memory_$Pointer$.offset|) (= (store .cse7 .cse4 (store .cse8 .cse6 (select .cse18 .cse6))) |v_#memory_$Pointer$.base_31|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 0))))))) (= |v_#memory_int_45| (store |v_#memory_int_50| .cse4 (store (select |v_#memory_int_50| .cse4) .cse2 (select .cse11 .cse2)))) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648)))))))) (and (exists ((|v_ULTIMATE.start_main_#t~nondet2#1_24| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet2#1_24| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2#1_24| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet2#1_24| 2147483647))) (<= (+ |c_ULTIMATE.start_main_~list~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (exists ((|v_ULTIMATE.start_main_#t~mem9#1.offset_19| Int) (|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_32| (Array Int (Array Int Int))) (|v_#memory_int_33| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_13| Int) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.base_19| Int) (|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.offset_19| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_#memory_int_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#valid_31| (Array Int Int)) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_#length_21| (Array Int Int)) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.base_19| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.offset_19| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int)) (let ((.cse45 (select |v_#memory_$Pointer$.base_49| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse34 (let ((.cse48 (store |v_#memory_$Pointer$.base_49| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse45 0 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)))) (store .cse48 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse48 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |c_ULTIMATE.start_main_~list~0#1.base|)))) (.cse46 (select |v_#memory_$Pointer$.offset_49| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse38 (let ((.cse47 (store |v_#memory_$Pointer$.offset_49| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse46 0 0)))) (store .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 0)))) (.cse28 (select (select .cse34 |c_ULTIMATE.start_main_~list~0#1.base|) 0))) (let ((.cse43 (store |v_#valid_31| |c_ULTIMATE.start_main_~list~0#1.base| 1)) (.cse44 (select |v_#memory_int_33| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse23 (select |v_#memory_int_32| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse30 (select |v_#memory_int_45| .cse28)) (.cse29 (select (select .cse38 |c_ULTIMATE.start_main_~list~0#1.base|) 0)) (.cse24 (select |v_#memory_int_116| 1))) (and (= |v_#memory_int_51| (store |v_#memory_int_32| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse23 8 1) 0 (select (select |v_#memory_int_51| |c_ULTIMATE.start_main_~list~0#1.base|) 0)))) (= (select .cse24 1) 0) (let ((.cse33 (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (.cse35 (store (select .cse34 .cse28) .cse29 0)) (.cse39 (store (select .cse38 .cse28) .cse29 0)) (.cse32 (store .cse43 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1)) (.cse37 (store (store |v_#length_21| |c_ULTIMATE.start_main_~list~0#1.base| 12) |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 12)) (.cse31 (+ 8 .cse29))) (or (let ((.cse36 (select |v_#memory_$Pointer$.base_31| .cse28)) (.cse40 (select |v_#memory_$Pointer$.offset_31| .cse28))) (let ((.cse25 (let ((.cse42 (store |v_#memory_$Pointer$.offset_31| .cse28 (store .cse40 .cse29 0)))) (store .cse42 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse42 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse29)))) (.cse27 (let ((.cse41 (store |v_#memory_$Pointer$.base_31| .cse28 (store .cse36 .cse29 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)))) (store .cse41 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse41 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse28)))) (.cse26 (select |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (store |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 (select (select |v_#memory_int_46| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4))) |v_#memory_int_46|) (= |c_#memory_$Pointer$.offset| (store .cse25 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse0 .cse17))) (= |v_#memory_int_48| (store |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select .cse26 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select .cse27 .cse28) .cse29) |c_ULTIMATE.start_main_~end~0#1.base|) (= (store |v_#memory_int_45| .cse28 (store (store .cse30 .cse31 0) .cse29 (select (select |v_#memory_int_47| .cse28) .cse29))) |v_#memory_int_47|) (= (select .cse32 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0) .cse33 (= (store .cse34 .cse28 (store .cse35 .cse31 (select .cse36 .cse31))) |v_#memory_$Pointer$.base_31|) (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select .cse25 .cse28) .cse29)) (<= (+ |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) |c_#StackHeapBarrier|) (= (store .cse27 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse0 .cse15)) |c_#memory_$Pointer$.base|) (= (store |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse26 .cse0 1)) |c_#memory_int|) (= |c_#valid| (store .cse32 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1)) (= (store .cse37 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 12) |c_#length|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 0)) (= |v_#memory_$Pointer$.offset_31| (store .cse38 .cse28 (store .cse39 .cse31 (select .cse40 .cse31))))))) (and (not .cse33) (= (store .cse34 .cse28 (store .cse35 .cse31 (select (select |c_#memory_$Pointer$.base| .cse28) .cse31))) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store .cse38 .cse28 (store .cse39 .cse31 (select (select |c_#memory_$Pointer$.offset| .cse28) .cse31)))) (= |c_#valid| .cse32) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_29| |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_ULTIMATE.start_main_#t~mem9#1.base| |v_ULTIMATE.start_main_#t~mem9#1.base_19|) (= |c_ULTIMATE.start_main_#t~mem9#1.offset| |v_ULTIMATE.start_main_#t~mem9#1.offset_19|) (= |c_ULTIMATE.start_main_~end~0#1.base| .cse28) (= |v_ULTIMATE.start_main_#t~mem8#1.base_19| |c_ULTIMATE.start_main_#t~mem8#1.base|) (= .cse37 |c_#length|) (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_19| |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (= |c_ULTIMATE.start_main_#t~mem8#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_19|) (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse29) (= (store |v_#memory_int_45| .cse28 (store .cse30 .cse31 1)) |c_#memory_int|)))) (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (= 2 (select |v_#length_21| 1)) (= |v_#memory_int_50| (store |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 (select (select |v_#memory_int_50| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4)))) (= (select |v_#valid_31| 0) 0) (= (select |v_#valid_31| 2) 1) (= (store |v_#memory_int_116| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_116| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse44 0))) |v_#memory_int_33|) (= (select |v_#valid_31| 1) 1) (= (select .cse43 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 0) (<= (+ |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_32| (store |v_#memory_int_33| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse44 4 (select .cse23 4)))) (= (store |v_#memory_int_50| .cse28 (store (select |v_#memory_int_50| .cse28) .cse29 (select .cse30 .cse29))) |v_#memory_int_45|) (= (store |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 (select .cse45 8))) |v_#memory_$Pointer$.base_49|) (= (select |v_#valid_31| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 0)) (= (store |v_#memory_$Pointer$.offset_48| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_48| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 (select .cse46 8))) |v_#memory_$Pointer$.offset_49|) (= (select |v_#length_21| 2) 19) (= (select .cse24 0) 48) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648))))))))))) (= |c_ULTIMATE.start_main_#t~mem11#1.base| (select .cse49 |c_ULTIMATE.start_main_~end~0#1.offset|)) (= (select .cse50 |c_ULTIMATE.start_main_~end~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1.offset|))) is different from false [2023-12-02 15:32:41,902 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1105#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) 8) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (not (= |ULTIMATE.start_main_~end~0#1.base| 0)))' at error location [2023-12-02 15:32:41,903 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:32:41,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:32:41,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2023-12-02 15:32:41,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004921892] [2023-12-02 15:32:41,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:32:41,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 15:32:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:41,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 15:32:41,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=277, Unknown=4, NotChecked=148, Total=506 [2023-12-02 15:32:41,904 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:32:44,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 15:32:46,461 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] [2023-12-02 15:32:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:48,371 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2023-12-02 15:32:48,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:32:48,372 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 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) Word has length 19 [2023-12-02 15:32:48,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:48,373 INFO L225 Difference]: With dead ends: 99 [2023-12-02 15:32:48,373 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 15:32:48,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=143, Invalid=519, Unknown=4, NotChecked=204, Total=870 [2023-12-02 15:32:48,374 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 170 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 15 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:48,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 139 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 94 Invalid, 5 Unknown, 0 Unchecked, 6.0s Time] [2023-12-02 15:32:48,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 15:32:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 60. [2023-12-02 15:32:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:32:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-12-02 15:32:48,386 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 19 [2023-12-02 15:32:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:48,387 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-12-02 15:32:48,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:32:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-12-02 15:32:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 15:32:48,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:48,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:48,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 15:32:48,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:48,589 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-02 15:32:48,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:48,589 INFO L85 PathProgramCache]: Analyzing trace with hash -138856261, now seen corresponding path program 1 times [2023-12-02 15:32:48,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:48,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294886530] [2023-12-02 15:32:48,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:48,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:32:50,383 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:50,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294886530] [2023-12-02 15:32:50,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294886530] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:50,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762291407] [2023-12-02 15:32:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:50,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:50,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:50,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:32:50,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5919a8e-f29b-4f28-92c9-766f3ba02308/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 15:32:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:50,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-02 15:32:50,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:50,545 INFO L378 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 [2023-12-02 15:32:50,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:50,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 449 treesize of output 441 [2023-12-02 15:32:50,660 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-12-02 15:32:50,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 603 treesize of output 543 [2023-12-02 15:32:50,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:50,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 319 [2023-12-02 15:32:50,825 INFO L349 Elim1Store]: treesize reduction 97, result has 41.2 percent of original size [2023-12-02 15:32:50,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 327 treesize of output 402 [2023-12-02 15:32:50,875 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-12-02 15:32:50,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 329 [2023-12-02 15:32:50,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 297 [2023-12-02 15:32:50,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 298 [2023-12-02 15:32:51,285 INFO L378 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 16 treesize of output 1 [2023-12-02 15:32:51,340 INFO L378 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 16 treesize of output 1 [2023-12-02 15:32:51,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:51,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:51,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:51,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:51,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2023-12-02 15:32:51,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:51,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:51,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:51,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:51,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2023-12-02 15:32:51,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 205 [2023-12-02 15:32:51,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:51,799 INFO L378 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 21 treesize of output 1 [2023-12-02 15:32:51,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2023-12-02 15:32:51,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:51,930 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:32:51,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 68 [2023-12-02 15:32:51,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:51,953 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-12-02 15:32:51,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 70 [2023-12-02 15:32:51,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2023-12-02 15:32:52,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:52,099 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-12-02 15:32:52,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 61 [2023-12-02 15:32:52,418 INFO L349 Elim1Store]: treesize reduction 622, result has 26.6 percent of original size [2023-12-02 15:32:52,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 307 treesize of output 599 [2023-12-02 15:32:56,679 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:56,680 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:56,681 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:56,681 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:56,684 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:56,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2023-12-02 15:32:56,909 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:56,912 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:56,943 INFO L349 Elim1Store]: treesize reduction 134, result has 8.2 percent of original size [2023-12-02 15:32:56,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 105 treesize of output 88 [2023-12-02 15:32:57,002 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,003 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,006 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,011 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,033 INFO L349 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2023-12-02 15:32:57,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 91 [2023-12-02 15:32:57,115 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,115 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,118 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,124 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,147 INFO L349 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2023-12-02 15:32:57,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 91 [2023-12-02 15:32:57,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:57,328 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,329 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,332 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,334 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,336 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,336 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2023-12-02 15:32:57,387 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,390 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,391 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,392 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,393 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2023-12-02 15:32:57,561 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,562 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,563 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,563 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,564 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,565 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2023-12-02 15:32:57,656 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,657 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,658 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,658 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,659 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,660 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2023-12-02 15:32:57,719 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,725 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,726 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,730 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-12-02 15:32:57,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 76 [2023-12-02 15:32:57,806 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,806 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,809 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,812 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,813 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,814 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,838 INFO L349 Elim1Store]: treesize reduction 67, result has 24.7 percent of original size [2023-12-02 15:32:57,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 98 [2023-12-02 15:32:57,979 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,980 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,981 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,982 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,982 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,983 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:57,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2023-12-02 15:32:58,058 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,059 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,063 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,064 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,088 INFO L349 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2023-12-02 15:32:58,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 91 [2023-12-02 15:32:58,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:58,158 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,159 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,161 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,162 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,163 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2023-12-02 15:32:58,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:58,277 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,277 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,280 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,281 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,282 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2023-12-02 15:32:58,325 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,326 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,327 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,327 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,328 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,329 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2023-12-02 15:32:58,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,474 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,475 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,476 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,476 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,477 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2023-12-02 15:32:58,629 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,632 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,634 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,635 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,636 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,657 INFO L349 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2023-12-02 15:32:58,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 91 [2023-12-02 15:32:58,739 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,742 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,746 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,746 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,747 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,773 INFO L349 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2023-12-02 15:32:58,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 91 [2023-12-02 15:32:58,860 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,865 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,869 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,870 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,871 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:58,894 INFO L349 Elim1Store]: treesize reduction 79, result has 16.0 percent of original size [2023-12-02 15:32:58,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 91 [2023-12-02 15:33:00,531 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:00,830 INFO L349 Elim1Store]: treesize reduction 961, result has 16.0 percent of original size [2023-12-02 15:33:00,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 500 treesize of output 770 [2023-12-02 15:33:02,233 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:02,234 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:02,235 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:02,244 INFO L349 Elim1Store]: treesize reduction 125, result has 0.8 percent of original size [2023-12-02 15:33:02,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 153 treesize of output 61 [2023-12-02 15:33:06,149 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:06,150 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:06,151 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:06,160 INFO L349 Elim1Store]: treesize reduction 125, result has 0.8 percent of original size [2023-12-02 15:33:06,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 153 treesize of output 61 [2023-12-02 15:33:20,557 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:20,557 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:20,905 INFO L349 Elim1Store]: treesize reduction 1240, result has 12.0 percent of original size [2023-12-02 15:33:20,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 281 treesize of output 438 [2023-12-02 15:33:23,465 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:23,482 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:23,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:23,495 INFO L349 Elim1Store]: treesize reduction 125, result has 0.8 percent of original size [2023-12-02 15:33:23,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 142 treesize of output 33 [2023-12-02 15:33:23,535 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:23,550 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:23,551 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:23,568 INFO L349 Elim1Store]: treesize reduction 410, result has 0.2 percent of original size [2023-12-02 15:33:23,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 184 treesize of output 57 [2023-12-02 15:33:23,961 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:23,961 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:24,022 INFO L349 Elim1Store]: treesize reduction 740, result has 2.9 percent of original size [2023-12-02 15:33:24,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 205 treesize of output 91 [2023-12-02 15:33:24,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:24,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:24,108 INFO L349 Elim1Store]: treesize reduction 325, result has 6.3 percent of original size [2023-12-02 15:33:24,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 163 treesize of output 67 [2023-12-02 15:33:24,246 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:24,352 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:24,353 INFO L173 IndexEqualityManager]: detected equality via solver