./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/length_test03-2.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_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/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_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/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_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/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 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:44:10,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:44:10,416 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:44:10,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:44:10,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:44:10,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:44:10,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:44:10,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:44:10,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:44:10,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:44:10,467 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:44:10,468 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:44:10,468 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:44:10,468 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:44:10,468 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:44:10,468 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:44:10,468 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:44:10,468 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:44:10,468 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:44:10,469 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:44:10,469 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:44:10,469 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:44:10,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:44:10,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:44:10,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:44:10,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:44:10,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:44:10,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:44:10,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:44:10,470 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:44:10,470 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:44:10,470 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:44:10,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:44:10,470 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:44:10,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:44:10,470 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:44:10,470 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:44:10,470 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:44:10,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:44:10,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:44:10,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:44:10,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:44:10,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:44:10,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:44:10,472 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:44:10,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:44:10,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:44:10,472 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:44:10,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:44:10,472 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_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/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 -> 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a [2024-11-14 03:44:10,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:44:10,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:44:10,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:44:10,829 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:44:10,829 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:44:10,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/memsafety-ext2/length_test03-2.i Unable to find full path for "g++" [2024-11-14 03:44:13,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:44:13,431 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:44:13,432 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-11-14 03:44:13,449 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/data/4ac0ab210/a6f71f3cb6724dc0b7b72743aec12295/FLAG831caa8f1 [2024-11-14 03:44:13,635 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/data/4ac0ab210/a6f71f3cb6724dc0b7b72743aec12295 [2024-11-14 03:44:13,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:44:13,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:44:13,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:44:13,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:44:13,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:44:13,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:44:13" (1/1) ... [2024-11-14 03:44:13,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ed66c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:13, skipping insertion in model container [2024-11-14 03:44:13,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:44:13" (1/1) ... [2024-11-14 03:44:13,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:44:14,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:44:14,113 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:44:14,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:44:14,190 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:44:14,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:14 WrapperNode [2024-11-14 03:44:14,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:44:14,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:44:14,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:44:14,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:44:14,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:14" (1/1) ... [2024-11-14 03:44:14,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:14" (1/1) ... [2024-11-14 03:44:14,240 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2024-11-14 03:44:14,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:44:14,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:44:14,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:44:14,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:44:14,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:14" (1/1) ... [2024-11-14 03:44:14,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:14" (1/1) ... [2024-11-14 03:44:14,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:14" (1/1) ... [2024-11-14 03:44:14,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:14" (1/1) ... [2024-11-14 03:44:14,263 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:14" (1/1) ... [2024-11-14 03:44:14,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:14" (1/1) ... [2024-11-14 03:44:14,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:14" (1/1) ... [2024-11-14 03:44:14,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:14" (1/1) ... [2024-11-14 03:44:14,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:44:14,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:44:14,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:44:14,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:44:14,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:14" (1/1) ... [2024-11-14 03:44:14,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:44:14,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:44:14,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:44:14,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:44:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:44:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:44:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:44:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:44:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:44:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:44:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:44:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:44:14,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:44:14,343 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-11-14 03:44:14,343 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-11-14 03:44:14,454 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:44:14,456 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:44:15,079 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-14 03:44:15,079 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:44:15,186 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:44:15,186 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-14 03:44:15,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:44:15 BoogieIcfgContainer [2024-11-14 03:44:15,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:44:15,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:44:15,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:44:15,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:44:15,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:44:13" (1/3) ... [2024-11-14 03:44:15,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c902b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:44:15, skipping insertion in model container [2024-11-14 03:44:15,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:44:14" (2/3) ... [2024-11-14 03:44:15,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c902b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:44:15, skipping insertion in model container [2024-11-14 03:44:15,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:44:15" (3/3) ... [2024-11-14 03:44:15,203 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2024-11-14 03:44:15,226 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:44:15,228 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG length_test03-2.i that has 2 procedures, 112 locations, 1 initial locations, 4 loop locations, and 59 error locations. [2024-11-14 03:44:15,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:44:15,328 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;@8800474, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:44:15,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-14 03:44:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 49 states have (on average 2.3469387755102042) internal successors, (115), 108 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:44:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 03:44:15,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:15,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 03:44:15,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-14 03:44:15,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:15,356 INFO L85 PathProgramCache]: Analyzing trace with hash 6762, now seen corresponding path program 1 times [2024-11-14 03:44:15,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:15,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180237357] [2024-11-14 03:44:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:15,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:15,664 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 03:44:15,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:15,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180237357] [2024-11-14 03:44:15,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180237357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:44:15,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:44:15,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:44:15,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781433639] [2024-11-14 03:44:15,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:44:15,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:44:15,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:15,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:44:15,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:44:15,719 INFO L87 Difference]: Start difference. First operand has 112 states, 49 states have (on average 2.3469387755102042) internal successors, (115), 108 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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 03:44:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:16,109 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2024-11-14 03:44:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:44:16,114 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 03:44:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:16,125 INFO L225 Difference]: With dead ends: 144 [2024-11-14 03:44:16,125 INFO L226 Difference]: Without dead ends: 143 [2024-11-14 03:44:16,129 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 03:44:16,135 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 42 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:16,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 129 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:44:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-14 03:44:16,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 109. [2024-11-14 03:44:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 49 states have (on average 2.2653061224489797) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:44:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2024-11-14 03:44:16,206 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 2 [2024-11-14 03:44:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:16,208 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2024-11-14 03:44:16,208 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 03:44:16,208 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2024-11-14 03:44:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 03:44:16,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:16,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 03:44:16,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:44:16,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-14 03:44:16,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:16,212 INFO L85 PathProgramCache]: Analyzing trace with hash 6763, now seen corresponding path program 1 times [2024-11-14 03:44:16,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:16,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737340256] [2024-11-14 03:44:16,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:16,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:16,378 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 03:44:16,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:16,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737340256] [2024-11-14 03:44:16,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737340256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:44:16,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:44:16,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:44:16,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334708110] [2024-11-14 03:44:16,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:44:16,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:44:16,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:16,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:44:16,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:44:16,383 INFO L87 Difference]: Start difference. First operand 109 states and 115 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 03:44:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:16,596 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2024-11-14 03:44:16,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:44:16,597 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 03:44:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:16,599 INFO L225 Difference]: With dead ends: 109 [2024-11-14 03:44:16,599 INFO L226 Difference]: Without dead ends: 109 [2024-11-14 03:44:16,599 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 03:44:16,600 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:16,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 146 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:44:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-14 03:44:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-11-14 03:44:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 103 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:44:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2024-11-14 03:44:16,619 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 2 [2024-11-14 03:44:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:16,619 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2024-11-14 03:44:16,619 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 03:44:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2024-11-14 03:44:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:44:16,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:16,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:44:16,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:44:16,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-14 03:44:16,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:16,621 INFO L85 PathProgramCache]: Analyzing trace with hash 6503067, now seen corresponding path program 1 times [2024-11-14 03:44:16,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:16,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694275113] [2024-11-14 03:44:16,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:16,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:16,762 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 03:44:16,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694275113] [2024-11-14 03:44:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694275113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:44:16,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:44:16,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:44:16,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573386449] [2024-11-14 03:44:16,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:44:16,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:44:16,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:16,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:44:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:44:16,764 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 03:44:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:16,933 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2024-11-14 03:44:16,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:44:16,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-14 03:44:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:16,935 INFO L225 Difference]: With dead ends: 121 [2024-11-14 03:44:16,936 INFO L226 Difference]: Without dead ends: 121 [2024-11-14 03:44:16,936 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 03:44:16,937 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 19 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:16,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 132 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:44:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-14 03:44:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2024-11-14 03:44:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 53 states have (on average 2.150943396226415) internal successors, (114), 105 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:44:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2024-11-14 03:44:16,948 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 4 [2024-11-14 03:44:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:16,948 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2024-11-14 03:44:16,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 03:44:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2024-11-14 03:44:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:44:16,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:16,949 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:44:16,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:44:16,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-14 03:44:16,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:16,950 INFO L85 PathProgramCache]: Analyzing trace with hash 6503068, now seen corresponding path program 1 times [2024-11-14 03:44:16,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:16,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097971728] [2024-11-14 03:44:16,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:16,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:17,112 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 03:44:17,113 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:17,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097971728] [2024-11-14 03:44:17,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097971728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:44:17,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:44:17,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:44:17,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275268888] [2024-11-14 03:44:17,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:44:17,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:44:17,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:17,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:44:17,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:44:17,117 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 03:44:17,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:17,330 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2024-11-14 03:44:17,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:44:17,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-14 03:44:17,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:17,332 INFO L225 Difference]: With dead ends: 109 [2024-11-14 03:44:17,332 INFO L226 Difference]: Without dead ends: 109 [2024-11-14 03:44:17,332 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 03:44:17,333 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:17,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:44:17,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-14 03:44:17,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-11-14 03:44:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 53 states have (on average 2.1132075471698113) internal successors, (112), 103 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:44:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2024-11-14 03:44:17,353 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 4 [2024-11-14 03:44:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:17,354 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2024-11-14 03:44:17,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 03:44:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2024-11-14 03:44:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:44:17,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:17,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:44:17,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:44:17,355 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-14 03:44:17,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash -809480257, now seen corresponding path program 1 times [2024-11-14 03:44:17,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:17,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261102297] [2024-11-14 03:44:17,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:17,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:17,531 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 03:44:17,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:17,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261102297] [2024-11-14 03:44:17,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261102297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:44:17,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:44:17,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:44:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622797259] [2024-11-14 03:44:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:44:17,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:44:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:17,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:44:17,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:44:17,534 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 03:44:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:17,708 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2024-11-14 03:44:17,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:44:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 03:44:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:17,712 INFO L225 Difference]: With dead ends: 102 [2024-11-14 03:44:17,712 INFO L226 Difference]: Without dead ends: 102 [2024-11-14 03:44:17,712 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 03:44:17,713 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 31 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:17,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 102 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:44:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-14 03:44:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-14 03:44:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 53 states have (on average 2.018867924528302) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:44:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2024-11-14 03:44:17,730 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 9 [2024-11-14 03:44:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:17,730 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2024-11-14 03:44:17,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 03:44:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2024-11-14 03:44:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:44:17,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:17,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:44:17,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:44:17,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-14 03:44:17,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:17,732 INFO L85 PathProgramCache]: Analyzing trace with hash -809480256, now seen corresponding path program 1 times [2024-11-14 03:44:17,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:17,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183536432] [2024-11-14 03:44:17,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:17,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:17,886 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 03:44:17,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183536432] [2024-11-14 03:44:17,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183536432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:44:17,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:44:17,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:44:17,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365409831] [2024-11-14 03:44:17,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:44:17,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:44:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:17,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:44:17,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:44:17,889 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 03:44:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:18,013 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2024-11-14 03:44:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:44:18,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 03:44:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:18,015 INFO L225 Difference]: With dead ends: 97 [2024-11-14 03:44:18,015 INFO L226 Difference]: Without dead ends: 97 [2024-11-14 03:44:18,016 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 03:44:18,016 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 31 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:18,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:44:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-14 03:44:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-14 03:44:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:44:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2024-11-14 03:44:18,035 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 9 [2024-11-14 03:44:18,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:18,035 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2024-11-14 03:44:18,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 03:44:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2024-11-14 03:44:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:44:18,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:18,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:44:18,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:44:18,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-14 03:44:18,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:18,037 INFO L85 PathProgramCache]: Analyzing trace with hash 675915903, now seen corresponding path program 1 times [2024-11-14 03:44:18,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:18,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910122015] [2024-11-14 03:44:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:18,497 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 03:44:18,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910122015] [2024-11-14 03:44:18,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910122015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:44:18,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:44:18,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:44:18,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328755340] [2024-11-14 03:44:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:44:18,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:44:18,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:18,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:44:18,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:44:18,499 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 03:44:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:19,023 INFO L93 Difference]: Finished difference Result 187 states and 208 transitions. [2024-11-14 03:44:19,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:44:19,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 10 [2024-11-14 03:44:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:19,025 INFO L225 Difference]: With dead ends: 187 [2024-11-14 03:44:19,026 INFO L226 Difference]: Without dead ends: 187 [2024-11-14 03:44:19,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:44:19,027 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 169 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:19,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 172 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:44:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-14 03:44:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 122. [2024-11-14 03:44:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 83 states have (on average 1.819277108433735) internal successors, (151), 117 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:44:19,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 155 transitions. [2024-11-14 03:44:19,050 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 155 transitions. Word has length 10 [2024-11-14 03:44:19,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:19,050 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 155 transitions. [2024-11-14 03:44:19,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 03:44:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 155 transitions. [2024-11-14 03:44:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:44:19,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:19,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:44:19,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:44:19,051 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-14 03:44:19,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:19,052 INFO L85 PathProgramCache]: Analyzing trace with hash 675915904, now seen corresponding path program 1 times [2024-11-14 03:44:19,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:19,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553908795] [2024-11-14 03:44:19,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:19,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:19,586 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 03:44:19,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553908795] [2024-11-14 03:44:19,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553908795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:44:19,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:44:19,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:44:19,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146336892] [2024-11-14 03:44:19,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:44:19,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:44:19,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:19,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:44:19,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:44:19,589 INFO L87 Difference]: Start difference. First operand 122 states and 155 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 03:44:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:19,889 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2024-11-14 03:44:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:44:19,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 10 [2024-11-14 03:44:19,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:19,892 INFO L225 Difference]: With dead ends: 140 [2024-11-14 03:44:19,892 INFO L226 Difference]: Without dead ends: 140 [2024-11-14 03:44:19,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:44:19,893 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 19 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:19,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 206 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:44:19,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-14 03:44:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2024-11-14 03:44:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 98 states have (on average 1.7346938775510203) internal successors, (170), 132 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:44:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 176 transitions. [2024-11-14 03:44:19,910 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 176 transitions. Word has length 10 [2024-11-14 03:44:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:19,911 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 176 transitions. [2024-11-14 03:44:19,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 03:44:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 176 transitions. [2024-11-14 03:44:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 03:44:19,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:19,912 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 03:44:19,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:44:19,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-14 03:44:19,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:19,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2049077105, now seen corresponding path program 1 times [2024-11-14 03:44:19,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:19,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301004020] [2024-11-14 03:44:19,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:19,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:20,862 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 03:44:20,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:20,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301004020] [2024-11-14 03:44:20,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301004020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:44:20,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:44:20,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:44:20,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187121492] [2024-11-14 03:44:20,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:44:20,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:44:20,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:20,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:44:20,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:44:20,869 INFO L87 Difference]: Start difference. First operand 138 states and 176 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:44:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:21,276 INFO L93 Difference]: Finished difference Result 171 states and 208 transitions. [2024-11-14 03:44:21,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:44:21,277 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 03:44:21,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:21,278 INFO L225 Difference]: With dead ends: 171 [2024-11-14 03:44:21,278 INFO L226 Difference]: Without dead ends: 171 [2024-11-14 03:44:21,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:44:21,280 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 52 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:21,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 301 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:44:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-14 03:44:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 138. [2024-11-14 03:44:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 98 states have (on average 1.7244897959183674) internal successors, (169), 132 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:44:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 175 transitions. [2024-11-14 03:44:21,293 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 175 transitions. Word has length 17 [2024-11-14 03:44:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:21,293 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 175 transitions. [2024-11-14 03:44:21,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:44:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2024-11-14 03:44:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:44:21,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:21,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:44:21,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 03:44:21,295 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-14 03:44:21,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:21,295 INFO L85 PathProgramCache]: Analyzing trace with hash 830201126, now seen corresponding path program 1 times [2024-11-14 03:44:21,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:21,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395461789] [2024-11-14 03:44:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:21,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:22,139 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 03:44:22,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:22,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395461789] [2024-11-14 03:44:22,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395461789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:44:22,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:44:22,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:44:22,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753847292] [2024-11-14 03:44:22,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:44:22,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:44:22,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:22,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:44:22,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:44:22,141 INFO L87 Difference]: Start difference. First operand 138 states and 175 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 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 03:44:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:22,448 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2024-11-14 03:44:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:44:22,449 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 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 18 [2024-11-14 03:44:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:22,451 INFO L225 Difference]: With dead ends: 132 [2024-11-14 03:44:22,451 INFO L226 Difference]: Without dead ends: 132 [2024-11-14 03:44:22,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:44:22,452 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 7 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:22,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 268 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:44:22,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-14 03:44:22,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-14 03:44:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 92 states have (on average 1.7391304347826086) internal successors, (160), 126 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:44:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2024-11-14 03:44:22,462 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 18 [2024-11-14 03:44:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:22,466 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2024-11-14 03:44:22,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 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 03:44:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2024-11-14 03:44:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:44:22,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:22,467 INFO L215 NwaCegarLoop]: trace histogram [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 03:44:22,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 03:44:22,468 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-14 03:44:22,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1089553779, now seen corresponding path program 1 times [2024-11-14 03:44:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:22,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294445841] [2024-11-14 03:44:22,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:22,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:22,577 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 03:44:22,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:22,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294445841] [2024-11-14 03:44:22,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294445841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:44:22,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:44:22,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:44:22,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961129307] [2024-11-14 03:44:22,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:44:22,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:44:22,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:22,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:44:22,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:44:22,580 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:44:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:22,636 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2024-11-14 03:44:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:44:22,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-14 03:44:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:22,637 INFO L225 Difference]: With dead ends: 128 [2024-11-14 03:44:22,638 INFO L226 Difference]: Without dead ends: 128 [2024-11-14 03:44:22,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 03:44:22,639 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:22,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 145 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:44:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-14 03:44:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2024-11-14 03:44:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.6623376623376624) internal successors, (128), 111 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:44:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2024-11-14 03:44:22,649 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 24 [2024-11-14 03:44:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:22,649 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2024-11-14 03:44:22,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:44:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2024-11-14 03:44:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:44:22,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:22,651 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:44:22,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:44:22,651 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-14 03:44:22,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash -864201242, now seen corresponding path program 1 times [2024-11-14 03:44:22,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:22,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808117821] [2024-11-14 03:44:22,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:22,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:44:23,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:23,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808117821] [2024-11-14 03:44:23,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808117821] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:44:23,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082444121] [2024-11-14 03:44:23,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:23,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:44:23,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:44:23,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:44:23,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:44:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:23,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 03:44:23,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:44:24,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:44:24,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:44:24,048 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:44:24,048 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 11 treesize of output 11 [2024-11-14 03:44:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:44:24,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:44:24,667 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 49 treesize of output 45 [2024-11-14 03:44:24,714 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-14 03:44:24,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2024-11-14 03:44:25,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:44:25,051 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 29 treesize of output 33 [2024-11-14 03:44:25,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:44:25,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 76 [2024-11-14 03:44:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:44:25,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082444121] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:44:25,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1037394752] [2024-11-14 03:44:25,456 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 03:44:25,457 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:44:25,462 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:44:25,468 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:44:25,468 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:44:28,228 INFO L197 IcfgInterpreter]: Interpreting procedure append with input of size 28 for LOIs [2024-11-14 03:44:28,395 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:44:53,973 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3071#(and (= 0 (select |old(#valid)| append_~node~0.base)) (<= 1 |#StackHeapBarrier|) (= (store |old(#memory_$Pointer$.base)| append_~node~0.base (store (select |old(#memory_$Pointer$.base)| append_~node~0.base) 0 (select (select |#memory_$Pointer$.base| append_~node~0.base) 0))) |#memory_$Pointer$.base|) (= |#memory_int| (store |old(#memory_int)| append_~node~0.base (store (select |old(#memory_int)| append_~node~0.base) 0 |append_#in~input|))) (not (= append_~node~0.base 0)) (= append_~node~0.offset 0) (<= 0 (+ 128 |append_#in~input|)) (<= (select |#length| |append_#in~head.base|) 3) (= (store |old(#length)| append_~node~0.base 9) |#length|) (= |append_#in~head.offset| 0) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| append_~node~0.base (store (select |old(#memory_$Pointer$.offset)| append_~node~0.base) 0 (select (select |#memory_$Pointer$.offset| append_~node~0.base) 0)))) (<= (+ append_~node~0.base 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| append_~node~0.base 1)) (<= |append_#in~input| 127))' at error location [2024-11-14 03:44:53,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:44:53,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:44:53,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-11-14 03:44:53,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340909119] [2024-11-14 03:44:53,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:44:53,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 03:44:53,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:53,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 03:44:53,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1551, Unknown=9, NotChecked=0, Total=1806 [2024-11-14 03:44:53,977 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 19 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:44:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:56,969 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2024-11-14 03:44:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:44:56,970 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 19 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-11-14 03:44:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:56,971 INFO L225 Difference]: With dead ends: 146 [2024-11-14 03:44:56,971 INFO L226 Difference]: Without dead ends: 146 [2024-11-14 03:44:56,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=358, Invalid=2083, Unknown=9, NotChecked=0, Total=2450 [2024-11-14 03:44:56,974 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 341 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:56,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 449 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-14 03:44:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-14 03:44:56,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2024-11-14 03:44:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 79 states have (on average 1.518987341772152) internal successors, (120), 109 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:44:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2024-11-14 03:44:56,980 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 26 [2024-11-14 03:44:56,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:56,980 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2024-11-14 03:44:56,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 19 states have internal predecessors, (63), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:44:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2024-11-14 03:44:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:44:56,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:56,981 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:44:57,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:44:57,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:44:57,182 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-14 03:44:57,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1690544109, now seen corresponding path program 1 times [2024-11-14 03:44:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:57,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792983230] [2024-11-14 03:44:57,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:57,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:44:57,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:57,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792983230] [2024-11-14 03:44:57,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792983230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:44:57,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126960364] [2024-11-14 03:44:57,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:57,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:44:57,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:44:57,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:44:57,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666b9e8b-cfb8-4620-bb42-d3748a63f9dd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:44:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:57,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 03:44:57,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:44:57,912 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 03:44:57,949 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1))) is different from true [2024-11-14 03:44:58,047 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 03:44:58,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 03:44:58,125 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 03:44:58,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 03:44:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-14 03:44:58,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:44:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:44:58,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126960364] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:44:58,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [833777808] [2024-11-14 03:44:58,567 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 03:44:58,567 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:44:58,567 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:44:58,567 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:44:58,567 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:45:00,134 INFO L197 IcfgInterpreter]: Interpreting procedure append with input of size 281 for LOIs [2024-11-14 03:45:06,794 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:45:47,136 WARN L286 SmtUtils]: Spent 36.43s on a formula simplification. DAG size of input: 326 DAG size of output: 245 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:46:27,683 WARN L286 SmtUtils]: Spent 22.65s on a formula simplification. DAG size of input: 281 DAG size of output: 273 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:46:56,335 WARN L286 SmtUtils]: Spent 23.35s on a formula simplification. DAG size of input: 304 DAG size of output: 296 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:47:48,400 WARN L286 SmtUtils]: Spent 45.57s on a formula simplification. DAG size of input: 325 DAG size of output: 313 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:49:03,606 WARN L286 SmtUtils]: Spent 1.05m on a formula simplification. DAG size of input: 343 DAG size of output: 331 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:50:15,160 WARN L286 SmtUtils]: Spent 1.03m on a formula simplification. DAG size of input: 335 DAG size of output: 322 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:51:42,124 WARN L286 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 347 DAG size of output: 334 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:53:01,408 WARN L286 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 339 DAG size of output: 326 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:56:12,182 WARN L286 SmtUtils]: Spent 2.80m on a formula simplification. DAG size of input: 352 DAG size of output: 339 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:56:14,196 WARN L851 $PredicateComparison]: unable to prove that (and (<= |c_append_#in~input| 127) (<= 0 (+ 128 |c_append_#in~input|)) (<= 1 |c_#StackHeapBarrier|) (exists ((|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#valid_130| (Array Int Int)) (|v_#memory_int_110| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_132| (Array Int (Array Int Int))) (|v_#length_110| (Array Int Int)) (|v_#memory_$Pointer$.base_132| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (let ((.cse39 (select |v_#memory_int_110| |c_append_#in~head.base|)) (.cse40 (select |v_#memory_$Pointer$.offset_132| |c_append_#in~head.base|)) (.cse37 (select |v_#memory_$Pointer$.base_132| |c_append_#in~head.base|))) (and (let ((.cse0 (= |v_#valid_130| |c_old(#valid)|)) (.cse1 (= |c_old(#length)| |v_#length_110|)) (.cse2 (= |v_#memory_$Pointer$.offset_131| |c_old(#memory_$Pointer$.offset)|)) (.cse3 (= |v_#memory_$Pointer$.base_131| |c_old(#memory_$Pointer$.base)|)) (.cse5 (= |c_old(#memory_int)| |v_#memory_int_108|)) (.cse4 (not (= |c_append_#in~head.base| 0))) (.cse6 (<= (+ |c_append_#in~head.base| 1) |c_#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((|v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11| Int) (|v_#memory_int_99| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_8| (Array Int Int)) (|v_#length_107| (Array Int Int)) (|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_122| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_122| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_#memory_int_102| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11|)) (.cse9 (store |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_8| |c_append_#in~head.base| 1)) (.cse8 (select |v_#memory_int_99| 1)) (.cse12 (select |v_#memory_int_100| |c_append_#in~head.base|))) (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11|) 0 (select .cse7 0))) |v_#memory_int_102|) (= (select |v_#length_107| 2) 18) (= |c_old(#length)| (store (store |v_#length_107| |c_append_#in~head.base| 8) |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11| 8)) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_8| 0) 0) (= (select .cse8 0) 48) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_8| |c_append_#in~head.base|) 0) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_8| 2) 1) (= (store |v_#memory_int_102| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11| (store .cse7 4 (select (select |c_old(#memory_int)| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11|) 4))) |c_old(#memory_int)|) (= |c_old(#valid)| (store .cse9 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11| 1)) (= (let ((.cse10 (store |v_#memory_$Pointer$.base_122| |c_append_#in~head.base| (store (store (select |v_#memory_$Pointer$.base_122| |c_append_#in~head.base|) 0 0) 4 0)))) (store .cse10 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11| (store (store (select .cse10 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11|) 0 0) 4 0))) |c_old(#memory_$Pointer$.base)|) (= (select .cse9 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11|) 0) (= (let ((.cse11 (store |v_#memory_$Pointer$.offset_122| |c_append_#in~head.base| (store (store (select |v_#memory_$Pointer$.offset_122| |c_append_#in~head.base|) 0 0) 4 0)))) (store .cse11 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11| (store (store (select .cse11 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11|) 0 0) 4 0))) |c_old(#memory_$Pointer$.offset)|) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_8| 1) 1) (<= 8 (select |c_old(#length)| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11|)) (<= (+ |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11|) 1) (not (= |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_11| 0)) (= (select .cse8 1) 0) (= 2 (select |v_#length_107| 1)) (= |v_#memory_int_101| (store |v_#memory_int_100| |c_append_#in~head.base| (store .cse12 4 (select (select |v_#memory_int_101| |c_append_#in~head.base|) 4)))) (= |v_#memory_int_100| (store |v_#memory_int_99| |c_append_#in~head.base| (store (select |v_#memory_int_99| |c_append_#in~head.base|) 0 (select .cse12 0)))))))) (and .cse0 .cse1 .cse2 .cse3 .cse5 (exists ((|v_ULTIMATE.start_main_~userInput~1#1_20| Int) (|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14| Int)) (and (<= |v_ULTIMATE.start_main_~userInput~1#1_20| 127) (<= 0 (+ 128 |v_ULTIMATE.start_main_~userInput~1#1_20|)) (let ((.cse13 (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| 1) 1)) (.cse14 (not (= |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14| 0))) (.cse15 (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| 2) 1)) (.cse16 (= 0 (select (store |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14| 1) |c_append_#in~head.base|))) (.cse17 (<= (+ |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14| 1) |c_#StackHeapBarrier|)) (.cse18 (= (select |c_old(#valid)| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|) 1)) (.cse19 (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| 0) 0)) (.cse23 (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#length_109| (Array Int Int)) (|v_#memory_int_106| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int))) (|v_#valid_129| (Array Int Int)) (|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int))) (v_append_~node~0.base_37 Int)) (let ((.cse30 (select |v_#memory_int_105| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|)) (.cse34 (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|)) (.cse35 (select |v_#memory_int_107| v_append_~node~0.base_37)) (.cse32 (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|))) (and (<= 9 (select |c_old(#length)| v_append_~node~0.base_37)) (= (store |v_#memory_int_105| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14| (store .cse30 4 (select (select |v_#memory_int_106| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|) 4))) |v_#memory_int_106|) (= (let ((.cse31 (store |v_#memory_int_103| v_append_~node~0.base_37 (store (select |v_#memory_int_103| v_append_~node~0.base_37) 0 |v_ULTIMATE.start_main_~userInput~1#1_20|)))) (store .cse31 |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14| (store (select .cse31 |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|) 0 (select .cse30 0)))) |v_#memory_int_105|) (= (store |v_#memory_$Pointer$.offset_126| v_append_~node~0.base_37 (store (select |v_#memory_$Pointer$.offset_126| v_append_~node~0.base_37) 0 (select (select |v_#memory_$Pointer$.offset_127| v_append_~node~0.base_37) 0))) |v_#memory_$Pointer$.offset_127|) (= (select .cse32 0) 0) (= (let ((.cse33 (store |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14| (store (store .cse34 0 v_append_~node~0.base_37) 4 v_append_~node~0.base_37)))) (store .cse33 v_append_~node~0.base_37 (store (store (select .cse33 v_append_~node~0.base_37) 1 0) 5 0))) |c_old(#memory_$Pointer$.base)|) (= (store |v_#memory_$Pointer$.base_126| v_append_~node~0.base_37 (store (select |v_#memory_$Pointer$.base_126| v_append_~node~0.base_37) 0 (select (select |v_#memory_$Pointer$.base_127| v_append_~node~0.base_37) 0))) |v_#memory_$Pointer$.base_127|) (= |c_old(#memory_int)| (store |v_#memory_int_107| v_append_~node~0.base_37 (store .cse35 5 (select (select |c_old(#memory_int)| v_append_~node~0.base_37) 5)))) (= (select .cse34 4) 0) (= (select .cse34 0) 0) (= |c_old(#length)| (store |v_#length_109| v_append_~node~0.base_37 9)) (= (select |c_old(#valid)| v_append_~node~0.base_37) 1) (not (= v_append_~node~0.base_37 0)) (= (store |v_#memory_int_106| v_append_~node~0.base_37 (store (select |v_#memory_int_106| v_append_~node~0.base_37) 1 (select .cse35 1))) |v_#memory_int_107|) (= (let ((.cse36 (store |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14| (store (store .cse32 0 0) 4 0)))) (store .cse36 v_append_~node~0.base_37 (store (store (select .cse36 v_append_~node~0.base_37) 1 0) 5 0))) |c_old(#memory_$Pointer$.offset)|) (<= (+ v_append_~node~0.base_37 1) |c_#StackHeapBarrier|) (= (store |v_#valid_129| v_append_~node~0.base_37 1) |c_old(#valid)|) (= (select |v_#valid_129| v_append_~node~0.base_37) 0) (= (select .cse32 4) 0))))) (.cse24 (exists ((|v_#length_107| (Array Int Int))) (and (= (select |v_#length_107| 2) 18) (= 2 (select |v_#length_107| 1))))) (.cse25 (<= 8 (select |c_old(#length)| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|))) (.cse26 (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|) 0))) (or (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse4 .cse18 .cse19 (exists ((|v_#memory_int_99| (Array Int (Array Int Int))) (|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_21| (Array Int (Array Int Int)))) (let ((.cse21 (select |v_#memory_int_102| |c_append_#in~head.base|)) (.cse20 (select |v_#memory_int_99| 1)) (.cse22 (select |v_#memory_int_100| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|))) (and (= (select .cse20 0) 48) (= (store |v_#memory_int_102| |c_append_#in~head.base| (store .cse21 4 (select (select |v_#memory_int_BEFORE_CALL_21| |c_append_#in~head.base|) 4))) |v_#memory_int_BEFORE_CALL_21|) (= |v_#memory_int_102| (store |v_#memory_int_101| |c_append_#in~head.base| (store (select |v_#memory_int_101| |c_append_#in~head.base|) 0 (select .cse21 0)))) (= |v_#memory_int_100| (store |v_#memory_int_99| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_int_99| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|) 0 (select .cse22 0)))) (= (select .cse20 1) 0) (= (store |v_#memory_int_100| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14| (store .cse22 4 (select (select |v_#memory_int_101| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|) 4))) |v_#memory_int_101|)))) .cse6 .cse23 .cse24 .cse25 .cse26) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse4 .cse18 .cse19 .cse6 .cse23 .cse24 (exists ((|v_#memory_int_99| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_19| (Array Int (Array Int Int))) (|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int)))) (let ((.cse27 (select |v_#memory_int_102| |c_append_#in~head.base|)) (.cse28 (select |v_#memory_int_99| 1)) (.cse29 (select |v_#memory_int_100| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|))) (and (= (store |v_#memory_int_102| |c_append_#in~head.base| (store .cse27 4 (select (select |v_#memory_int_BEFORE_CALL_19| |c_append_#in~head.base|) 4))) |v_#memory_int_BEFORE_CALL_19|) (= (select .cse28 0) 48) (= |v_#memory_int_102| (store |v_#memory_int_101| |c_append_#in~head.base| (store (select |v_#memory_int_101| |c_append_#in~head.base|) 0 (select .cse27 0)))) (= |v_#memory_int_100| (store |v_#memory_int_99| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_int_99| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|) 0 (select .cse29 0)))) (= (select .cse28 1) 0) (= (store |v_#memory_int_100| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14| (store .cse29 4 (select (select |v_#memory_int_101| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_14|) 4))) |v_#memory_int_101|)))) .cse25 .cse26)))))))) (= (select .cse37 0) 0) (= (let ((.cse38 (store |v_#memory_int_108| c_append_~node~0.base (store (select |v_#memory_int_108| c_append_~node~0.base) 0 |c_append_#in~input|)))) (store .cse38 |c_append_#in~head.base| (store (select .cse38 |c_append_#in~head.base|) 0 (select .cse39 0)))) |v_#memory_int_110|) (= (store |v_#memory_int_110| |c_append_#in~head.base| (store .cse39 4 (select (select |c_#memory_int| |c_append_#in~head.base|) 4))) |c_#memory_int|) (= (store |v_#memory_$Pointer$.offset_131| c_append_~node~0.base (store (select |v_#memory_$Pointer$.offset_131| c_append_~node~0.base) 0 (select (select |v_#memory_$Pointer$.offset_132| c_append_~node~0.base) 0))) |v_#memory_$Pointer$.offset_132|) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_132| |c_append_#in~head.base| (store (store .cse40 0 0) 4 0))) (= (select |v_#valid_130| c_append_~node~0.base) 0) (= (store |v_#memory_$Pointer$.base_132| |c_append_#in~head.base| (store (store .cse37 0 c_append_~node~0.base) 4 c_append_~node~0.base)) |c_#memory_$Pointer$.base|) (= (select .cse40 0) 0) (= |c_#valid| (store |v_#valid_130| c_append_~node~0.base 1)) (= (store |v_#length_110| c_append_~node~0.base 9) |c_#length|) (= (select .cse40 4) 0) (= (store |v_#memory_$Pointer$.base_131| c_append_~node~0.base (store (select |v_#memory_$Pointer$.base_131| c_append_~node~0.base) 0 (select (select |v_#memory_$Pointer$.base_132| c_append_~node~0.base) 0))) |v_#memory_$Pointer$.base_132|) (= (select .cse37 4) 0)))) (= (select |c_#valid| |c_append_#in~head.base|) 1) (<= 1 (select |c_#length| c_append_~node~0.base)) (<= (+ c_append_~node~0.base 1) |c_#StackHeapBarrier|) (= c_append_~node~0.offset 0) (= (select |c_#valid| c_append_~node~0.base) 1) (not (= c_append_~node~0.base 0)) (= |c_append_#in~head.offset| 0) (<= 8 (select |c_#length| |c_append_#in~head.base|))) is different from false