./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/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_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/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_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:11:13,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:11:13,703 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:11:13,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:11:13,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:11:13,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:11:13,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:11:13,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:11:13,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:11:13,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:11:13,746 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:11:13,746 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:11:13,747 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:11:13,747 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:11:13,748 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:11:13,748 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:11:13,749 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:11:13,749 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:11:13,750 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:11:13,750 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:11:13,751 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:11:13,757 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:11:13,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:11:13,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:11:13,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:11:13,759 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:11:13,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:11:13,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:11:13,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:11:13,761 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:11:13,762 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:11:13,762 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:11:13,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:11:13,763 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:11:13,763 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:11:13,763 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:11:13,764 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:11:13,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:11:13,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:11:13,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:11:13,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:11:13,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:11:13,765 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:11:13,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:11:13,766 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:11:13,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:11:13,767 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_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/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_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2023-11-12 00:11:14,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:11:14,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:11:14,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:11:14,088 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:11:14,089 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:11:14,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-11-12 00:11:17,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:11:17,533 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:11:17,538 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-11-12 00:11:17,560 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/data/379cc961e/269646c71e7b465983876c3f634c04ef/FLAGde24d5242 [2023-11-12 00:11:17,576 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/data/379cc961e/269646c71e7b465983876c3f634c04ef [2023-11-12 00:11:17,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:11:17,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:11:17,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:11:17,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:11:17,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:11:17,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:11:17" (1/1) ... [2023-11-12 00:11:17,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e4343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:17, skipping insertion in model container [2023-11-12 00:11:17,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:11:17" (1/1) ... [2023-11-12 00:11:17,657 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:11:18,023 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:11:18,035 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:11:18,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:11:18,151 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:11:18,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:18 WrapperNode [2023-11-12 00:11:18,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:11:18,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:11:18,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:11:18,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:11:18,161 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:11:18" (1/1) ... [2023-11-12 00:11:18,202 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:11:18" (1/1) ... [2023-11-12 00:11:18,229 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 158 [2023-11-12 00:11:18,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:11:18,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:11:18,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:11:18,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:11:18,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:18" (1/1) ... [2023-11-12 00:11:18,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:18" (1/1) ... [2023-11-12 00:11:18,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:18" (1/1) ... [2023-11-12 00:11:18,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:18" (1/1) ... [2023-11-12 00:11:18,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:18" (1/1) ... [2023-11-12 00:11:18,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:18" (1/1) ... [2023-11-12 00:11:18,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:18" (1/1) ... [2023-11-12 00:11:18,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:18" (1/1) ... [2023-11-12 00:11:18,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:11:18,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:11:18,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:11:18,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:11:18,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:18" (1/1) ... [2023-11-12 00:11:18,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:11:18,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:11:18,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/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:11:18,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/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:11:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:11:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:11:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:11:18,353 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:11:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:11:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:11:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:11:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:11:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:11:18,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:11:18,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:11:18,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:11:18,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:11:18,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:11:18,505 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:11:18,507 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:11:18,997 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:11:19,091 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:11:19,091 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 00:11:19,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:11:19 BoogieIcfgContainer [2023-11-12 00:11:19,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:11:19,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:11:19,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:11:19,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:11:19,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:11:17" (1/3) ... [2023-11-12 00:11:19,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c4311f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:11:19, skipping insertion in model container [2023-11-12 00:11:19,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:11:18" (2/3) ... [2023-11-12 00:11:19,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c4311f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:11:19, skipping insertion in model container [2023-11-12 00:11:19,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:11:19" (3/3) ... [2023-11-12 00:11:19,111 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2023-11-12 00:11:19,132 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:11:19,132 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2023-11-12 00:11:19,179 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:11:19,186 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;@14d18fe0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:11:19,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-11-12 00:11:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 53 states have (on average 2.30188679245283) internal successors, (122), 109 states have internal predecessors, (122), 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:11:19,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:11:19,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:19,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:11:19,200 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:19,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:19,207 INFO L85 PathProgramCache]: Analyzing trace with hash 240098767, now seen corresponding path program 1 times [2023-11-12 00:11:19,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:19,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028055725] [2023-11-12 00:11:19,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:19,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:19,523 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:11:19,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:19,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028055725] [2023-11-12 00:11:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028055725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:19,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:19,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:11:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965075828] [2023-11-12 00:11:19,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:19,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:11:19,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:19,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:11:19,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:11:19,587 INFO L87 Difference]: Start difference. First operand has 114 states, 53 states have (on average 2.30188679245283) internal successors, (122), 109 states have internal predecessors, (122), 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:11:19,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:19,782 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2023-11-12 00:11:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:11:19,784 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:11:19,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:19,793 INFO L225 Difference]: With dead ends: 111 [2023-11-12 00:11:19,794 INFO L226 Difference]: Without dead ends: 109 [2023-11-12 00:11:19,805 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:11:19,810 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:19,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 155 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:11:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-12 00:11:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-12 00:11:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 51 states have (on average 2.196078431372549) internal successors, (112), 104 states have internal predecessors, (112), 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:11:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2023-11-12 00:11:19,873 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 5 [2023-11-12 00:11:19,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:19,873 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2023-11-12 00:11:19,873 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:11:19,874 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2023-11-12 00:11:19,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:11:19,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:19,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:11:19,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:11:19,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:19,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash 240098768, now seen corresponding path program 1 times [2023-11-12 00:11:19,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:19,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600866500] [2023-11-12 00:11:19,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:19,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:20,012 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:11:20,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:20,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600866500] [2023-11-12 00:11:20,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600866500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:20,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:20,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:11:20,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185924760] [2023-11-12 00:11:20,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:20,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:11:20,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:20,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:11:20,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:11:20,017 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:11:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:20,151 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2023-11-12 00:11:20,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:11:20,152 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:11:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:20,156 INFO L225 Difference]: With dead ends: 107 [2023-11-12 00:11:20,156 INFO L226 Difference]: Without dead ends: 107 [2023-11-12 00:11:20,160 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:11:20,162 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:20,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 160 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:11:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-12 00:11:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-12 00:11:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 51 states have (on average 2.156862745098039) internal successors, (110), 102 states have internal predecessors, (110), 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:11:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2023-11-12 00:11:20,174 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 5 [2023-11-12 00:11:20,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:20,174 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2023-11-12 00:11:20,175 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:11:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2023-11-12 00:11:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:11:20,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:20,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:20,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:11:20,176 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:20,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash -538109043, now seen corresponding path program 1 times [2023-11-12 00:11:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:20,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767520362] [2023-11-12 00:11:20,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:20,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:20,263 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:11:20,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:20,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767520362] [2023-11-12 00:11:20,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767520362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:20,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:20,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:11:20,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909914912] [2023-11-12 00:11:20,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:20,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:11:20,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:20,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:11:20,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:11:20,267 INFO L87 Difference]: Start difference. First operand 107 states and 116 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:11:20,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:20,315 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2023-11-12 00:11:20,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:11:20,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:11:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:20,317 INFO L225 Difference]: With dead ends: 113 [2023-11-12 00:11:20,317 INFO L226 Difference]: Without dead ends: 113 [2023-11-12 00:11:20,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:11:20,319 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 4 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:20,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 196 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:11:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-12 00:11:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2023-11-12 00:11:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 52 states have (on average 2.1346153846153846) internal successors, (111), 103 states have internal predecessors, (111), 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:11:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2023-11-12 00:11:20,330 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 10 [2023-11-12 00:11:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:20,331 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2023-11-12 00:11:20,331 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:11:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2023-11-12 00:11:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:11:20,332 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:20,332 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:20,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:11:20,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:20,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1293681336, now seen corresponding path program 1 times [2023-11-12 00:11:20,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:20,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088643064] [2023-11-12 00:11:20,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:20,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:20,548 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:11:20,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:20,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088643064] [2023-11-12 00:11:20,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088643064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:20,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:20,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:11:20,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640815969] [2023-11-12 00:11:20,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:20,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:11:20,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:20,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:11:20,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:11:20,552 INFO L87 Difference]: Start difference. First operand 108 states and 117 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:11:20,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:20,825 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2023-11-12 00:11:20,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:11:20,825 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:11:20,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:20,828 INFO L225 Difference]: With dead ends: 107 [2023-11-12 00:11:20,828 INFO L226 Difference]: Without dead ends: 107 [2023-11-12 00:11:20,829 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:11:20,833 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:20,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 311 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:11:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-12 00:11:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-12 00:11:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 102 states have internal predecessors, (110), 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:11:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2023-11-12 00:11:20,851 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 17 [2023-11-12 00:11:20,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:20,851 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2023-11-12 00:11:20,852 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:11:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2023-11-12 00:11:20,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:11:20,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:20,853 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:20,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:11:20,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:20,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:20,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1293681337, now seen corresponding path program 1 times [2023-11-12 00:11:20,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:20,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923808075] [2023-11-12 00:11:20,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:21,072 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:11:21,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:21,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923808075] [2023-11-12 00:11:21,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923808075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:21,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:21,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:11:21,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755895020] [2023-11-12 00:11:21,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:21,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:11:21,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:21,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:11:21,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:11:21,076 INFO L87 Difference]: Start difference. First operand 107 states and 116 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:11:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:21,277 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2023-11-12 00:11:21,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:11:21,278 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:11:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:21,279 INFO L225 Difference]: With dead ends: 106 [2023-11-12 00:11:21,279 INFO L226 Difference]: Without dead ends: 106 [2023-11-12 00:11:21,280 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:11:21,281 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:21,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 369 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:11:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-12 00:11:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-12 00:11:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 101 states have internal predecessors, (109), 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:11:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2023-11-12 00:11:21,289 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 17 [2023-11-12 00:11:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:21,289 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2023-11-12 00:11:21,289 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:11:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2023-11-12 00:11:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:11:21,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:21,290 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:21,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:11:21,291 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:21,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:21,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1982425401, now seen corresponding path program 1 times [2023-11-12 00:11:21,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:21,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14970445] [2023-11-12 00:11:21,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:21,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:21,585 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:11:21,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:21,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14970445] [2023-11-12 00:11:21,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14970445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:21,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490523020] [2023-11-12 00:11:21,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:21,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:21,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:11:21,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:11:21,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:11:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:21,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-12 00:11:21,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:11:21,851 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:11:21,906 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |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:11:21,962 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:11:21,963 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-12 00:11:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-12 00:11:21,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:11:22,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490523020] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:22,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [105126077] [2023-11-12 00:11:22,069 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:11:22,070 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:11:22,075 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:11:22,081 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:11:22,082 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:11:23,968 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-12 00:11:24,143 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:11:26,194 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1304#(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:11:26,194 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:11:26,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:11:26,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2023-11-12 00:11:26,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68047091] [2023-11-12 00:11:26,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:11:26,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:11:26,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:26,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:11:26,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=432, Unknown=2, NotChecked=42, Total=552 [2023-11-12 00:11:26,197 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:11:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:26,576 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2023-11-12 00:11:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:11:26,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2023-11-12 00:11:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:26,578 INFO L225 Difference]: With dead ends: 105 [2023-11-12 00:11:26,578 INFO L226 Difference]: Without dead ends: 105 [2023-11-12 00:11:26,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=94, Invalid=508, Unknown=2, NotChecked=46, Total=650 [2023-11-12 00:11:26,580 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 6 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:26,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 397 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 371 Invalid, 0 Unknown, 109 Unchecked, 0.3s Time] [2023-11-12 00:11:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-12 00:11:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-11-12 00:11:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 52 states have (on average 2.076923076923077) internal successors, (108), 100 states have internal predecessors, (108), 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:11:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2023-11-12 00:11:26,586 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 19 [2023-11-12 00:11:26,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:26,587 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2023-11-12 00:11:26,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:11:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2023-11-12 00:11:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:11:26,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:26,588 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:11:26,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:11:26,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:26,795 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:26,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:26,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1982425402, now seen corresponding path program 1 times [2023-11-12 00:11:26,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:26,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790816752] [2023-11-12 00:11:26,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:26,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:27,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:27,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790816752] [2023-11-12 00:11:27,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790816752] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:27,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578035687] [2023-11-12 00:11:27,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:27,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:27,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:11:27,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:11:27,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:11:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:27,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-12 00:11:27,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:11:27,414 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:11:27,609 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:11:27,610 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 15 [2023-11-12 00:11:27,627 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:11:27,627 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:11:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:11:27,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:11:27,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578035687] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:27,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1324949563] [2023-11-12 00:11:27,847 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:11:27,847 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:11:27,848 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:11:27,848 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:11:27,848 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:11:28,849 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-12 00:11:28,974 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:11:31,370 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1619#(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:11:31,371 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:11:31,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:11:31,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-11-12 00:11:31,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803295526] [2023-11-12 00:11:31,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:11:31,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-12 00:11:31,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:31,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-12 00:11:31,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2023-11-12 00:11:31,373 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 18 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 3 states have call successors, (3), 2 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:11:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:31,969 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2023-11-12 00:11:31,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 00:11:31,970 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 3 states have call successors, (3), 2 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:11:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:31,971 INFO L225 Difference]: With dead ends: 106 [2023-11-12 00:11:31,971 INFO L226 Difference]: Without dead ends: 106 [2023-11-12 00:11:31,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2023-11-12 00:11:31,972 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:31,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 436 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 00:11:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-12 00:11:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2023-11-12 00:11:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 99 states have internal predecessors, (107), 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:11:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2023-11-12 00:11:31,978 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 19 [2023-11-12 00:11:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:31,979 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2023-11-12 00:11:31,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 3 states have call successors, (3), 2 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:11:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2023-11-12 00:11:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:11:31,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:31,980 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:11:31,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:11:32,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:32,190 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:32,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:32,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1210538543, now seen corresponding path program 1 times [2023-11-12 00:11:32,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:32,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469500240] [2023-11-12 00:11:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:32,807 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:11:32,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:32,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469500240] [2023-11-12 00:11:32,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469500240] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:32,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585294019] [2023-11-12 00:11:32,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:32,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:32,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:11:32,813 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:11:32,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:11:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:32,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-12 00:11:32,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:11:32,992 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:11:33,001 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:11:33,012 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:11:33,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:33,039 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:11:33,057 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:11:33,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:33,093 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:11:33,139 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:11:33,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:33,175 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:11:33,181 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:11:33,181 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:11:33,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585294019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:33,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:11:33,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2023-11-12 00:11:33,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976944472] [2023-11-12 00:11:33,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:33,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:11:33,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:33,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:11:33,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=146, Unknown=1, NotChecked=24, Total=210 [2023-11-12 00:11:33,184 INFO L87 Difference]: Start difference. First operand 104 states and 113 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:11:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:33,388 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2023-11-12 00:11:33,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:11:33,389 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:11:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:33,390 INFO L225 Difference]: With dead ends: 98 [2023-11-12 00:11:33,390 INFO L226 Difference]: Without dead ends: 98 [2023-11-12 00:11:33,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2023-11-12 00:11:33,391 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 32 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:33,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 191 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 128 Unchecked, 0.2s Time] [2023-11-12 00:11:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-12 00:11:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-12 00:11:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 93 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:11:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2023-11-12 00:11:33,405 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 27 [2023-11-12 00:11:33,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:33,405 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2023-11-12 00:11:33,405 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:11:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2023-11-12 00:11:33,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:11:33,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:33,408 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:11:33,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:11:33,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-12 00:11:33,615 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:33,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1210538542, now seen corresponding path program 1 times [2023-11-12 00:11:33,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:33,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544683955] [2023-11-12 00:11:33,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:11:34,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:34,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544683955] [2023-11-12 00:11:34,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544683955] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:34,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113929454] [2023-11-12 00:11:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:34,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:34,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:11:34,257 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:11:34,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:11:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:34,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-12 00:11:34,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:11:34,437 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:11:34,443 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:11:34,472 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:11:34,476 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:11:34,497 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:11:34,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:34,525 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:11:34,533 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:11:34,534 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:11:34,558 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:11:34,566 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:11:34,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:34,606 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:11:34,669 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:11:34,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:34,705 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:11:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2023-11-12 00:11:34,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:11:34,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113929454] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:34,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2089755957] [2023-11-12 00:11:34,822 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:11:34,822 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:11:34,823 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:11:34,823 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:11:34,823 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:11:36,058 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-12 00:11:36,084 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:11:38,834 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2243#(and (<= 1 |#StackHeapBarrier|) (<= (select |#length| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 3) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (or (and (exists ((|v_#memory_$Pointer$.base_110| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_110| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_110| |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))))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_138| (Array Int Int))) (and (= (store |v_#valid_138| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_138| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int))) (|v_#memory_int_87| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int)) (|v_#length_BEFORE_CALL_63| (Array Int Int)) (|v_#memory_$Pointer$.base_114| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_#memory_$Pointer$.offset_114| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_114| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_114| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_35| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 1) (<= 4 (select |v_#length_BEFORE_CALL_63| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|)) (= |v_old(#memory_int)_AFTER_CALL_35| (store |v_#memory_int_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_35| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0)))) (= (select (select (store |v_#memory_$Pointer$.base_114| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_114| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_110| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_110| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_110| |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))))) (<= 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_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (= |v_#memory_int_84| (store |v_#memory_int_83| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_83| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_84| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_84| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_84| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 5))))) (exists ((|v_#length_120| (Array Int Int))) (= |#length| (store |v_#length_120| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8))) (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_#memory_$Pointer$.base_110| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_110| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_110| |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))))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_138| (Array Int Int))) (and (= (store |v_#valid_138| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_138| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_110| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_110| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_110| |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))))) (<= 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_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (= |v_#memory_int_84| (store |v_#memory_int_83| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_83| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_84| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_84| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_84| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 5))))) (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_int_87| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#memory_$Pointer$.base_114| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_65| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_#memory_$Pointer$.offset_114| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_114| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_114| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_36| (store |v_#memory_int_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_87| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_36| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0)))) (<= 4 (select |v_#length_BEFORE_CALL_65| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|)) (= (select (select (store |v_#memory_$Pointer$.base_114| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_114| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select |v_old(#valid)_AFTER_CALL_36| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 1))) (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_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (= |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) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 5))' at error location [2023-11-12 00:11:38,836 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:11:38,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:11:38,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-11-12 00:11:38,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016432539] [2023-11-12 00:11:38,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:11:38,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 00:11:38,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:38,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 00:11:38,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=834, Unknown=6, NotChecked=118, Total=1056 [2023-11-12 00:11:38,844 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 16 states, 11 states have (on average 3.090909090909091) internal successors, (34), 13 states have internal predecessors, (34), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:11:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:39,398 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2023-11-12 00:11:39,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:11:39,399 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 3.090909090909091) internal successors, (34), 13 states have internal predecessors, (34), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2023-11-12 00:11:39,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:39,401 INFO L225 Difference]: With dead ends: 104 [2023-11-12 00:11:39,401 INFO L226 Difference]: Without dead ends: 104 [2023-11-12 00:11:39,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=113, Invalid=945, Unknown=6, NotChecked=126, Total=1190 [2023-11-12 00:11:39,403 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 122 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:39,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 195 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 393 Invalid, 0 Unknown, 218 Unchecked, 0.4s Time] [2023-11-12 00:11:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-12 00:11:39,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2023-11-12 00:11:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 82 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:11:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2023-11-12 00:11:39,408 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 27 [2023-11-12 00:11:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:39,408 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2023-11-12 00:11:39,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 3.090909090909091) internal successors, (34), 13 states have internal predecessors, (34), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:11:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2023-11-12 00:11:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:11:39,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:39,410 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:11:39,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-12 00:11:39,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:39,616 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:39,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:39,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1686655992, now seen corresponding path program 1 times [2023-11-12 00:11:39,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:39,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423893203] [2023-11-12 00:11:39,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:39,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:39,739 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:11:39,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:39,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423893203] [2023-11-12 00:11:39,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423893203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:39,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:39,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:11:39,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518546268] [2023-11-12 00:11:39,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:39,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:11:39,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:39,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:11:39,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:11:39,742 INFO L87 Difference]: Start difference. First operand 87 states and 96 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:11:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:39,920 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2023-11-12 00:11:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:11:39,921 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:11:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:39,922 INFO L225 Difference]: With dead ends: 85 [2023-11-12 00:11:39,922 INFO L226 Difference]: Without dead ends: 85 [2023-11-12 00:11:39,922 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:11:39,923 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 22 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:39,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 221 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:11:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-12 00:11:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-12 00:11:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.6923076923076923) internal successors, (88), 80 states have internal predecessors, (88), 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:11:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2023-11-12 00:11:39,928 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 30 [2023-11-12 00:11:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:39,928 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2023-11-12 00:11:39,928 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:11:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2023-11-12 00:11:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:11:39,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:39,930 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:11:39,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 00:11:39,930 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:39,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:39,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1686655993, now seen corresponding path program 1 times [2023-11-12 00:11:39,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:39,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116390452] [2023-11-12 00:11:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:39,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:40,147 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:11:40,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:40,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116390452] [2023-11-12 00:11:40,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116390452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:40,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:40,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:11:40,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040766532] [2023-11-12 00:11:40,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:40,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:11:40,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:40,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:11:40,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:11:40,150 INFO L87 Difference]: Start difference. First operand 85 states and 94 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:11:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:40,317 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2023-11-12 00:11:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:11:40,317 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:11:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:40,318 INFO L225 Difference]: With dead ends: 83 [2023-11-12 00:11:40,318 INFO L226 Difference]: Without dead ends: 83 [2023-11-12 00:11:40,319 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:11:40,319 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 19 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:40,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 249 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:11:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-12 00:11:40,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-12 00:11:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 78 states have internal predecessors, (86), 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:11:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2023-11-12 00:11:40,323 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 30 [2023-11-12 00:11:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:40,323 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2023-11-12 00:11:40,324 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:11:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2023-11-12 00:11:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:11:40,325 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:40,325 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:11:40,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 00:11:40,325 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:40,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:40,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1686669521, now seen corresponding path program 1 times [2023-11-12 00:11:40,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:40,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525988353] [2023-11-12 00:11:40,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:40,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:41,017 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:11:41,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:41,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525988353] [2023-11-12 00:11:41,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525988353] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:41,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229895492] [2023-11-12 00:11:41,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:41,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:41,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:11:41,021 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:11:41,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:11:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:41,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-12 00:11:41,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:11:41,255 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:11:41,426 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:11:41,542 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|))) (= |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:11:41,580 INFO L322 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-12 00:11:41,580 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-11-12 00:11:41,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:41,602 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 26 treesize of output 19 [2023-11-12 00:11:41,645 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:11:41,647 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:11:41,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:11:41,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229895492] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:41,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1547808628] [2023-11-12 00:11:41,767 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-12 00:11:41,767 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:11:41,767 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:11:41,767 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:11:41,768 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:11:43,088 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-12 00:11:43,108 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:11:47,783 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2935#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1)) (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 1) (or (and (exists ((|v_#memory_$Pointer$.offset_122| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_122| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_122| |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))))) (exists ((|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_126| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_126| |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|)) (= |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_int_95| (Array Int (Array Int Int))) (|v_#memory_int_96| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_96| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_96| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 5))) (= (store |v_#memory_int_95| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_95| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_96| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_96|))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_149| (Array Int Int))) (and (= (store |v_#valid_149| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_149| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#length_127| (Array Int Int))) (= (store |v_#length_127| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (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_$Pointer$.base_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_#memory_int_99| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_88| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_80| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_49| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1) (= (store |v_#memory_int_99| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_99| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_#memory_int_BEFORE_CALL_80| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0))) |v_#memory_int_BEFORE_CALL_80|) (= (select (select (store |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= 4 (select |v_#length_BEFORE_CALL_88| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|))))) (and (exists ((|v_#memory_$Pointer$.offset_122| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_122| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_122| |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))))) (exists ((|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_126| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_126| |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|)) (= |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_int_95| (Array Int (Array Int Int))) (|v_#memory_int_96| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_96| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_96| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 5))) (= (store |v_#memory_int_95| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_95| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_96| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_96|))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_149| (Array Int Int))) (and (= (store |v_#valid_149| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_149| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_#memory_int_99| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#length_BEFORE_CALL_86| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= |v_old(#memory_int)_AFTER_CALL_48| (store |v_#memory_int_99| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_99| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_48| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= 4 (select |v_#length_BEFORE_CALL_86| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|)))) (exists ((|v_#length_127| (Array Int Int))) (= (store |v_#length_127| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (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|)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (= |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) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 5) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_prepend_~head#1.base|)))' at error location [2023-11-12 00:11:47,783 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:11:47,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:11:47,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-11-12 00:11:47,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422065010] [2023-11-12 00:11:47,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:11:47,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-12 00:11:47,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:47,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-12 00:11:47,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1577, Unknown=14, NotChecked=80, Total=1806 [2023-11-12 00:11:47,787 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 24 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 21 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:11:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:48,805 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2023-11-12 00:11:48,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 00:11:48,805 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 21 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-12 00:11:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:48,806 INFO L225 Difference]: With dead ends: 86 [2023-11-12 00:11:48,807 INFO L226 Difference]: Without dead ends: 86 [2023-11-12 00:11:48,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=200, Invalid=2240, Unknown=14, NotChecked=96, Total=2550 [2023-11-12 00:11:48,808 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 204 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:48,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 542 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 849 Invalid, 0 Unknown, 95 Unchecked, 0.7s Time] [2023-11-12 00:11:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-12 00:11:48,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2023-11-12 00:11:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 77 states have internal predecessors, (86), 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:11:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2023-11-12 00:11:48,813 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 30 [2023-11-12 00:11:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:48,813 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2023-11-12 00:11:48,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 21 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:11:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2023-11-12 00:11:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:11:48,815 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:48,815 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:11:48,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:11:49,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-12 00:11:49,022 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:49,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1686669522, now seen corresponding path program 1 times [2023-11-12 00:11:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:49,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924855361] [2023-11-12 00:11:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:49,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:50,096 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:11:50,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:50,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924855361] [2023-11-12 00:11:50,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924855361] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:50,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946102021] [2023-11-12 00:11:50,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:50,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:50,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:11:50,099 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:11:50,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:11:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:50,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-12 00:11:50,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:11:50,339 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:11:50,645 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:11:50,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 00:11:50,845 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:11:50,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:50,866 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-12 00:11:50,880 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-12 00:11:50,881 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:11:50,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:11:50,892 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:11:50,897 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 18 treesize of output 13 [2023-11-12 00:11:50,978 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:11:51,018 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:11:51,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:11:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946102021] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:11:51,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [768667321] [2023-11-12 00:11:51,393 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-12 00:11:51,393 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:11:51,393 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:11:51,393 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:11:51,393 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:11:52,590 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-12 00:11:52,607 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:11:55,934 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| 5) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem10#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= 5 |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (<= 1 |c_#StackHeapBarrier|) (<= 4 (select |c_#length| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 1) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse0 (<= (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |c_#StackHeapBarrier|)) (.cse1 (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (.cse2 (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0))) (.cse3 (exists ((|v_#valid_159| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_159| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_159| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))) (.cse4 (exists ((|v_#length_137| (Array Int Int))) (= |c_#length| (store |v_#length_137| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8)))) (.cse5 (exists ((|v_#memory_$Pointer$.offset_138| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_138| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_138| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)))))) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (= |c_ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse8 (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_#memory_int_108| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (= |c_#memory_int| (store |v_#memory_int_108| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse11 4 5))) (= (store |v_#memory_int_107| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_107| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select .cse11 0))) |v_#memory_int_108|))))) (.cse9 (exists ((|v_#memory_$Pointer$.base_142| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_142| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_142| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) |c_#memory_$Pointer$.base|))) (.cse10 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 1))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_62| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_62| (Array Int Int)) (|v_#memory_$Pointer$.offset_142| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_62| (store |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 4 (select |v_old(#length)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_old(#length)_AFTER_CALL_61| (Array Int Int)) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_142| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_#memory_int_BEFORE_CALL_101| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (= |v_#memory_int_BEFORE_CALL_101| (store |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_#memory_int_BEFORE_CALL_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (<= 4 (select |v_old(#length)_AFTER_CALL_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) .cse10))) (<= 2 |c_ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (= |c_ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (<= 2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-11-12 00:11:57,127 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3273#(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) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_old(#length)_AFTER_CALL_61| (Array Int Int)) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_142| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_#memory_int_BEFORE_CALL_101| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (= |v_#memory_int_BEFORE_CALL_101| (store |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_#memory_int_BEFORE_CALL_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (<= 4 (select |v_old(#length)_AFTER_CALL_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_146| |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_main_~#s~0#1.base|) (exists ((|v_#length_137| (Array Int Int))) (= |#length| (store |v_#length_137| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_107| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_107| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_108| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_108|) (= |#memory_int| (store |v_#memory_int_108| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_108| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 5))))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_#valid_159| (Array Int Int))) (and (= (store |v_#valid_159| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_159| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_138| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_138| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_138| |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))))) (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_$Pointer$.base_142| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_142| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_142| |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)))))) (and (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_137| (Array Int Int))) (= |#length| (store |v_#length_137| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_62| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_62| (Array Int Int)) (|v_#memory_$Pointer$.offset_142| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_146| (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_142| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (= |v_old(#memory_int)_AFTER_CALL_62| (store |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_62| |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_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_146| |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)) (<= 4 (select |v_old(#length)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_107| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_107| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_108| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_108|) (= |#memory_int| (store |v_#memory_int_108| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_108| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 5))))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_#valid_159| (Array Int Int))) (and (= (store |v_#valid_159| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_159| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_138| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_138| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_138| |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))))) (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_$Pointer$.base_142| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_142| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_142| |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))))))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (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|) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (= |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) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 5) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_prepend_~head#1.base|)))' at error location [2023-11-12 00:11:57,128 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:11:57,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:11:57,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-11-12 00:11:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732395289] [2023-11-12 00:11:57,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:11:57,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-12 00:11:57,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:57,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-12 00:11:57,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2003, Unknown=15, NotChecked=182, Total=2352 [2023-11-12 00:11:57,133 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 28 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 24 states have internal predecessors, (44), 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:11:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:58,977 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2023-11-12 00:11:58,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 00:11:58,977 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 24 states have internal predecessors, (44), 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:11:58,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:58,978 INFO L225 Difference]: With dead ends: 92 [2023-11-12 00:11:58,978 INFO L226 Difference]: Without dead ends: 92 [2023-11-12 00:11:58,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=252, Invalid=3160, Unknown=18, NotChecked=230, Total=3660 [2023-11-12 00:11:58,981 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 226 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:58,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 761 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1120 Invalid, 0 Unknown, 102 Unchecked, 1.0s Time] [2023-11-12 00:11:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-12 00:11:58,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2023-11-12 00:11:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.55) internal successors, (93), 84 states have internal predecessors, (93), 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:11:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2023-11-12 00:11:58,985 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 30 [2023-11-12 00:11:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:58,985 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2023-11-12 00:11:58,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 24 states have internal predecessors, (44), 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:11:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2023-11-12 00:11:58,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 00:11:58,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:58,987 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:11:58,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:11:59,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:11:59,194 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:59,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:59,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1673739513, now seen corresponding path program 1 times [2023-11-12 00:11:59,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:59,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166360476] [2023-11-12 00:11:59,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:59,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:11:59,320 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:11:59,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:11:59,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166360476] [2023-11-12 00:11:59,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166360476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:11:59,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:11:59,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:11:59,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536487390] [2023-11-12 00:11:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:11:59,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:11:59,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:11:59,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:11:59,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:11:59,323 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:11:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:11:59,441 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2023-11-12 00:11:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:11:59,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:11:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:11:59,443 INFO L225 Difference]: With dead ends: 105 [2023-11-12 00:11:59,443 INFO L226 Difference]: Without dead ends: 105 [2023-11-12 00:11:59,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:11:59,444 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 63 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:11:59,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 143 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:11:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-12 00:11:59,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2023-11-12 00:11:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 83 states have internal predecessors, (92), 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:11:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2023-11-12 00:11:59,448 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 32 [2023-11-12 00:11:59,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:11:59,449 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2023-11-12 00:11:59,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:11:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2023-11-12 00:11:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-12 00:11:59,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:11:59,450 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:11:59,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 00:11:59,450 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-12 00:11:59,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:11:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash 346321659, now seen corresponding path program 1 times [2023-11-12 00:11:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:11:59,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317246214] [2023-11-12 00:11:59,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:11:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:11:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:00,212 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:12:00,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:12:00,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317246214] [2023-11-12 00:12:00,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317246214] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:12:00,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983752735] [2023-11-12 00:12:00,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:12:00,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:12:00,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:12:00,214 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:12:00,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49c7dbd4-37a8-44ce-9bf7-43e1a7868135/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 00:12:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:12:00,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-12 00:12:00,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:12:00,625 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:12:00,704 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:12:00,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:12:00,716 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:12:00,758 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:12:00,781 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:12:00,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:12:00,842 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (|v_node_create_~temp~0#1.base_32| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_32| v_ArrVal_1060) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_32| 1)))) is different from false [2023-11-12 00:12:00,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983752735] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:12:00,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [181848223] [2023-11-12 00:12:00,846 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-11-12 00:12:00,846 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:12:00,847 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:12:00,847 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:12:00,847 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:12:02,497 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2023-11-12 00:12:02,525 INFO L180 IcfgInterpreter]: Interpretation finished