./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E --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 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:36:38,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:36:38,808 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:36:38,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:36:38,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:36:38,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:36:38,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:36:38,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:36:38,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:36:38,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:36:38,858 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:36:38,858 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:36:38,858 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:36:38,858 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:36:38,858 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:36:38,858 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:36:38,859 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:36:38,859 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:36:38,859 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:36:38,859 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:36:38,859 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:36:38,859 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:36:38,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:36:38,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:36:38,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:36:38,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:36:38,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:36:38,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:36:38,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:36:38,860 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:36:38,860 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:36:38,860 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:36:38,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:36:38,861 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:36:38,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:36:38,862 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:36:38,862 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:36:38,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:36:38,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:36:38,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:36:38,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:36:38,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:36:38,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:36:38,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:36:38,863 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:36:38,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:36:38,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:36:38,863 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:36:38,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:36:38,863 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E 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 -> 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 [2024-11-14 05:36:39,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:36:39,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:36:39,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:36:39,194 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:36:39,194 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:36:39,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i Unable to find full path for "g++" [2024-11-14 05:36:41,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:36:41,466 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:36:41,466 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2024-11-14 05:36:41,487 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/data/4fe09be49/12ed86f6ec354f599d313804fe96f784/FLAGded3c25e7 [2024-11-14 05:36:41,632 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/data/4fe09be49/12ed86f6ec354f599d313804fe96f784 [2024-11-14 05:36:41,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:36:41,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:36:41,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:36:41,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:36:41,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:36:41,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:36:41" (1/1) ... [2024-11-14 05:36:41,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3978e517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:41, skipping insertion in model container [2024-11-14 05:36:41,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:36:41" (1/1) ... [2024-11-14 05:36:41,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:36:42,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:36:42,087 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:36:42,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:36:42,166 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:36:42,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:42 WrapperNode [2024-11-14 05:36:42,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:36:42,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:36:42,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:36:42,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:36:42,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:42" (1/1) ... [2024-11-14 05:36:42,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:42" (1/1) ... [2024-11-14 05:36:42,215 INFO L138 Inliner]: procedures = 125, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 356 [2024-11-14 05:36:42,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:36:42,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:36:42,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:36:42,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:36:42,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:42" (1/1) ... [2024-11-14 05:36:42,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:42" (1/1) ... [2024-11-14 05:36:42,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:42" (1/1) ... [2024-11-14 05:36:42,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:42" (1/1) ... [2024-11-14 05:36:42,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:42" (1/1) ... [2024-11-14 05:36:42,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:42" (1/1) ... [2024-11-14 05:36:42,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:42" (1/1) ... [2024-11-14 05:36:42,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:42" (1/1) ... [2024-11-14 05:36:42,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:36:42,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:36:42,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:36:42,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:36:42,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:42" (1/1) ... [2024-11-14 05:36:42,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:36:42,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:36:42,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:36:42,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:36:42,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:36:42,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:36:42,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:36:42,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:36:42,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:36:42,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:36:42,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:36:42,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:36:42,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:36:42,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:36:42,333 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-11-14 05:36:42,333 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-11-14 05:36:42,471 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:36:42,473 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:36:43,506 INFO L? ?]: Removed 360 outVars from TransFormulas that were not future-live. [2024-11-14 05:36:43,506 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:36:43,626 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:36:43,629 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-14 05:36:43,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:36:43 BoogieIcfgContainer [2024-11-14 05:36:43,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:36:43,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:36:43,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:36:43,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:36:43,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:36:41" (1/3) ... [2024-11-14 05:36:43,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b585151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:36:43, skipping insertion in model container [2024-11-14 05:36:43,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:42" (2/3) ... [2024-11-14 05:36:43,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b585151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:36:43, skipping insertion in model container [2024-11-14 05:36:43,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:36:43" (3/3) ... [2024-11-14 05:36:43,641 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2024-11-14 05:36:43,657 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:36:43,659 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG split_list_test05-1.i that has 2 procedures, 293 locations, 1 initial locations, 11 loop locations, and 147 error locations. [2024-11-14 05:36:43,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:36:43,731 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;@253f89b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:36:43,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2024-11-14 05:36:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 293 states, 130 states have (on average 2.353846153846154) internal successors, (306), 279 states have internal predecessors, (306), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 05:36:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 05:36:43,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:43,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 05:36:43,747 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-14 05:36:43,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:43,751 INFO L85 PathProgramCache]: Analyzing trace with hash 17798, now seen corresponding path program 1 times [2024-11-14 05:36:43,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:43,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695942236] [2024-11-14 05:36:43,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:43,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:43,973 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-14 05:36:43,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:43,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695942236] [2024-11-14 05:36:43,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695942236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:43,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:43,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 05:36:43,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930587052] [2024-11-14 05:36:43,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:43,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:36:43,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:44,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:36:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:36:44,018 INFO L87 Difference]: Start difference. First operand has 293 states, 130 states have (on average 2.353846153846154) internal successors, (306), 279 states have internal predecessors, (306), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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-14 05:36:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:44,699 INFO L93 Difference]: Finished difference Result 498 states and 552 transitions. [2024-11-14 05:36:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:36:44,702 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-14 05:36:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:44,719 INFO L225 Difference]: With dead ends: 498 [2024-11-14 05:36:44,719 INFO L226 Difference]: Without dead ends: 497 [2024-11-14 05:36:44,721 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-14 05:36:44,724 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 221 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:44,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 368 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:36:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-14 05:36:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 364. [2024-11-14 05:36:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 204 states have (on average 2.3186274509803924) internal successors, (473), 350 states have internal predecessors, (473), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 05:36:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 501 transitions. [2024-11-14 05:36:44,805 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 501 transitions. Word has length 2 [2024-11-14 05:36:44,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:44,806 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 501 transitions. [2024-11-14 05:36:44,806 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-14 05:36:44,807 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 501 transitions. [2024-11-14 05:36:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 05:36:44,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:44,807 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 05:36:44,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:36:44,809 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-14 05:36:44,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:44,810 INFO L85 PathProgramCache]: Analyzing trace with hash 17799, now seen corresponding path program 1 times [2024-11-14 05:36:44,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:44,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305047964] [2024-11-14 05:36:44,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:44,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:44,909 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-14 05:36:44,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:44,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305047964] [2024-11-14 05:36:44,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305047964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:44,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 05:36:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081568488] [2024-11-14 05:36:44,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:44,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:36:44,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:44,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:36:44,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:36:44,913 INFO L87 Difference]: Start difference. First operand 364 states and 501 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-14 05:36:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:45,239 INFO L93 Difference]: Finished difference Result 365 states and 504 transitions. [2024-11-14 05:36:45,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:36:45,243 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-14 05:36:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:45,245 INFO L225 Difference]: With dead ends: 365 [2024-11-14 05:36:45,245 INFO L226 Difference]: Without dead ends: 365 [2024-11-14 05:36:45,245 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-14 05:36:45,246 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 5 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:45,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 469 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:36:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-14 05:36:45,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2024-11-14 05:36:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 204 states have (on average 2.3088235294117645) internal successors, (471), 348 states have internal predecessors, (471), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 05:36:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 499 transitions. [2024-11-14 05:36:45,285 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 499 transitions. Word has length 2 [2024-11-14 05:36:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:45,288 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 499 transitions. [2024-11-14 05:36:45,289 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-14 05:36:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 499 transitions. [2024-11-14 05:36:45,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:36:45,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:45,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:45,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:36:45,289 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-14 05:36:45,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash 130348559, now seen corresponding path program 1 times [2024-11-14 05:36:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:45,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502027144] [2024-11-14 05:36:45,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:45,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:45,455 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-14 05:36:45,455 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:45,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502027144] [2024-11-14 05:36:45,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502027144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:45,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:45,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:36:45,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815503884] [2024-11-14 05:36:45,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:45,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:36:45,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:45,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:36:45,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:36:45,461 INFO L87 Difference]: Start difference. First operand 362 states and 499 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-14 05:36:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:45,749 INFO L93 Difference]: Finished difference Result 357 states and 494 transitions. [2024-11-14 05:36:45,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:36:45,750 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-14 05:36:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:45,752 INFO L225 Difference]: With dead ends: 357 [2024-11-14 05:36:45,752 INFO L226 Difference]: Without dead ends: 357 [2024-11-14 05:36:45,752 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-14 05:36:45,753 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 31 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:45,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 422 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:36:45,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-14 05:36:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-11-14 05:36:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 204 states have (on average 2.284313725490196) internal successors, (466), 343 states have internal predecessors, (466), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 05:36:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 494 transitions. [2024-11-14 05:36:45,778 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 494 transitions. Word has length 8 [2024-11-14 05:36:45,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:45,778 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 494 transitions. [2024-11-14 05:36:45,778 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-14 05:36:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 494 transitions. [2024-11-14 05:36:45,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:36:45,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:45,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:45,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:36:45,779 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-14 05:36:45,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:45,780 INFO L85 PathProgramCache]: Analyzing trace with hash 130348560, now seen corresponding path program 1 times [2024-11-14 05:36:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:45,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980060371] [2024-11-14 05:36:45,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:45,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:45,898 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-14 05:36:45,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:45,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980060371] [2024-11-14 05:36:45,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980060371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:45,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:45,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:36:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866620648] [2024-11-14 05:36:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:45,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:36:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:45,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:36:45,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:36:45,900 INFO L87 Difference]: Start difference. First operand 357 states and 494 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-14 05:36:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:46,163 INFO L93 Difference]: Finished difference Result 352 states and 489 transitions. [2024-11-14 05:36:46,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:36:46,163 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-14 05:36:46,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:46,165 INFO L225 Difference]: With dead ends: 352 [2024-11-14 05:36:46,165 INFO L226 Difference]: Without dead ends: 352 [2024-11-14 05:36:46,165 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-14 05:36:46,166 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 31 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:46,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 435 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:36:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-14 05:36:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-11-14 05:36:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 204 states have (on average 2.2598039215686274) internal successors, (461), 338 states have internal predecessors, (461), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 05:36:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 489 transitions. [2024-11-14 05:36:46,191 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 489 transitions. Word has length 8 [2024-11-14 05:36:46,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:46,192 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 489 transitions. [2024-11-14 05:36:46,192 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-14 05:36:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 489 transitions. [2024-11-14 05:36:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 05:36:46,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:46,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:46,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:36:46,193 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-14 05:36:46,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:46,193 INFO L85 PathProgramCache]: Analyzing trace with hash -254161555, now seen corresponding path program 1 times [2024-11-14 05:36:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318378167] [2024-11-14 05:36:46,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:46,479 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-14 05:36:46,480 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:46,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318378167] [2024-11-14 05:36:46,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318378167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:46,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:46,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:36:46,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043624135] [2024-11-14 05:36:46,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:46,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:36:46,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:46,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:36:46,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:36:46,483 INFO L87 Difference]: Start difference. First operand 352 states and 489 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-14 05:36:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:47,165 INFO L93 Difference]: Finished difference Result 474 states and 526 transitions. [2024-11-14 05:36:47,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:36:47,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-14 05:36:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:47,169 INFO L225 Difference]: With dead ends: 474 [2024-11-14 05:36:47,169 INFO L226 Difference]: Without dead ends: 474 [2024-11-14 05:36:47,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-14 05:36:47,173 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 288 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:47,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 517 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:36:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-14 05:36:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 344. [2024-11-14 05:36:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 204 states have (on average 2.2205882352941178) internal successors, (453), 330 states have internal predecessors, (453), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 05:36:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2024-11-14 05:36:47,198 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 9 [2024-11-14 05:36:47,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:47,198 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2024-11-14 05:36:47,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-14 05:36:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2024-11-14 05:36:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 05:36:47,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:47,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:47,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:36:47,200 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-14 05:36:47,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:47,200 INFO L85 PathProgramCache]: Analyzing trace with hash -254161554, now seen corresponding path program 1 times [2024-11-14 05:36:47,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:47,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988783708] [2024-11-14 05:36:47,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:47,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:47,518 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-14 05:36:47,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:47,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988783708] [2024-11-14 05:36:47,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988783708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:47,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:47,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:36:47,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055447649] [2024-11-14 05:36:47,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:47,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:36:47,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:47,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:36:47,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:36:47,523 INFO L87 Difference]: Start difference. First operand 344 states and 481 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-14 05:36:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:48,400 INFO L93 Difference]: Finished difference Result 466 states and 517 transitions. [2024-11-14 05:36:48,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:36:48,401 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-14 05:36:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:48,403 INFO L225 Difference]: With dead ends: 466 [2024-11-14 05:36:48,403 INFO L226 Difference]: Without dead ends: 466 [2024-11-14 05:36:48,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:36:48,404 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 487 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:48,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 332 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 05:36:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-14 05:36:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 335. [2024-11-14 05:36:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 204 states have (on average 2.1715686274509802) internal successors, (443), 321 states have internal predecessors, (443), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 05:36:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 471 transitions. [2024-11-14 05:36:48,423 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 471 transitions. Word has length 9 [2024-11-14 05:36:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:48,423 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 471 transitions. [2024-11-14 05:36:48,424 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-14 05:36:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 471 transitions. [2024-11-14 05:36:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 05:36:48,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:48,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:48,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 05:36:48,426 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-14 05:36:48,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:48,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2138092533, now seen corresponding path program 1 times [2024-11-14 05:36:48,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:48,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867567427] [2024-11-14 05:36:48,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:48,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:48,989 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-14 05:36:48,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:48,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867567427] [2024-11-14 05:36:48,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867567427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:48,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:48,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:36:48,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311044583] [2024-11-14 05:36:48,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:48,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:36:48,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:48,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:36:48,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:36:48,992 INFO L87 Difference]: Start difference. First operand 335 states and 471 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-14 05:36:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:49,503 INFO L93 Difference]: Finished difference Result 352 states and 491 transitions. [2024-11-14 05:36:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:36:49,503 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-14 05:36:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:49,505 INFO L225 Difference]: With dead ends: 352 [2024-11-14 05:36:49,505 INFO L226 Difference]: Without dead ends: 352 [2024-11-14 05:36:49,505 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-14 05:36:49,506 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 10 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:49,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1256 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:36:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-14 05:36:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 342. [2024-11-14 05:36:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 210 states have (on average 2.142857142857143) internal successors, (450), 327 states have internal predecessors, (450), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:36:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 480 transitions. [2024-11-14 05:36:49,519 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 480 transitions. Word has length 16 [2024-11-14 05:36:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:49,519 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 480 transitions. [2024-11-14 05:36:49,519 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-14 05:36:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 480 transitions. [2024-11-14 05:36:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 05:36:49,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:49,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:49,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 05:36:49,520 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-14 05:36:49,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:49,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1373847814, now seen corresponding path program 1 times [2024-11-14 05:36:49,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:49,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100766129] [2024-11-14 05:36:49,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:49,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:50,044 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-14 05:36:50,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:50,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100766129] [2024-11-14 05:36:50,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100766129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:50,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:50,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:36:50,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646552389] [2024-11-14 05:36:50,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:50,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:36:50,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:50,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:36:50,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:36:50,045 INFO L87 Difference]: Start difference. First operand 342 states and 480 transitions. Second operand has 8 states, 8 states have (on average 2.0) 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-14 05:36:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:50,872 INFO L93 Difference]: Finished difference Result 475 states and 529 transitions. [2024-11-14 05:36:50,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:36:50,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) 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-14 05:36:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:50,875 INFO L225 Difference]: With dead ends: 475 [2024-11-14 05:36:50,875 INFO L226 Difference]: Without dead ends: 475 [2024-11-14 05:36:50,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:36:50,876 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 221 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:50,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1059 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 05:36:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-14 05:36:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 344. [2024-11-14 05:36:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 212 states have (on average 2.1320754716981134) internal successors, (452), 329 states have internal predecessors, (452), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:36:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 482 transitions. [2024-11-14 05:36:50,889 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 482 transitions. Word has length 17 [2024-11-14 05:36:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:50,890 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 482 transitions. [2024-11-14 05:36:50,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) 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-14 05:36:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 482 transitions. [2024-11-14 05:36:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:36:50,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:50,891 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-14 05:36:50,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 05:36:50,891 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-14 05:36:50,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2128066969, now seen corresponding path program 1 times [2024-11-14 05:36:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:50,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882601340] [2024-11-14 05:36:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:52,082 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-14 05:36:52,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:52,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882601340] [2024-11-14 05:36:52,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882601340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:36:52,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679985265] [2024-11-14 05:36:52,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:52,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:36:52,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:36:52,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:36:52,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:36:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:52,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-14 05:36:52,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:36:52,314 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-14 05:36:52,537 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-14 05:36:52,619 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:36:52,619 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-14 05:36:52,635 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-14 05:36:52,732 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:36:52,732 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-14 05:36:52,851 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:36:52,861 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 05:36:52,861 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 28 [2024-11-14 05:36:53,005 INFO L349 Elim1Store]: treesize reduction 58, result has 34.8 percent of original size [2024-11-14 05:36:53,005 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-14 05:36:53,078 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-14 05:36:53,172 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-14 05:36:53,208 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-14 05:36:53,261 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-14 05:36:53,326 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-14 05:36:53,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:36:53,341 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-14 05:36:53,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:36:53,644 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-14 05:36:53,654 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 332 treesize of output 206 [2024-11-14 05:36:53,664 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-14 05:36:53,673 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-14 05:36:53,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679985265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:36:53,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [529087352] [2024-11-14 05:36:53,811 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-14 05:36:53,811 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:36:53,817 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:36:53,822 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:36:53,823 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:36:54,615 INFO L197 IcfgInterpreter]: Interpreting procedure append with input of size 210 for LOIs [2024-11-14 05:36:56,355 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:37:08,389 WARN L286 SmtUtils]: Spent 5.40s 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-14 05:37:18,030 WARN L286 SmtUtils]: Spent 8.53s 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-14 05:37:36,426 WARN L286 SmtUtils]: Spent 13.15s 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-14 05:37:53,855 WARN L286 SmtUtils]: Spent 13.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-14 05:38:27,470 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6646#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_121| (Array Int (Array Int Int))) (|v_#memory_int_122| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_122| append_~node~0.base (store (select |v_#memory_int_122| append_~node~0.base) 5 (select (select |#memory_int| append_~node~0.base) 5)))) (= |v_#memory_int_122| (store |v_#memory_int_121| append_~node~0.base (store (select |v_#memory_int_121| append_~node~0.base) 1 (select (select |v_#memory_int_122| append_~node~0.base) 1)))))) (= append_~node~0.offset 0) (<= 0 (+ 128 |append_#in~input|)) (= |append_#in~head.offset| 0) (exists ((|v_#memory_$Pointer$.offset_141| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_141| append_~node~0.base (store (store (select |v_#memory_$Pointer$.offset_141| append_~node~0.base) 1 (select (select |v_#memory_$Pointer$.offset_141| append_~head.base) 4)) 5 0)))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| append_~head.base) 4)) 1)) (exists ((|v_#memory_$Pointer$.base_149| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_149| append_~node~0.base (store (store (select |v_#memory_$Pointer$.base_149| append_~node~0.base) 1 (select (select |v_#memory_$Pointer$.base_149| append_~head.base) 4)) 5 0)) |#memory_$Pointer$.base|)) (= (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)) (= |append_#t~mem60.offset| (select (select |#memory_$Pointer$.offset| append_~head.base) 4)))' at error location [2024-11-14 05:38:27,471 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:38:27,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:38:27,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2024-11-14 05:38:27,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857629952] [2024-11-14 05:38:27,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:38:27,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:38:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:27,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:38:27,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2255, Unknown=13, NotChecked=96, Total=2550 [2024-11-14 05:38:27,474 INFO L87 Difference]: Start difference. First operand 344 states and 482 transitions. Second operand has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:31,187 INFO L93 Difference]: Finished difference Result 478 states and 531 transitions. [2024-11-14 05:38:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:38:31,187 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-14 05:38:31,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:31,190 INFO L225 Difference]: With dead ends: 478 [2024-11-14 05:38:31,190 INFO L226 Difference]: Without dead ends: 478 [2024-11-14 05:38:31,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 92.5s TimeCoverageRelationStatistics Valid=260, Invalid=2811, Unknown=13, NotChecked=108, Total=3192 [2024-11-14 05:38:31,192 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 755 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:31,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1065 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-14 05:38:31,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-14 05:38:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 349. [2024-11-14 05:38:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 217 states have (on average 2.1013824884792625) internal successors, (456), 334 states have internal predecessors, (456), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:38:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 486 transitions. [2024-11-14 05:38:31,211 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 486 transitions. Word has length 31 [2024-11-14 05:38:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:31,212 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 486 transitions. [2024-11-14 05:38:31,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 486 transitions. [2024-11-14 05:38:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:38:31,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:31,213 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-14 05:38:31,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:38:31,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:31,418 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-14 05:38:31,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2128066970, now seen corresponding path program 1 times [2024-11-14 05:38:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:31,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80090338] [2024-11-14 05:38:31,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:31,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:34,410 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-14 05:38:34,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:34,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80090338] [2024-11-14 05:38:34,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80090338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:34,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299272389] [2024-11-14 05:38:34,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:34,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:34,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:38:34,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:38:34,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:38:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:34,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-14 05:38:34,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:38:34,567 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-14 05:38:34,673 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-14 05:38:35,086 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-14 05:38:35,104 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-14 05:38:35,265 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:38:35,265 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-14 05:38:35,278 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-14 05:38:35,325 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:38:35,325 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-14 05:38:35,338 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-14 05:38:35,524 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:38:35,525 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-14 05:38:35,566 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:38:35,566 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-14 05:38:35,863 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:38:35,900 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 05:38:35,900 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 28 [2024-11-14 05:38:36,269 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-14 05:38:36,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2024-11-14 05:38:36,340 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-14 05:38:36,341 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-14 05:38:36,479 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-14 05:38:36,492 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-14 05:38:36,614 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-14 05:38:36,629 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-14 05:38:36,660 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-14 05:38:36,668 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-14 05:38:36,800 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-14 05:38:36,810 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-14 05:38:36,902 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-14 05:38:36,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:38:37,132 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-14 05:38:38,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:38:38,076 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-14 05:38:38,087 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 341 treesize of output 245 [2024-11-14 05:38:38,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:38:38,108 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-14 05:38:38,129 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 1064 treesize of output 1004 [2024-11-14 05:38:38,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:38:38,176 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 633 treesize of output 620 [2024-11-14 05:38:38,197 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 396 treesize of output 344 [2024-11-14 05:38:38,213 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 331 treesize of output 299 [2024-11-14 05:38:38,241 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 299 treesize of output 279 [2024-11-14 05:38:38,256 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-14 05:38:38,272 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-14 05:38:38,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299272389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:38,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [643900006] [2024-11-14 05:38:38,651 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-14 05:38:38,654 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:38:38,654 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:38:38,655 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:38:38,655 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:38:39,069 INFO L197 IcfgInterpreter]: Interpreting procedure append with input of size 214 for LOIs [2024-11-14 05:38:40,267 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:38:57,326 WARN L286 SmtUtils]: Spent 6.55s 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-14 05:39:11,872 WARN L286 SmtUtils]: Spent 10.67s 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-14 05:39:33,409 WARN L286 SmtUtils]: Spent 17.17s 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-14 05:39:55,647 WARN L286 SmtUtils]: Spent 17.16s 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-14 05:40:33,751 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7675#(and (<= 1 |#StackHeapBarrier|) (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|)) (exists ((|v_#memory_$Pointer$.base_182| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_182| append_~node~0.base (store (store (select |v_#memory_$Pointer$.base_182| append_~node~0.base) 1 (select (select |v_#memory_$Pointer$.base_182| append_~head.base) 4)) 5 0)) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_147| (Array Int (Array Int Int))) (|v_#memory_int_146| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_147| append_~node~0.base (store (select |v_#memory_int_147| append_~node~0.base) 5 (select (select |#memory_int| append_~node~0.base) 5)))) (= (store |v_#memory_int_146| append_~node~0.base (store (select |v_#memory_int_146| append_~node~0.base) 1 (select (select |v_#memory_int_147| append_~node~0.base) 1))) |v_#memory_int_147|))) (= |append_#in~head.offset| 0) (= (select |#valid| append_~head.base) 1) (exists ((|v_#memory_$Pointer$.offset_174| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_174| append_~node~0.base (store (store (select |v_#memory_$Pointer$.offset_174| append_~node~0.base) 1 (select (select |v_#memory_$Pointer$.offset_174| append_~head.base) 4)) 5 0)))) (= (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)))' at error location [2024-11-14 05:40:33,752 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:40:33,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:40:33,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 28 [2024-11-14 05:40:33,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126617309] [2024-11-14 05:40:33,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:40:33,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 05:40:33,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:33,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 05:40:33,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2982, Unknown=15, NotChecked=110, Total=3306 [2024-11-14 05:40:33,754 INFO L87 Difference]: Start difference. First operand 349 states and 486 transitions. Second operand has 29 states, 28 states have (on average 2.0) internal successors, (56), 25 states have internal predecessors, (56), 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-14 05:40:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:55,642 INFO L93 Difference]: Finished difference Result 738 states and 856 transitions. [2024-11-14 05:40:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 05:40:55,642 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0) internal successors, (56), 25 states have internal predecessors, (56), 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-14 05:40:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:55,647 INFO L225 Difference]: With dead ends: 738 [2024-11-14 05:40:55,647 INFO L226 Difference]: Without dead ends: 738 [2024-11-14 05:40:55,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 122.8s TimeCoverageRelationStatistics Valid=576, Invalid=6219, Unknown=15, NotChecked=162, Total=6972 [2024-11-14 05:40:55,650 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1044 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 4782 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 5071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 4782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:55,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1851 Invalid, 5071 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [289 Valid, 4782 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2024-11-14 05:40:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-14 05:40:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 348. [2024-11-14 05:40:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 217 states have (on average 2.096774193548387) internal successors, (455), 333 states have internal predecessors, (455), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:40:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 485 transitions. [2024-11-14 05:40:55,675 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 485 transitions. Word has length 31 [2024-11-14 05:40:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:55,675 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 485 transitions. [2024-11-14 05:40:55,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0) internal successors, (56), 25 states have internal predecessors, (56), 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-14 05:40:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 485 transitions. [2024-11-14 05:40:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-14 05:40:55,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:55,684 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 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-14 05:40:55,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:40:55,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:55,884 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-14 05:40:55,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:55,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1886935031, now seen corresponding path program 1 times [2024-11-14 05:40:55,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:55,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379281800] [2024-11-14 05:40:55,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:55,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 7 proven. 84 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2024-11-14 05:40:56,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:56,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379281800] [2024-11-14 05:40:56,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379281800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:40:56,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633618725] [2024-11-14 05:40:56,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:56,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:56,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:40:56,235 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:40:56,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:40:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:56,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 1822 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:40:56,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2024-11-14 05:40:56,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:40:56,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633618725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:56,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:40:56,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-14 05:40:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513654276] [2024-11-14 05:40:56,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:56,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:40:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:56,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:40:56,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:40:56,897 INFO L87 Difference]: Start difference. First operand 348 states and 485 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-14 05:40:57,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:57,236 INFO L93 Difference]: Finished difference Result 349 states and 486 transitions. [2024-11-14 05:40:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:40:57,237 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 186 [2024-11-14 05:40:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:57,239 INFO L225 Difference]: With dead ends: 349 [2024-11-14 05:40:57,240 INFO L226 Difference]: Without dead ends: 349 [2024-11-14 05:40:57,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 187 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-14 05:40:57,241 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:57,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 519 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:40:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-14 05:40:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-14 05:40:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 218 states have (on average 2.091743119266055) internal successors, (456), 334 states have internal predecessors, (456), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:40:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 486 transitions. [2024-11-14 05:40:57,253 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 486 transitions. Word has length 186 [2024-11-14 05:40:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:57,254 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 486 transitions. [2024-11-14 05:40:57,254 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-14 05:40:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 486 transitions. [2024-11-14 05:40:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-14 05:40:57,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:57,258 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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] [2024-11-14 05:40:57,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 05:40:57,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:57,463 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-14 05:40:57,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2070622510, now seen corresponding path program 1 times [2024-11-14 05:40:57,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:57,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894544175] [2024-11-14 05:40:57,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 12 proven. 409 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2024-11-14 05:41:02,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:02,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894544175] [2024-11-14 05:41:02,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894544175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:02,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218785997] [2024-11-14 05:41:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:02,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:02,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:02,303 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:02,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeeb21a-0967-4d72-88a8-9cfed548249e/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:41:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:03,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 05:41:03,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:03,824 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-14 05:41:04,056 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-14 05:41:04,056 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 25 treesize of output 23 [2024-11-14 05:41:04,361 INFO L349 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2024-11-14 05:41:04,362 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 35 treesize of output 31 [2024-11-14 05:41:07,328 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-14 05:41:07,551 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_1 (Array Int Int)) (append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= (select (select (store |c_old(#memory_$Pointer$.base)| append_~node~0.base v_DerPreprocessor_1) |c_append_#in~head.base|) (+ 4 |c_append_#in~head.offset|)) 0))) is different from true [2024-11-14 05:41:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 410 proven. 5 refuted. 0 times theorem prover too weak. 671 trivial. 6 not checked. [2024-11-14 05:41:07,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:07,984 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-14 05:41:08,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218785997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:08,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [485916957] [2024-11-14 05:41:08,162 INFO L159 IcfgInterpreter]: Started Sifa with 44 locations of interest [2024-11-14 05:41:08,162 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:41:08,163 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:41:08,163 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:41:08,163 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:41:37,340 INFO L197 IcfgInterpreter]: Interpreting procedure append with input of size 13 for LOIs [2024-11-14 05:41:37,472 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:42:18,170 WARN L286 SmtUtils]: Spent 6.12s 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-14 05:42:25,471 WARN L286 SmtUtils]: Spent 6.18s 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-14 05:42:37,298 WARN L286 SmtUtils]: Spent 6.27s 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-14 05:42:39,316 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (let ((.cse0 (exists ((v_append_~node~0.base_52 Int) (|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#valid_272| (Array Int Int)) (|v_#memory_$Pointer$.base_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_211| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int))) (|v_#memory_int_173| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_200| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_201| (Array Int (Array Int Int))) (|v_#memory_int_174| (Array Int (Array Int Int))) (|v_#length_243| (Array Int Int))) (let ((.cse41 (select |v_#memory_int_174| v_append_~node~0.base_52)) (.cse42 (select |v_#memory_$Pointer$.offset_201| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse43 (select |v_#memory_$Pointer$.base_212| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse40 (select |v_#memory_int_172| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_200| v_append_~node~0.base_52 (store (select |v_#memory_$Pointer$.offset_200| v_append_~node~0.base_52) 0 (select (select |v_#memory_$Pointer$.offset_201| v_append_~node~0.base_52) 0))) |v_#memory_$Pointer$.offset_201|) (= (store |v_#memory_int_172| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse40 4 (select (select |v_#memory_int_173| |c_ULTIMATE.start_main_~list~0#1.base|) 4))) |v_#memory_int_173|) (= |c_#length| (store |v_#length_243| v_append_~node~0.base_52 9)) (= |v_#memory_$Pointer$.base_212| (store |v_#memory_$Pointer$.base_211| v_append_~node~0.base_52 (store (select |v_#memory_$Pointer$.base_211| v_append_~node~0.base_52) 0 (select (select |v_#memory_$Pointer$.base_212| v_append_~node~0.base_52) 0)))) (= (store |v_#memory_int_173| v_append_~node~0.base_52 (store (select |v_#memory_int_173| v_append_~node~0.base_52) 1 (select .cse41 1))) |v_#memory_int_174|) (= 0 (select .cse42 4)) (= (select |v_#valid_272| v_append_~node~0.base_52) 0) (= (select .cse42 0) 0) (= (select .cse43 0) 0) (= (store |v_#memory_int_174| v_append_~node~0.base_52 (store .cse41 5 (select (select |c_#memory_int| v_append_~node~0.base_52) 5))) |c_#memory_int|) (= |c_#valid| (store |v_#valid_272| v_append_~node~0.base_52 1)) (= (let ((.cse44 (store |v_#memory_$Pointer$.offset_201| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse42 0 0) 4 0)))) (store .cse44 v_append_~node~0.base_52 (store (store (select .cse44 v_append_~node~0.base_52) 1 0) 5 0))) |c_#memory_$Pointer$.offset|) (= (select .cse43 4) 0) (= |c_#memory_$Pointer$.base| (let ((.cse45 (store |v_#memory_$Pointer$.base_212| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse43 0 v_append_~node~0.base_52) 4 v_append_~node~0.base_52)))) (store .cse45 v_append_~node~0.base_52 (store (store (select .cse45 v_append_~node~0.base_52) 1 0) 5 0)))) (<= (+ v_append_~node~0.base_52 1) |c_#StackHeapBarrier|) (= (select |c_#valid| v_append_~node~0.base_52) 1) (<= 9 (select |c_#length| v_append_~node~0.base_52)) (= (let ((.cse46 (store |v_#memory_int_170| v_append_~node~0.base_52 (store (select |v_#memory_int_170| v_append_~node~0.base_52) 0 60)))) (store .cse46 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse46 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse40 0)))) |v_#memory_int_172|) (not (= v_append_~node~0.base_52 0)))))) (.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse15 (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int))) (|v_#memory_int_169| (Array Int (Array Int Int))) (|v_#memory_int_168| (Array Int (Array Int Int)))) (let ((.cse39 (select |v_#memory_int_168| 1)) (.cse38 (select |v_#memory_int_169| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= |v_old(#memory_int)_AFTER_CALL_37| (store |v_#memory_int_169| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse38 4 (select (select |v_old(#memory_int)_AFTER_CALL_37| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (= (select .cse39 1) 0) (= 48 (select .cse39 0)) (= (store |v_#memory_int_168| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_168| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse38 0))) |v_#memory_int_169|))))) (.cse4 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse6 (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int))) (|v_#memory_int_169| (Array Int (Array Int Int))) (|v_#memory_int_168| (Array Int (Array Int Int)))) (let ((.cse37 (select |v_#memory_int_168| 1)) (.cse36 (select |v_#memory_int_169| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= |v_old(#memory_int)_AFTER_CALL_38| (store |v_#memory_int_169| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse36 4 (select (select |v_old(#memory_int)_AFTER_CALL_38| |c_ULTIMATE.start_main_~list~0#1.base|) 4)))) (= (select .cse37 1) 0) (= 48 (select .cse37 0)) (= (store |v_#memory_int_168| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_168| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse36 0))) |v_#memory_int_169|))))) (.cse7 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse8 (<= (+ |c_ULTIMATE.start_main_~list~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse9 (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)) (.cse11 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse13 (exists ((|v_#length_242| (Array Int Int))) (and (= (select |v_#length_242| 2) 22) (= 2 (select |v_#length_242| 1))))) (.cse23 (<= 8 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|)))) (or (and .cse0 .cse1 (exists ((|v_old(#length)_AFTER_CALL_39| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~userInput~1#1_18| Int) (|v_old(#valid)_AFTER_CALL_39| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (Array Int (Array Int Int)))) (and (<= 0 (+ 128 |v_ULTIMATE.start_main_~userInput~1#1_18|)) (<= |v_ULTIMATE.start_main_~userInput~1#1_18| 127) (let ((.cse2 (exists ((v_append_~node~0.base_52 Int) (|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#valid_272| (Array Int Int)) (|v_#memory_$Pointer$.base_212| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_211| (Array Int (Array Int Int))) (|v_#memory_int_173| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_200| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_201| (Array Int (Array Int Int))) (|v_#memory_int_174| (Array Int (Array Int Int))) (|v_#length_243| (Array Int Int))) (let ((.cse19 (select |v_#memory_$Pointer$.base_212| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse16 (select |v_#memory_int_172| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse20 (select |v_#memory_$Pointer$.offset_201| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse17 (select |v_#memory_int_174| v_append_~node~0.base_52))) (and (= (store |v_#memory_$Pointer$.offset_200| v_append_~node~0.base_52 (store (select |v_#memory_$Pointer$.offset_200| v_append_~node~0.base_52) 0 (select (select |v_#memory_$Pointer$.offset_201| v_append_~node~0.base_52) 0))) |v_#memory_$Pointer$.offset_201|) (= (store |v_#memory_int_172| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse16 4 (select (select |v_#memory_int_173| |c_ULTIMATE.start_main_~list~0#1.base|) 4))) |v_#memory_int_173|) (= |v_#memory_$Pointer$.base_212| (store |v_#memory_$Pointer$.base_211| v_append_~node~0.base_52 (store (select |v_#memory_$Pointer$.base_211| v_append_~node~0.base_52) 0 (select (select |v_#memory_$Pointer$.base_212| v_append_~node~0.base_52) 0)))) (= (store |v_#memory_int_173| v_append_~node~0.base_52 (store (select |v_#memory_int_173| v_append_~node~0.base_52) 1 (select .cse17 1))) |v_#memory_int_174|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (let ((.cse18 (store |v_#memory_$Pointer$.base_212| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse19 0 v_append_~node~0.base_52) 4 v_append_~node~0.base_52)))) (store .cse18 v_append_~node~0.base_52 (store (store (select .cse18 v_append_~node~0.base_52) 1 0) 5 0)))) (= 0 (select .cse20 4)) (= (select |v_#valid_272| v_append_~node~0.base_52) 0) (= (select .cse20 0) 0) (= (select .cse19 0) 0) (= (select .cse19 4) 0) (= (select |v_old(#valid)_AFTER_CALL_39| v_append_~node~0.base_52) 1) (<= (+ v_append_~node~0.base_52 1) |c_#StackHeapBarrier|) (= (store |v_#valid_272| v_append_~node~0.base_52 1) |v_old(#valid)_AFTER_CALL_39|) (= (let ((.cse21 (store |v_#memory_int_170| v_append_~node~0.base_52 (store (select |v_#memory_int_170| v_append_~node~0.base_52) 0 |v_ULTIMATE.start_main_~userInput~1#1_18|)))) (store .cse21 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse16 0)))) |v_#memory_int_172|) (not (= v_append_~node~0.base_52 0)) (= |v_old(#length)_AFTER_CALL_39| (store |v_#length_243| v_append_~node~0.base_52 9)) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| (let ((.cse22 (store |v_#memory_$Pointer$.offset_201| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse20 0 0) 4 0)))) (store .cse22 v_append_~node~0.base_52 (store (store (select .cse22 v_append_~node~0.base_52) 1 0) 5 0)))) (<= 9 (select |v_old(#length)_AFTER_CALL_39| v_append_~node~0.base_52)) (= |v_old(#memory_int)_AFTER_CALL_39| (store |v_#memory_int_174| v_append_~node~0.base_52 (store .cse17 5 (select (select |v_old(#memory_int)_AFTER_CALL_39| v_append_~node~0.base_52) 5)))))))) (.cse3 (= (select |v_old(#valid)_AFTER_CALL_39| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse5 (not (= 62 |v_ULTIMATE.start_main_~userInput~1#1_18|))) (.cse12 (<= 8 (select |v_old(#length)_AFTER_CALL_39| |c_ULTIMATE.start_main_~list~0#1.base|))) (.cse14 (not (= 60 |v_ULTIMATE.start_main_~userInput~1#1_18|)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse15 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) .cse23) (and .cse0 .cse1 (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_40| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_40| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_40| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_main_~userInput~1#1_18| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_main_~userInput~1#1_18|)) (<= |v_ULTIMATE.start_main_~userInput~1#1_18| 127) (let ((.cse24 (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse25 (<= 8 (select |v_old(#length)_AFTER_CALL_40| |c_ULTIMATE.start_main_~list~0#1.base|))) (.cse26 (not (= 62 |v_ULTIMATE.start_main_~userInput~1#1_18|))) (.cse27 (exists ((v_append_~node~0.base_52 Int) (|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#valid_272| (Array Int Int)) (|v_#memory_$Pointer$.base_212| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_211| (Array Int (Array Int Int))) (|v_#memory_int_173| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_200| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_201| (Array Int (Array Int Int))) (|v_#memory_int_174| (Array Int (Array Int Int))) (|v_#length_243| (Array Int Int))) (let ((.cse30 (select |v_#memory_int_174| v_append_~node~0.base_52)) (.cse31 (select |v_#memory_$Pointer$.offset_201| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse32 (select |v_#memory_$Pointer$.base_212| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse29 (select |v_#memory_int_172| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_200| v_append_~node~0.base_52 (store (select |v_#memory_$Pointer$.offset_200| v_append_~node~0.base_52) 0 (select (select |v_#memory_$Pointer$.offset_201| v_append_~node~0.base_52) 0))) |v_#memory_$Pointer$.offset_201|) (= (store |v_#memory_int_172| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse29 4 (select (select |v_#memory_int_173| |c_ULTIMATE.start_main_~list~0#1.base|) 4))) |v_#memory_int_173|) (= |v_#memory_$Pointer$.base_212| (store |v_#memory_$Pointer$.base_211| v_append_~node~0.base_52 (store (select |v_#memory_$Pointer$.base_211| v_append_~node~0.base_52) 0 (select (select |v_#memory_$Pointer$.base_212| v_append_~node~0.base_52) 0)))) (= (store |v_#memory_int_173| v_append_~node~0.base_52 (store (select |v_#memory_int_173| v_append_~node~0.base_52) 1 (select .cse30 1))) |v_#memory_int_174|) (= 0 (select .cse31 4)) (= (select |v_#valid_272| v_append_~node~0.base_52) 0) (= (store |v_#valid_272| v_append_~node~0.base_52 1) |v_old(#valid)_AFTER_CALL_40|) (= (select .cse31 0) 0) (= (select .cse32 0) 0) (<= 9 (select |v_old(#length)_AFTER_CALL_40| v_append_~node~0.base_52)) (= (select .cse32 4) 0) (= (select |v_old(#valid)_AFTER_CALL_40| v_append_~node~0.base_52) 1) (= |v_old(#memory_int)_AFTER_CALL_40| (store |v_#memory_int_174| v_append_~node~0.base_52 (store .cse30 5 (select (select |v_old(#memory_int)_AFTER_CALL_40| v_append_~node~0.base_52) 5)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_40| (let ((.cse33 (store |v_#memory_$Pointer$.offset_201| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse31 0 0) 4 0)))) (store .cse33 v_append_~node~0.base_52 (store (store (select .cse33 v_append_~node~0.base_52) 1 0) 5 0)))) (<= (+ v_append_~node~0.base_52 1) |c_#StackHeapBarrier|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| (let ((.cse34 (store |v_#memory_$Pointer$.base_212| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse32 0 v_append_~node~0.base_52) 4 v_append_~node~0.base_52)))) (store .cse34 v_append_~node~0.base_52 (store (store (select .cse34 v_append_~node~0.base_52) 1 0) 5 0)))) (= (let ((.cse35 (store |v_#memory_int_170| v_append_~node~0.base_52 (store (select |v_#memory_int_170| v_append_~node~0.base_52) 0 |v_ULTIMATE.start_main_~userInput~1#1_18|)))) (store .cse35 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse29 0)))) |v_#memory_int_172|) (not (= v_append_~node~0.base_52 0)) (= |v_old(#length)_AFTER_CALL_40| (store |v_#length_243| v_append_~node~0.base_52 9)))))) (.cse28 (not (= 60 |v_ULTIMATE.start_main_~userInput~1#1_18|)))) (or (and .cse24 .cse25 .cse15 .cse4 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse13 .cse28) (and .cse24 .cse25 .cse4 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse13 .cse28))))) .cse23)))) is different from false [2024-11-14 05:43:53,613 WARN L286 SmtUtils]: Spent 27.61s 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-14 05:45:39,222 WARN L286 SmtUtils]: Spent 24.88s 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-14 05:47:32,580 WARN L286 SmtUtils]: Spent 23.78s 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-14 05:49:35,000 WARN L286 SmtUtils]: Spent 21.56s on a formula simplification. DAG size of input: 272 DAG size of output: 268 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:50:29,913 WARN L286 SmtUtils]: Spent 24.31s on a formula simplification. DAG size of input: 280 DAG size of output: 276 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:51:46,637 WARN L286 SmtUtils]: Spent 21.55s on a formula simplification. DAG size of input: 274 DAG size of output: 270 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)