./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_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_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/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_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/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_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/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 f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:57:45,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:57:45,286 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:57:45,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:57:45,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:57:45,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:57:45,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:57:45,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:57:45,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:57:45,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:57:45,355 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:57:45,357 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:57:45,358 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:57:45,360 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:57:45,361 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:57:45,361 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:57:45,362 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:57:45,363 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:57:45,363 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:57:45,364 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:57:45,365 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:57:45,366 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:57:45,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:57:45,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:57:45,368 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:57:45,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:57:45,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:57:45,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:57:45,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:57:45,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:57:45,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:57:45,374 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:57:45,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:57:45,375 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:57:45,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:57:45,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:57:45,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:57:45,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:57:45,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:57:45,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:57:45,378 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:57:45,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:57:45,379 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:57:45,379 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:57:45,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:57:45,380 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_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/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_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2023-11-12 00:57:45,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:57:45,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:57:45,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:57:45,833 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:57:45,833 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:57:45,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-12 00:57:49,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:57:49,371 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:57:49,372 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-12 00:57:49,390 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/data/20692a036/cfa7bb04c7644255a36d6f392b57bc3b/FLAG7f0c76cea [2023-11-12 00:57:49,423 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/data/20692a036/cfa7bb04c7644255a36d6f392b57bc3b [2023-11-12 00:57:49,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:57:49,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:57:49,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:57:49,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:57:49,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:57:49,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:49" (1/1) ... [2023-11-12 00:57:49,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55814b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:49, skipping insertion in model container [2023-11-12 00:57:49,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:49" (1/1) ... [2023-11-12 00:57:49,490 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:57:49,932 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_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-11-12 00:57:49,944 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:57:49,959 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:57:50,013 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_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-11-12 00:57:50,014 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:57:50,059 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:57:50,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:50 WrapperNode [2023-11-12 00:57:50,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:57:50,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:57:50,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:57:50,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:57:50,071 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:57:50" (1/1) ... [2023-11-12 00:57:50,090 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:57:50" (1/1) ... [2023-11-12 00:57:50,123 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2023-11-12 00:57:50,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:57:50,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:57:50,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:57:50,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:57:50,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:50" (1/1) ... [2023-11-12 00:57:50,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:50" (1/1) ... [2023-11-12 00:57:50,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:50" (1/1) ... [2023-11-12 00:57:50,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:50" (1/1) ... [2023-11-12 00:57:50,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:50" (1/1) ... [2023-11-12 00:57:50,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:50" (1/1) ... [2023-11-12 00:57:50,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:50" (1/1) ... [2023-11-12 00:57:50,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:50" (1/1) ... [2023-11-12 00:57:50,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:57:50,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:57:50,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:57:50,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:57:50,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:50" (1/1) ... [2023-11-12 00:57:50,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:57:50,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:50,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/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:57:50,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/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:57:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:57:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:57:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:57:50,293 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:57:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:57:50,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:57:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:57:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:57:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:57:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:57:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:57:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:57:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:57:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:57:50,509 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:57:50,512 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:57:50,895 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:57:50,965 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:57:50,966 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 00:57:50,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:50 BoogieIcfgContainer [2023-11-12 00:57:50,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:57:50,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:57:50,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:57:50,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:57:50,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:57:49" (1/3) ... [2023-11-12 00:57:50,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21186064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:50, skipping insertion in model container [2023-11-12 00:57:50,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:50" (2/3) ... [2023-11-12 00:57:50,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21186064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:50, skipping insertion in model container [2023-11-12 00:57:50,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:50" (3/3) ... [2023-11-12 00:57:50,988 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-11-12 00:57:51,027 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:57:51,027 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 00:57:51,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:57:51,147 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;@a169ea1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:57:51,147 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 00:57:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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:57:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:57:51,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:51,163 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:51,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:57:51,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1985109648, now seen corresponding path program 1 times [2023-11-12 00:57:51,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:51,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362659635] [2023-11-12 00:57:51,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:51,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:57:51,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:51,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362659635] [2023-11-12 00:57:51,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362659635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:51,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:51,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:57:51,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393600405] [2023-11-12 00:57:51,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:51,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:57:51,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:51,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:57:51,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:57:51,824 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:57:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:51,877 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2023-11-12 00:57:51,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:57:51,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 17 [2023-11-12 00:57:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:51,894 INFO L225 Difference]: With dead ends: 53 [2023-11-12 00:57:51,894 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 00:57:51,897 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:57:51,901 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 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:57:51,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:57:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 00:57:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-12 00:57:51,947 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:57:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-12 00:57:51,950 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 17 [2023-11-12 00:57:51,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:51,953 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-12 00:57:51,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:57:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-12 00:57:51,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:57:51,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:51,957 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:51,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:57:51,958 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:57:51,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:51,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1124278203, now seen corresponding path program 1 times [2023-11-12 00:57:51,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:51,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630902252] [2023-11-12 00:57:51,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:51,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:57:53,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:53,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630902252] [2023-11-12 00:57:53,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630902252] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:53,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549650682] [2023-11-12 00:57:53,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:53,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:53,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:53,044 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:53,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:57:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:53,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-12 00:57:53,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:53,543 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:57:53,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:57:53,620 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:57:53,665 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:57:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:57:53,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:53,779 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_14| Int) (v_ArrVal_172 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_14| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_14| v_ArrVal_172) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0)))) is different from false [2023-11-12 00:57:53,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549650682] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:53,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1144158670] [2023-11-12 00:57:53,803 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:57:53,803 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:53,807 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:53,812 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:53,813 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:55,890 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:57:55,902 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:58:03,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1144158670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:58:03,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:58:03,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13, 13] total 34 [2023-11-12 00:58:03,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861437246] [2023-11-12 00:58:03,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:58:03,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 00:58:03,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:58:03,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 00:58:03,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1081, Unknown=8, NotChecked=66, Total=1260 [2023-11-12 00:58:03,860 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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:58:06,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-12 00:58:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:58:08,938 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-11-12 00:58:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 00:58:08,939 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 23 [2023-11-12 00:58:08,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:58:08,940 INFO L225 Difference]: With dead ends: 28 [2023-11-12 00:58:08,940 INFO L226 Difference]: Without dead ends: 26 [2023-11-12 00:58:08,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=105, Invalid=1081, Unknown=8, NotChecked=66, Total=1260 [2023-11-12 00:58:08,943 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:58:08,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 5 Unknown, 0 Unchecked, 5.0s Time] [2023-11-12 00:58:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-12 00:58:08,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-12 00:58:08,952 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:58:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-12 00:58:08,953 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 23 [2023-11-12 00:58:08,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:58:08,954 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-12 00:58:08,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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:58:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-11-12 00:58:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 00:58:08,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:58:08,956 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:58:08,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:58:09,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:58:09,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:58:09,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:58:09,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1898557292, now seen corresponding path program 1 times [2023-11-12 00:58:09,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:58:09,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707661359] [2023-11-12 00:58:09,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:58:09,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:58:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:58:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:58:09,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:58:09,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707661359] [2023-11-12 00:58:09,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707661359] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:58:09,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707049787] [2023-11-12 00:58:09,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:58:09,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:58:09,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:58:09,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:58:09,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:58:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:58:09,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-12 00:58:09,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:58:09,943 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:58:09,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:58:10,000 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:58:10,033 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:58:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:58:10,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:58:10,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707049787] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:58:10,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [951265432] [2023-11-12 00:58:10,201 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-12 00:58:10,201 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:58:10,201 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:58:10,202 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:58:10,202 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:58:11,883 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:58:11,895 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:58:24,771 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '449#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 1) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| Int) (|v_#memory_$Pointer$.base_76| (Array Int (Array Int Int))) (|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_int_15| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16| Int) (|v_ULTIMATE.start_sll_circular_prepend_#in~head#1.base_10| Int) (|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (and (or (and (= |v_ULTIMATE.start_sll_circular_prepend_#in~head#1.base_10| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) (= |v_ULTIMATE.start_sll_circular_prepend_#in~head#1.base_10| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_#memory_int_87| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_69| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= 0 (select (select (store |v_#memory_$Pointer$.offset_69| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_69| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select (select (store |v_#memory_$Pointer$.base_75| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_75| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |v_#memory_int_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_25| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))))) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 8))) (exists ((|v_#valid_40| (Array Int Int))) (and (= (store |v_#valid_40| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 1) |#valid|) (= (select |v_#valid_40| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0))) (exists ((|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (store (select |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 4))) |v_#memory_$Pointer$.base_76|)) (exists ((|v_#memory_$Pointer$.offset_66| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (store (select |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 4))) |v_#memory_$Pointer$.offset_70|)) (not (= |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 0)) (<= (+ |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= |v_#memory_int_88| (store |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 4 1))) (= |v_#memory_int_39| (store |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 (select (select |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0))))))) (and (= |v_ULTIMATE.start_sll_circular_prepend_#in~head#1.base_10| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) (= |v_ULTIMATE.start_sll_circular_prepend_#in~head#1.base_10| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 8))) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_#memory_int_87| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_69| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= 0 (select (select (store |v_#memory_$Pointer$.offset_69| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_69| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select (select (store |v_#memory_$Pointer$.base_75| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_75| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_26| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))))) (exists ((|v_#valid_40| (Array Int Int))) (and (= (store |v_#valid_40| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 1) |#valid|) (= (select |v_#valid_40| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0))) (exists ((|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (store (select |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 4))) |v_#memory_$Pointer$.base_76|)) (exists ((|v_#memory_$Pointer$.offset_66| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (store (select |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 4))) |v_#memory_$Pointer$.offset_70|)) (not (= |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 0)) (<= (+ |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= |v_#memory_int_88| (store |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 4 1))) (= |v_#memory_int_39| (store |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 (select (select |v_#memory_int_39| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0)))))))) (<= 2 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) (= (store |v_#memory_int_15| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select |v_#memory_int_15| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0))) |#memory_int|) (= |v_#memory_int_15| (store |v_#memory_int_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16| (store (select |v_#memory_int_88| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0 (select (select |v_#memory_int_15| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0)))) (= (store (store |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16| (store (select |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0 |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|)) |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select (store |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16| (store (select |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0 |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|)) |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|)) |#memory_$Pointer$.base|) (= (select (select |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0) 0) (= (select (select |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0) 0) (<= 2 |v_ULTIMATE.start_sll_circular_prepend_#in~head#1.base_10|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16| (store (select |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0 0)) |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15| (store (select (store |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16| (store (select |v_#memory_$Pointer$.offset_70| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_16|) 0 0)) |v_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base_15|) 0 0))))) (= (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:58:24,772 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:58:24,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:58:24,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-11-12 00:58:24,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572974228] [2023-11-12 00:58:24,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:58:24,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-12 00:58:24,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:58:24,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-12 00:58:24,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1286, Unknown=9, NotChecked=0, Total=1406 [2023-11-12 00:58:24,776 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:58:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:58:25,388 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-11-12 00:58:25,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 00:58:25,388 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2023-11-12 00:58:25,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:58:25,390 INFO L225 Difference]: With dead ends: 34 [2023-11-12 00:58:25,390 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 00:58:25,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=163, Invalid=1720, Unknown=9, NotChecked=0, Total=1892 [2023-11-12 00:58:25,392 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:58:25,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 148 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:58:25,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 00:58:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-12 00:58:25,400 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:58:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-11-12 00:58:25,401 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 25 [2023-11-12 00:58:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:58:25,401 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-11-12 00:58:25,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:58:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-11-12 00:58:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 00:58:25,403 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:58:25,403 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:58:25,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-12 00:58:25,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:58:25,604 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:58:25,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:58:25,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1118165248, now seen corresponding path program 1 times [2023-11-12 00:58:25,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:58:25,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905636727] [2023-11-12 00:58:25,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:58:25,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:58:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:58:27,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:58:27,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:58:27,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905636727] [2023-11-12 00:58:27,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905636727] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:58:27,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379390879] [2023-11-12 00:58:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:58:27,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:58:27,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:58:27,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:58:27,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334cfd76-65af-4ff3-9bd4-8a3282ddbfbf/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:58:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:58:27,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-12 00:58:27,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:58:27,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:58:27,544 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 00:58:27,545 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-12 00:58:27,621 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:58:27,728 INFO L322 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-12 00:58:27,728 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2023-11-12 00:58:27,812 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:58:27,812 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-11-12 00:58:27,819 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:58:27,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:58:27,907 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:58:27,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:58:27,925 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-12 00:58:27,926 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 38 [2023-11-12 00:58:27,945 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-12 00:58:27,946 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-12 00:58:28,091 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:58:28,158 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:58:28,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-11-12 00:58:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:58:28,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:58:28,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379390879] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:58:28,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1709181173] [2023-11-12 00:58:28,463 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-12 00:58:28,463 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:58:28,463 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:58:28,463 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:58:28,464 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:58:30,102 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:58:30,114 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:58:33,283 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse0 (exists ((|v_#length_34| (Array Int Int))) (and (= 2 (select |v_#length_34| 1)) (= (select |v_#length_34| 2) 22)))) (.cse1 (<= (+ |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 1) |c_#StackHeapBarrier|)) (.cse2 (exists ((|v_#valid_51| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_51| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 1)) (= (select |v_#valid_51| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0)))) (.cse3 (exists ((|v_#length_35| (Array Int Int))) (= |c_#length| (store |v_#length_35| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 8)))) (.cse4 (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 0))) (.cse5 (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_39| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|))) (and (= |c_#memory_int| (store |v_#memory_int_39| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store .cse12 4 1))) (= |v_#memory_int_39| (store |v_#memory_int_105| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (select |v_#memory_int_105| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 (select .cse12 0)))))))) (.cse6 (exists ((|v_#valid_50| (Array Int Int))) (and (= (select |v_#valid_50| 0) 0) (= (select |v_#valid_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) (= (select |v_#valid_50| 1) 1) (= (select |v_#valid_50| 2) 1)))) (.cse7 (exists ((|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_80| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (store (select |v_#memory_$Pointer$.offset_80| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4)))))) (.cse8 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse9 (exists ((|v_#memory_$Pointer$.base_88| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_88| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (store (select |v_#memory_$Pointer$.base_88| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4))) |c_#memory_$Pointer$.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_#memory_int_BEFORE_CALL_50| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_#memory_int_BEFORE_CALL_50| 1))) (and (= (select .cse10 1) 0) (= 48 (select .cse10 0)))))) (and .cse0 (exists ((|v_#memory_int_BEFORE_CALL_48| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_#memory_int_BEFORE_CALL_48| 1))) (and (= (select .cse11 0) 48) (= (select .cse11 1) 0)))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 2 |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~len#1| 2) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true