./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91 --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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:58:04,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:58:04,652 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-24 23:58:04,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:58:04,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:58:04,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:58:04,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:58:04,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:58:04,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:58:04,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:58:04,703 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:58:04,704 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:58:04,704 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:58:04,705 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:58:04,705 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:58:04,706 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:58:04,707 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:58:04,707 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:58:04,708 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:58:04,708 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:58:04,709 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:58:04,710 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:58:04,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 23:58:04,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 23:58:04,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:58:04,712 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:58:04,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:58:04,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:58:04,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:58:04,714 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 23:58:04,715 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 23:58:04,715 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 23:58:04,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:58:04,716 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 23:58:04,716 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 23:58:04,717 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:58:04,717 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:58:04,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:58:04,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 23:58:04,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:58:04,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:58:04,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:58:04,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:58:04,720 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:58:04,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:58:04,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:58:04,721 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:58:04,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:58:04,721 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_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/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_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2023-11-24 23:58:05,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:58:05,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:58:05,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:58:05,060 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:58:05,061 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:58:05,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-24 23:58:08,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:58:08,476 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:58:08,476 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-24 23:58:08,491 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/data/4d4ebed91/05b8bf7d827a46a3b2c251722d580726/FLAGdf3525261 [2023-11-24 23:58:08,516 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/data/4d4ebed91/05b8bf7d827a46a3b2c251722d580726 [2023-11-24 23:58:08,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:58:08,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:58:08,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:58:08,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:58:08,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:58:08,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:58:08" (1/1) ... [2023-11-24 23:58:08,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d15b304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:08, skipping insertion in model container [2023-11-24 23:58:08,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:58:08" (1/1) ... [2023-11-24 23:58:08,604 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:58:09,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:58:09,031 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:58:09,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:58:09,136 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:58:09,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09 WrapperNode [2023-11-24 23:58:09,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:58:09,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:58:09,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:58:09,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:58:09,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,219 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 148 [2023-11-24 23:58:09,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:58:09,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:58:09,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:58:09,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:58:09,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:58:09,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:58:09,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:58:09,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:58:09,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:58:09,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:09,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:58:09,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:58:09,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 23:58:09,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 23:58:09,389 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-24 23:58:09,389 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-24 23:58:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 23:58:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 23:58:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 23:58:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-24 23:58:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 23:58:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:58:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 23:58:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 23:58:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:58:09,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:58:09,598 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:58:09,601 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:58:10,120 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:58:10,212 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:58:10,212 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-24 23:58:10,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:58:10 BoogieIcfgContainer [2023-11-24 23:58:10,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:58:10,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:58:10,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:58:10,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:58:10,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:58:08" (1/3) ... [2023-11-24 23:58:10,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9cc511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:58:10, skipping insertion in model container [2023-11-24 23:58:10,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (2/3) ... [2023-11-24 23:58:10,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9cc511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:58:10, skipping insertion in model container [2023-11-24 23:58:10,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:58:10" (3/3) ... [2023-11-24 23:58:10,229 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-11-24 23:58:10,251 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:58:10,251 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2023-11-24 23:58:10,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:58:10,316 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;@21283af6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:58:10,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-11-24 23:58:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 49 states have (on average 2.2653061224489797) internal successors, (111), 99 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-24 23:58:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-24 23:58:10,326 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:10,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 23:58:10,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:10,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:10,333 INFO L85 PathProgramCache]: Analyzing trace with hash 227600450, now seen corresponding path program 1 times [2023-11-24 23:58:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:10,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649115765] [2023-11-24 23:58:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:10,640 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-24 23:58:10,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:10,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649115765] [2023-11-24 23:58:10,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649115765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:10,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:58:10,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732766358] [2023-11-24 23:58:10,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:10,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:58:10,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:10,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:58:10,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:58:10,697 INFO L87 Difference]: Start difference. First operand has 104 states, 49 states have (on average 2.2653061224489797) internal successors, (111), 99 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) 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-24 23:58:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:10,834 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2023-11-24 23:58:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:58:10,837 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-24 23:58:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:10,846 INFO L225 Difference]: With dead ends: 101 [2023-11-24 23:58:10,846 INFO L226 Difference]: Without dead ends: 99 [2023-11-24 23:58:10,848 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-24 23:58:10,852 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:10,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 141 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:58:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-24 23:58:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-24 23:58:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 47 states have (on average 2.148936170212766) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:58:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2023-11-24 23:58:10,896 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 5 [2023-11-24 23:58:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:10,897 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2023-11-24 23:58:10,897 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-24 23:58:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2023-11-24 23:58:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-24 23:58:10,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:10,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 23:58:10,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:58:10,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:10,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:10,899 INFO L85 PathProgramCache]: Analyzing trace with hash 227600451, now seen corresponding path program 1 times [2023-11-24 23:58:10,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:10,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895613133] [2023-11-24 23:58:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:10,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:11,080 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-24 23:58:11,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:11,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895613133] [2023-11-24 23:58:11,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895613133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:11,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:11,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:58:11,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487677888] [2023-11-24 23:58:11,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:11,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:58:11,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:11,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:58:11,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:58:11,085 INFO L87 Difference]: Start difference. First operand 99 states and 107 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-24 23:58:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:11,210 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2023-11-24 23:58:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:58:11,211 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-24 23:58:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:11,213 INFO L225 Difference]: With dead ends: 97 [2023-11-24 23:58:11,213 INFO L226 Difference]: Without dead ends: 97 [2023-11-24 23:58:11,213 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-24 23:58:11,215 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:11,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:58:11,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-24 23:58:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-24 23:58:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 47 states have (on average 2.106382978723404) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:58:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-11-24 23:58:11,226 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 5 [2023-11-24 23:58:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:11,227 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-11-24 23:58:11,227 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-24 23:58:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-11-24 23:58:11,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-24 23:58:11,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:11,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:11,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:58:11,228 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:11,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:11,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1271630806, now seen corresponding path program 1 times [2023-11-24 23:58:11,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:11,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150437365] [2023-11-24 23:58:11,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:11,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:11,363 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-24 23:58:11,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150437365] [2023-11-24 23:58:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150437365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:11,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:11,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:58:11,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876871719] [2023-11-24 23:58:11,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:11,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:58:11,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:11,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:58:11,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:58:11,367 INFO L87 Difference]: Start difference. First operand 97 states and 105 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-24 23:58:11,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:11,423 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-11-24 23:58:11,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:58:11,424 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-24 23:58:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:11,430 INFO L225 Difference]: With dead ends: 98 [2023-11-24 23:58:11,431 INFO L226 Difference]: Without dead ends: 98 [2023-11-24 23:58:11,436 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-24 23:58:11,438 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:11,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 174 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:58:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-24 23:58:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-24 23:58:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:58:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-11-24 23:58:11,464 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 10 [2023-11-24 23:58:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:11,465 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-11-24 23:58:11,465 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-24 23:58:11,466 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-11-24 23:58:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 23:58:11,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:11,467 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:11,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 23:58:11,467 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:11,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash 310161943, now seen corresponding path program 1 times [2023-11-24 23:58:11,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:11,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813996393] [2023-11-24 23:58:11,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:11,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:11,636 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-24 23:58:11,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:11,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813996393] [2023-11-24 23:58:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813996393] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:11,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:58:11,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36356795] [2023-11-24 23:58:11,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:11,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:58:11,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:58:11,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:58:11,640 INFO L87 Difference]: Start difference. First operand 98 states and 106 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-24 23:58:11,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:11,882 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2023-11-24 23:58:11,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:58:11,883 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-24 23:58:11,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:11,885 INFO L225 Difference]: With dead ends: 97 [2023-11-24 23:58:11,885 INFO L226 Difference]: Without dead ends: 97 [2023-11-24 23:58:11,885 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-24 23:58:11,897 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:11,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 282 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:58:11,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-24 23:58:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-24 23:58:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 48 states have (on average 2.0625) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:58:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-11-24 23:58:11,906 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 17 [2023-11-24 23:58:11,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:11,906 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-11-24 23:58:11,906 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-24 23:58:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-11-24 23:58:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 23:58:11,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:11,907 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:11,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:58:11,913 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:11,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash 310161944, now seen corresponding path program 1 times [2023-11-24 23:58:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:11,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132641759] [2023-11-24 23:58:11,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:12,211 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-24 23:58:12,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:12,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132641759] [2023-11-24 23:58:12,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132641759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:12,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:12,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:58:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096329298] [2023-11-24 23:58:12,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:12,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:58:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:12,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:58:12,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:58:12,214 INFO L87 Difference]: Start difference. First operand 97 states and 105 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-24 23:58:12,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:12,407 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2023-11-24 23:58:12,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:58:12,408 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-24 23:58:12,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:12,409 INFO L225 Difference]: With dead ends: 96 [2023-11-24 23:58:12,409 INFO L226 Difference]: Without dead ends: 96 [2023-11-24 23:58:12,409 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-24 23:58:12,410 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:12,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 306 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:58:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-24 23:58:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-24 23:58:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 91 states have internal predecessors, (98), 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-24 23:58:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2023-11-24 23:58:12,419 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 17 [2023-11-24 23:58:12,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:12,419 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2023-11-24 23:58:12,420 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-24 23:58:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2023-11-24 23:58:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 23:58:12,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:12,421 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:12,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 23:58:12,421 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:12,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1713077914, now seen corresponding path program 1 times [2023-11-24 23:58:12,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:12,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449090910] [2023-11-24 23:58:12,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:12,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:12,701 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-24 23:58:12,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:12,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449090910] [2023-11-24 23:58:12,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449090910] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:12,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109267770] [2023-11-24 23:58:12,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:12,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:12,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:12,712 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:12,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:58:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:12,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-24 23:58:12,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:12,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:58:13,009 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-24 23:58:13,060 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 23:58:13,061 INFO L378 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-24 23:58:13,073 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-24 23:58:13,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:13,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109267770] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:13,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1635605349] [2023-11-24 23:58:13,172 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-24 23:58:13,172 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:13,177 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:58:13,182 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:58:13,183 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:58:14,993 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-24 23:58:15,144 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:58:17,645 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1189#(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-24 23:58:17,645 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:58:17,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:58:17,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2023-11-24 23:58:17,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708273112] [2023-11-24 23:58:17,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:58:17,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 23:58:17,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:17,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 23:58:17,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=433, Unknown=1, NotChecked=42, Total=552 [2023-11-24 23:58:17,648 INFO L87 Difference]: Start difference. First operand 96 states and 104 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-24 23:58:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:18,045 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2023-11-24 23:58:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:58:18,046 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-24 23:58:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:18,047 INFO L225 Difference]: With dead ends: 95 [2023-11-24 23:58:18,047 INFO L226 Difference]: Without dead ends: 95 [2023-11-24 23:58:18,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=94, Invalid=509, Unknown=1, NotChecked=46, Total=650 [2023-11-24 23:58:18,049 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:18,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 403 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 383 Invalid, 0 Unknown, 98 Unchecked, 0.3s Time] [2023-11-24 23:58:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-24 23:58:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-24 23:58:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 90 states have internal predecessors, (97), 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-24 23:58:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2023-11-24 23:58:18,072 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 19 [2023-11-24 23:58:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:18,074 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2023-11-24 23:58:18,074 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-24 23:58:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2023-11-24 23:58:18,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 23:58:18,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:18,076 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:18,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 23:58:18,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:18,282 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:18,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1713077915, now seen corresponding path program 1 times [2023-11-24 23:58:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:18,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021808493] [2023-11-24 23:58:18,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:18,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:18,754 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-24 23:58:18,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:18,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021808493] [2023-11-24 23:58:18,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021808493] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:18,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182257888] [2023-11-24 23:58:18,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:18,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:18,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:18,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:18,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:58:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:18,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-24 23:58:18,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:18,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:58:19,026 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-24 23:58:19,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:58:19,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-24 23:58:19,071 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:58:19,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 23:58:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-24 23:58:19,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:19,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182257888] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:19,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1311948856] [2023-11-24 23:58:19,264 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-24 23:58:19,264 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:19,265 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:58:19,265 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:58:19,265 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:58:20,359 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-24 23:58:20,477 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:58:22,891 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1483#(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) (= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 3) (= |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-24 23:58:22,891 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:58:22,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:58:22,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-11-24 23:58:22,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782329925] [2023-11-24 23:58:22,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:58:22,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-24 23:58:22,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:22,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-24 23:58:22,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=768, Unknown=1, NotChecked=56, Total=930 [2023-11-24 23:58:22,894 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 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-24 23:58:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:23,439 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2023-11-24 23:58:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 23:58:23,440 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 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-24 23:58:23,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:23,442 INFO L225 Difference]: With dead ends: 95 [2023-11-24 23:58:23,442 INFO L226 Difference]: Without dead ends: 95 [2023-11-24 23:58:23,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=126, Invalid=869, Unknown=1, NotChecked=60, Total=1056 [2023-11-24 23:58:23,444 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 7 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:23,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 427 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 463 Invalid, 0 Unknown, 100 Unchecked, 0.4s Time] [2023-11-24 23:58:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-24 23:58:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2023-11-24 23:58:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 48 states have (on average 2.0) internal successors, (96), 89 states have internal predecessors, (96), 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-24 23:58:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2023-11-24 23:58:23,466 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 19 [2023-11-24 23:58:23,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:23,467 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2023-11-24 23:58:23,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 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-24 23:58:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2023-11-24 23:58:23,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-24 23:58:23,468 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:23,469 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-24 23:58:23,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 23:58:23,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:23,669 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:23,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:23,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1849628720, now seen corresponding path program 1 times [2023-11-24 23:58:23,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:23,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510968422] [2023-11-24 23:58:23,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:23,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:24,321 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-24 23:58:24,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:24,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510968422] [2023-11-24 23:58:24,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510968422] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:24,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28233308] [2023-11-24 23:58:24,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:24,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:24,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:24,328 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:24,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:58:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:24,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-24 23:58:24,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:24,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:58:24,531 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 23:58:24,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-24 23:58:24,580 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-24 23:58:24,602 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-24 23:58:24,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-11-24 23:58:24,711 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-24 23:58:24,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-24 23:58:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2023-11-24 23:58:24,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:25,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 23:58:25,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28233308] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:58:25,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [158820930] [2023-11-24 23:58:25,361 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-24 23:58:25,361 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:25,361 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:58:25,361 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:58:25,362 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:58:26,562 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-24 23:58:26,581 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:58:30,716 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1867#(and (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_append_~head#1.base|) 1)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (or (and (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#length_BEFORE_CALL_59| (Array Int Int)) (|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_119| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_33| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_#memory_int_94| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_119| |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_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (<= 4 (select |v_#length_BEFORE_CALL_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= (select (select (store |v_#memory_$Pointer$.base_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_119| |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_create_#res#1.base|) (= |v_old(#memory_int)_AFTER_CALL_33| (store |v_#memory_int_94| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_94| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (exists ((|v_#valid_141| (Array Int Int))) (and (= (select |v_#valid_141| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_141| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1)))) (exists ((|v_#length_113| (Array Int Int))) (= (store |v_#length_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_91| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_91| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))) (= (store |v_#memory_int_90| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_90| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_91| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_91|))) (exists ((|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|)) (and (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#memory_$Pointer$.base_119| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_#memory_int_BEFORE_CALL_55| (Array Int (Array Int Int))) (|v_#memory_int_94| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.base_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_119| |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_create_#res#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (<= 4 (select |v_#length_BEFORE_CALL_57| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= (store |v_#memory_int_94| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_94| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_#memory_int_BEFORE_CALL_55| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0))) |v_#memory_int_BEFORE_CALL_55|))) (exists ((|v_#valid_141| (Array Int Int))) (and (= (select |v_#valid_141| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_141| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1)))) (exists ((|v_#length_113| (Array Int Int))) (= (store |v_#length_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_91| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_91| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))) (= (store |v_#memory_int_90| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_90| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_91| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_91|))) (exists ((|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-24 23:58:30,717 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:58:30,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:58:30,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2023-11-24 23:58:30,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98527933] [2023-11-24 23:58:30,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:58:30,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-24 23:58:30,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:30,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-24 23:58:30,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1184, Unknown=11, NotChecked=70, Total=1406 [2023-11-24 23:58:30,722 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-24 23:58:31,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:31,251 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2023-11-24 23:58:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:58:31,252 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 27 [2023-11-24 23:58:31,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:31,253 INFO L225 Difference]: With dead ends: 103 [2023-11-24 23:58:31,253 INFO L226 Difference]: Without dead ends: 103 [2023-11-24 23:58:31,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=178, Invalid=1375, Unknown=11, NotChecked=76, Total=1640 [2023-11-24 23:58:31,255 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 182 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:31,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 261 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 414 Invalid, 0 Unknown, 107 Unchecked, 0.4s Time] [2023-11-24 23:58:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-24 23:58:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2023-11-24 23:58:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 81 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-24 23:58:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-11-24 23:58:31,260 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 27 [2023-11-24 23:58:31,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:31,261 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-11-24 23:58:31,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-24 23:58:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-11-24 23:58:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-24 23:58:31,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:31,262 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-24 23:58:31,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-24 23:58:31,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:31,469 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:31,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1849628719, now seen corresponding path program 1 times [2023-11-24 23:58:31,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:31,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842833123] [2023-11-24 23:58:31,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:31,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:58:32,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:32,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842833123] [2023-11-24 23:58:32,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842833123] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:32,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935209860] [2023-11-24 23:58:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:32,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:32,153 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:32,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:58:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:32,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-24 23:58:32,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:32,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 23:58:32,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-24 23:58:32,350 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-24 23:58:32,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:58:32,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-24 23:58:32,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-24 23:58:32,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:58:32,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-24 23:58:32,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-24 23:58:32,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:58:32,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-24 23:58:32,497 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-24 23:58:32,498 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 23:58:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935209860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:32,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 23:58:32,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-11-24 23:58:32,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095995229] [2023-11-24 23:58:32,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:32,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 23:58:32,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:32,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 23:58:32,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2023-11-24 23:58:32,500 INFO L87 Difference]: Start difference. First operand 86 states and 94 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-24 23:58:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:32,653 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2023-11-24 23:58:32,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:58:32,653 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-24 23:58:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:32,654 INFO L225 Difference]: With dead ends: 81 [2023-11-24 23:58:32,654 INFO L226 Difference]: Without dead ends: 81 [2023-11-24 23:58:32,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2023-11-24 23:58:32,655 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 25 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:32,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 180 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 110 Unchecked, 0.1s Time] [2023-11-24 23:58:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-24 23:58:32,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-24 23:58:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 76 states have internal predecessors, (83), 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-24 23:58:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-11-24 23:58:32,659 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 27 [2023-11-24 23:58:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:32,660 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-11-24 23:58:32,660 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-24 23:58:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-11-24 23:58:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-24 23:58:32,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:32,661 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] [2023-11-24 23:58:32,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 23:58:32,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:32,862 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:32,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:32,862 INFO L85 PathProgramCache]: Analyzing trace with hash 623260817, now seen corresponding path program 1 times [2023-11-24 23:58:32,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:32,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593312218] [2023-11-24 23:58:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:32,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:32,967 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-24 23:58:32,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:32,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593312218] [2023-11-24 23:58:32,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593312218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:32,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:32,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:58:32,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103184284] [2023-11-24 23:58:32,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:32,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:58:32,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:32,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:58:32,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:58:32,970 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-24 23:58:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:33,130 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2023-11-24 23:58:33,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:58:33,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 29 [2023-11-24 23:58:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:33,132 INFO L225 Difference]: With dead ends: 79 [2023-11-24 23:58:33,132 INFO L226 Difference]: Without dead ends: 79 [2023-11-24 23:58:33,132 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-24 23:58:33,133 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:33,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 212 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:58:33,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-24 23:58:33,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-24 23:58:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.6875) internal successors, (81), 74 states have internal predecessors, (81), 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-24 23:58:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2023-11-24 23:58:33,137 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 29 [2023-11-24 23:58:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:33,138 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2023-11-24 23:58:33,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-24 23:58:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2023-11-24 23:58:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-24 23:58:33,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:33,139 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] [2023-11-24 23:58:33,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 23:58:33,140 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:33,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:33,140 INFO L85 PathProgramCache]: Analyzing trace with hash 623260818, now seen corresponding path program 1 times [2023-11-24 23:58:33,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:33,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913676007] [2023-11-24 23:58:33,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:33,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:33,360 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-24 23:58:33,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:33,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913676007] [2023-11-24 23:58:33,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913676007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:33,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:33,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:58:33,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400473200] [2023-11-24 23:58:33,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:33,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:58:33,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:33,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:58:33,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:58:33,362 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-24 23:58:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:33,529 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-11-24 23:58:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:58:33,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 29 [2023-11-24 23:58:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:33,530 INFO L225 Difference]: With dead ends: 77 [2023-11-24 23:58:33,531 INFO L226 Difference]: Without dead ends: 77 [2023-11-24 23:58:33,531 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-24 23:58:33,531 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:33,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 224 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:58:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-24 23:58:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-24 23:58:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 72 states have internal predecessors, (79), 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-24 23:58:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2023-11-24 23:58:33,535 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 29 [2023-11-24 23:58:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:33,535 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2023-11-24 23:58:33,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-24 23:58:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2023-11-24 23:58:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-24 23:58:33,540 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:33,540 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-24 23:58:33,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 23:58:33,541 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:33,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2141229217, now seen corresponding path program 1 times [2023-11-24 23:58:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:33,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147759429] [2023-11-24 23:58:33,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:33,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 23:58:34,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:34,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147759429] [2023-11-24 23:58:34,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147759429] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:34,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129118225] [2023-11-24 23:58:34,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:34,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:34,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:34,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:34,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 23:58:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:34,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-24 23:58:34,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:34,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:58:34,535 INFO L378 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-24 23:58:34,597 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-11-24 23:58:34,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:58:34,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-24 23:58:34,622 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-24 23:58:34,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-11-24 23:58:34,703 INFO L378 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-24 23:58:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-24 23:58:34,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:36,800 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_708 (Array Int Int)) (|v_node_create_~temp~0#1.base_35| Int)) (or (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_35| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_35| v_ArrVal_708) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) 1) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_35| 1)))) is different from false [2023-11-24 23:58:36,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129118225] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:36,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [481408545] [2023-11-24 23:58:36,805 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-24 23:58:36,805 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:36,805 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:58:36,806 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:58:36,806 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:58:38,137 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-24 23:58:38,161 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:58:44,931 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2789#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) 1)) (= |ULTIMATE.start_sll_circular_append_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (or (and (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (exists ((|v_#length_124| (Array Int Int))) (= |#length| (store |v_#length_124| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_127| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_127| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_old(#length)_AFTER_CALL_49| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_80| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_131| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_131| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_old(#length)_AFTER_CALL_49| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)) (= (store |v_#memory_int_106| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_106| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_#memory_int_BEFORE_CALL_80| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0))) |v_#memory_int_BEFORE_CALL_80|) (= (select |v_old(#valid)_AFTER_CALL_49| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_103| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_103| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))) (= (store |v_#memory_int_102| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_102| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_103| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_103|))) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_152| (Array Int Int))) (and (= (store |v_#valid_152| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_152| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|)) (and (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (exists ((|v_#length_124| (Array Int Int))) (= |#length| (store |v_#length_124| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_127| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_127| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_int_106| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_86| (Array Int Int)) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_78| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_131| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_131| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 1) (<= 4 (select |v_#length_BEFORE_CALL_86| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_#memory_int_BEFORE_CALL_78| (store |v_#memory_int_106| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_106| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_#memory_int_BEFORE_CALL_78| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_103| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_103| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))) (= (store |v_#memory_int_102| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_102| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_103| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_103|))) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_152| (Array Int Int))) (and (= (store |v_#valid_152| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_152| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~head#1.base|) 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-24 23:58:44,931 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:58:44,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:58:44,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2023-11-24 23:58:44,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390660690] [2023-11-24 23:58:44,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:58:44,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-24 23:58:44,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:44,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-24 23:58:44,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1431, Unknown=5, NotChecked=154, Total=1722 [2023-11-24 23:58:44,934 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 23 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 20 states have internal predecessors, (39), 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-24 23:58:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:45,818 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-11-24 23:58:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-24 23:58:45,819 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 20 states have internal predecessors, (39), 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-24 23:58:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:45,820 INFO L225 Difference]: With dead ends: 80 [2023-11-24 23:58:45,820 INFO L226 Difference]: Without dead ends: 80 [2023-11-24 23:58:45,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=187, Invalid=1978, Unknown=5, NotChecked=182, Total=2352 [2023-11-24 23:58:45,821 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 123 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:45,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 440 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 756 Invalid, 0 Unknown, 88 Unchecked, 0.6s Time] [2023-11-24 23:58:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-24 23:58:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2023-11-24 23:58:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 71 states have internal predecessors, (79), 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-24 23:58:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-11-24 23:58:45,825 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 30 [2023-11-24 23:58:45,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:45,825 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-11-24 23:58:45,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 20 states have internal predecessors, (39), 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-24 23:58:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-11-24 23:58:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-24 23:58:45,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:45,826 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-24 23:58:45,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 23:58:46,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:46,034 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:46,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2141229218, now seen corresponding path program 1 times [2023-11-24 23:58:46,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:46,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071327841] [2023-11-24 23:58:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:46,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:47,028 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-24 23:58:47,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:47,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071327841] [2023-11-24 23:58:47,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071327841] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:47,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296174623] [2023-11-24 23:58:47,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:47,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:47,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:47,032 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:47,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 23:58:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:47,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-24 23:58:47,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:47,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:58:47,525 INFO L378 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-24 23:58:47,532 INFO L378 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-24 23:58:47,700 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-24 23:58:47,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:58:47,722 INFO L378 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-24 23:58:47,734 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 23:58:47,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-24 23:58:47,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-24 23:58:47,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:58:47,745 INFO L378 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-24 23:58:47,822 INFO L378 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-24 23:58:47,857 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-24 23:58:47,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:48,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296174623] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:48,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [629377751] [2023-11-24 23:58:48,173 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-24 23:58:48,173 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:48,173 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:58:48,174 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:58:48,174 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:58:49,330 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-24 23:58:49,351 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:58:56,816 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3113#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_append_~head#1.base|) (= |ULTIMATE.start_sll_circular_append_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (or (and (exists ((|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_int_115| (Array Int (Array Int Int)))) (and (= |v_#memory_int_115| (store |v_#memory_int_114| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_114| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))))) (exists ((|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_162| (Array Int Int))) (and (= (store |v_#valid_162| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_162| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (exists ((|v_#length_134| (Array Int Int))) (= (store |v_#length_134| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_#memory_int_118| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_151| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_old(#memory_int)_AFTER_CALL_62| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_62| (Array Int Int)) (|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 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_19|)) (= (select (select (store |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 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_19|) 1) (= |v_old(#memory_int)_AFTER_CALL_62| (store |v_#memory_int_118| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_118| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|)) (and (exists ((|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_int_115| (Array Int (Array Int Int)))) (and (= |v_#memory_int_115| (store |v_#memory_int_114| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_114| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))))) (exists ((|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_162| (Array Int Int))) (and (= (store |v_#valid_162| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_162| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_#memory_int_118| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_151| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_111| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_101| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select |v_old(#valid)_AFTER_CALL_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_#length_BEFORE_CALL_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= |v_#memory_int_BEFORE_CALL_101| (store |v_#memory_int_118| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_118| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_#memory_int_BEFORE_CALL_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))))) (exists ((|v_#length_134| (Array Int Int))) (= (store |v_#length_134| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|))) (or (< |ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_append_~last~1#1.offset| 4))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~head#1.base|) 1))' at error location [2023-11-24 23:58:56,816 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:58:56,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:58:56,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-11-24 23:58:56,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100589953] [2023-11-24 23:58:56,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:58:56,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-24 23:58:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:56,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-24 23:58:56,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2095, Unknown=12, NotChecked=92, Total=2352 [2023-11-24 23:58:56,819 INFO L87 Difference]: Start difference. First operand 76 states and 85 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-24 23:58:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:58,504 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2023-11-24 23:58:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-24 23:58:58,505 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-24 23:58:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:58,506 INFO L225 Difference]: With dead ends: 85 [2023-11-24 23:58:58,506 INFO L226 Difference]: Without dead ends: 85 [2023-11-24 23:58:58,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=253, Invalid=3278, Unknown=13, NotChecked=116, Total=3660 [2023-11-24 23:58:58,509 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 134 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:58,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 665 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1002 Invalid, 0 Unknown, 94 Unchecked, 0.9s Time] [2023-11-24 23:58:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-24 23:58:58,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2023-11-24 23:58:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 75 states have internal predecessors, (83), 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-24 23:58:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2023-11-24 23:58:58,513 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 30 [2023-11-24 23:58:58,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:58,513 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2023-11-24 23:58:58,514 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-24 23:58:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2023-11-24 23:58:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-24 23:58:58,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:58,515 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-24 23:58:58,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-24 23:58:58,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6a63bf-4c15-48a1-b813-48a377957bfe/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:58,721 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:58,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash 419389915, now seen corresponding path program 1 times [2023-11-24 23:58:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:58,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286877672] [2023-11-24 23:58:58,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:58,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:58,985 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-24 23:58:58,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:58,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286877672] [2023-11-24 23:58:58,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286877672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:58,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:58,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 23:58:58,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077775794] [2023-11-24 23:58:58,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:58,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 23:58:58,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:58,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 23:58:58,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:58:58,989 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:58:59,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:59,092 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2023-11-24 23:58:59,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:58:59,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-11-24 23:58:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:59,094 INFO L225 Difference]: With dead ends: 77 [2023-11-24 23:58:59,094 INFO L226 Difference]: Without dead ends: 77 [2023-11-24 23:58:59,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-24 23:58:59,095 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 128 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:59,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 122 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:58:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-24 23:58:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-24 23:58:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.509433962264151) internal successors, (80), 72 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:58:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-11-24 23:58:59,098 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 32 [2023-11-24 23:58:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:59,098 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-11-24 23:58:59,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:58:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-11-24 23:58:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-24 23:58:59,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:59,099 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-24 23:58:59,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 23:58:59,100 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 23:58:59,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:59,100 INFO L85 PathProgramCache]: Analyzing trace with hash 116189350, now seen corresponding path program 1 times [2023-11-24 23:58:59,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:59,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210417424] [2023-11-24 23:58:59,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:59,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms