./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:07:57,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:07:57,325 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:07:57,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:07:57,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:07:57,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:07:57,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:07:57,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:07:57,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:07:57,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:07:57,374 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:07:57,375 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:07:57,375 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:07:57,377 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:07:57,378 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:07:57,378 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:07:57,378 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:07:57,379 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:07:57,379 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:07:57,380 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:07:57,380 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:07:57,381 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:07:57,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:07:57,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:07:57,383 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:07:57,383 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:07:57,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:07:57,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:07:57,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:07:57,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:07:57,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:07:57,386 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:07:57,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:07:57,387 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:07:57,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:07:57,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:07:57,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:07:57,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:07:57,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:07:57,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:07:57,389 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:07:57,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:07:57,389 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:07:57,389 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:07:57,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:07:57,390 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2023-11-12 00:07:57,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:07:57,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:07:57,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:07:57,730 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:07:57,731 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:07:57,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-11-12 00:08:00,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:08:01,118 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:08:01,119 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-11-12 00:08:01,139 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/data/cc24d3ad4/d0fa5ba20cb14e8fbfdcb717ef65aacc/FLAGdb12d7708 [2023-11-12 00:08:01,154 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/data/cc24d3ad4/d0fa5ba20cb14e8fbfdcb717ef65aacc [2023-11-12 00:08:01,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:08:01,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:08:01,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:08:01,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:08:01,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:08:01,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:08:01" (1/1) ... [2023-11-12 00:08:01,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599b3d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01, skipping insertion in model container [2023-11-12 00:08:01,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:08:01" (1/1) ... [2023-11-12 00:08:01,209 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:08:01,531 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2023-11-12 00:08:01,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:08:01,549 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:08:01,599 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2023-11-12 00:08:01,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:08:01,641 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:08:01,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01 WrapperNode [2023-11-12 00:08:01,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:08:01,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:08:01,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:08:01,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:08:01,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01" (1/1) ... [2023-11-12 00:08:01,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01" (1/1) ... [2023-11-12 00:08:01,700 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2023-11-12 00:08:01,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:08:01,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:08:01,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:08:01,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:08:01,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01" (1/1) ... [2023-11-12 00:08:01,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01" (1/1) ... [2023-11-12 00:08:01,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01" (1/1) ... [2023-11-12 00:08:01,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01" (1/1) ... [2023-11-12 00:08:01,725 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01" (1/1) ... [2023-11-12 00:08:01,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01" (1/1) ... [2023-11-12 00:08:01,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01" (1/1) ... [2023-11-12 00:08:01,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01" (1/1) ... [2023-11-12 00:08:01,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:08:01,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:08:01,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:08:01,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:08:01,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01" (1/1) ... [2023-11-12 00:08:01,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:08:01,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:08:01,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:08:01,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:08:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:08:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:08:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:08:01,847 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:08:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:08:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:08:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:08:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:08:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:08:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:08:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:08:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:08:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:08:01,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:08:01,978 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:08:01,980 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:08:02,188 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:08:02,239 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:08:02,240 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 00:08:02,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:08:02 BoogieIcfgContainer [2023-11-12 00:08:02,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:08:02,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:08:02,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:08:02,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:08:02,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:08:01" (1/3) ... [2023-11-12 00:08:02,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a62a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:08:02, skipping insertion in model container [2023-11-12 00:08:02,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:08:01" (2/3) ... [2023-11-12 00:08:02,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a62a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:08:02, skipping insertion in model container [2023-11-12 00:08:02,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:08:02" (3/3) ... [2023-11-12 00:08:02,261 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-11-12 00:08:02,281 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:08:02,281 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 00:08:02,329 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:08:02,338 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@541fec4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:08:02,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 00:08:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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) [2023-11-12 00:08:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:08:02,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:02,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:02,355 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:08:02,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:02,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1151333058, now seen corresponding path program 1 times [2023-11-12 00:08:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:02,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385796548] [2023-11-12 00:08:02,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:08:02,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:02,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385796548] [2023-11-12 00:08:02,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385796548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:02,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:08:02,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:08:02,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234561591] [2023-11-12 00:08:02,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:02,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:08:02,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:02,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:08:02,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:08:02,880 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-12 00:08:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:02,951 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2023-11-12 00:08:02,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:08:02,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2023-11-12 00:08:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:02,961 INFO L225 Difference]: With dead ends: 45 [2023-11-12 00:08:02,962 INFO L226 Difference]: Without dead ends: 22 [2023-11-12 00:08:02,965 INFO L412 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 [2023-11-12 00:08:02,970 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:02,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:08:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-12 00:08:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2023-11-12 00:08:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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) [2023-11-12 00:08:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-11-12 00:08:03,013 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2023-11-12 00:08:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:03,014 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-12 00:08:03,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-12 00:08:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-11-12 00:08:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:08:03,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:03,017 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:03,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:08:03,018 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:08:03,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:03,020 INFO L85 PathProgramCache]: Analyzing trace with hash 61820946, now seen corresponding path program 1 times [2023-11-12 00:08:03,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:03,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121842189] [2023-11-12 00:08:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:03,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:08:03,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:03,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121842189] [2023-11-12 00:08:03,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121842189] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:08:03,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981957282] [2023-11-12 00:08:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:03,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:08:03,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:08:03,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:08:03,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:08:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:03,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:08:03,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:08:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:08:03,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:08:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:08:03,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981957282] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:08:03,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2101725395] [2023-11-12 00:08:03,714 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-12 00:08:03,714 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:08:03,718 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:08:03,723 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:08:03,724 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:08:06,308 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-11-12 00:08:06,595 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:08:13,928 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '222#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_#in~head#1.base_9| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_13| Int)) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_sll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0 0))) (= (select (select |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 0) (= (select (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 0) (<= 2 |v_ULTIMATE.start_sll_append_#in~head#1.base_9|) (or (and (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_int_25| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_25| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_25| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0 1)) |v_#memory_int_54|) (= |v_#memory_int_25| (store |v_#memory_int_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 (select (select |v_#memory_int_25| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4)))))) (exists ((|v_#length_23| (Array Int Int))) (= (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.base_53|)) (exists ((|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_53|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_9| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_33| (Array Int Int))) (and (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0) (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#valid|))) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_9| |v_ULTIMATE.start_sll_append_~head#1.base_13|)) (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_17| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_17| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_int_25| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_25| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_25| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0 1)) |v_#memory_int_54|) (= |v_#memory_int_25| (store |v_#memory_int_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 (select (select |v_#memory_int_25| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4)))))) (exists ((|v_#length_23| (Array Int Int))) (= (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.base_53|)) (exists ((|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_53|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_9| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_33| (Array Int Int))) (and (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0) (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#valid|))) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_9| |v_ULTIMATE.start_sll_append_~head#1.base_13|))) (<= 2 |v_ULTIMATE.start_sll_append_~head#1.base_13|) (= |#memory_int| (store |v_#memory_int_54| |v_ULTIMATE.start_sll_append_~head#1.base_13| (store (select |v_#memory_int_54| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)))) (= (store |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_sll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0))) |#memory_$Pointer$.base|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:08:13,928 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:08:13,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:08:13,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-12 00:08:13,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129416338] [2023-11-12 00:08:13,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:08:13,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:08:13,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:13,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:08:13,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=262, Unknown=3, NotChecked=0, Total=306 [2023-11-12 00:08:13,938 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:08:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:13,998 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2023-11-12 00:08:13,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:08:14,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2023-11-12 00:08:14,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:14,002 INFO L225 Difference]: With dead ends: 38 [2023-11-12 00:08:14,002 INFO L226 Difference]: Without dead ends: 23 [2023-11-12 00:08:14,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=41, Invalid=262, Unknown=3, NotChecked=0, Total=306 [2023-11-12 00:08:14,005 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:14,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:08:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-12 00:08:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-12 00:08:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:08:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-12 00:08:14,022 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2023-11-12 00:08:14,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:14,022 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-12 00:08:14,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:08:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-12 00:08:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:08:14,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:14,029 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:14,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:08:14,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-12 00:08:14,234 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:08:14,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1095883802, now seen corresponding path program 2 times [2023-11-12 00:08:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:14,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018263900] [2023-11-12 00:08:14,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:14,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:08:14,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:14,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018263900] [2023-11-12 00:08:14,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018263900] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:08:14,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277598652] [2023-11-12 00:08:14,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:08:14,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:08:14,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:08:14,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:08:14,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:08:14,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-12 00:08:14,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:08:14,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-12 00:08:15,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:08:15,176 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:08:15,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:15,347 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-12 00:08:15,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:08:15,368 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-12 00:08:15,418 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-12 00:08:15,423 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 00:08:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:08:15,487 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:08:15,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277598652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:15,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:08:15,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2023-11-12 00:08:15,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232860026] [2023-11-12 00:08:15,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:15,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:08:15,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:15,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:08:15,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2023-11-12 00:08:15,492 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:08:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:15,949 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-11-12 00:08:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 00:08:15,950 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-11-12 00:08:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:15,951 INFO L225 Difference]: With dead ends: 36 [2023-11-12 00:08:15,951 INFO L226 Difference]: Without dead ends: 34 [2023-11-12 00:08:15,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2023-11-12 00:08:15,953 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:15,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 64 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:08:15,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-12 00:08:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2023-11-12 00:08:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:08:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-11-12 00:08:15,966 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 24 [2023-11-12 00:08:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:15,967 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-11-12 00:08:15,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:08:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-11-12 00:08:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:08:15,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:15,968 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:15,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:08:16,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-12 00:08:16,169 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:08:16,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1095827816, now seen corresponding path program 1 times [2023-11-12 00:08:16,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:16,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009919988] [2023-11-12 00:08:16,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:16,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:08:16,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:16,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009919988] [2023-11-12 00:08:16,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009919988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:08:16,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:08:16,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 00:08:16,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080554699] [2023-11-12 00:08:16,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:08:16,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 00:08:16,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:16,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 00:08:16,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:08:16,501 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:08:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:16,620 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-11-12 00:08:16,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:08:16,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-11-12 00:08:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:16,626 INFO L225 Difference]: With dead ends: 34 [2023-11-12 00:08:16,626 INFO L226 Difference]: Without dead ends: 31 [2023-11-12 00:08:16,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-12 00:08:16,631 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:16,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 90 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:08:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-12 00:08:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2023-11-12 00:08:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:08:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-12 00:08:16,647 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 24 [2023-11-12 00:08:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:16,648 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-12 00:08:16,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:08:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-11-12 00:08:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 00:08:16,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:16,649 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:16,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:08:16,650 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:08:16,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:16,650 INFO L85 PathProgramCache]: Analyzing trace with hash -877311743, now seen corresponding path program 1 times [2023-11-12 00:08:16,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:16,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405636349] [2023-11-12 00:08:16,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:16,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:08:17,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:17,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405636349] [2023-11-12 00:08:17,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405636349] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:08:17,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800474734] [2023-11-12 00:08:17,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:17,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:08:17,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:08:17,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:08:17,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:08:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:17,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-12 00:08:17,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:08:17,440 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-12 00:08:17,457 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-12 00:08:17,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:17,473 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-12 00:08:17,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-12 00:08:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2023-11-12 00:08:17,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:08:17,584 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_ArrVal_386 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_17| v_ArrVal_386) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_17| 1)))) is different from false [2023-11-12 00:08:17,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800474734] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:08:17,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1728877348] [2023-11-12 00:08:17,590 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-12 00:08:17,590 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:08:17,591 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:08:17,591 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:08:17,591 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:08:19,123 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-11-12 00:08:19,375 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:08:25,329 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '726#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:08:25,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:08:25,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:08:25,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-11-12 00:08:25,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144915373] [2023-11-12 00:08:25,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:08:25,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-12 00:08:25,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:25,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-12 00:08:25,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=958, Unknown=4, NotChecked=126, Total=1190 [2023-11-12 00:08:25,334 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:08:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:25,774 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2023-11-12 00:08:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:08:25,774 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 26 [2023-11-12 00:08:25,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:25,775 INFO L225 Difference]: With dead ends: 31 [2023-11-12 00:08:25,775 INFO L226 Difference]: Without dead ends: 23 [2023-11-12 00:08:25,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=144, Invalid=1265, Unknown=5, NotChecked=146, Total=1560 [2023-11-12 00:08:25,777 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:25,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 119 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2023-11-12 00:08:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-12 00:08:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-12 00:08:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:08:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-11-12 00:08:25,784 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 26 [2023-11-12 00:08:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:25,784 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-11-12 00:08:25,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:08:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-11-12 00:08:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:08:25,785 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:25,786 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:25,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:08:25,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:08:25,993 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:08:25,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 384410914, now seen corresponding path program 1 times [2023-11-12 00:08:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:25,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488641183] [2023-11-12 00:08:25,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:25,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:08:27,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:08:27,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488641183] [2023-11-12 00:08:27,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488641183] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:08:27,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144750428] [2023-11-12 00:08:27,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:27,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:08:27,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:08:27,654 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:08:27,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:08:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:08:27,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-12 00:08:27,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:08:28,005 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:08:28,079 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:08:28,235 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 00:08:28,429 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-12 00:08:28,435 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 00:08:28,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:08:28,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 00:08:28,485 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |node_create_~temp~0#1.base| (select |c_#memory_int| |node_create_~temp~0#1.base|)) |c_#memory_int|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 00:08:28,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:28,513 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-12 00:08:28,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:28,522 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2023-11-12 00:08:28,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:28,535 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:08:28,554 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-12 00:08:28,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-12 00:08:28,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:28,945 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-12 00:08:28,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:28,958 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:08:28,958 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 27 [2023-11-12 00:08:28,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:08:28,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-12 00:08:29,037 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-11-12 00:08:29,044 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 00:08:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-11-12 00:08:29,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:08:30,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144750428] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:08:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2054082996] [2023-11-12 00:08:30,052 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-12 00:08:30,053 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:08:30,053 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:08:30,053 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:08:30,053 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:08:31,788 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-11-12 00:08:32,011 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:08:51,746 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '967#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_~head#1.base_17| Int) (|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_#in~head#1.base_13| Int) (|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_107| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0) (store (select |v_#memory_int_107| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))))) (= (store |v_#memory_$Pointer$.base_83| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0) (store (select |v_#memory_$Pointer$.base_83| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))))) |#memory_$Pointer$.base|) (or (and (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_25| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_25| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (select |v_#memory_int_25| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0 1)) |v_#memory_int_107|) (= |v_#memory_int_25| (store |v_#memory_int_103| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (select |v_#memory_int_103| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4 (select (select |v_#memory_int_25| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4)))))) (exists ((|v_#memory_$Pointer$.offset_76| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_76| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (store (select |v_#memory_$Pointer$.offset_76| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_80| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0))) |v_#memory_$Pointer$.offset_80|)) (exists ((|v_#length_37| (Array Int Int))) (= |#length| (store |v_#length_37| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 8))) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_13| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (store (select |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4 0) 0 (select (select |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0))) |v_#memory_$Pointer$.base_83|)) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_13| |v_ULTIMATE.start_sll_append_~head#1.base_17|) (exists ((|v_#valid_50| (Array Int Int))) (and (= (select |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0) (= (store |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 1) |#valid|))) (exists ((|v_#memory_int_106| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_34| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_34| (store |v_#memory_int_106| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_106| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_34| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_82| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_34| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= (store |v_#memory_$Pointer$.base_82| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_82| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_34|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 0))) (and (exists ((|v_#memory_$Pointer$.base_82| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_35| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| (store |v_#memory_$Pointer$.base_82| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_82| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_25| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_25| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (select |v_#memory_int_25| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0 1)) |v_#memory_int_107|) (= |v_#memory_int_25| (store |v_#memory_int_103| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (select |v_#memory_int_103| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4 (select (select |v_#memory_int_25| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4)))))) (exists ((|v_#memory_$Pointer$.offset_76| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_76| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (store (select |v_#memory_$Pointer$.offset_76| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_80| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0))) |v_#memory_$Pointer$.offset_80|)) (exists ((|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_35| (store |v_#memory_int_106| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_106| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_35| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#length_37| (Array Int Int))) (= |#length| (store |v_#length_37| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 8))) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_13| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (store (store (select |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 4 0) 0 (select (select |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0))) |v_#memory_$Pointer$.base_83|)) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_13| |v_ULTIMATE.start_sll_append_~head#1.base_17|) (exists ((|v_#valid_50| (Array Int Int))) (and (= (select |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)))) 0) (= (store |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_80| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0) (store (select |v_#memory_$Pointer$.offset_80| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) 0))) (= (select (select |v_#memory_$Pointer$.base_83| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 0) (= (select (select |v_#memory_$Pointer$.offset_80| (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) 0) (<= 2 |v_ULTIMATE.start_sll_append_#in~head#1.base_13|) (or (not (= 0 (select (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0))) (not (= (select (select |v_#memory_$Pointer$.base_83| |v_ULTIMATE.start_sll_append_~head#1.base_17|) 0) 0))) (<= 2 |v_ULTIMATE.start_sll_append_~head#1.base_17|))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:08:51,746 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:08:51,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:08:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 30 [2023-11-12 00:08:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304722585] [2023-11-12 00:08:51,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:08:51,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-12 00:08:51,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:08:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-12 00:08:51,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2357, Unknown=25, NotChecked=98, Total=2652 [2023-11-12 00:08:51,750 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 30 states, 24 states have (on average 1.5) internal successors, (36), 27 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:08:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:08:53,386 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2023-11-12 00:08:53,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 00:08:53,387 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 1.5) internal successors, (36), 27 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2023-11-12 00:08:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:08:53,388 INFO L225 Difference]: With dead ends: 37 [2023-11-12 00:08:53,388 INFO L226 Difference]: Without dead ends: 34 [2023-11-12 00:08:53,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=259, Invalid=3256, Unknown=29, NotChecked=116, Total=3660 [2023-11-12 00:08:53,391 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 28 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:08:53,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 97 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 422 Invalid, 0 Unknown, 38 Unchecked, 0.5s Time] [2023-11-12 00:08:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-12 00:08:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-11-12 00:08:53,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:08:53,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-12 00:08:53,400 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 27 [2023-11-12 00:08:53,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:08:53,400 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-12 00:08:53,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 1.5) internal successors, (36), 27 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:08:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-11-12 00:08:53,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 00:08:53,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:08:53,401 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:08:53,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:08:53,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_204cb149-50e2-4941-9f67-97cbb27c315c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 00:08:53,606 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:08:53,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:08:53,606 INFO L85 PathProgramCache]: Analyzing trace with hash 51735357, now seen corresponding path program 1 times [2023-11-12 00:08:53,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:08:53,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319519277] [2023-11-12 00:08:53,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:08:53,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:08:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat