./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/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_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:12:40,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:12:40,199 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:12:40,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:12:40,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:12:40,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:12:40,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:12:40,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:12:40,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:12:40,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:12:40,271 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:12:40,273 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:12:40,273 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:12:40,276 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:12:40,276 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:12:40,277 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:12:40,277 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:12:40,278 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:12:40,279 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:12:40,279 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:12:40,280 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:12:40,281 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:12:40,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:12:40,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:12:40,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:12:40,284 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:12:40,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:12:40,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:12:40,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:12:40,301 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:12:40,303 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:12:40,303 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:12:40,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:12:40,304 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:12:40,304 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:12:40,305 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:12:40,305 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:12:40,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:12:40,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:12:40,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:12:40,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:12:40,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:12:40,308 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:12:40,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:12:40,309 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:12:40,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:12:40,309 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_c9a0e355-7d33-4adb-9043-fa9900e15c5f/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_c9a0e355-7d33-4adb-9043-fa9900e15c5f/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2023-11-12 00:12:40,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:12:40,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:12:40,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:12:40,727 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:12:40,729 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:12:40,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-12 00:12:44,203 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:12:44,492 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:12:44,493 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-12 00:12:44,513 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/data/69397ee3e/fb5c48e20fd84607baaa9436cb595ac2/FLAGacfd13729 [2023-11-12 00:12:44,540 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/data/69397ee3e/fb5c48e20fd84607baaa9436cb595ac2 [2023-11-12 00:12:44,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:12:44,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:12:44,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:12:44,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:12:44,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:12:44,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:12:44" (1/1) ... [2023-11-12 00:12:44,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39767ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:44, skipping insertion in model container [2023-11-12 00:12:44,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:12:44" (1/1) ... [2023-11-12 00:12:44,626 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:12:44,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:12:44,951 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:12:45,011 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:12:45,065 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:12:45,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:45 WrapperNode [2023-11-12 00:12:45,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:12:45,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:12:45,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:12:45,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:12:45,077 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:12:45" (1/1) ... [2023-11-12 00:12:45,094 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:12:45" (1/1) ... [2023-11-12 00:12:45,125 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2023-11-12 00:12:45,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:12:45,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:12:45,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:12:45,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:12:45,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:45" (1/1) ... [2023-11-12 00:12:45,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:45" (1/1) ... [2023-11-12 00:12:45,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:45" (1/1) ... [2023-11-12 00:12:45,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:45" (1/1) ... [2023-11-12 00:12:45,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:45" (1/1) ... [2023-11-12 00:12:45,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:45" (1/1) ... [2023-11-12 00:12:45,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:45" (1/1) ... [2023-11-12 00:12:45,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:45" (1/1) ... [2023-11-12 00:12:45,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:12:45,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:12:45,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:12:45,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:12:45,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:45" (1/1) ... [2023-11-12 00:12:45,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:12:45,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:12:45,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/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:12:45,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/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:12:45,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:12:45,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:12:45,279 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:12:45,279 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:12:45,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:12:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:12:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:12:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:12:45,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:12:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:12:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:12:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:12:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:12:45,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:12:45,437 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:12:45,439 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:12:45,899 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:12:45,963 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:12:45,963 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 00:12:45,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:12:45 BoogieIcfgContainer [2023-11-12 00:12:45,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:12:45,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:12:45,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:12:45,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:12:45,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:12:44" (1/3) ... [2023-11-12 00:12:45,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fe8f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:12:45, skipping insertion in model container [2023-11-12 00:12:45,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:12:45" (2/3) ... [2023-11-12 00:12:45,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fe8f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:12:45, skipping insertion in model container [2023-11-12 00:12:45,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:12:45" (3/3) ... [2023-11-12 00:12:45,976 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-11-12 00:12:45,996 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:12:45,996 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2023-11-12 00:12:46,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:12:46,053 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@5c3ab7a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:12:46,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-11-12 00:12:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 50 states have (on average 2.28) internal successors, (114), 102 states have internal predecessors, (114), 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:12:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:12:46,066 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:46,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:12:46,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:12:46,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:46,073 INFO L85 PathProgramCache]: Analyzing trace with hash 229570628, now seen corresponding path program 1 times [2023-11-12 00:12:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877175576] [2023-11-12 00:12:46,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:46,409 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:12:46,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:46,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877175576] [2023-11-12 00:12:46,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877175576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:12:46,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:12:46,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:12:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136797982] [2023-11-12 00:12:46,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:12:46,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:12:46,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:12:46,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:12:46,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:12:46,475 INFO L87 Difference]: Start difference. First operand has 107 states, 50 states have (on average 2.28) internal successors, (114), 102 states have internal predecessors, (114), 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, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:12:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:12:46,696 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2023-11-12 00:12:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:12:46,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-12 00:12:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:12:46,711 INFO L225 Difference]: With dead ends: 104 [2023-11-12 00:12:46,711 INFO L226 Difference]: Without dead ends: 102 [2023-11-12 00:12:46,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:12:46,723 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:12:46,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 144 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:12:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-12 00:12:46,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-12 00:12:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 97 states have internal predecessors, (104), 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:12:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2023-11-12 00:12:46,786 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 5 [2023-11-12 00:12:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:12:46,786 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2023-11-12 00:12:46,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:12:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2023-11-12 00:12:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:12:46,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:46,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:12:46,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:12:46,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:12:46,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:46,790 INFO L85 PathProgramCache]: Analyzing trace with hash 229570629, now seen corresponding path program 1 times [2023-11-12 00:12:46,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:46,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887423808] [2023-11-12 00:12:46,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:46,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:46,964 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:12:46,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:46,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887423808] [2023-11-12 00:12:46,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887423808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:12:46,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:12:46,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:12:46,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167327557] [2023-11-12 00:12:46,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:12:46,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:12:46,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:12:46,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:12:46,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:12:46,968 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:12:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:12:47,106 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-12 00:12:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:12:47,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-12 00:12:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:12:47,109 INFO L225 Difference]: With dead ends: 100 [2023-11-12 00:12:47,109 INFO L226 Difference]: Without dead ends: 100 [2023-11-12 00:12:47,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:12:47,118 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:12:47,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 149 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:12:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-12 00:12:47,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-12 00:12:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 2.125) internal successors, (102), 95 states have internal predecessors, (102), 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:12:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-11-12 00:12:47,138 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 5 [2023-11-12 00:12:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:12:47,139 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-11-12 00:12:47,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:12:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-11-12 00:12:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:12:47,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:47,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:12:47,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:12:47,141 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:12:47,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash -15830491, now seen corresponding path program 1 times [2023-11-12 00:12:47,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:47,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202912977] [2023-11-12 00:12:47,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:47,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:47,269 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:12:47,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:47,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202912977] [2023-11-12 00:12:47,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202912977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:12:47,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:12:47,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:12:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100235341] [2023-11-12 00:12:47,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:12:47,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:12:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:12:47,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:12:47,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:12:47,273 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:12:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:12:47,314 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2023-11-12 00:12:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:12:47,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2023-11-12 00:12:47,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:12:47,317 INFO L225 Difference]: With dead ends: 106 [2023-11-12 00:12:47,317 INFO L226 Difference]: Without dead ends: 106 [2023-11-12 00:12:47,317 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:12:47,319 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:12:47,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 182 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:12:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-12 00:12:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2023-11-12 00:12:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 96 states have internal predecessors, (103), 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:12:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2023-11-12 00:12:47,330 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 10 [2023-11-12 00:12:47,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:12:47,330 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2023-11-12 00:12:47,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:12:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2023-11-12 00:12:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:12:47,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:47,331 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:12:47,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:12:47,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:12:47,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2103939155, now seen corresponding path program 1 times [2023-11-12 00:12:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:47,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857622573] [2023-11-12 00:12:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:47,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:12:47,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:47,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857622573] [2023-11-12 00:12:47,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857622573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:12:47,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:12:47,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:12:47,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735180370] [2023-11-12 00:12:47,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:12:47,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:12:47,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:12:47,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:12:47,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:12:47,571 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:12:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:12:47,831 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-12 00:12:47,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:12:47,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-12 00:12:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:12:47,836 INFO L225 Difference]: With dead ends: 100 [2023-11-12 00:12:47,836 INFO L226 Difference]: Without dead ends: 100 [2023-11-12 00:12:47,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:12:47,846 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:12:47,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 288 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:12:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-12 00:12:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-12 00:12:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 95 states have internal predecessors, (102), 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:12:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-11-12 00:12:47,856 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 17 [2023-11-12 00:12:47,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:12:47,860 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-11-12 00:12:47,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:12:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-11-12 00:12:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:12:47,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:47,864 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:12:47,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:12:47,865 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:12:47,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2103939154, now seen corresponding path program 1 times [2023-11-12 00:12:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:47,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598954577] [2023-11-12 00:12:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:12:48,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:48,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598954577] [2023-11-12 00:12:48,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598954577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:12:48,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:12:48,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:12:48,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81977412] [2023-11-12 00:12:48,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:12:48,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:12:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:12:48,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:12:48,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:12:48,186 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:12:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:12:48,422 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2023-11-12 00:12:48,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:12:48,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-12 00:12:48,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:12:48,426 INFO L225 Difference]: With dead ends: 99 [2023-11-12 00:12:48,426 INFO L226 Difference]: Without dead ends: 99 [2023-11-12 00:12:48,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:12:48,428 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:12:48,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 343 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:12:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-12 00:12:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-12 00:12:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 49 states have (on average 2.061224489795918) internal successors, (101), 94 states have internal predecessors, (101), 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:12:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2023-11-12 00:12:48,438 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 17 [2023-11-12 00:12:48,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:12:48,438 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2023-11-12 00:12:48,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:12:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2023-11-12 00:12:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:12:48,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:48,440 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:12:48,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:12:48,440 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:12:48,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:48,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1044266575, now seen corresponding path program 1 times [2023-11-12 00:12:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:48,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997480781] [2023-11-12 00:12:48,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:48,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:12:48,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997480781] [2023-11-12 00:12:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997480781] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:12:48,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676008830] [2023-11-12 00:12:48,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:48,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:12:48,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:12:48,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:12:48,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:12:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:48,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-12 00:12:48,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:12:48,955 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:12:49,033 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:12:49,034 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-12 00:12:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:12:49,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:12:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:12:49,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676008830] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:12:49,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [296441908] [2023-11-12 00:12:49,400 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:12:49,401 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:12:49,405 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:12:49,410 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:12:49,411 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:12:50,995 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-12 00:12:51,134 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:12:53,834 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1272#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-11-12 00:12:53,835 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:12:53,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:12:53,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2023-11-12 00:12:53,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744094812] [2023-11-12 00:12:53,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:12:53,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-12 00:12:53,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:12:53,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-12 00:12:53,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=748, Unknown=1, NotChecked=0, Total=870 [2023-11-12 00:12:53,838 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 00:12:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:12:54,519 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-11-12 00:12:54,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:12:54,520 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-11-12 00:12:54,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:12:54,522 INFO L225 Difference]: With dead ends: 98 [2023-11-12 00:12:54,522 INFO L226 Difference]: Without dead ends: 98 [2023-11-12 00:12:54,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=133, Invalid=796, Unknown=1, NotChecked=0, Total=930 [2023-11-12 00:12:54,524 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 3 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:12:54,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 688 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 00:12:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-12 00:12:54,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-12 00:12:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 93 states have internal predecessors, (100), 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:12:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-11-12 00:12:54,539 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 19 [2023-11-12 00:12:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:12:54,540 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-11-12 00:12:54,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 00:12:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-11-12 00:12:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:12:54,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:12:54,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:12:54,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:12:54,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:12:54,757 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:12:54,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:12:54,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1044266576, now seen corresponding path program 1 times [2023-11-12 00:12:54,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:12:54,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758413695] [2023-11-12 00:12:54,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:54,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:12:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:12:55,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:55,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758413695] [2023-11-12 00:12:55,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758413695] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:12:55,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154564086] [2023-11-12 00:12:55,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:55,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:12:55,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:12:55,189 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:12:55,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:12:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:55,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-12 00:12:55,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:12:55,373 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:12:55,380 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 8 treesize of output 1 [2023-11-12 00:12:55,549 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 00:12:55,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:12:55,581 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:12:55,593 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:12:55,594 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-12 00:12:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-12 00:12:55,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:12:55,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154564086] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:12:55,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1157394806] [2023-11-12 00:12:55,801 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:12:55,801 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:12:55,802 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:12:55,802 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:12:55,802 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:12:56,976 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-12 00:12:57,152 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:13:00,968 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1569#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-11-12 00:13:00,968 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:13:00,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:13:00,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-12 00:13:00,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865985860] [2023-11-12 00:13:00,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:13:00,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 00:13:00,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:00,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 00:13:00,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=720, Unknown=2, NotChecked=54, Total=870 [2023-11-12 00:13:00,971 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:13:01,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:01,590 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2023-11-12 00:13:01,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:13:01,591 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-11-12 00:13:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:01,593 INFO L225 Difference]: With dead ends: 98 [2023-11-12 00:13:01,594 INFO L226 Difference]: Without dead ends: 98 [2023-11-12 00:13:01,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=125, Invalid=933, Unknown=2, NotChecked=62, Total=1122 [2023-11-12 00:13:01,595 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 3 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:01,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 574 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 642 Invalid, 0 Unknown, 103 Unchecked, 0.5s Time] [2023-11-12 00:13:01,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-12 00:13:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2023-11-12 00:13:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 49 states have (on average 2.020408163265306) internal successors, (99), 92 states have internal predecessors, (99), 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:13:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-11-12 00:13:01,602 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 19 [2023-11-12 00:13:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:01,603 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-11-12 00:13:01,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:13:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-11-12 00:13:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:13:01,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:01,605 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:01,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:13:01,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:01,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:13:01,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:01,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2020805723, now seen corresponding path program 1 times [2023-11-12 00:13:01,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:01,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734137052] [2023-11-12 00:13:01,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:01,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:13:02,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:02,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734137052] [2023-11-12 00:13:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734137052] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:02,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186704965] [2023-11-12 00:13:02,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:02,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:02,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:13:02,575 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:13:02,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:13:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:02,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-12 00:13:02,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:13:02,753 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:13:02,762 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:13:02,772 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_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-12 00:13:02,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:02,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:13:02,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:13:02,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:02,873 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:13:02,891 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-12 00:13:02,912 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:13:02,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-12 00:13:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2023-11-12 00:13:02,943 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:13:03,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186704965] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:03,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [300328713] [2023-11-12 00:13:03,212 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:13:03,213 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:13:03,214 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:13:03,214 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:13:03,215 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:13:04,496 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:13:04,521 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:13:07,606 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1918#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 1) (not (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (or (and (exists ((|v_#valid_147| (Array Int Int))) (and (= (select |v_#valid_147| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_147| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|))) (exists ((|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_101| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1))) (= (store |v_#memory_int_100| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_100| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_101|))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_125| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_125| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_125| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#length_BEFORE_CALL_59| (Array Int Int)) (|v_#memory_$Pointer$.offset_129| (Array Int (Array Int Int))) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_33| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_129| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_129| |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)) (= (select (select (store |v_#memory_$Pointer$.offset_129| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_129| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_33| (store |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))) (<= 4 (select |v_#length_BEFORE_CALL_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|)) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_120| (Array Int Int))) (= |#length| (store |v_#length_120| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8))) (exists ((|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_125| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_125| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (= 1 (select |#valid| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (exists ((|v_#valid_147| (Array Int Int))) (and (= (select |v_#valid_147| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_147| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|))) (exists ((|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_101| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1))) (= (store |v_#memory_int_100| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_100| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_101|))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_125| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_125| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_125| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_#memory_$Pointer$.offset_129| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int) (|v_old(#memory_int)_AFTER_CALL_32| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_129| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_129| |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)) (= (select (select (store |v_#memory_$Pointer$.offset_129| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_129| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_#length_BEFORE_CALL_57| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|)) (= (select |v_old(#valid)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1) (= |v_old(#memory_int)_AFTER_CALL_32| (store |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_120| (Array Int Int))) (= |#length| (store |v_#length_120| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8))) (exists ((|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_125| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_125| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (= 1 (select |#valid| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)))) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:13:07,606 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:13:07,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:13:07,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 13 [2023-11-12 00:13:07,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359635699] [2023-11-12 00:13:07,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:13:07,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-12 00:13:07,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:07,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 00:13:07,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=777, Unknown=6, NotChecked=114, Total=992 [2023-11-12 00:13:07,611 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 15 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 00:13:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:08,340 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2023-11-12 00:13:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:13:08,341 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 27 [2023-11-12 00:13:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:08,342 INFO L225 Difference]: With dead ends: 105 [2023-11-12 00:13:08,342 INFO L226 Difference]: Without dead ends: 105 [2023-11-12 00:13:08,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=111, Invalid=882, Unknown=7, NotChecked=122, Total=1122 [2023-11-12 00:13:08,344 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 113 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:08,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 281 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 468 Invalid, 0 Unknown, 218 Unchecked, 0.6s Time] [2023-11-12 00:13:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-12 00:13:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2023-11-12 00:13:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.836734693877551) internal successors, (90), 83 states have internal predecessors, (90), 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:13:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-11-12 00:13:08,353 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 27 [2023-11-12 00:13:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:08,354 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-11-12 00:13:08,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 00:13:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-11-12 00:13:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:13:08,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:08,356 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:08,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:13:08,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:08,564 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:13:08,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2020805724, now seen corresponding path program 1 times [2023-11-12 00:13:08,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:08,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758308377] [2023-11-12 00:13:08,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:13:09,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:09,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758308377] [2023-11-12 00:13:09,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758308377] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:09,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891881463] [2023-11-12 00:13:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:09,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:09,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:13:09,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:13:09,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:13:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:09,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-12 00:13:09,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:13:09,404 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 8 treesize of output 1 [2023-11-12 00:13:09,419 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:13:09,429 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|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-12 00:13:09,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:09,458 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:13:09,495 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:13:09,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:09,531 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:13:09,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:13:09,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:09,625 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:13:09,634 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 00:13:09,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:13:09,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891881463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:09,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:13:09,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-11-12 00:13:09,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637034733] [2023-11-12 00:13:09,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:09,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:13:09,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:09,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:13:09,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2023-11-12 00:13:09,637 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:13:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:09,848 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2023-11-12 00:13:09,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:13:09,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-12 00:13:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:09,850 INFO L225 Difference]: With dead ends: 82 [2023-11-12 00:13:09,850 INFO L226 Difference]: Without dead ends: 82 [2023-11-12 00:13:09,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2023-11-12 00:13:09,851 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:09,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 180 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 111 Unchecked, 0.2s Time] [2023-11-12 00:13:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-12 00:13:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-12 00:13:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 77 states have internal predecessors, (84), 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:13:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2023-11-12 00:13:09,858 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 27 [2023-11-12 00:13:09,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:09,859 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2023-11-12 00:13:09,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:13:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2023-11-12 00:13:09,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:13:09,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:09,861 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:09,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:13:10,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:10,073 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:13:10,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:10,074 INFO L85 PathProgramCache]: Analyzing trace with hash -733288146, now seen corresponding path program 1 times [2023-11-12 00:13:10,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:10,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179975910] [2023-11-12 00:13:10,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:10,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 00:13:10,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:10,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179975910] [2023-11-12 00:13:10,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179975910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:10,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:10,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:13:10,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99551049] [2023-11-12 00:13:10,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:10,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:13:10,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:10,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:13:10,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:13:10,249 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:13:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:10,447 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2023-11-12 00:13:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:13:10,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-11-12 00:13:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:10,449 INFO L225 Difference]: With dead ends: 80 [2023-11-12 00:13:10,449 INFO L226 Difference]: Without dead ends: 80 [2023-11-12 00:13:10,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:13:10,450 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:10,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 212 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:13:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-12 00:13:10,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-12 00:13:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 75 states have internal predecessors, (82), 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:13:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-11-12 00:13:10,457 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 30 [2023-11-12 00:13:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:10,457 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-11-12 00:13:10,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:13:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-11-12 00:13:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:13:10,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:10,459 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:10,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 00:13:10,460 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:13:10,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:10,461 INFO L85 PathProgramCache]: Analyzing trace with hash -733288145, now seen corresponding path program 1 times [2023-11-12 00:13:10,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:10,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494994017] [2023-11-12 00:13:10,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:10,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-12 00:13:10,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:10,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494994017] [2023-11-12 00:13:10,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494994017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:10,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:10,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:13:10,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574324066] [2023-11-12 00:13:10,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:10,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:13:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:10,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:13:10,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:13:10,720 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:13:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:10,915 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-11-12 00:13:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:13:10,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-11-12 00:13:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:10,917 INFO L225 Difference]: With dead ends: 78 [2023-11-12 00:13:10,917 INFO L226 Difference]: Without dead ends: 78 [2023-11-12 00:13:10,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:13:10,918 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:10,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 224 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:13:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-12 00:13:10,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-12 00:13:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 73 states have internal predecessors, (80), 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:13:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2023-11-12 00:13:10,923 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 30 [2023-11-12 00:13:10,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:10,924 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2023-11-12 00:13:10,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:13:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2023-11-12 00:13:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:13:10,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:10,926 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:10,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 00:13:10,927 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:13:10,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash -733274989, now seen corresponding path program 1 times [2023-11-12 00:13:10,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:10,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666737485] [2023-11-12 00:13:10,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:10,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:13:11,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:11,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666737485] [2023-11-12 00:13:11,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666737485] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:11,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510739512] [2023-11-12 00:13:11,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:11,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:11,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:13:11,541 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:13:11,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:13:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:11,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-12 00:13:11,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:13:11,911 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 9 treesize of output 5 [2023-11-12 00:13:11,992 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|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-11-12 00:13:12,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:12,009 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 18 treesize of output 13 [2023-11-12 00:13:12,027 INFO L322 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-12 00:13:12,027 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-11-12 00:13:12,139 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 17 treesize of output 9 [2023-11-12 00:13:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:13:12,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:13:12,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510739512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:12,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:13:12,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2023-11-12 00:13:12,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103606611] [2023-11-12 00:13:12,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:12,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:13:12,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:12,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:13:12,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2023-11-12 00:13:12,172 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 11 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:13:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:12,738 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-11-12 00:13:12,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:13:12,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-11-12 00:13:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:12,739 INFO L225 Difference]: With dead ends: 81 [2023-11-12 00:13:12,740 INFO L226 Difference]: Without dead ends: 81 [2023-11-12 00:13:12,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=465, Unknown=1, NotChecked=44, Total=600 [2023-11-12 00:13:12,741 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 108 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:12,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 219 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 344 Invalid, 0 Unknown, 89 Unchecked, 0.4s Time] [2023-11-12 00:13:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-12 00:13:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2023-11-12 00:13:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 72 states have internal predecessors, (80), 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:13:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-11-12 00:13:12,747 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 30 [2023-11-12 00:13:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:12,747 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-11-12 00:13:12,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:13:12,748 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-11-12 00:13:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:13:12,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:12,749 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:12,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:13:12,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-12 00:13:12,957 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:13:12,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:12,957 INFO L85 PathProgramCache]: Analyzing trace with hash -733274988, now seen corresponding path program 1 times [2023-11-12 00:13:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:12,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724010050] [2023-11-12 00:13:12,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:12,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:13:14,180 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:14,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724010050] [2023-11-12 00:13:14,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724010050] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347040308] [2023-11-12 00:13:14,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:14,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:14,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:13:14,183 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:13:14,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:13:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:14,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-12 00:13:14,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:13:14,769 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 25 treesize of output 17 [2023-11-12 00:13:14,780 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 19 treesize of output 11 [2023-11-12 00:13:15,000 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|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |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|))) (= |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:13:15,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:15,021 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 33 treesize of output 26 [2023-11-12 00:13:15,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:15,034 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-12 00:13:15,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:15,042 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 31 treesize of output 24 [2023-11-12 00:13:15,053 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-12 00:13:15,053 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-12 00:13:15,137 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 23 treesize of output 15 [2023-11-12 00:13:15,141 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 26 treesize of output 14 [2023-11-12 00:13:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2023-11-12 00:13:15,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:13:15,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347040308] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:15,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [756229496] [2023-11-12 00:13:15,536 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-12 00:13:15,536 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:13:15,536 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:13:15,537 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:13:15,537 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:13:17,215 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:13:17,240 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:13:22,735 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3129#(and (<= 1 |#StackHeapBarrier|) (or (< |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 4))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (or (and (exists ((|v_#length_134| (Array Int Int))) (= (store |v_#length_134| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_145| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_51| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_51| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= (store |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_#memory_int_BEFORE_CALL_78| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0))) |v_#memory_int_BEFORE_CALL_78|) (= (select (select (store |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_#memory_$Pointer$.offset_141| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_141| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_141| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_143| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_143| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_157| (Array Int Int))) (and (= (store |v_#valid_157| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_157| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (= 1 (select |#valid| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_112| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_112| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_113|) (= |#memory_int| (store |v_#memory_int_113| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1)))))) (and (exists ((|v_#length_134| (Array Int Int))) (= (store |v_#length_134| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_#memory_$Pointer$.offset_141| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_141| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_141| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_143| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_143| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_157| (Array Int Int))) (and (= (store |v_#valid_157| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_157| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (= 1 (select |#valid| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_52| (Array Int Int)) (|v_#memory_$Pointer$.offset_145| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_52| (store |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)))) (exists ((|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_112| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_112| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_113|) (= |#memory_int| (store |v_#memory_int_113| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1))))))) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_prepend_~head#1.base|)))' at error location [2023-11-12 00:13:22,736 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:13:22,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:13:22,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-11-12 00:13:22,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880261371] [2023-11-12 00:13:22,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:13:22,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-12 00:13:22,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:22,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-12 00:13:22,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2005, Unknown=12, NotChecked=90, Total=2256 [2023-11-12 00:13:22,740 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 27 states, 20 states have (on average 2.05) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:13:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:24,660 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2023-11-12 00:13:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 00:13:24,661 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 20 states have (on average 2.05) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-12 00:13:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:24,662 INFO L225 Difference]: With dead ends: 87 [2023-11-12 00:13:24,662 INFO L226 Difference]: Without dead ends: 87 [2023-11-12 00:13:24,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=246, Invalid=3165, Unknown=15, NotChecked=114, Total=3540 [2023-11-12 00:13:24,666 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 139 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:24,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 538 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 796 Invalid, 0 Unknown, 96 Unchecked, 1.0s Time] [2023-11-12 00:13:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-12 00:13:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2023-11-12 00:13:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 79 states have internal predecessors, (87), 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:13:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2023-11-12 00:13:24,672 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 30 [2023-11-12 00:13:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:24,673 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2023-11-12 00:13:24,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 20 states have (on average 2.05) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:13:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2023-11-12 00:13:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 00:13:24,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:24,674 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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:13:24,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:13:24,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:24,881 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:13:24,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:24,882 INFO L85 PathProgramCache]: Analyzing trace with hash -315269968, now seen corresponding path program 1 times [2023-11-12 00:13:24,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:24,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871834389] [2023-11-12 00:13:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:24,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 00:13:25,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:25,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871834389] [2023-11-12 00:13:25,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871834389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:13:25,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:13:25,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:13:25,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174779767] [2023-11-12 00:13:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:13:25,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:13:25,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:13:25,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:13:25,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:13:25,243 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:13:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:13:25,378 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-11-12 00:13:25,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:13:25,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-11-12 00:13:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:13:25,380 INFO L225 Difference]: With dead ends: 81 [2023-11-12 00:13:25,380 INFO L226 Difference]: Without dead ends: 81 [2023-11-12 00:13:25,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:13:25,381 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 109 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:13:25,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 98 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:13:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-12 00:13:25,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-12 00:13:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 76 states have internal predecessors, (84), 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:13:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-11-12 00:13:25,387 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 32 [2023-11-12 00:13:25,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:13:25,387 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-11-12 00:13:25,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:13:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-11-12 00:13:25,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-12 00:13:25,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:13:25,390 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:13:25,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 00:13:25,391 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-12 00:13:25,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:13:25,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1183430600, now seen corresponding path program 1 times [2023-11-12 00:13:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:13:25,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314623640] [2023-11-12 00:13:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:25,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:13:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:13:25,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:13:25,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314623640] [2023-11-12 00:13:25,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314623640] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:25,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884004645] [2023-11-12 00:13:25,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:13:25,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:13:25,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:13:25,985 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:13:26,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9a0e355-7d33-4adb-9043-fa9900e15c5f/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 00:13:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:13:26,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-12 00:13:26,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:13:26,442 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:13:26,467 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:13:26,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:13:26,480 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:13:26,518 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:13:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-12 00:13:26,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:13:26,604 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_38| Int) (v_ArrVal_1053 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_38| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_38| v_ArrVal_1053) |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:13:26,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884004645] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:13:26,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1125351004] [2023-11-12 00:13:26,608 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-11-12 00:13:26,609 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:13:26,609 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:13:26,610 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:13:26,610 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:13:28,806 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:13:28,831 INFO L180 IcfgInterpreter]: Interpretation finished