./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:16:34,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:16:34,695 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:16:34,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:16:34,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:16:34,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:16:34,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:16:34,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:16:34,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:16:34,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:16:34,748 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:16:34,749 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:16:34,749 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:16:34,750 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:16:34,752 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:16:34,753 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:16:34,753 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:16:34,754 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:16:34,754 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:16:34,755 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:16:34,758 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:16:34,759 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:16:34,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:16:34,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:16:34,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:16:34,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:16:34,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:16:34,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:16:34,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:16:34,762 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:16:34,765 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:16:34,766 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:16:34,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:16:34,766 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:16:34,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:16:34,768 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:16:34,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:16:34,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:16:34,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:16:34,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:16:34,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:16:34,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:16:34,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:16:34,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:16:34,772 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:16:34,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:16:34,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:16:34,772 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:16:34,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:16:34,773 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_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/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_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 [2024-11-09 05:16:35,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:16:35,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:16:35,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:16:35,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:16:35,172 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:16:35,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i Unable to find full path for "g++" [2024-11-09 05:16:37,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:16:37,658 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:16:37,659 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2024-11-09 05:16:37,691 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/data/e4c814b83/6c5c66ede1074639a69f3c25fc47219a/FLAGaa016346d [2024-11-09 05:16:37,714 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/data/e4c814b83/6c5c66ede1074639a69f3c25fc47219a [2024-11-09 05:16:37,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:16:37,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:16:37,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:16:37,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:16:37,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:16:37,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:16:37" (1/1) ... [2024-11-09 05:16:37,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29620a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:37, skipping insertion in model container [2024-11-09 05:16:37,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:16:37" (1/1) ... [2024-11-09 05:16:37,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:16:38,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:16:38,256 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:16:38,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:16:38,354 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:16:38,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:38 WrapperNode [2024-11-09 05:16:38,355 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:16:38,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:16:38,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:16:38,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:16:38,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:38" (1/1) ... [2024-11-09 05:16:38,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:38" (1/1) ... [2024-11-09 05:16:38,430 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 354 [2024-11-09 05:16:38,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:16:38,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:16:38,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:16:38,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:16:38,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:38" (1/1) ... [2024-11-09 05:16:38,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:38" (1/1) ... [2024-11-09 05:16:38,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:38" (1/1) ... [2024-11-09 05:16:38,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:38" (1/1) ... [2024-11-09 05:16:38,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:38" (1/1) ... [2024-11-09 05:16:38,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:38" (1/1) ... [2024-11-09 05:16:38,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:38" (1/1) ... [2024-11-09 05:16:38,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:38" (1/1) ... [2024-11-09 05:16:38,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:16:38,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:16:38,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:16:38,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:16:38,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:38" (1/1) ... [2024-11-09 05:16:38,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:16:38,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:16:38,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:16:38,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:16:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:16:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:16:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:16:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:16:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:16:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:16:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:16:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:16:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:16:38,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:16:38,572 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-11-09 05:16:38,572 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-11-09 05:16:38,696 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:16:38,698 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:16:39,689 INFO L? ?]: Removed 363 outVars from TransFormulas that were not future-live. [2024-11-09 05:16:39,689 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:16:39,799 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:16:39,800 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 05:16:39,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:16:39 BoogieIcfgContainer [2024-11-09 05:16:39,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:16:39,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:16:39,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:16:39,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:16:39,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:16:37" (1/3) ... [2024-11-09 05:16:39,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1a3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:16:39, skipping insertion in model container [2024-11-09 05:16:39,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:16:38" (2/3) ... [2024-11-09 05:16:39,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1a3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:16:39, skipping insertion in model container [2024-11-09 05:16:39,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:16:39" (3/3) ... [2024-11-09 05:16:39,815 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2024-11-09 05:16:39,833 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:16:39,833 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2024-11-09 05:16:39,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:16:39,907 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@d708beb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:16:39,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2024-11-09 05:16:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 135 states have (on average 2.3407407407407406) internal successors, (316), 284 states have internal predecessors, (316), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 05:16:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 05:16:39,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:16:39,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 05:16:39,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-09 05:16:39,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:16:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash 17953, now seen corresponding path program 1 times [2024-11-09 05:16:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:16:39,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132963447] [2024-11-09 05:16:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:16:39,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:16:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:16:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:16:40,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:16:40,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132963447] [2024-11-09 05:16:40,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132963447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:16:40,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:16:40,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:16:40,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883220146] [2024-11-09 05:16:40,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:16:40,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:16:40,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:16:40,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:16:40,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:16:40,205 INFO L87 Difference]: Start difference. First operand has 299 states, 135 states have (on average 2.3407407407407406) internal successors, (316), 284 states have internal predecessors, (316), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2024-11-09 05:16:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:16:40,770 INFO L93 Difference]: Finished difference Result 508 states and 572 transitions. [2024-11-09 05:16:40,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:16:40,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-11-09 05:16:40,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:16:40,797 INFO L225 Difference]: With dead ends: 508 [2024-11-09 05:16:40,797 INFO L226 Difference]: Without dead ends: 507 [2024-11-09 05:16:40,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:16:40,806 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 229 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:16:40,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 404 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:16:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-09 05:16:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 373. [2024-11-09 05:16:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 212 states have (on average 2.306603773584906) internal successors, (489), 358 states have internal predecessors, (489), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 05:16:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 519 transitions. [2024-11-09 05:16:40,911 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 519 transitions. Word has length 2 [2024-11-09 05:16:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:16:40,911 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 519 transitions. [2024-11-09 05:16:40,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2024-11-09 05:16:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 519 transitions. [2024-11-09 05:16:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 05:16:40,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:16:40,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 05:16:40,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:16:40,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-09 05:16:40,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:16:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash 17954, now seen corresponding path program 1 times [2024-11-09 05:16:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:16:40,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117173741] [2024-11-09 05:16:40,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:16:40,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:16:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:16:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:16:41,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:16:41,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117173741] [2024-11-09 05:16:41,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117173741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:16:41,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:16:41,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:16:41,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951062340] [2024-11-09 05:16:41,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:16:41,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:16:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:16:41,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:16:41,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:16:41,112 INFO L87 Difference]: Start difference. First operand 373 states and 519 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2024-11-09 05:16:41,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:16:41,434 INFO L93 Difference]: Finished difference Result 375 states and 524 transitions. [2024-11-09 05:16:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:16:41,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-11-09 05:16:41,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:16:41,437 INFO L225 Difference]: With dead ends: 375 [2024-11-09 05:16:41,437 INFO L226 Difference]: Without dead ends: 375 [2024-11-09 05:16:41,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:16:41,440 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 7 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:16:41,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 505 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:16:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-09 05:16:41,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2024-11-09 05:16:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 212 states have (on average 2.297169811320755) internal successors, (487), 356 states have internal predecessors, (487), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 05:16:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 517 transitions. [2024-11-09 05:16:41,470 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 517 transitions. Word has length 2 [2024-11-09 05:16:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:16:41,471 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 517 transitions. [2024-11-09 05:16:41,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2024-11-09 05:16:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 517 transitions. [2024-11-09 05:16:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 05:16:41,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:16:41,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:16:41,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:16:41,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-09 05:16:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:16:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash 353284375, now seen corresponding path program 1 times [2024-11-09 05:16:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:16:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696857716] [2024-11-09 05:16:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:16:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:16:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:16:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:16:41,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:16:41,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696857716] [2024-11-09 05:16:41,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696857716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:16:41,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:16:41,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:16:41,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319544310] [2024-11-09 05:16:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:16:41,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:16:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:16:41,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:16:41,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:16:41,601 INFO L87 Difference]: Start difference. First operand 371 states and 517 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:16:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:16:41,865 INFO L93 Difference]: Finished difference Result 366 states and 512 transitions. [2024-11-09 05:16:41,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:16:41,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 05:16:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:16:41,868 INFO L225 Difference]: With dead ends: 366 [2024-11-09 05:16:41,869 INFO L226 Difference]: Without dead ends: 366 [2024-11-09 05:16:41,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:16:41,872 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 31 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:16:41,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 458 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:16:41,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-09 05:16:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-11-09 05:16:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 212 states have (on average 2.2735849056603774) internal successors, (482), 351 states have internal predecessors, (482), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 05:16:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 512 transitions. [2024-11-09 05:16:41,895 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 512 transitions. Word has length 8 [2024-11-09 05:16:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:16:41,895 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 512 transitions. [2024-11-09 05:16:41,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:16:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 512 transitions. [2024-11-09 05:16:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 05:16:41,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:16:41,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:16:41,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:16:41,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-09 05:16:41,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:16:41,903 INFO L85 PathProgramCache]: Analyzing trace with hash 353284376, now seen corresponding path program 1 times [2024-11-09 05:16:41,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:16:41,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87272475] [2024-11-09 05:16:41,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:16:41,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:16:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:16:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:16:42,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:16:42,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87272475] [2024-11-09 05:16:42,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87272475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:16:42,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:16:42,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:16:42,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887199250] [2024-11-09 05:16:42,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:16:42,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:16:42,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:16:42,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:16:42,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:16:42,020 INFO L87 Difference]: Start difference. First operand 366 states and 512 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:16:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:16:42,284 INFO L93 Difference]: Finished difference Result 361 states and 507 transitions. [2024-11-09 05:16:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:16:42,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 05:16:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:16:42,286 INFO L225 Difference]: With dead ends: 361 [2024-11-09 05:16:42,287 INFO L226 Difference]: Without dead ends: 361 [2024-11-09 05:16:42,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:16:42,288 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 31 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:16:42,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 471 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:16:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-09 05:16:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-11-09 05:16:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 212 states have (on average 2.25) internal successors, (477), 346 states have internal predecessors, (477), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 05:16:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 507 transitions. [2024-11-09 05:16:42,303 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 507 transitions. Word has length 8 [2024-11-09 05:16:42,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:16:42,303 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 507 transitions. [2024-11-09 05:16:42,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:16:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 507 transitions. [2024-11-09 05:16:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:16:42,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:16:42,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:16:42,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:16:42,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-09 05:16:42,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:16:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1933085849, now seen corresponding path program 1 times [2024-11-09 05:16:42,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:16:42,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248540268] [2024-11-09 05:16:42,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:16:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:16:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:16:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:16:42,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:16:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248540268] [2024-11-09 05:16:42,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248540268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:16:42,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:16:42,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:16:42,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114346514] [2024-11-09 05:16:42,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:16:42,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:16:42,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:16:42,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:16:42,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:16:42,535 INFO L87 Difference]: Start difference. First operand 361 states and 507 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:16:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:16:43,378 INFO L93 Difference]: Finished difference Result 483 states and 544 transitions. [2024-11-09 05:16:43,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:16:43,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:16:43,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:16:43,381 INFO L225 Difference]: With dead ends: 483 [2024-11-09 05:16:43,381 INFO L226 Difference]: Without dead ends: 483 [2024-11-09 05:16:43,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:16:43,384 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 286 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:16:43,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 716 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 05:16:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-09 05:16:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 353. [2024-11-09 05:16:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 212 states have (on average 2.2122641509433962) internal successors, (469), 338 states have internal predecessors, (469), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 05:16:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 499 transitions. [2024-11-09 05:16:43,397 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 499 transitions. Word has length 9 [2024-11-09 05:16:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:16:43,398 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 499 transitions. [2024-11-09 05:16:43,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:16:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 499 transitions. [2024-11-09 05:16:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:16:43,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:16:43,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:16:43,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:16:43,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-09 05:16:43,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:16:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1933085848, now seen corresponding path program 1 times [2024-11-09 05:16:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:16:43,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279261184] [2024-11-09 05:16:43,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:16:43,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:16:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:16:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:16:43,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:16:43,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279261184] [2024-11-09 05:16:43,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279261184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:16:43,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:16:43,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:16:43,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904748020] [2024-11-09 05:16:43,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:16:43,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:16:43,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:16:43,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:16:43,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:16:43,676 INFO L87 Difference]: Start difference. First operand 353 states and 499 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:16:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:16:44,671 INFO L93 Difference]: Finished difference Result 473 states and 534 transitions. [2024-11-09 05:16:44,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:16:44,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:16:44,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:16:44,673 INFO L225 Difference]: With dead ends: 473 [2024-11-09 05:16:44,674 INFO L226 Difference]: Without dead ends: 473 [2024-11-09 05:16:44,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:16:44,679 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 502 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:16:44,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 388 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 05:16:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-09 05:16:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 344. [2024-11-09 05:16:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 212 states have (on average 2.1650943396226414) internal successors, (459), 329 states have internal predecessors, (459), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 05:16:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 489 transitions. [2024-11-09 05:16:44,696 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 489 transitions. Word has length 9 [2024-11-09 05:16:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:16:44,697 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 489 transitions. [2024-11-09 05:16:44,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:16:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 489 transitions. [2024-11-09 05:16:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:16:44,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:16:44,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:16:44,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:16:44,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-09 05:16:44,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:16:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash -540292487, now seen corresponding path program 1 times [2024-11-09 05:16:44,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:16:44,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696608889] [2024-11-09 05:16:44,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:16:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:16:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:16:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:16:45,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:16:45,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696608889] [2024-11-09 05:16:45,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696608889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:16:45,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:16:45,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:16:45,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718670505] [2024-11-09 05:16:45,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:16:45,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:16:45,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:16:45,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:16:45,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:16:45,201 INFO L87 Difference]: Start difference. First operand 344 states and 489 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:16:45,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:16:45,710 INFO L93 Difference]: Finished difference Result 362 states and 511 transitions. [2024-11-09 05:16:45,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:16:45,710 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 05:16:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:16:45,713 INFO L225 Difference]: With dead ends: 362 [2024-11-09 05:16:45,713 INFO L226 Difference]: Without dead ends: 362 [2024-11-09 05:16:45,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:16:45,714 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 21 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:16:45,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1123 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:16:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-09 05:16:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2024-11-09 05:16:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 219 states have (on average 2.136986301369863) internal successors, (468), 336 states have internal predecessors, (468), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 05:16:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 500 transitions. [2024-11-09 05:16:45,729 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 500 transitions. Word has length 16 [2024-11-09 05:16:45,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:16:45,729 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 500 transitions. [2024-11-09 05:16:45,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:16:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 500 transitions. [2024-11-09 05:16:45,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 05:16:45,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:16:45,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:16:45,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:16:45,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-09 05:16:45,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:16:45,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1026184906, now seen corresponding path program 1 times [2024-11-09 05:16:45,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:16:45,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466705237] [2024-11-09 05:16:45,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:16:45,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:16:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:16:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:16:46,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:16:46,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466705237] [2024-11-09 05:16:46,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466705237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:16:46,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:16:46,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:16:46,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97511689] [2024-11-09 05:16:46,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:16:46,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:16:46,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:16:46,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:16:46,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:16:46,339 INFO L87 Difference]: Start difference. First operand 352 states and 500 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:16:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:16:47,274 INFO L93 Difference]: Finished difference Result 485 states and 549 transitions. [2024-11-09 05:16:47,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:16:47,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 05:16:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:16:47,277 INFO L225 Difference]: With dead ends: 485 [2024-11-09 05:16:47,277 INFO L226 Difference]: Without dead ends: 485 [2024-11-09 05:16:47,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:16:47,279 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 479 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:16:47,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1198 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 05:16:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-09 05:16:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 354. [2024-11-09 05:16:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 221 states have (on average 2.1266968325791855) internal successors, (470), 338 states have internal predecessors, (470), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 05:16:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 502 transitions. [2024-11-09 05:16:47,290 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 502 transitions. Word has length 17 [2024-11-09 05:16:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:16:47,290 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 502 transitions. [2024-11-09 05:16:47,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:16:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 502 transitions. [2024-11-09 05:16:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:16:47,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:16:47,292 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:16:47,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:16:47,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-09 05:16:47,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:16:47,293 INFO L85 PathProgramCache]: Analyzing trace with hash 145133299, now seen corresponding path program 1 times [2024-11-09 05:16:47,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:16:47,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328321065] [2024-11-09 05:16:47,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:16:47,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:16:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:16:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:16:48,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:16:48,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328321065] [2024-11-09 05:16:48,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328321065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:16:48,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380426782] [2024-11-09 05:16:48,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:16:48,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:16:48,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:16:48,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:16:48,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:16:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:16:48,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 05:16:48,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:16:48,855 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 [2024-11-09 05:16:49,024 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 13 treesize of output 9 [2024-11-09 05:16:49,090 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:16:49,090 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-09 05:16:49,106 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 7 treesize of output 3 [2024-11-09 05:16:49,189 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:16:49,189 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2024-11-09 05:16:49,290 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-09 05:16:49,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 29 treesize of output 33 [2024-11-09 05:16:49,446 INFO L349 Elim1Store]: treesize reduction 58, result has 34.8 percent of original size [2024-11-09 05:16:49,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 40 [2024-11-09 05:16:49,516 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 0 case distinctions, treesize of input 40 treesize of output 31 [2024-11-09 05:16:49,604 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 0 case distinctions, treesize of input 40 treesize of output 31 [2024-11-09 05:16:49,635 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 0 case distinctions, treesize of input 40 treesize of output 31 [2024-11-09 05:16:49,685 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 31 treesize of output 13 [2024-11-09 05:16:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:16:49,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:16:49,755 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_289 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_289) c_append_~head.base) (+ c_append_~head.offset 4))) 1)) is different from false [2024-11-09 05:16:50,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:16:50,031 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 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-09 05:16:50,039 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 317 treesize of output 197 [2024-11-09 05:16:50,049 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 44 treesize of output 36 [2024-11-09 05:16:50,056 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 41 treesize of output 37 [2024-11-09 05:16:50,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380426782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:16:50,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [868417641] [2024-11-09 05:16:50,337 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 05:16:50,337 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:16:50,342 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:16:50,348 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:16:50,349 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:16:51,148 INFO L197 IcfgInterpreter]: Interpreting procedure append with input of size 210 for LOIs [2024-11-09 05:16:53,138 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:17:07,484 WARN L286 SmtUtils]: Spent 6.95s on a formula simplification. DAG size of input: 233 DAG size of output: 230 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:17:18,186 WARN L286 SmtUtils]: Spent 9.37s on a formula simplification. DAG size of input: 254 DAG size of output: 247 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:17:34,875 WARN L286 SmtUtils]: Spent 13.05s on a formula simplification. DAG size of input: 274 DAG size of output: 265 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:17:51,392 WARN L286 SmtUtils]: Spent 12.66s on a formula simplification. DAG size of input: 266 DAG size of output: 257 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:18:26,027 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6803#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_143| append_~node~0.base (store (store (select |v_#memory_$Pointer$.offset_143| append_~node~0.base) 1 (select (select |v_#memory_$Pointer$.offset_143| append_~head.base) 4)) 5 0)))) (= append_~node~0.offset 0) (<= 0 (+ 128 |append_#in~input|)) (exists ((|v_#memory_int_123| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_124| append_~node~0.base (store (select |v_#memory_int_124| append_~node~0.base) 5 (select (select |#memory_int| append_~node~0.base) 5)))) (= |v_#memory_int_124| (store |v_#memory_int_123| append_~node~0.base (store (select |v_#memory_int_123| append_~node~0.base) 1 (select (select |v_#memory_int_124| append_~node~0.base) 1)))))) (= |append_#in~head.offset| 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| append_~head.base) 4)) 1)) (= (select |#valid| append_~head.base) 1) (= (select |#valid| append_~node~0.base) 1) (= append_~head.offset 0) (<= |append_#in~input| 127) (<= 9 (select |#length| append_~node~0.base)) (exists ((|v_#memory_$Pointer$.base_151| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_151| append_~node~0.base (store (store (select |v_#memory_$Pointer$.base_151| append_~node~0.base) 1 (select (select |v_#memory_$Pointer$.base_151| append_~head.base) 4)) 5 0)) |#memory_$Pointer$.base|)) (<= 8 (select |#length| append_~head.base)) (= |append_#t~mem60.offset| (select (select |#memory_$Pointer$.offset| append_~head.base) 4)))' at error location [2024-11-09 05:18:26,027 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:18:26,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:18:26,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2024-11-09 05:18:26,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008854461] [2024-11-09 05:18:26,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:18:26,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 05:18:26,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:18:26,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 05:18:26,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2441, Unknown=15, NotChecked=100, Total=2756 [2024-11-09 05:18:26,031 INFO L87 Difference]: Start difference. First operand 354 states and 502 transitions. Second operand has 26 states, 25 states have (on average 2.24) internal successors, (56), 22 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:18:30,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:18:30,248 INFO L93 Difference]: Finished difference Result 488 states and 551 transitions. [2024-11-09 05:18:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 05:18:30,249 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 22 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-09 05:18:30,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:18:30,251 INFO L225 Difference]: With dead ends: 488 [2024-11-09 05:18:30,251 INFO L226 Difference]: Without dead ends: 488 [2024-11-09 05:18:30,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 94.6s TimeCoverageRelationStatistics Valid=318, Invalid=3577, Unknown=15, NotChecked=122, Total=4032 [2024-11-09 05:18:30,254 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 999 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 2413 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 2527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:18:30,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 2227 Invalid, 2527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2413 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 05:18:30,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-09 05:18:30,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 359. [2024-11-09 05:18:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 226 states have (on average 2.0973451327433628) internal successors, (474), 343 states have internal predecessors, (474), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 05:18:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 506 transitions. [2024-11-09 05:18:30,266 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 506 transitions. Word has length 31 [2024-11-09 05:18:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:18:30,267 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 506 transitions. [2024-11-09 05:18:30,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 22 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:18:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 506 transitions. [2024-11-09 05:18:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:18:30,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:18:30,268 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:18:30,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:18:30,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:18:30,474 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-09 05:18:30,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:18:30,475 INFO L85 PathProgramCache]: Analyzing trace with hash 145133300, now seen corresponding path program 1 times [2024-11-09 05:18:30,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:18:30,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044836243] [2024-11-09 05:18:30,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:18:30,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:18:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:18:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:18:35,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:18:35,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044836243] [2024-11-09 05:18:35,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044836243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:18:35,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459784035] [2024-11-09 05:18:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:18:35,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:18:35,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:18:35,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:18:35,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:18:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:18:35,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 05:18:35,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:18:35,200 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 [2024-11-09 05:18:35,331 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 8 treesize of output 1 [2024-11-09 05:18:35,514 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 13 treesize of output 9 [2024-11-09 05:18:35,522 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 13 treesize of output 9 [2024-11-09 05:18:35,618 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:18:35,618 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-09 05:18:35,627 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 7 treesize of output 3 [2024-11-09 05:18:35,662 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:18:35,662 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-09 05:18:35,676 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 7 treesize of output 3 [2024-11-09 05:18:35,791 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:18:35,791 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2024-11-09 05:18:35,819 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:18:35,819 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2024-11-09 05:18:36,016 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-09 05:18:36,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 29 treesize of output 33 [2024-11-09 05:18:36,236 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-09 05:18:36,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-09 05:18:36,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 15 [2024-11-09 05:18:36,343 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 0 case distinctions, treesize of input 40 treesize of output 31 [2024-11-09 05:18:36,359 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 18 treesize of output 13 [2024-11-09 05:18:36,429 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 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:18:36,436 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 0 case distinctions, treesize of input 40 treesize of output 31 [2024-11-09 05:18:36,461 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 0 case distinctions, treesize of input 40 treesize of output 31 [2024-11-09 05:18:36,472 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 18 treesize of output 13 [2024-11-09 05:18:36,552 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 31 treesize of output 13 [2024-11-09 05:18:36,557 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 3 [2024-11-09 05:18:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:18:36,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:18:36,778 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_append_~head.offset 4))) (and (forall ((v_ArrVal_443 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_444) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_443) c_append_~head.base) .cse0)))) (forall ((v_ArrVal_444 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_444) c_append_~head.base) .cse0)))))) is different from false [2024-11-09 05:18:37,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:18:37,492 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 1 case distinctions, treesize of input 105 treesize of output 106 [2024-11-09 05:18:37,502 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 326 treesize of output 236 [2024-11-09 05:18:37,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:18:37,517 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 1 case distinctions, treesize of input 229 treesize of output 190 [2024-11-09 05:18:37,531 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 576 treesize of output 540 [2024-11-09 05:18:37,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:18:37,560 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 405 treesize of output 404 [2024-11-09 05:18:37,578 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 379 treesize of output 359 [2024-11-09 05:18:37,591 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 359 treesize of output 327 [2024-11-09 05:18:37,603 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 344 treesize of output 292 [2024-11-09 05:18:37,617 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 292 treesize of output 264 [2024-11-09 05:18:37,628 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 255 treesize of output 247 [2024-11-09 05:18:37,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459784035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:18:37,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1929991452] [2024-11-09 05:18:37,993 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 05:18:37,993 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:18:37,993 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:18:37,995 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:18:37,996 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:18:38,515 INFO L197 IcfgInterpreter]: Interpreting procedure append with input of size 214 for LOIs [2024-11-09 05:18:39,956 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:18:55,247 WARN L286 SmtUtils]: Spent 6.52s on a formula simplification. DAG size of input: 237 DAG size of output: 230 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:19:07,335 WARN L286 SmtUtils]: Spent 9.63s on a formula simplification. DAG size of input: 258 DAG size of output: 247 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:19:25,557 WARN L286 SmtUtils]: Spent 13.81s on a formula simplification. DAG size of input: 278 DAG size of output: 265 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:19:44,930 WARN L286 SmtUtils]: Spent 14.52s on a formula simplification. DAG size of input: 270 DAG size of output: 257 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:20:19,882 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7866#(and (exists ((|v_#memory_int_148| (Array Int (Array Int Int))) (|v_#memory_int_149| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_149| append_~node~0.base (store (select |v_#memory_int_149| append_~node~0.base) 5 (select (select |#memory_int| append_~node~0.base) 5)))) (= (store |v_#memory_int_148| append_~node~0.base (store (select |v_#memory_int_148| append_~node~0.base) 1 (select (select |v_#memory_int_149| append_~node~0.base) 1))) |v_#memory_int_149|))) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_176| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_176| append_~node~0.base (store (store (select |v_#memory_$Pointer$.offset_176| append_~node~0.base) 1 (select (select |v_#memory_$Pointer$.offset_176| append_~head.base) 4)) 5 0)))) (or (< (+ 5 (select (select |#memory_$Pointer$.offset| append_~head.base) 4)) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| append_~head.base) 4)) (+ 9 (select (select |#memory_$Pointer$.offset| append_~head.base) 4)))) (= append_~node~0.offset 0) (<= 0 (+ 128 |append_#in~input|)) (= |append_#in~head.offset| 0) (= (select |#valid| append_~head.base) 1) (= (select |#valid| append_~node~0.base) 1) (= append_~head.offset 0) (<= |append_#in~input| 127) (<= 9 (select |#length| append_~node~0.base)) (<= 8 (select |#length| append_~head.base)) (exists ((|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_184| append_~node~0.base (store (store (select |v_#memory_$Pointer$.base_184| append_~node~0.base) 1 (select (select |v_#memory_$Pointer$.base_184| append_~head.base) 4)) 5 0)) |#memory_$Pointer$.base|)))' at error location [2024-11-09 05:20:19,882 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:20:19,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:20:19,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 31 [2024-11-09 05:20:19,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838002398] [2024-11-09 05:20:19,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:20:19,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 05:20:19,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:19,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 05:20:19,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=3418, Unknown=13, NotChecked=118, Total=3782 [2024-11-09 05:20:19,886 INFO L87 Difference]: Start difference. First operand 359 states and 506 transitions. Second operand has 33 states, 32 states have (on average 1.71875) internal successors, (55), 28 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:20:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:29,793 INFO L93 Difference]: Finished difference Result 489 states and 566 transitions. [2024-11-09 05:20:29,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 05:20:29,793 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.71875) internal successors, (55), 28 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-09 05:20:29,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:29,796 INFO L225 Difference]: With dead ends: 489 [2024-11-09 05:20:29,796 INFO L226 Difference]: Without dead ends: 489 [2024-11-09 05:20:29,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1505 ImplicationChecksByTransitivity, 105.8s TimeCoverageRelationStatistics Valid=441, Invalid=5712, Unknown=13, NotChecked=154, Total=6320 [2024-11-09 05:20:29,798 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1042 mSDsluCounter, 2038 mSDsCounter, 0 mSdLazyCounter, 4329 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 4532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 4329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:29,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 2159 Invalid, 4532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 4329 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-09 05:20:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-09 05:20:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 358. [2024-11-09 05:20:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 226 states have (on average 2.0929203539823007) internal successors, (473), 342 states have internal predecessors, (473), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 05:20:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 505 transitions. [2024-11-09 05:20:29,817 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 505 transitions. Word has length 31 [2024-11-09 05:20:29,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:29,818 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 505 transitions. [2024-11-09 05:20:29,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.71875) internal successors, (55), 28 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:20:29,818 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 505 transitions. [2024-11-09 05:20:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-09 05:20:29,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:29,826 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:29,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:20:30,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 05:20:30,026 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-09 05:20:30,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1550105549, now seen corresponding path program 1 times [2024-11-09 05:20:30,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:30,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769493273] [2024-11-09 05:20:30,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:30,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 7 proven. 91 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2024-11-09 05:20:30,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:30,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769493273] [2024-11-09 05:20:30,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769493273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:20:30,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074930228] [2024-11-09 05:20:30,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:30,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:20:30,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:20:30,318 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:20:30,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:20:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:30,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 1945 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 05:20:30,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:20:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2024-11-09 05:20:30,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:20:30,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074930228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:30,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:20:30,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-09 05:20:30,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327511709] [2024-11-09 05:20:30,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:30,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:20:30,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:30,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:20:30,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:30,876 INFO L87 Difference]: Start difference. First operand 358 states and 505 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 05:20:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:30,976 INFO L93 Difference]: Finished difference Result 359 states and 506 transitions. [2024-11-09 05:20:30,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:20:30,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 198 [2024-11-09 05:20:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:30,980 INFO L225 Difference]: With dead ends: 359 [2024-11-09 05:20:30,980 INFO L226 Difference]: Without dead ends: 359 [2024-11-09 05:20:30,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:30,981 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 0 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:30,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:20:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-09 05:20:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-11-09 05:20:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 227 states have (on average 2.0881057268722465) internal successors, (474), 343 states have internal predecessors, (474), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 05:20:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 506 transitions. [2024-11-09 05:20:30,995 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 506 transitions. Word has length 198 [2024-11-09 05:20:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:30,995 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 506 transitions. [2024-11-09 05:20:30,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 05:20:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 506 transitions. [2024-11-09 05:20:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 05:20:31,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:31,000 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:31,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 05:20:31,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 05:20:31,201 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-11-09 05:20:31,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:31,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1325334857, now seen corresponding path program 1 times [2024-11-09 05:20:31,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:31,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966939044] [2024-11-09 05:20:31,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:31,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 12 proven. 444 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2024-11-09 05:20:34,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:34,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966939044] [2024-11-09 05:20:34,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966939044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:20:34,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719564204] [2024-11-09 05:20:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:34,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:20:34,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:20:34,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:20:34,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6d0fb36-5384-4162-8898-1b18d9640898/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:20:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:35,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 2015 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 05:20:35,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:20:35,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 05:20:35,736 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:20:35,736 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 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-09 05:20:35,746 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 7 treesize of output 3 [2024-11-09 05:20:35,848 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:20:35,848 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 1 case distinctions, treesize of input 22 treesize of output 21 [2024-11-09 05:20:35,957 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-09 05:20:35,957 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 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-09 05:20:36,357 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 45 treesize of output 33 [2024-11-09 05:20:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 874 proven. 20 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2024-11-09 05:20:37,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:20:38,000 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 10 treesize of output 4 [2024-11-09 05:20:38,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719564204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:20:38,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1781338403] [2024-11-09 05:20:38,060 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2024-11-09 05:20:38,060 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:20:38,060 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:20:38,061 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:20:38,061 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:21:24,840 INFO L197 IcfgInterpreter]: Interpreting procedure append with input of size 13 for LOIs [2024-11-09 05:21:24,972 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:22:02,225 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 178 DAG size of output: 174 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:22:08,416 WARN L286 SmtUtils]: Spent 5.09s on a formula simplification. DAG size of input: 186 DAG size of output: 182 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:22:18,765 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 180 DAG size of output: 176 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:22:20,776 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse1 (<= 8 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|))) (.cse3 (exists ((|v_old(#memory_int)_AFTER_CALL_40| (Array Int (Array Int Int))) (|v_#memory_int_210| (Array Int (Array Int Int))) (|v_#memory_int_211| (Array Int (Array Int Int)))) (let ((.cse46 (select |v_#memory_int_211| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse45 (select |v_#memory_int_210| 1))) (and (= (select .cse45 0) 48) (= (store |v_#memory_int_210| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_210| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse46 0))) |v_#memory_int_211|) (= (store |v_#memory_int_211| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse46 4 (select (select |v_old(#memory_int)_AFTER_CALL_40| |c_ULTIMATE.start_main_~list~0#1.base|) 4))) |v_old(#memory_int)_AFTER_CALL_40|) (= (select .cse45 1) 0))))) (.cse2 (exists ((|v_#length_264| (Array Int Int))) (and (= 22 (select |v_#length_264| 2)) (= 2 (select |v_#length_264| 1))))) (.cse4 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse5 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse6 (<= (+ |c_ULTIMATE.start_main_~list~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse8 (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0))) (.cse10 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base|) 0)) (.cse12 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse15 (exists ((|v_old(#memory_int)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_#memory_int_210| (Array Int (Array Int Int))) (|v_#memory_int_211| (Array Int (Array Int Int)))) (let ((.cse43 (select |v_#memory_int_210| 1)) (.cse44 (select |v_#memory_int_211| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select .cse43 0) 48) (= (store |v_#memory_int_210| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_210| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse44 0))) |v_#memory_int_211|) (= (select .cse43 1) 0) (= |v_old(#memory_int)_AFTER_CALL_39| (store |v_#memory_int_211| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse44 4 (select (select |v_old(#memory_int)_AFTER_CALL_39| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))))))) (.cse23 (exists ((|v_#valid_295| (Array Int Int)) (|v_#memory_int_214| (Array Int (Array Int Int))) (v_append_~node~0.base_67 Int) (|v_#memory_int_215| (Array Int (Array Int Int))) (|v_#memory_int_216| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_242| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int))) (|v_#length_265| (Array Int Int))) (let ((.cse40 (select |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse36 (select |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse37 (select |v_#memory_int_216| v_append_~node~0.base_67)) (.cse38 (select |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.offset_243| v_append_~node~0.base_67) 0))) |v_#memory_$Pointer$.offset_243|) (= (select |v_#valid_295| v_append_~node~0.base_67) 0) (= (select .cse36 0) 0) (<= (+ v_append_~node~0.base_67 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_265| v_append_~node~0.base_67 9)) (= (store |v_#memory_int_216| v_append_~node~0.base_67 (store .cse37 5 (select (select |c_#memory_int| v_append_~node~0.base_67) 5))) |c_#memory_int|) (= 0 (select .cse38 0)) (= (let ((.cse39 (store |v_#memory_int_212| v_append_~node~0.base_67 (store (select |v_#memory_int_212| v_append_~node~0.base_67) 0 60)))) (store .cse39 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse39 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse40 0)))) |v_#memory_int_214|) (= (select .cse36 4) 0) (= |v_#memory_int_215| (store |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse40 4 (select (select |v_#memory_int_215| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (= |c_#valid| (store |v_#valid_295| v_append_~node~0.base_67 1)) (not (= v_append_~node~0.base_67 0)) (= |v_#memory_$Pointer$.base_254| (store |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.base_254| v_append_~node~0.base_67) 0)))) (= |c_#memory_$Pointer$.offset| (let ((.cse41 (store |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse36 0 0) 4 0)))) (store .cse41 v_append_~node~0.base_67 (store (store (select .cse41 v_append_~node~0.base_67) 1 0) 5 0)))) (= (store |v_#memory_int_215| v_append_~node~0.base_67 (store (select |v_#memory_int_215| v_append_~node~0.base_67) 1 (select .cse37 1))) |v_#memory_int_216|) (<= 9 (select |c_#length| v_append_~node~0.base_67)) (= (select |c_#valid| v_append_~node~0.base_67) 1) (= (let ((.cse42 (store |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse38 0 v_append_~node~0.base_67) 4 v_append_~node~0.base_67)))) (store .cse42 v_append_~node~0.base_67 (store (store (select .cse42 v_append_~node~0.base_67) 1 0) 5 0))) |c_#memory_$Pointer$.base|) (= (select .cse38 4) 0)))))) (or (and .cse0 .cse1 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_42| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~userInput~1#1_20| Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_42| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_42| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_42| (Array Int (Array Int Int)))) (and (<= |v_ULTIMATE.start_main_~userInput~1#1_20| 127) (let ((.cse7 (<= 8 (select |v_old(#length)_AFTER_CALL_42| |c_ULTIMATE.start_main_~list~0#1.base|))) (.cse9 (not (= 62 |v_ULTIMATE.start_main_~userInput~1#1_20|))) (.cse11 (exists ((|v_#valid_295| (Array Int Int)) (|v_#memory_int_214| (Array Int (Array Int Int))) (v_append_~node~0.base_67 Int) (|v_#memory_int_215| (Array Int (Array Int Int))) (|v_#memory_int_216| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_242| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int))) (|v_#length_265| (Array Int Int))) (let ((.cse16 (select |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse21 (select |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse22 (select |v_#memory_int_216| v_append_~node~0.base_67)) (.cse18 (select |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.offset_243| v_append_~node~0.base_67) 0))) |v_#memory_$Pointer$.offset_243|) (= (select |v_#valid_295| v_append_~node~0.base_67) 0) (= (select .cse16 0) 0) (<= (+ v_append_~node~0.base_67 1) |c_#StackHeapBarrier|) (= |v_old(#length)_AFTER_CALL_42| (store |v_#length_265| v_append_~node~0.base_67 9)) (= (let ((.cse17 (store |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse18 0 v_append_~node~0.base_67) 4 v_append_~node~0.base_67)))) (store .cse17 v_append_~node~0.base_67 (store (store (select .cse17 v_append_~node~0.base_67) 1 0) 5 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_42|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_42| (let ((.cse19 (store |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse16 0 0) 4 0)))) (store .cse19 v_append_~node~0.base_67 (store (store (select .cse19 v_append_~node~0.base_67) 1 0) 5 0)))) (<= 9 (select |v_old(#length)_AFTER_CALL_42| v_append_~node~0.base_67)) (= 0 (select .cse18 0)) (= (select |v_old(#valid)_AFTER_CALL_42| v_append_~node~0.base_67) 1) (= (let ((.cse20 (store |v_#memory_int_212| v_append_~node~0.base_67 (store (select |v_#memory_int_212| v_append_~node~0.base_67) 0 |v_ULTIMATE.start_main_~userInput~1#1_20|)))) (store .cse20 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse21 0)))) |v_#memory_int_214|) (= (select .cse16 4) 0) (= |v_#memory_int_215| (store |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse21 4 (select (select |v_#memory_int_215| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (not (= v_append_~node~0.base_67 0)) (= |v_#memory_$Pointer$.base_254| (store |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.base_254| v_append_~node~0.base_67) 0)))) (= (store |v_#memory_int_215| v_append_~node~0.base_67 (store (select |v_#memory_int_215| v_append_~node~0.base_67) 1 (select .cse22 1))) |v_#memory_int_216|) (= |v_old(#memory_int)_AFTER_CALL_42| (store |v_#memory_int_216| v_append_~node~0.base_67 (store .cse22 5 (select (select |v_old(#memory_int)_AFTER_CALL_42| v_append_~node~0.base_67) 5)))) (= |v_old(#valid)_AFTER_CALL_42| (store |v_#valid_295| v_append_~node~0.base_67 1)) (= (select .cse18 4) 0))))) (.cse13 (not (= 60 |v_ULTIMATE.start_main_~userInput~1#1_20|))) (.cse14 (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~list~0#1.base|) 1))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14))) (<= 0 (+ 128 |v_ULTIMATE.start_main_~userInput~1#1_20|)))) .cse23) (and .cse0 .cse1 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_41| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~userInput~1#1_20| Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_41| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_41| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_41| (Array Int Int))) (and (let ((.cse24 (not (= 62 |v_ULTIMATE.start_main_~userInput~1#1_20|))) (.cse25 (not (= 60 |v_ULTIMATE.start_main_~userInput~1#1_20|))) (.cse26 (<= 8 (select |v_old(#length)_AFTER_CALL_41| |c_ULTIMATE.start_main_~list~0#1.base|))) (.cse27 (exists ((|v_#valid_295| (Array Int Int)) (|v_#memory_int_214| (Array Int (Array Int Int))) (v_append_~node~0.base_67 Int) (|v_#memory_int_215| (Array Int (Array Int Int))) (|v_#memory_int_216| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_242| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int))) (|v_#length_265| (Array Int Int))) (let ((.cse29 (select |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse33 (select |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse31 (select |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse34 (select |v_#memory_int_216| v_append_~node~0.base_67))) (and (= (store |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.offset_243| v_append_~node~0.base_67) 0))) |v_#memory_$Pointer$.offset_243|) (= (select |v_#valid_295| v_append_~node~0.base_67) 0) (= (select .cse29 0) 0) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_41| (let ((.cse30 (store |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse29 0 0) 4 0)))) (store .cse30 v_append_~node~0.base_67 (store (store (select .cse30 v_append_~node~0.base_67) 1 0) 5 0)))) (<= (+ v_append_~node~0.base_67 1) |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_41| v_append_~node~0.base_67) 1) (= 0 (select .cse31 0)) (= (let ((.cse32 (store |v_#memory_int_212| v_append_~node~0.base_67 (store (select |v_#memory_int_212| v_append_~node~0.base_67) 0 |v_ULTIMATE.start_main_~userInput~1#1_20|)))) (store .cse32 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse33 0)))) |v_#memory_int_214|) (= (select .cse29 4) 0) (= |v_#memory_int_215| (store |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse33 4 (select (select |v_#memory_int_215| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (not (= v_append_~node~0.base_67 0)) (<= 9 (select |v_old(#length)_AFTER_CALL_41| v_append_~node~0.base_67)) (= |v_#memory_$Pointer$.base_254| (store |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.base_254| v_append_~node~0.base_67) 0)))) (= (store |v_#memory_int_215| v_append_~node~0.base_67 (store (select |v_#memory_int_215| v_append_~node~0.base_67) 1 (select .cse34 1))) |v_#memory_int_216|) (= |v_old(#valid)_AFTER_CALL_41| (store |v_#valid_295| v_append_~node~0.base_67 1)) (= |v_old(#length)_AFTER_CALL_41| (store |v_#length_265| v_append_~node~0.base_67 9)) (= (select .cse31 4) 0) (= (let ((.cse35 (store |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse31 0 v_append_~node~0.base_67) 4 v_append_~node~0.base_67)))) (store .cse35 v_append_~node~0.base_67 (store (store (select .cse35 v_append_~node~0.base_67) 1 0) 5 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_41|) (= |v_old(#memory_int)_AFTER_CALL_41| (store |v_#memory_int_216| v_append_~node~0.base_67 (store .cse34 5 (select (select |v_old(#memory_int)_AFTER_CALL_41| v_append_~node~0.base_67) 5)))))))) (.cse28 (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~list~0#1.base|) 1))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse24 .cse10 .cse12 .cse25 .cse26 .cse27 .cse28) (and .cse2 .cse4 .cse5 .cse6 .cse8 .cse24 .cse10 .cse12 .cse25 .cse15 .cse26 .cse27 .cse28))) (<= |v_ULTIMATE.start_main_~userInput~1#1_20| 127) (<= 0 (+ 128 |v_ULTIMATE.start_main_~userInput~1#1_20|)))) .cse23)))) is different from false [2024-11-09 05:23:41,529 WARN L286 SmtUtils]: Spent 27.73s on a formula simplification. DAG size of input: 297 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:24:21,188 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (<= 0 (+ 128 |c_ULTIMATE.start_main_~userInput~2#1|)) (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse1 (<= 8 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|))) (.cse2 (not (= 60 |c_ULTIMATE.start_main_~userInput~2#1|))) (.cse15 (not (= 62 |c_ULTIMATE.start_main_~userInput~2#1|)))) (or (and .cse0 .cse1 .cse2 (exists ((v_append_~node~0.base_71 Int) (|v_#memory_int_229| (Array Int (Array Int Int))) (|v_#valid_299| (Array Int Int)) (|v_#memory_int_231| (Array Int (Array Int Int))) (|v_#memory_int_232| (Array Int (Array Int Int))) (|v_#length_269| (Array Int Int)) (|v_#memory_$Pointer$.offset_253| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_254| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_265| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_264| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_#memory_int_231| v_append_~node~0.base_71)) (.cse9 (select |v_#memory_$Pointer$.base_264| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse4 (select |v_#memory_int_229| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse5 (select |v_#memory_$Pointer$.offset_254| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (let ((.cse3 (store |v_#memory_int_232| v_append_~node~0.base_71 (store (select |v_#memory_int_232| v_append_~node~0.base_71) 0 |c_ULTIMATE.start_main_~userInput~2#1|)))) (store .cse3 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse4 0)))) |v_#memory_int_229|) (= (select .cse5 4) 0) (not (= v_append_~node~0.base_71 0)) (= (store |v_#memory_$Pointer$.offset_253| v_append_~node~0.base_71 (store (select |v_#memory_$Pointer$.offset_253| v_append_~node~0.base_71) 0 (select (select |v_#memory_$Pointer$.offset_254| v_append_~node~0.base_71) 0))) |v_#memory_$Pointer$.offset_254|) (= (let ((.cse6 (store |v_#memory_$Pointer$.offset_254| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse5 0 0) 4 0)))) (store .cse6 v_append_~node~0.base_71 (store (store (select .cse6 v_append_~node~0.base_71) 1 0) 5 0))) |c_#memory_$Pointer$.offset|) (= |c_#valid| (store |v_#valid_299| v_append_~node~0.base_71 1)) (= (select |c_#valid| v_append_~node~0.base_71) 1) (<= 9 (select |c_#length| v_append_~node~0.base_71)) (= (store |v_#memory_int_231| v_append_~node~0.base_71 (store .cse7 5 (select (select |c_#memory_int| v_append_~node~0.base_71) 5))) |c_#memory_int|) (= (let ((.cse8 (store |v_#memory_$Pointer$.base_264| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse9 0 v_append_~node~0.base_71) 4 v_append_~node~0.base_71)))) (store .cse8 v_append_~node~0.base_71 (store (store (select .cse8 v_append_~node~0.base_71) 1 0) 5 0))) |c_#memory_$Pointer$.base|) (= (select .cse9 0) 0) (= (store |v_#memory_int_230| v_append_~node~0.base_71 (store (select |v_#memory_int_230| v_append_~node~0.base_71) 1 (select .cse7 1))) |v_#memory_int_231|) (= (select |v_#valid_299| v_append_~node~0.base_71) 0) (= (store |v_#memory_$Pointer$.base_265| v_append_~node~0.base_71 (store (select |v_#memory_$Pointer$.base_265| v_append_~node~0.base_71) 0 (select (select |v_#memory_$Pointer$.base_264| v_append_~node~0.base_71) 0))) |v_#memory_$Pointer$.base_264|) (= 0 (select .cse9 4)) (= |c_#length| (store |v_#length_269| v_append_~node~0.base_71 9)) (<= (+ v_append_~node~0.base_71 1) |c_#StackHeapBarrier|) (= (store |v_#memory_int_229| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse4 4 (select (select |v_#memory_int_230| |c_ULTIMATE.start_main_~list~0#1.base|) 4))) |v_#memory_int_230|) (= (select .cse5 0) 0)))) (exists ((|v_#valid_295| (Array Int Int)) (|v_#memory_int_214| (Array Int (Array Int Int))) (v_append_~node~0.base_67 Int) (|v_#memory_int_215| (Array Int (Array Int Int))) (|v_#memory_int_216| (Array Int (Array Int Int))) (|v_#length_265| (Array Int Int)) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_242| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_44| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse11 (select |v_#memory_int_216| v_append_~node~0.base_67)) (.cse13 (select |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse12 (select |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.offset_243| v_append_~node~0.base_67) 0))) |v_#memory_$Pointer$.offset_243|) (<= 8 (select (store |v_#length_265| v_append_~node~0.base_67 9) |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select |v_#valid_295| v_append_~node~0.base_67) 0) (= (select .cse10 0) 0) (<= (+ v_append_~node~0.base_67 1) |c_#StackHeapBarrier|) (= (select (store |v_#valid_295| v_append_~node~0.base_67 1) |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= (store |v_#memory_int_216| v_append_~node~0.base_67 (store .cse11 5 (select (select |v_#memory_int_BEFORE_CALL_44| v_append_~node~0.base_67) 5))) |v_#memory_int_BEFORE_CALL_44|) (= 0 (select .cse12 0)) (= (select .cse10 4) 0) (= |v_#memory_int_215| (store |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse13 4 (select (select |v_#memory_int_215| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (not (= v_append_~node~0.base_67 0)) (= |v_#memory_$Pointer$.base_254| (store |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.base_254| v_append_~node~0.base_67) 0)))) (= (store |v_#memory_int_215| v_append_~node~0.base_67 (store (select |v_#memory_int_215| v_append_~node~0.base_67) 1 (select .cse11 1))) |v_#memory_int_216|) (= |v_#memory_int_214| (let ((.cse14 (store |v_#memory_int_212| v_append_~node~0.base_67 (store (select |v_#memory_int_212| v_append_~node~0.base_67) 0 62)))) (store .cse14 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse13 0))))) (= (select .cse12 4) 0)))) .cse15) (and .cse0 (exists ((|v_#memory_$Pointer$.base_262| (Array Int (Array Int Int))) (|v_#memory_int_228| (Array Int (Array Int Int))) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_226| (Array Int (Array Int Int))) (|v_#memory_int_227| (Array Int (Array Int Int))) (|v_#valid_298| (Array Int Int)) (|v_#memory_$Pointer$.offset_251| (Array Int (Array Int Int))) (|v_#length_268| (Array Int Int)) (|v_#memory_$Pointer$.offset_252| (Array Int (Array Int Int))) (v_append_~node~0.base_70 Int) (|v_#memory_$Pointer$.base_263| (Array Int (Array Int Int)))) (let ((.cse19 (select |v_#memory_int_227| v_append_~node~0.base_70)) (.cse18 (select |v_#memory_$Pointer$.base_262| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse17 (select |v_#memory_$Pointer$.offset_252| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse22 (select |v_#memory_int_225| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= |c_#memory_$Pointer$.offset| (let ((.cse16 (store |v_#memory_$Pointer$.offset_252| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse17 0 0) 4 0)))) (store .cse16 v_append_~node~0.base_70 (store (store (select .cse16 v_append_~node~0.base_70) 1 0) 5 0)))) (= |c_#valid| (store |v_#valid_298| v_append_~node~0.base_70 1)) (<= 9 (select |c_#length| v_append_~node~0.base_70)) (= |c_#length| (store |v_#length_268| v_append_~node~0.base_70 9)) (= (select |v_#valid_298| v_append_~node~0.base_70) 0) (= (select .cse18 0) 0) (= (store |v_#memory_int_226| v_append_~node~0.base_70 (store (select |v_#memory_int_226| v_append_~node~0.base_70) 1 (select .cse19 1))) |v_#memory_int_227|) (= |c_#memory_$Pointer$.base| (let ((.cse20 (store |v_#memory_$Pointer$.base_262| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse18 0 v_append_~node~0.base_70) 4 v_append_~node~0.base_70)))) (store .cse20 v_append_~node~0.base_70 (store (store (select .cse20 v_append_~node~0.base_70) 1 0) 5 0)))) (= (store |v_#memory_int_227| v_append_~node~0.base_70 (store .cse19 5 (select (select |c_#memory_int| v_append_~node~0.base_70) 5))) |c_#memory_int|) (= (let ((.cse21 (store |v_#memory_int_228| v_append_~node~0.base_70 (store (select |v_#memory_int_228| v_append_~node~0.base_70) 0 |c_ULTIMATE.start_main_~userInput~2#1|)))) (store .cse21 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse22 0)))) |v_#memory_int_225|) (= (select |c_#valid| v_append_~node~0.base_70) 1) (= (select .cse18 4) 0) (= |v_#memory_$Pointer$.offset_252| (store |v_#memory_$Pointer$.offset_251| v_append_~node~0.base_70 (store (select |v_#memory_$Pointer$.offset_251| v_append_~node~0.base_70) 0 (select (select |v_#memory_$Pointer$.offset_252| v_append_~node~0.base_70) 0)))) (= (select .cse17 0) 0) (= (select .cse17 4) 0) (= |v_#memory_int_226| (store |v_#memory_int_225| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse22 4 (select (select |v_#memory_int_226| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (= (store |v_#memory_$Pointer$.base_263| v_append_~node~0.base_70 (store (select |v_#memory_$Pointer$.base_263| v_append_~node~0.base_70) 0 (select (select |v_#memory_$Pointer$.base_262| v_append_~node~0.base_70) 0))) |v_#memory_$Pointer$.base_262|) (<= (+ v_append_~node~0.base_70 1) |c_#StackHeapBarrier|) (not (= v_append_~node~0.base_70 0))))) .cse1 .cse2 .cse15 (exists ((|v_#valid_295| (Array Int Int)) (|v_#memory_int_214| (Array Int (Array Int Int))) (v_append_~node~0.base_67 Int) (|v_#memory_int_215| (Array Int (Array Int Int))) (|v_#memory_int_216| (Array Int (Array Int Int))) (|v_#length_265| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_53| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_242| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (let ((.cse23 (select |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse25 (select |v_#memory_int_216| v_append_~node~0.base_67)) (.cse26 (select |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse24 (select |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.offset_243| v_append_~node~0.base_67) 0))) |v_#memory_$Pointer$.offset_243|) (<= 8 (select (store |v_#length_265| v_append_~node~0.base_67 9) |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select |v_#valid_295| v_append_~node~0.base_67) 0) (= (select .cse23 0) 0) (<= (+ v_append_~node~0.base_67 1) |c_#StackHeapBarrier|) (= (select (store |v_#valid_295| v_append_~node~0.base_67 1) |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= 0 (select .cse24 0)) (= (select .cse23 4) 0) (= |v_old(#memory_int)_AFTER_CALL_53| (store |v_#memory_int_216| v_append_~node~0.base_67 (store .cse25 5 (select (select |v_old(#memory_int)_AFTER_CALL_53| v_append_~node~0.base_67) 5)))) (= |v_#memory_int_215| (store |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse26 4 (select (select |v_#memory_int_215| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (not (= v_append_~node~0.base_67 0)) (= |v_#memory_$Pointer$.base_254| (store |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.base_254| v_append_~node~0.base_67) 0)))) (= (store |v_#memory_int_215| v_append_~node~0.base_67 (store (select |v_#memory_int_215| v_append_~node~0.base_67) 1 (select .cse25 1))) |v_#memory_int_216|) (= |v_#memory_int_214| (let ((.cse27 (store |v_#memory_int_212| v_append_~node~0.base_67 (store (select |v_#memory_int_212| v_append_~node~0.base_67) 0 62)))) (store .cse27 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse26 0))))) (= (select .cse24 4) 0))))))) (<= |c_ULTIMATE.start_main_~userInput~2#1| 127)) is different from false [2024-11-09 05:25:48,822 WARN L286 SmtUtils]: Spent 34.72s on a formula simplification. DAG size of input: 305 DAG size of output: 297 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:25:50,842 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~userInput~2#1_16| Int)) (and (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse1 (not (= 60 |v_ULTIMATE.start_main_~userInput~2#1_16|))) (.cse9 (<= 8 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|))) (.cse10 (not (= 62 |v_ULTIMATE.start_main_~userInput~2#1_16|)))) (or (and .cse0 .cse1 (exists ((v_append_~node~0.base_71 Int) (|v_#memory_int_229| (Array Int (Array Int Int))) (|v_#valid_299| (Array Int Int)) (|v_#memory_int_231| (Array Int (Array Int Int))) (|v_#memory_int_232| (Array Int (Array Int Int))) (|v_#length_269| (Array Int Int)) (|v_#memory_$Pointer$.offset_253| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_254| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_265| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_264| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_231| v_append_~node~0.base_71)) (.cse6 (select |v_#memory_$Pointer$.base_264| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse2 (select |v_#memory_$Pointer$.offset_254| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse7 (select |v_#memory_int_229| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select .cse2 4) 0) (not (= v_append_~node~0.base_71 0)) (= (store |v_#memory_$Pointer$.offset_253| v_append_~node~0.base_71 (store (select |v_#memory_$Pointer$.offset_253| v_append_~node~0.base_71) 0 (select (select |v_#memory_$Pointer$.offset_254| v_append_~node~0.base_71) 0))) |v_#memory_$Pointer$.offset_254|) (= (let ((.cse3 (store |v_#memory_$Pointer$.offset_254| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse2 0 0) 4 0)))) (store .cse3 v_append_~node~0.base_71 (store (store (select .cse3 v_append_~node~0.base_71) 1 0) 5 0))) |c_#memory_$Pointer$.offset|) (= |c_#valid| (store |v_#valid_299| v_append_~node~0.base_71 1)) (= (select |c_#valid| v_append_~node~0.base_71) 1) (<= 9 (select |c_#length| v_append_~node~0.base_71)) (= (store |v_#memory_int_231| v_append_~node~0.base_71 (store .cse4 5 (select (select |c_#memory_int| v_append_~node~0.base_71) 5))) |c_#memory_int|) (= (let ((.cse5 (store |v_#memory_$Pointer$.base_264| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse6 0 v_append_~node~0.base_71) 4 v_append_~node~0.base_71)))) (store .cse5 v_append_~node~0.base_71 (store (store (select .cse5 v_append_~node~0.base_71) 1 0) 5 0))) |c_#memory_$Pointer$.base|) (= (select .cse6 0) 0) (= (store |v_#memory_int_230| v_append_~node~0.base_71 (store (select |v_#memory_int_230| v_append_~node~0.base_71) 1 (select .cse4 1))) |v_#memory_int_231|) (= (select |v_#valid_299| v_append_~node~0.base_71) 0) (= (store |v_#memory_$Pointer$.base_265| v_append_~node~0.base_71 (store (select |v_#memory_$Pointer$.base_265| v_append_~node~0.base_71) 0 (select (select |v_#memory_$Pointer$.base_264| v_append_~node~0.base_71) 0))) |v_#memory_$Pointer$.base_264|) (= 0 (select .cse6 4)) (= |c_#length| (store |v_#length_269| v_append_~node~0.base_71 9)) (<= (+ v_append_~node~0.base_71 1) |c_#StackHeapBarrier|) (= (store |v_#memory_int_229| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse7 4 (select (select |v_#memory_int_230| |c_ULTIMATE.start_main_~list~0#1.base|) 4))) |v_#memory_int_230|) (= (select .cse2 0) 0) (= (let ((.cse8 (store |v_#memory_int_232| v_append_~node~0.base_71 (store (select |v_#memory_int_232| v_append_~node~0.base_71) 0 |v_ULTIMATE.start_main_~userInput~2#1_16|)))) (store .cse8 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse7 0)))) |v_#memory_int_229|)))) .cse9 .cse10 (exists ((|v_#valid_295| (Array Int Int)) (|v_#memory_int_214| (Array Int (Array Int Int))) (v_append_~node~0.base_67 Int) (|v_#memory_int_215| (Array Int (Array Int Int))) (|v_#memory_int_216| (Array Int (Array Int Int))) (|v_#length_265| (Array Int Int)) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_242| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_44| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse12 (select |v_#memory_int_216| v_append_~node~0.base_67)) (.cse14 (select |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse13 (select |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.offset_243| v_append_~node~0.base_67) 0))) |v_#memory_$Pointer$.offset_243|) (<= 8 (select (store |v_#length_265| v_append_~node~0.base_67 9) |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select |v_#valid_295| v_append_~node~0.base_67) 0) (= (select .cse11 0) 0) (<= (+ v_append_~node~0.base_67 1) |c_#StackHeapBarrier|) (= (select (store |v_#valid_295| v_append_~node~0.base_67 1) |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= (store |v_#memory_int_216| v_append_~node~0.base_67 (store .cse12 5 (select (select |v_#memory_int_BEFORE_CALL_44| v_append_~node~0.base_67) 5))) |v_#memory_int_BEFORE_CALL_44|) (= 0 (select .cse13 0)) (= (select .cse11 4) 0) (= |v_#memory_int_215| (store |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse14 4 (select (select |v_#memory_int_215| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (not (= v_append_~node~0.base_67 0)) (= |v_#memory_$Pointer$.base_254| (store |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.base_254| v_append_~node~0.base_67) 0)))) (= (store |v_#memory_int_215| v_append_~node~0.base_67 (store (select |v_#memory_int_215| v_append_~node~0.base_67) 1 (select .cse12 1))) |v_#memory_int_216|) (= |v_#memory_int_214| (let ((.cse15 (store |v_#memory_int_212| v_append_~node~0.base_67 (store (select |v_#memory_int_212| v_append_~node~0.base_67) 0 62)))) (store .cse15 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse14 0))))) (= (select .cse13 4) 0))))) (and .cse0 (exists ((|v_#memory_$Pointer$.base_262| (Array Int (Array Int Int))) (|v_#memory_int_228| (Array Int (Array Int Int))) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_226| (Array Int (Array Int Int))) (|v_#memory_int_227| (Array Int (Array Int Int))) (|v_#valid_298| (Array Int Int)) (|v_#memory_$Pointer$.offset_251| (Array Int (Array Int Int))) (|v_#length_268| (Array Int Int)) (|v_#memory_$Pointer$.offset_252| (Array Int (Array Int Int))) (v_append_~node~0.base_70 Int) (|v_#memory_$Pointer$.base_263| (Array Int (Array Int Int)))) (let ((.cse19 (select |v_#memory_int_227| v_append_~node~0.base_70)) (.cse18 (select |v_#memory_$Pointer$.base_262| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse17 (select |v_#memory_$Pointer$.offset_252| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse22 (select |v_#memory_int_225| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= |c_#memory_$Pointer$.offset| (let ((.cse16 (store |v_#memory_$Pointer$.offset_252| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse17 0 0) 4 0)))) (store .cse16 v_append_~node~0.base_70 (store (store (select .cse16 v_append_~node~0.base_70) 1 0) 5 0)))) (= |c_#valid| (store |v_#valid_298| v_append_~node~0.base_70 1)) (<= 9 (select |c_#length| v_append_~node~0.base_70)) (= |c_#length| (store |v_#length_268| v_append_~node~0.base_70 9)) (= (select |v_#valid_298| v_append_~node~0.base_70) 0) (= (select .cse18 0) 0) (= (store |v_#memory_int_226| v_append_~node~0.base_70 (store (select |v_#memory_int_226| v_append_~node~0.base_70) 1 (select .cse19 1))) |v_#memory_int_227|) (= |c_#memory_$Pointer$.base| (let ((.cse20 (store |v_#memory_$Pointer$.base_262| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse18 0 v_append_~node~0.base_70) 4 v_append_~node~0.base_70)))) (store .cse20 v_append_~node~0.base_70 (store (store (select .cse20 v_append_~node~0.base_70) 1 0) 5 0)))) (= (store |v_#memory_int_227| v_append_~node~0.base_70 (store .cse19 5 (select (select |c_#memory_int| v_append_~node~0.base_70) 5))) |c_#memory_int|) (= (select |c_#valid| v_append_~node~0.base_70) 1) (= (select .cse18 4) 0) (= |v_#memory_$Pointer$.offset_252| (store |v_#memory_$Pointer$.offset_251| v_append_~node~0.base_70 (store (select |v_#memory_$Pointer$.offset_251| v_append_~node~0.base_70) 0 (select (select |v_#memory_$Pointer$.offset_252| v_append_~node~0.base_70) 0)))) (= (select .cse17 0) 0) (= (let ((.cse21 (store |v_#memory_int_228| v_append_~node~0.base_70 (store (select |v_#memory_int_228| v_append_~node~0.base_70) 0 |v_ULTIMATE.start_main_~userInput~2#1_16|)))) (store .cse21 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse22 0)))) |v_#memory_int_225|) (= (select .cse17 4) 0) (= |v_#memory_int_226| (store |v_#memory_int_225| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse22 4 (select (select |v_#memory_int_226| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (= (store |v_#memory_$Pointer$.base_263| v_append_~node~0.base_70 (store (select |v_#memory_$Pointer$.base_263| v_append_~node~0.base_70) 0 (select (select |v_#memory_$Pointer$.base_262| v_append_~node~0.base_70) 0))) |v_#memory_$Pointer$.base_262|) (<= (+ v_append_~node~0.base_70 1) |c_#StackHeapBarrier|) (not (= v_append_~node~0.base_70 0))))) .cse1 .cse9 .cse10 (exists ((|v_#valid_295| (Array Int Int)) (|v_#memory_int_214| (Array Int (Array Int Int))) (v_append_~node~0.base_67 Int) (|v_#memory_int_215| (Array Int (Array Int Int))) (|v_#memory_int_216| (Array Int (Array Int Int))) (|v_#length_265| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_53| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_242| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (let ((.cse23 (select |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse25 (select |v_#memory_int_216| v_append_~node~0.base_67)) (.cse26 (select |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse24 (select |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.offset_243| v_append_~node~0.base_67) 0))) |v_#memory_$Pointer$.offset_243|) (<= 8 (select (store |v_#length_265| v_append_~node~0.base_67 9) |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select |v_#valid_295| v_append_~node~0.base_67) 0) (= (select .cse23 0) 0) (<= (+ v_append_~node~0.base_67 1) |c_#StackHeapBarrier|) (= (select (store |v_#valid_295| v_append_~node~0.base_67 1) |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= 0 (select .cse24 0)) (= (select .cse23 4) 0) (= |v_old(#memory_int)_AFTER_CALL_53| (store |v_#memory_int_216| v_append_~node~0.base_67 (store .cse25 5 (select (select |v_old(#memory_int)_AFTER_CALL_53| v_append_~node~0.base_67) 5)))) (= |v_#memory_int_215| (store |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse26 4 (select (select |v_#memory_int_215| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (not (= v_append_~node~0.base_67 0)) (= |v_#memory_$Pointer$.base_254| (store |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.base_254| v_append_~node~0.base_67) 0)))) (= (store |v_#memory_int_215| v_append_~node~0.base_67 (store (select |v_#memory_int_215| v_append_~node~0.base_67) 1 (select .cse25 1))) |v_#memory_int_216|) (= |v_#memory_int_214| (let ((.cse27 (store |v_#memory_int_212| v_append_~node~0.base_67 (store (select |v_#memory_int_212| v_append_~node~0.base_67) 0 62)))) (store .cse27 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse26 0))))) (= (select .cse24 4) 0))))))) (<= |v_ULTIMATE.start_main_~userInput~2#1_16| 127) (<= 0 (+ 128 |v_ULTIMATE.start_main_~userInput~2#1_16|)))) (<= 1 |c_#StackHeapBarrier|)) is different from false [2024-11-09 05:25:52,899 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (let ((.cse20 (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse11 (exists ((|v_#valid_295| (Array Int Int)) (|v_#memory_int_214| (Array Int (Array Int Int))) (v_append_~node~0.base_67 Int) (|v_#memory_int_215| (Array Int (Array Int Int))) (|v_#memory_int_216| (Array Int (Array Int Int))) (|v_#length_265| (Array Int Int)) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_242| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_44| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (let ((.cse53 (select |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse54 (select |v_#memory_int_216| v_append_~node~0.base_67)) (.cse56 (select |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse55 (select |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.offset_243| v_append_~node~0.base_67) 0))) |v_#memory_$Pointer$.offset_243|) (<= 8 (select (store |v_#length_265| v_append_~node~0.base_67 9) |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select |v_#valid_295| v_append_~node~0.base_67) 0) (= (select .cse53 0) 0) (<= (+ v_append_~node~0.base_67 1) |c_#StackHeapBarrier|) (= (select (store |v_#valid_295| v_append_~node~0.base_67 1) |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= (store |v_#memory_int_216| v_append_~node~0.base_67 (store .cse54 5 (select (select |v_#memory_int_BEFORE_CALL_44| v_append_~node~0.base_67) 5))) |v_#memory_int_BEFORE_CALL_44|) (= 0 (select .cse55 0)) (= (select .cse53 4) 0) (= |v_#memory_int_215| (store |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse56 4 (select (select |v_#memory_int_215| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (not (= v_append_~node~0.base_67 0)) (= |v_#memory_$Pointer$.base_254| (store |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.base_254| v_append_~node~0.base_67) 0)))) (= (store |v_#memory_int_215| v_append_~node~0.base_67 (store (select |v_#memory_int_215| v_append_~node~0.base_67) 1 (select .cse54 1))) |v_#memory_int_216|) (= |v_#memory_int_214| (let ((.cse57 (store |v_#memory_int_212| v_append_~node~0.base_67 (store (select |v_#memory_int_212| v_append_~node~0.base_67) 0 62)))) (store .cse57 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse57 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse56 0))))) (= (select .cse55 4) 0))))) (.cse19 (exists ((|v_#valid_295| (Array Int Int)) (|v_#memory_int_214| (Array Int (Array Int Int))) (v_append_~node~0.base_67 Int) (|v_#memory_int_215| (Array Int (Array Int Int))) (|v_#memory_int_216| (Array Int (Array Int Int))) (|v_#length_265| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_53| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_242| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (let ((.cse48 (select |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse50 (select |v_#memory_int_216| v_append_~node~0.base_67)) (.cse51 (select |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse49 (select |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.offset_243| v_append_~node~0.base_67) 0))) |v_#memory_$Pointer$.offset_243|) (<= 8 (select (store |v_#length_265| v_append_~node~0.base_67 9) |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select |v_#valid_295| v_append_~node~0.base_67) 0) (= (select .cse48 0) 0) (<= (+ v_append_~node~0.base_67 1) |c_#StackHeapBarrier|) (= (select (store |v_#valid_295| v_append_~node~0.base_67 1) |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= 0 (select .cse49 0)) (= (select .cse48 4) 0) (= |v_old(#memory_int)_AFTER_CALL_53| (store |v_#memory_int_216| v_append_~node~0.base_67 (store .cse50 5 (select (select |v_old(#memory_int)_AFTER_CALL_53| v_append_~node~0.base_67) 5)))) (= |v_#memory_int_215| (store |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse51 4 (select (select |v_#memory_int_215| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (not (= v_append_~node~0.base_67 0)) (= |v_#memory_$Pointer$.base_254| (store |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.base_254| v_append_~node~0.base_67) 0)))) (= (store |v_#memory_int_215| v_append_~node~0.base_67 (store (select |v_#memory_int_215| v_append_~node~0.base_67) 1 (select .cse50 1))) |v_#memory_int_216|) (= |v_#memory_int_214| (let ((.cse52 (store |v_#memory_int_212| v_append_~node~0.base_67 (store (select |v_#memory_int_212| v_append_~node~0.base_67) 0 62)))) (store .cse52 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse52 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse51 0))))) (= (select .cse49 4) 0))))) (.cse21 (<= 8 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|))) (.cse22 (exists ((|v_#valid_295| (Array Int Int)) (|v_#memory_int_214| (Array Int (Array Int Int))) (v_append_~node~0.base_67 Int) (|v_#memory_int_215| (Array Int (Array Int Int))) (|v_#memory_int_216| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_242| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int))) (|v_#length_265| (Array Int Int))) (let ((.cse45 (select |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse41 (select |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse42 (select |v_#memory_int_216| v_append_~node~0.base_67)) (.cse43 (select |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.offset_242| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.offset_243| v_append_~node~0.base_67) 0))) |v_#memory_$Pointer$.offset_243|) (= (select |v_#valid_295| v_append_~node~0.base_67) 0) (= (select .cse41 0) 0) (<= (+ v_append_~node~0.base_67 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_265| v_append_~node~0.base_67 9)) (= (store |v_#memory_int_216| v_append_~node~0.base_67 (store .cse42 5 (select (select |c_#memory_int| v_append_~node~0.base_67) 5))) |c_#memory_int|) (= 0 (select .cse43 0)) (= (let ((.cse44 (store |v_#memory_int_212| v_append_~node~0.base_67 (store (select |v_#memory_int_212| v_append_~node~0.base_67) 0 60)))) (store .cse44 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse44 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse45 0)))) |v_#memory_int_214|) (= (select .cse41 4) 0) (= |v_#memory_int_215| (store |v_#memory_int_214| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse45 4 (select (select |v_#memory_int_215| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (= |c_#valid| (store |v_#valid_295| v_append_~node~0.base_67 1)) (not (= v_append_~node~0.base_67 0)) (= |v_#memory_$Pointer$.base_254| (store |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67 (store (select |v_#memory_$Pointer$.base_253| v_append_~node~0.base_67) 0 (select (select |v_#memory_$Pointer$.base_254| v_append_~node~0.base_67) 0)))) (= |c_#memory_$Pointer$.offset| (let ((.cse46 (store |v_#memory_$Pointer$.offset_243| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse41 0 0) 4 0)))) (store .cse46 v_append_~node~0.base_67 (store (store (select .cse46 v_append_~node~0.base_67) 1 0) 5 0)))) (= (store |v_#memory_int_215| v_append_~node~0.base_67 (store (select |v_#memory_int_215| v_append_~node~0.base_67) 1 (select .cse42 1))) |v_#memory_int_216|) (<= 9 (select |c_#length| v_append_~node~0.base_67)) (= (select |c_#valid| v_append_~node~0.base_67) 1) (= (let ((.cse47 (store |v_#memory_$Pointer$.base_254| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse43 0 v_append_~node~0.base_67) 4 v_append_~node~0.base_67)))) (store .cse47 v_append_~node~0.base_67 (store (store (select .cse47 v_append_~node~0.base_67) 1 0) 5 0))) |c_#memory_$Pointer$.base|) (= (select .cse43 4) 0)))))) (or (and (exists ((|v_old(#length)_AFTER_CALL_55| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_55| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_55| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_55| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~userInput~2#1_16| Int)) (and (let ((.cse0 (not (= 60 |v_ULTIMATE.start_main_~userInput~2#1_16|))) (.cse1 (= (select |v_old(#valid)_AFTER_CALL_55| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse9 (<= 8 (select |v_old(#length)_AFTER_CALL_55| |c_ULTIMATE.start_main_~list~0#1.base|))) (.cse10 (not (= 62 |v_ULTIMATE.start_main_~userInput~2#1_16|)))) (or (and .cse0 .cse1 (exists ((v_append_~node~0.base_71 Int) (|v_#memory_int_229| (Array Int (Array Int Int))) (|v_#valid_299| (Array Int Int)) (|v_#memory_int_231| (Array Int (Array Int Int))) (|v_#memory_int_232| (Array Int (Array Int Int))) (|v_#length_269| (Array Int Int)) (|v_#memory_$Pointer$.offset_253| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_254| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_265| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_264| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_#memory_int_231| v_append_~node~0.base_71)) (.cse2 (select |v_#memory_$Pointer$.offset_254| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse6 (select |v_#memory_int_229| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse3 (select |v_#memory_$Pointer$.base_264| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select .cse2 4) 0) (not (= v_append_~node~0.base_71 0)) (= (store |v_#memory_$Pointer$.offset_253| v_append_~node~0.base_71 (store (select |v_#memory_$Pointer$.offset_253| v_append_~node~0.base_71) 0 (select (select |v_#memory_$Pointer$.offset_254| v_append_~node~0.base_71) 0))) |v_#memory_$Pointer$.offset_254|) (<= 9 (select |v_old(#length)_AFTER_CALL_55| v_append_~node~0.base_71)) (= (select .cse3 0) 0) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_55| (let ((.cse4 (store |v_#memory_$Pointer$.offset_254| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse2 0 0) 4 0)))) (store .cse4 v_append_~node~0.base_71 (store (store (select .cse4 v_append_~node~0.base_71) 1 0) 5 0)))) (= (store |v_#memory_int_230| v_append_~node~0.base_71 (store (select |v_#memory_int_230| v_append_~node~0.base_71) 1 (select .cse5 1))) |v_#memory_int_231|) (= |v_old(#length)_AFTER_CALL_55| (store |v_#length_269| v_append_~node~0.base_71 9)) (= (select |v_old(#valid)_AFTER_CALL_55| v_append_~node~0.base_71) 1) (= |v_old(#memory_int)_AFTER_CALL_55| (store |v_#memory_int_231| v_append_~node~0.base_71 (store .cse5 5 (select (select |v_old(#memory_int)_AFTER_CALL_55| v_append_~node~0.base_71) 5)))) (= (select |v_#valid_299| v_append_~node~0.base_71) 0) (= (store |v_#memory_$Pointer$.base_265| v_append_~node~0.base_71 (store (select |v_#memory_$Pointer$.base_265| v_append_~node~0.base_71) 0 (select (select |v_#memory_$Pointer$.base_264| v_append_~node~0.base_71) 0))) |v_#memory_$Pointer$.base_264|) (= 0 (select .cse3 4)) (<= (+ v_append_~node~0.base_71 1) |c_#StackHeapBarrier|) (= (store |v_#memory_int_229| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse6 4 (select (select |v_#memory_int_230| |c_ULTIMATE.start_main_~list~0#1.base|) 4))) |v_#memory_int_230|) (= (select .cse2 0) 0) (= (let ((.cse7 (store |v_#memory_int_232| v_append_~node~0.base_71 (store (select |v_#memory_int_232| v_append_~node~0.base_71) 0 |v_ULTIMATE.start_main_~userInput~2#1_16|)))) (store .cse7 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse6 0)))) |v_#memory_int_229|) (= |v_old(#valid)_AFTER_CALL_55| (store |v_#valid_299| v_append_~node~0.base_71 1)) (= (let ((.cse8 (store |v_#memory_$Pointer$.base_264| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse3 0 v_append_~node~0.base_71) 4 v_append_~node~0.base_71)))) (store .cse8 v_append_~node~0.base_71 (store (store (select .cse8 v_append_~node~0.base_71) 1 0) 5 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_55|)))) .cse9 .cse10 .cse11) (and .cse0 (exists ((|v_#memory_$Pointer$.base_262| (Array Int (Array Int Int))) (|v_#memory_int_228| (Array Int (Array Int Int))) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_226| (Array Int (Array Int Int))) (|v_#memory_int_227| (Array Int (Array Int Int))) (|v_#valid_298| (Array Int Int)) (|v_#memory_$Pointer$.offset_251| (Array Int (Array Int Int))) (|v_#length_268| (Array Int Int)) (|v_#memory_$Pointer$.offset_252| (Array Int (Array Int Int))) (v_append_~node~0.base_70 Int) (|v_#memory_$Pointer$.base_263| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_227| v_append_~node~0.base_70)) (.cse13 (select |v_#memory_$Pointer$.base_262| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse15 (select |v_#memory_$Pointer$.offset_252| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse18 (select |v_#memory_int_225| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (<= 9 (select |v_old(#length)_AFTER_CALL_55| v_append_~node~0.base_70)) (= |v_old(#memory_int)_AFTER_CALL_55| (store |v_#memory_int_227| v_append_~node~0.base_70 (store .cse12 5 (select (select |v_old(#memory_int)_AFTER_CALL_55| v_append_~node~0.base_70) 5)))) (= |v_old(#length)_AFTER_CALL_55| (store |v_#length_268| v_append_~node~0.base_70 9)) (= (select |v_#valid_298| v_append_~node~0.base_70) 0) (= (select .cse13 0) 0) (= (store |v_#memory_int_226| v_append_~node~0.base_70 (store (select |v_#memory_int_226| v_append_~node~0.base_70) 1 (select .cse12 1))) |v_#memory_int_227|) (= (store |v_#valid_298| v_append_~node~0.base_70 1) |v_old(#valid)_AFTER_CALL_55|) (= (select |v_old(#valid)_AFTER_CALL_55| v_append_~node~0.base_70) 1) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_55| (let ((.cse14 (store |v_#memory_$Pointer$.offset_252| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse15 0 0) 4 0)))) (store .cse14 v_append_~node~0.base_70 (store (store (select .cse14 v_append_~node~0.base_70) 1 0) 5 0)))) (= (select .cse13 4) 0) (= |v_#memory_$Pointer$.offset_252| (store |v_#memory_$Pointer$.offset_251| v_append_~node~0.base_70 (store (select |v_#memory_$Pointer$.offset_251| v_append_~node~0.base_70) 0 (select (select |v_#memory_$Pointer$.offset_252| v_append_~node~0.base_70) 0)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| (let ((.cse16 (store |v_#memory_$Pointer$.base_262| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse13 0 v_append_~node~0.base_70) 4 v_append_~node~0.base_70)))) (store .cse16 v_append_~node~0.base_70 (store (store (select .cse16 v_append_~node~0.base_70) 1 0) 5 0)))) (= (select .cse15 0) 0) (= (let ((.cse17 (store |v_#memory_int_228| v_append_~node~0.base_70 (store (select |v_#memory_int_228| v_append_~node~0.base_70) 0 |v_ULTIMATE.start_main_~userInput~2#1_16|)))) (store .cse17 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse18 0)))) |v_#memory_int_225|) (= (select .cse15 4) 0) (= |v_#memory_int_226| (store |v_#memory_int_225| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse18 4 (select (select |v_#memory_int_226| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (= (store |v_#memory_$Pointer$.base_263| v_append_~node~0.base_70 (store (select |v_#memory_$Pointer$.base_263| v_append_~node~0.base_70) 0 (select (select |v_#memory_$Pointer$.base_262| v_append_~node~0.base_70) 0))) |v_#memory_$Pointer$.base_262|) (<= (+ v_append_~node~0.base_70 1) |c_#StackHeapBarrier|) (not (= v_append_~node~0.base_70 0))))) .cse1 .cse9 .cse10 .cse19))) (<= |v_ULTIMATE.start_main_~userInput~2#1_16| 127) (<= 0 (+ 128 |v_ULTIMATE.start_main_~userInput~2#1_16|)))) .cse20 .cse21 .cse22) (and .cse20 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_56| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_56| (Array Int Int)) (|v_old(#length)_AFTER_CALL_56| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_56| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~userInput~2#1_16| Int) (|v_old(#memory_int)_AFTER_CALL_56| (Array Int (Array Int Int)))) (and (let ((.cse30 (not (= 60 |v_ULTIMATE.start_main_~userInput~2#1_16|))) (.cse31 (<= 8 (select |v_old(#length)_AFTER_CALL_56| |c_ULTIMATE.start_main_~list~0#1.base|))) (.cse32 (not (= 62 |v_ULTIMATE.start_main_~userInput~2#1_16|))) (.cse33 (= (select |v_old(#valid)_AFTER_CALL_56| |c_ULTIMATE.start_main_~list~0#1.base|) 1))) (or (and (exists ((v_append_~node~0.base_71 Int) (|v_#memory_int_229| (Array Int (Array Int Int))) (|v_#valid_299| (Array Int Int)) (|v_#memory_int_231| (Array Int (Array Int Int))) (|v_#memory_int_232| (Array Int (Array Int Int))) (|v_#length_269| (Array Int Int)) (|v_#memory_$Pointer$.offset_253| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_254| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_265| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_264| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int)))) (let ((.cse25 (select |v_#memory_$Pointer$.base_264| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse23 (select |v_#memory_$Pointer$.offset_254| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse28 (select |v_#memory_int_229| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse27 (select |v_#memory_int_231| v_append_~node~0.base_71))) (and (= |v_old(#length)_AFTER_CALL_56| (store |v_#length_269| v_append_~node~0.base_71 9)) (= (select .cse23 4) 0) (not (= v_append_~node~0.base_71 0)) (= (store |v_#memory_$Pointer$.offset_253| v_append_~node~0.base_71 (store (select |v_#memory_$Pointer$.offset_253| v_append_~node~0.base_71) 0 (select (select |v_#memory_$Pointer$.offset_254| v_append_~node~0.base_71) 0))) |v_#memory_$Pointer$.offset_254|) (= |v_old(#valid)_AFTER_CALL_56| (store |v_#valid_299| v_append_~node~0.base_71 1)) (= (let ((.cse24 (store |v_#memory_$Pointer$.base_264| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse25 0 v_append_~node~0.base_71) 4 v_append_~node~0.base_71)))) (store .cse24 v_append_~node~0.base_71 (store (store (select .cse24 v_append_~node~0.base_71) 1 0) 5 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_56|) (<= 9 (select |v_old(#length)_AFTER_CALL_56| v_append_~node~0.base_71)) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_56| (let ((.cse26 (store |v_#memory_$Pointer$.offset_254| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse23 0 0) 4 0)))) (store .cse26 v_append_~node~0.base_71 (store (store (select .cse26 v_append_~node~0.base_71) 1 0) 5 0)))) (= (select |v_old(#valid)_AFTER_CALL_56| v_append_~node~0.base_71) 1) (= (select .cse25 0) 0) (= (store |v_#memory_int_230| v_append_~node~0.base_71 (store (select |v_#memory_int_230| v_append_~node~0.base_71) 1 (select .cse27 1))) |v_#memory_int_231|) (= (select |v_#valid_299| v_append_~node~0.base_71) 0) (= (store |v_#memory_$Pointer$.base_265| v_append_~node~0.base_71 (store (select |v_#memory_$Pointer$.base_265| v_append_~node~0.base_71) 0 (select (select |v_#memory_$Pointer$.base_264| v_append_~node~0.base_71) 0))) |v_#memory_$Pointer$.base_264|) (= 0 (select .cse25 4)) (<= (+ v_append_~node~0.base_71 1) |c_#StackHeapBarrier|) (= (store |v_#memory_int_229| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse28 4 (select (select |v_#memory_int_230| |c_ULTIMATE.start_main_~list~0#1.base|) 4))) |v_#memory_int_230|) (= (select .cse23 0) 0) (= (let ((.cse29 (store |v_#memory_int_232| v_append_~node~0.base_71 (store (select |v_#memory_int_232| v_append_~node~0.base_71) 0 |v_ULTIMATE.start_main_~userInput~2#1_16|)))) (store .cse29 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse28 0)))) |v_#memory_int_229|) (= |v_old(#memory_int)_AFTER_CALL_56| (store |v_#memory_int_231| v_append_~node~0.base_71 (store .cse27 5 (select (select |v_old(#memory_int)_AFTER_CALL_56| v_append_~node~0.base_71) 5))))))) .cse30 .cse31 .cse32 .cse11 .cse33) (and .cse30 .cse31 .cse32 (exists ((|v_#memory_$Pointer$.base_262| (Array Int (Array Int Int))) (|v_#memory_int_228| (Array Int (Array Int Int))) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_226| (Array Int (Array Int Int))) (|v_#memory_int_227| (Array Int (Array Int Int))) (|v_#valid_298| (Array Int Int)) (|v_#memory_$Pointer$.offset_251| (Array Int (Array Int Int))) (|v_#length_268| (Array Int Int)) (|v_#memory_$Pointer$.offset_252| (Array Int (Array Int Int))) (v_append_~node~0.base_70 Int) (|v_#memory_$Pointer$.base_263| (Array Int (Array Int Int)))) (let ((.cse37 (select |v_#memory_int_227| v_append_~node~0.base_70)) (.cse36 (select |v_#memory_$Pointer$.base_262| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse35 (select |v_#memory_$Pointer$.offset_252| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse40 (select |v_#memory_int_225| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#valid_298| v_append_~node~0.base_70 1) |v_old(#valid)_AFTER_CALL_56|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_56| (let ((.cse34 (store |v_#memory_$Pointer$.offset_252| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse35 0 0) 4 0)))) (store .cse34 v_append_~node~0.base_70 (store (store (select .cse34 v_append_~node~0.base_70) 1 0) 5 0)))) (= (select |v_#valid_298| v_append_~node~0.base_70) 0) (= (select .cse36 0) 0) (= (store |v_#memory_int_226| v_append_~node~0.base_70 (store (select |v_#memory_int_226| v_append_~node~0.base_70) 1 (select .cse37 1))) |v_#memory_int_227|) (<= 9 (select |v_old(#length)_AFTER_CALL_56| v_append_~node~0.base_70)) (= (select .cse36 4) 0) (= |v_old(#memory_int)_AFTER_CALL_56| (store |v_#memory_int_227| v_append_~node~0.base_70 (store .cse37 5 (select (select |v_old(#memory_int)_AFTER_CALL_56| v_append_~node~0.base_70) 5)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| (let ((.cse38 (store |v_#memory_$Pointer$.base_262| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse36 0 v_append_~node~0.base_70) 4 v_append_~node~0.base_70)))) (store .cse38 v_append_~node~0.base_70 (store (store (select .cse38 v_append_~node~0.base_70) 1 0) 5 0)))) (= (select |v_old(#valid)_AFTER_CALL_56| v_append_~node~0.base_70) 1) (= |v_#memory_$Pointer$.offset_252| (store |v_#memory_$Pointer$.offset_251| v_append_~node~0.base_70 (store (select |v_#memory_$Pointer$.offset_251| v_append_~node~0.base_70) 0 (select (select |v_#memory_$Pointer$.offset_252| v_append_~node~0.base_70) 0)))) (= (select .cse35 0) 0) (= |v_old(#length)_AFTER_CALL_56| (store |v_#length_268| v_append_~node~0.base_70 9)) (= (let ((.cse39 (store |v_#memory_int_228| v_append_~node~0.base_70 (store (select |v_#memory_int_228| v_append_~node~0.base_70) 0 |v_ULTIMATE.start_main_~userInput~2#1_16|)))) (store .cse39 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse39 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse40 0)))) |v_#memory_int_225|) (= (select .cse35 4) 0) (= |v_#memory_int_226| (store |v_#memory_int_225| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse40 4 (select (select |v_#memory_int_226| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (= (store |v_#memory_$Pointer$.base_263| v_append_~node~0.base_70 (store (select |v_#memory_$Pointer$.base_263| v_append_~node~0.base_70) 0 (select (select |v_#memory_$Pointer$.base_262| v_append_~node~0.base_70) 0))) |v_#memory_$Pointer$.base_262|) (<= (+ v_append_~node~0.base_70 1) |c_#StackHeapBarrier|) (not (= v_append_~node~0.base_70 0))))) .cse19 .cse33))) (<= |v_ULTIMATE.start_main_~userInput~2#1_16| 127) (<= 0 (+ 128 |v_ULTIMATE.start_main_~userInput~2#1_16|)))) .cse21 .cse22)))) is different from false [2024-11-09 05:27:45,917 WARN L286 SmtUtils]: Spent 24.27s on a formula simplification. DAG size of input: 287 DAG size of output: 279 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:29:58,808 WARN L286 SmtUtils]: Spent 32.46s on a formula simplification. DAG size of input: 297 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:31:34,051 WARN L286 SmtUtils]: Spent 38.70s on a formula simplification. DAG size of input: 305 DAG size of output: 297 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)