./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_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_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh --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 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:50:09,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:50:09,218 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 12:50:09,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:50:09,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:50:09,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:50:09,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:50:09,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:50:09,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:50:09,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:50:09,253 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:50:09,253 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:50:09,254 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:50:09,255 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 12:50:09,255 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:50:09,256 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:50:09,256 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 12:50:09,257 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 12:50:09,257 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:50:09,258 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 12:50:09,258 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 12:50:09,259 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 12:50:09,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 12:50:09,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 12:50:09,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:50:09,262 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:50:09,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:50:09,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:50:09,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:50:09,263 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 12:50:09,264 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 12:50:09,264 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 12:50:09,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:50:09,265 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 12:50:09,265 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 12:50:09,265 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:50:09,266 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:50:09,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:50:09,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:50:09,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:50:09,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:50:09,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:50:09,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:50:09,267 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 12:50:09,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 12:50:09,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:50:09,268 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:50:09,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:50:09,268 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_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/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_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh 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 -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2023-12-02 12:50:09,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:50:09,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:50:09,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:50:09,518 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:50:09,518 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:50:09,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2023-12-02 12:50:12,262 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:50:12,508 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:50:12,508 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2023-12-02 12:50:12,523 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/data/9180cd8b2/b771755b8de9427bb5144f2f42734b61/FLAGa28b225f4 [2023-12-02 12:50:12,536 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/data/9180cd8b2/b771755b8de9427bb5144f2f42734b61 [2023-12-02 12:50:12,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:50:12,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:50:12,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:50:12,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:50:12,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:50:12,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:50:12" (1/1) ... [2023-12-02 12:50:12,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7eab1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12, skipping insertion in model container [2023-12-02 12:50:12,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:50:12" (1/1) ... [2023-12-02 12:50:12,605 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:50:12,894 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:50:12,905 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:50:12,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:50:12,980 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:50:12,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12 WrapperNode [2023-12-02 12:50:12,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:50:12,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:50:12,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:50:12,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:50:12,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12" (1/1) ... [2023-12-02 12:50:13,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12" (1/1) ... [2023-12-02 12:50:13,027 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 130 [2023-12-02 12:50:13,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:50:13,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:50:13,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:50:13,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:50:13,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12" (1/1) ... [2023-12-02 12:50:13,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12" (1/1) ... [2023-12-02 12:50:13,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12" (1/1) ... [2023-12-02 12:50:13,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12" (1/1) ... [2023-12-02 12:50:13,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12" (1/1) ... [2023-12-02 12:50:13,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12" (1/1) ... [2023-12-02 12:50:13,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12" (1/1) ... [2023-12-02 12:50:13,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12" (1/1) ... [2023-12-02 12:50:13,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:50:13,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:50:13,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:50:13,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:50:13,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12" (1/1) ... [2023-12-02 12:50:13,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:50:13,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:50:13,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:50:13,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:50:13,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 12:50:13,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 12:50:13,122 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 12:50:13,122 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 12:50:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 12:50:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:50:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 12:50:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 12:50:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 12:50:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 12:50:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 12:50:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 12:50:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:50:13,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:50:13,223 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:50:13,224 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:50:13,491 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:50:13,540 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:50:13,540 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 12:50:13,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:50:13 BoogieIcfgContainer [2023-12-02 12:50:13,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:50:13,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:50:13,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:50:13,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:50:13,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:50:12" (1/3) ... [2023-12-02 12:50:13,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cebb568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:50:13, skipping insertion in model container [2023-12-02 12:50:13,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:12" (2/3) ... [2023-12-02 12:50:13,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cebb568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:50:13, skipping insertion in model container [2023-12-02 12:50:13,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:50:13" (3/3) ... [2023-12-02 12:50:13,552 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2023-12-02 12:50:13,571 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:50:13,571 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-12-02 12:50:13,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:50:13,620 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;@51393714, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:50:13,620 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-12-02 12:50:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 42 states have (on average 2.238095238095238) internal successors, (94), 83 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:50:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 12:50:13,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:50:13,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 12:50:13,631 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:50:13,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:50:13,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2072626774, now seen corresponding path program 1 times [2023-12-02 12:50:13,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:50:13,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473337104] [2023-12-02 12:50:13,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:13,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:50:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:50:13,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:50:13,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473337104] [2023-12-02 12:50:13,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473337104] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:50:13,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:50:13,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:50:13,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134679706] [2023-12-02 12:50:13,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:50:13,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:50:13,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:50:13,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:50:13,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:50:13,917 INFO L87 Difference]: Start difference. First operand has 87 states, 42 states have (on average 2.238095238095238) internal successors, (94), 83 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-12-02 12:50:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:50:13,976 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2023-12-02 12:50:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:50:13,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 6 [2023-12-02 12:50:13,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:50:13,985 INFO L225 Difference]: With dead ends: 100 [2023-12-02 12:50:13,985 INFO L226 Difference]: Without dead ends: 98 [2023-12-02 12:50:13,986 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-12-02 12:50:13,990 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 13 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:50:13,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 158 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:50:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-02 12:50:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2023-12-02 12:50:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:50:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-12-02 12:50:14,026 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 6 [2023-12-02 12:50:14,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:50:14,027 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-12-02 12:50:14,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-12-02 12:50:14,027 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-12-02 12:50:14,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 12:50:14,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:50:14,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 12:50:14,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 12:50:14,028 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:50:14,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:50:14,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1904486370, now seen corresponding path program 1 times [2023-12-02 12:50:14,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:50:14,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790120025] [2023-12-02 12:50:14,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:14,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:50:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:50:14,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:50:14,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790120025] [2023-12-02 12:50:14,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790120025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:50:14,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:50:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:50:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374591226] [2023-12-02 12:50:14,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:50:14,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:50:14,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:50:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:50:14,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:50:14,099 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12-02 12:50:14,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:50:14,183 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2023-12-02 12:50:14,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:50:14,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2023-12-02 12:50:14,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:50:14,185 INFO L225 Difference]: With dead ends: 82 [2023-12-02 12:50:14,185 INFO L226 Difference]: Without dead ends: 82 [2023-12-02 12:50:14,186 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-12-02 12:50:14,187 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:50:14,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:50:14,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-02 12:50:14,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-12-02 12:50:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 41 states have (on average 2.073170731707317) internal successors, (85), 78 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:50:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2023-12-02 12:50:14,197 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 6 [2023-12-02 12:50:14,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:50:14,197 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2023-12-02 12:50:14,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12-02 12:50:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2023-12-02 12:50:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 12:50:14,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:50:14,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 12:50:14,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 12:50:14,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:50:14,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:50:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1904486371, now seen corresponding path program 1 times [2023-12-02 12:50:14,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:50:14,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576336285] [2023-12-02 12:50:14,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:50:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:50:14,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:50:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576336285] [2023-12-02 12:50:14,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576336285] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:50:14,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:50:14,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:50:14,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262908928] [2023-12-02 12:50:14,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:50:14,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:50:14,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:50:14,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:50:14,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:50:14,284 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12-02 12:50:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:50:14,360 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2023-12-02 12:50:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:50:14,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2023-12-02 12:50:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:50:14,362 INFO L225 Difference]: With dead ends: 79 [2023-12-02 12:50:14,362 INFO L226 Difference]: Without dead ends: 79 [2023-12-02 12:50:14,362 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-12-02 12:50:14,364 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:50:14,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:50:14,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-02 12:50:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-12-02 12:50:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 41 states have (on average 2.0) internal successors, (82), 75 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:50:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2023-12-02 12:50:14,372 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 6 [2023-12-02 12:50:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:50:14,372 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2023-12-02 12:50:14,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12-02 12:50:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2023-12-02 12:50:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 12:50:14,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:50:14,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:50:14,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 12:50:14,374 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:50:14,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:50:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash -143040805, now seen corresponding path program 1 times [2023-12-02 12:50:14,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:50:14,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011523065] [2023-12-02 12:50:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:14,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:50:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:50:14,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:50:14,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011523065] [2023-12-02 12:50:14,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011523065] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:50:14,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:50:14,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:50:14,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115067332] [2023-12-02 12:50:14,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:50:14,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:50:14,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:50:14,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:50:14,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:50:14,574 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-12-02 12:50:14,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:50:14,755 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2023-12-02 12:50:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:50:14,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 11 [2023-12-02 12:50:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:50:14,757 INFO L225 Difference]: With dead ends: 77 [2023-12-02 12:50:14,757 INFO L226 Difference]: Without dead ends: 77 [2023-12-02 12:50:14,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:50:14,759 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 13 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:50:14,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 236 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:50:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-02 12:50:14,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-02 12:50:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 41 states have (on average 1.951219512195122) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:50:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2023-12-02 12:50:14,765 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 11 [2023-12-02 12:50:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:50:14,766 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2023-12-02 12:50:14,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-12-02 12:50:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2023-12-02 12:50:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 12:50:14,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:50:14,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:50:14,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 12:50:14,767 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:50:14,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:50:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -143040806, now seen corresponding path program 1 times [2023-12-02 12:50:14,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:50:14,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344394953] [2023-12-02 12:50:14,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:14,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:50:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:50:14,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:50:14,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344394953] [2023-12-02 12:50:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344394953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:50:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:50:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:50:14,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915006912] [2023-12-02 12:50:14,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:50:14,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:50:14,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:50:14,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:50:14,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:50:14,850 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-12-02 12:50:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:50:14,994 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2023-12-02 12:50:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:50:14,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2023-12-02 12:50:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:50:14,995 INFO L225 Difference]: With dead ends: 75 [2023-12-02 12:50:14,995 INFO L226 Difference]: Without dead ends: 75 [2023-12-02 12:50:14,996 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-12-02 12:50:14,997 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 9 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:50:14,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 205 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:50:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-02 12:50:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-12-02 12:50:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:50:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2023-12-02 12:50:15,003 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 11 [2023-12-02 12:50:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:50:15,004 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2023-12-02 12:50:15,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-12-02 12:50:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2023-12-02 12:50:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 12:50:15,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:50:15,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:50:15,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 12:50:15,005 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:50:15,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:50:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash -721106662, now seen corresponding path program 1 times [2023-12-02 12:50:15,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:50:15,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463812599] [2023-12-02 12:50:15,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:15,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:50:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:50:15,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:50:15,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463812599] [2023-12-02 12:50:15,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463812599] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:50:15,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:50:15,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:50:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150298268] [2023-12-02 12:50:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:50:15,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:50:15,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:50:15,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:50:15,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:50:15,057 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-02 12:50:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:50:15,092 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2023-12-02 12:50:15,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:50:15,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2023-12-02 12:50:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:50:15,094 INFO L225 Difference]: With dead ends: 81 [2023-12-02 12:50:15,094 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 12:50:15,094 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-12-02 12:50:15,096 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:50:15,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:50:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 12:50:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2023-12-02 12:50:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 12:50:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-12-02 12:50:15,102 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 14 [2023-12-02 12:50:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:50:15,102 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-12-02 12:50:15,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-02 12:50:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-12-02 12:50:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 12:50:15,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:50:15,104 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:50:15,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 12:50:15,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:50:15,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:50:15,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1237928394, now seen corresponding path program 1 times [2023-12-02 12:50:15,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:50:15,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363491722] [2023-12-02 12:50:15,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:15,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:50:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 12:50:15,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:50:15,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363491722] [2023-12-02 12:50:15,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363491722] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:50:15,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051238916] [2023-12-02 12:50:15,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:15,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:50:15,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:50:15,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:50:15,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 12:50:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:15,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:50:15,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:50:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:50:15,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:50:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 12:50:15,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051238916] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:50:15,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1800316048] [2023-12-02 12:50:15,485 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 12:50:15,486 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:50:15,490 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:50:15,496 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:50:15,496 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:50:17,565 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 33 for LOIs [2023-12-02 12:50:17,626 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:50:25,893 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1233#(and (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_append_#in~head#1.base|) (or (and (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#length_75| (Array Int Int))) (= |#length| (store |v_#length_75| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (exists ((|v_#valid_90| (Array Int Int))) (and (= (store |v_#valid_90| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_90| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_70| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_70| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_49| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))) (= (store |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_51|) (= (store |v_#memory_int_49| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_49| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_50|))) (exists ((|v_#memory_$Pointer$.base_70| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_70| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_70| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|)) (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_16| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_16| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_75| (Array Int Int))) (= |#length| (store |v_#length_75| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (exists ((|v_#valid_90| (Array Int Int))) (and (= (store |v_#valid_90| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_90| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_70| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_70| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_49| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))) (= (store |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_51|) (= (store |v_#memory_int_49| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_49| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_50|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_70| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_70| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_70| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|))) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_append_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0))' at error location [2023-12-02 12:50:25,893 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:50:25,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:50:25,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-12-02 12:50:25,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205229852] [2023-12-02 12:50:25,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:50:25,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:50:25,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:50:25,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:50:25,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=314, Unknown=4, NotChecked=0, Total=380 [2023-12-02 12:50:25,896 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 12:50:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:50:25,929 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2023-12-02 12:50:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:50:25,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-12-02 12:50:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:50:25,930 INFO L225 Difference]: With dead ends: 82 [2023-12-02 12:50:25,930 INFO L226 Difference]: Without dead ends: 82 [2023-12-02 12:50:25,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=62, Invalid=314, Unknown=4, NotChecked=0, Total=380 [2023-12-02 12:50:25,932 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:50:25,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 133 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:50:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-02 12:50:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-12-02 12:50:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 77 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 12:50:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2023-12-02 12:50:25,940 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 24 [2023-12-02 12:50:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:50:25,940 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2023-12-02 12:50:25,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 12:50:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2023-12-02 12:50:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 12:50:25,942 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:50:25,942 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-02 12:50:25,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 12:50:26,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:50:26,143 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:50:26,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:50:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash -237961352, now seen corresponding path program 1 times [2023-12-02 12:50:26,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:50:26,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189679057] [2023-12-02 12:50:26,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:26,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:50:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:50:26,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:50:26,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189679057] [2023-12-02 12:50:26,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189679057] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:50:26,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918663265] [2023-12-02 12:50:26,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:26,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:50:26,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:50:26,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:50:26,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 12:50:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:26,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 12:50:26,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:50:26,604 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-12-02 12:50:26,665 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 12:50:26,666 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-12-02 12:50:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:50:26,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:50:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:50:26,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918663265] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:50:26,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [727254393] [2023-12-02 12:50:26,945 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 12:50:26,945 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:50:26,945 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:50:26,945 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:50:26,946 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:50:28,099 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 122 for LOIs [2023-12-02 12:50:28,438 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:50:33,962 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1588#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (not (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 2) (exists ((|v_#memory_$Pointer$.offset_111| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_112| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_111| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_111| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_112| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.offset_112|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_112| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_112| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 0))))) (exists ((|v_#memory_$Pointer$.base_112| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_111| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_111| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_111| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_112| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.base_112|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_112| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_112| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 |ULTIMATE.start_dll_create_~head~0#1.base|))))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_create_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_#memory_int_90| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_90| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_90| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 1) 4 (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_create_~data#1| 1))' at error location [2023-12-02 12:50:33,962 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:50:33,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:50:33,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 18 [2023-12-02 12:50:33,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460968395] [2023-12-02 12:50:33,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:50:33,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 12:50:33,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:50:33,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 12:50:33,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2023-12-02 12:50:33,965 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 19 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 12:50:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:50:34,431 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2023-12-02 12:50:34,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 12:50:34,432 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2023-12-02 12:50:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:50:34,433 INFO L225 Difference]: With dead ends: 81 [2023-12-02 12:50:34,433 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 12:50:34,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2023-12-02 12:50:34,435 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 8 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:50:34,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 576 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 12:50:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 12:50:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-02 12:50:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 47 states have (on average 1.7659574468085106) 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-12-02 12:50:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-12-02 12:50:34,441 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 27 [2023-12-02 12:50:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:50:34,442 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-12-02 12:50:34,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 12:50:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-12-02 12:50:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 12:50:34,443 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:50:34,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-02 12:50:34,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 12:50:34,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:50:34,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:50:34,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:50:34,644 INFO L85 PathProgramCache]: Analyzing trace with hash -237961351, now seen corresponding path program 1 times [2023-12-02 12:50:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:50:34,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590031820] [2023-12-02 12:50:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:50:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:34,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:50:34,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:50:34,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590031820] [2023-12-02 12:50:34,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590031820] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:50:34,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46440506] [2023-12-02 12:50:34,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:34,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:50:34,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:50:34,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:50:34,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 12:50:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:35,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 12:50:35,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:50:35,316 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 12:50:35,317 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-12-02 12:50:35,324 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-12-02 12:50:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:50:35,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:50:35,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46440506] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:50:35,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1186664147] [2023-12-02 12:50:35,525 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 12:50:35,526 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:50:35,526 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:50:35,526 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:50:35,527 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:50:36,597 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 122 for LOIs [2023-12-02 12:50:36,842 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:50:42,743 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1890#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (<= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 11) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 2) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_create_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#memory_int_110| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_110| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_110| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 1) 4 (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_132| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_132| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.offset_132|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_132| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_132| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 0))))) (<= 8 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_132| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_131| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_131| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_132| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.base_132|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_132| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_132| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 |ULTIMATE.start_dll_create_~head~0#1.base|))))) (= |ULTIMATE.start_dll_create_~data#1| 1))' at error location [2023-12-02 12:50:42,743 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:50:42,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:50:42,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2023-12-02 12:50:42,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122042535] [2023-12-02 12:50:42,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:50:42,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 12:50:42,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:50:42,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 12:50:42,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1270, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 12:50:42,746 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 12:50:43,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:50:43,470 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2023-12-02 12:50:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 12:50:43,470 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2023-12-02 12:50:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:50:43,471 INFO L225 Difference]: With dead ends: 81 [2023-12-02 12:50:43,471 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 12:50:43,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=212, Invalid=1858, Unknown=0, NotChecked=0, Total=2070 [2023-12-02 12:50:43,473 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:50:43,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 639 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 12:50:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 12:50:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2023-12-02 12:50:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.7446808510638299) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 12:50:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-12-02 12:50:43,478 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 27 [2023-12-02 12:50:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:50:43,478 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-12-02 12:50:43,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 12:50:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-12-02 12:50:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 12:50:43,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:50:43,480 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-02 12:50:43,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 12:50:43,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-02 12:50:43,681 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:50:43,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:50:43,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1052532056, now seen corresponding path program 2 times [2023-12-02 12:50:43,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:50:43,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293247708] [2023-12-02 12:50:43,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:43,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:50:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 12:50:43,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:50:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293247708] [2023-12-02 12:50:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293247708] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:50:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919715882] [2023-12-02 12:50:43,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 12:50:43,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:50:43,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:50:43,817 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:50:43,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 12:50:44,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 12:50:44,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:50:44,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 12:50:44,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:50:44,067 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-12-02 12:50:44,091 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|))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-12-02 12:50:44,111 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-12-02 12:50:44,120 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 12:50:44,120 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-12-02 12:50:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 7 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:50:44,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:50:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 12:50:44,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919715882] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:50:44,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1825825689] [2023-12-02 12:50:44,258 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 12:50:44,258 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:50:44,258 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:50:44,258 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:50:44,258 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:50:45,253 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 33 for LOIs [2023-12-02 12:50:45,303 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:50:53,372 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2310#(and (= |ULTIMATE.start_dll_append_~data#1| 1) (or (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_36| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_161| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_161| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_161| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_36| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#valid_138| (Array Int Int))) (and (= (select |v_#valid_138| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_138| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_161| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_161| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_161| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_int_140| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int))) (|v_#memory_int_142| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_142| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_142| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))) (= (store |v_#memory_int_141| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_141| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_142| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_142|) (= (store |v_#memory_int_140| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_140| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_141| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_141|))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|) (exists ((|v_#length_114| (Array Int Int))) (= (store |v_#length_114| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|))) (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_60| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.offset_161| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_161| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_161| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_138| (Array Int Int))) (and (= (select |v_#valid_138| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_138| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_37| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_161| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_161| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_161| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_int_140| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int))) (|v_#memory_int_142| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_142| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_142| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))) (= (store |v_#memory_int_141| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_141| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_142| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_142|) (= (store |v_#memory_int_140| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_140| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_141| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_141|))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|) (exists ((|v_#length_114| (Array Int Int))) (= (store |v_#length_114| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_append_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0))' at error location [2023-12-02 12:50:53,372 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:50:53,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:50:53,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2023-12-02 12:50:53,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414606359] [2023-12-02 12:50:53,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:50:53,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 12:50:53,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:50:53,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 12:50:53,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=617, Unknown=3, NotChecked=50, Total=756 [2023-12-02 12:50:53,374 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 12:50:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:50:53,701 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2023-12-02 12:50:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 12:50:53,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2023-12-02 12:50:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:50:53,703 INFO L225 Difference]: With dead ends: 80 [2023-12-02 12:50:53,703 INFO L226 Difference]: Without dead ends: 80 [2023-12-02 12:50:53,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=142, Invalid=1045, Unknown=7, NotChecked=66, Total=1260 [2023-12-02 12:50:53,704 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 210 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:50:53,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 253 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 320 Invalid, 0 Unknown, 81 Unchecked, 0.2s Time] [2023-12-02 12:50:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-02 12:50:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-12-02 12:50:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 75 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-12-02 12:50:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2023-12-02 12:50:53,710 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 37 [2023-12-02 12:50:53,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:50:53,710 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2023-12-02 12:50:53,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 12:50:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2023-12-02 12:50:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 12:50:53,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:50:53,712 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:50:53,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 12:50:53,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 12:50:53,912 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:50:53,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:50:53,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1554489494, now seen corresponding path program 1 times [2023-12-02 12:50:53,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:50:53,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324518230] [2023-12-02 12:50:53,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:53,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:50:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 12:50:54,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:50:54,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324518230] [2023-12-02 12:50:54,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324518230] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:50:54,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067037965] [2023-12-02 12:50:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:50:54,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:50:54,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:50:54,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:50:54,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 12:50:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:50:54,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 12:50:54,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:50:54,609 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-12-02 12:50:54,619 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-12-02 12:50:54,651 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 12:50:54,651 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-12-02 12:50:54,741 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 9 treesize of output 7 [2023-12-02 12:50:54,754 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-12-02 12:50:54,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:50:54,783 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-12-02 12:50:54,835 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-12-02 12:50:54,855 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 12:50:54,855 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-12-02 12:50:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 15 not checked. [2023-12-02 12:50:54,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:50:55,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067037965] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:50:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1830258385] [2023-12-02 12:50:55,101 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 12:50:55,101 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:50:55,102 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:50:55,102 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:50:55,102 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:50:57,344 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 33 for LOIs [2023-12-02 12:50:57,392 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:51:05,642 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2689#(and (or (and (exists ((|v_#valid_158| (Array Int Int))) (and (= (store |v_#valid_158| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_158| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_191| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_191| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_191| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_51| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_51| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#length_126| (Array Int Int))) (= |#length| (store |v_#length_126| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (exists ((|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#memory_int_171| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_170| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_170| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_171| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_171|) (= (store |v_#memory_int_171| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_171| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_172| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_172|) (= |#memory_int| (store |v_#memory_int_172| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_172| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_51| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_51| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_191| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_191| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_191| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))) (and (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_52| (Array Int (Array Int Int)))) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_52| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#valid_158| (Array Int Int))) (and (= (store |v_#valid_158| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_158| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_52| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_52| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_191| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_191| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_191| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#length_126| (Array Int Int))) (= |#length| (store |v_#length_126| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (exists ((|v_#memory_int_170| (Array Int (Array Int Int))) (|v_#memory_int_171| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_170| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_170| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_171| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_171|) (= (store |v_#memory_int_171| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_171| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_172| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_172|) (= |#memory_int| (store |v_#memory_int_172| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_172| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_191| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_191| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_191| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))))) (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_append_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0))' at error location [2023-12-02 12:51:05,642 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:51:05,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:51:05,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2023-12-02 12:51:05,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371144252] [2023-12-02 12:51:05,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:51:05,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 12:51:05,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:51:05,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 12:51:05,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1174, Unknown=8, NotChecked=142, Total=1482 [2023-12-02 12:51:05,644 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 20 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 12:51:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:51:06,012 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2023-12-02 12:51:06,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:51:06,013 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2023-12-02 12:51:06,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:51:06,014 INFO L225 Difference]: With dead ends: 85 [2023-12-02 12:51:06,014 INFO L226 Difference]: Without dead ends: 85 [2023-12-02 12:51:06,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=196, Invalid=1364, Unknown=8, NotChecked=154, Total=1722 [2023-12-02 12:51:06,015 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 136 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:51:06,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 220 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 344 Invalid, 0 Unknown, 160 Unchecked, 0.2s Time] [2023-12-02 12:51:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-02 12:51:06,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2023-12-02 12:51:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 70 states have internal predecessors, (76), 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-12-02 12:51:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2023-12-02 12:51:06,020 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 38 [2023-12-02 12:51:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:51:06,020 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2023-12-02 12:51:06,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 12:51:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2023-12-02 12:51:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 12:51:06,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:51:06,022 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:51:06,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 12:51:06,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:51:06,222 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:51:06,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:51:06,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1554489495, now seen corresponding path program 1 times [2023-12-02 12:51:06,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:51:06,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514228205] [2023-12-02 12:51:06,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:51:06,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:51:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:51:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 12:51:06,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:51:06,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514228205] [2023-12-02 12:51:06,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514228205] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:51:06,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696927550] [2023-12-02 12:51:06,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:51:06,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:51:06,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:51:06,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:51:06,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 12:51:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:51:06,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 12:51:07,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:51:07,009 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-12-02 12:51:07,022 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-12-02 12:51:07,029 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-12-02 12:51:07,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:51:07,058 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-12-02 12:51:07,099 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-12-02 12:51:07,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:51:07,126 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-12-02 12:51:07,169 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-12-02 12:51:07,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:51:07,197 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-12-02 12:51:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 12:51:07,203 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:51:07,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696927550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:51:07,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:51:07,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-02 12:51:07,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110994665] [2023-12-02 12:51:07,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:51:07,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:51:07,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:51:07,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:51:07,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2023-12-02 12:51:07,205 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:51:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:51:07,315 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2023-12-02 12:51:07,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:51:07,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-12-02 12:51:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:51:07,316 INFO L225 Difference]: With dead ends: 72 [2023-12-02 12:51:07,316 INFO L226 Difference]: Without dead ends: 72 [2023-12-02 12:51:07,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 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-12-02 12:51:07,317 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 20 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:51:07,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 159 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 93 Unchecked, 0.1s Time] [2023-12-02 12:51:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-02 12:51:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-12-02 12:51:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.553191489361702) internal successors, (73), 67 states have internal predecessors, (73), 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-12-02 12:51:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2023-12-02 12:51:07,322 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 38 [2023-12-02 12:51:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:51:07,322 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2023-12-02 12:51:07,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:51:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2023-12-02 12:51:07,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 12:51:07,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:51:07,324 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:51:07,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 12:51:07,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 12:51:07,525 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:51:07,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:51:07,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1459152443, now seen corresponding path program 1 times [2023-12-02 12:51:07,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:51:07,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064402685] [2023-12-02 12:51:07,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:51:07,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:51:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:51:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:51:08,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:51:08,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064402685] [2023-12-02 12:51:08,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064402685] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:51:08,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090650501] [2023-12-02 12:51:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:51:08,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:51:08,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:51:08,262 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:51:08,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 12:51:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:51:08,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 12:51:08,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:51:08,540 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-12-02 12:51:08,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 9 treesize of output 5 [2023-12-02 12:51:08,770 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-12-02 12:51:08,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:51:08,788 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-12-02 12:51:08,800 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-02 12:51:08,800 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-12-02 12:51:08,888 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-12-02 12:51:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-12-02 12:51:08,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:51:10,977 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1224 (Array Int Int)) (|v_node_create_~temp~0#1.base_54| Int)) (or (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_54| 1)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_54| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_54| v_ArrVal_1224) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) 1))) is different from false [2023-12-02 12:51:10,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090650501] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:51:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [968212001] [2023-12-02 12:51:10,982 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 12:51:10,982 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:51:10,982 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:51:10,982 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:51:10,982 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:51:12,178 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 33 for LOIs [2023-12-02 12:51:12,233 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:51:23,285 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3303#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) 0) 0))) (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_append_#in~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_dll_append_~last~0#1.base|) 1)) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) 0) |ULTIMATE.start_dll_append_~last~0#1.offset|) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) 0) |ULTIMATE.start_dll_append_~last~0#1.base|) (= |ULTIMATE.start_dll_append_#in~data#1| 1) (or (and (exists ((|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_int_199| (Array Int (Array Int Int))) (|v_#memory_int_200| (Array Int (Array Int Int)))) (and (= |v_#memory_int_199| (store |v_#memory_int_198| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_198| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_199| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_200| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_200| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))) (= (store |v_#memory_int_199| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_199| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_200| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_200|))) (exists ((|v_#valid_169| (Array Int Int))) (and (= (store |v_#valid_169| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_169| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_66| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_66| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_219| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_219| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_219| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_224| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_224| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_224| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#length_137| (Array Int Int))) (= (store |v_#length_137| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_66| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_66| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|)) (and (exists ((|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_int_199| (Array Int (Array Int Int))) (|v_#memory_int_200| (Array Int (Array Int Int)))) (and (= |v_#memory_int_199| (store |v_#memory_int_198| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_198| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_199| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_200| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_200| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))) (= (store |v_#memory_int_199| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_199| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_200| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_200|))) (exists ((|v_#valid_169| (Array Int Int))) (and (= (store |v_#valid_169| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_169| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_103| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_103| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_219| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_219| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_219| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_224| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_224| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_224| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#length_137| (Array Int Int))) (= (store |v_#length_137| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)))' at error location [2023-12-02 12:51:23,285 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:51:23,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:51:23,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2023-12-02 12:51:23,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539187139] [2023-12-02 12:51:23,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:51:23,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 12:51:23,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:51:23,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 12:51:23,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1566, Unknown=11, NotChecked=162, Total=1892 [2023-12-02 12:51:23,288 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 23 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 20 states have internal predecessors, (56), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:51:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:51:23,966 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2023-12-02 12:51:23,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 12:51:23,967 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 20 states have internal predecessors, (56), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2023-12-02 12:51:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:51:23,968 INFO L225 Difference]: With dead ends: 72 [2023-12-02 12:51:23,968 INFO L226 Difference]: Without dead ends: 72 [2023-12-02 12:51:23,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=209, Invalid=2136, Unknown=15, NotChecked=190, Total=2550 [2023-12-02 12:51:23,969 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 96 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:51:23,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 325 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 641 Invalid, 0 Unknown, 77 Unchecked, 0.4s Time] [2023-12-02 12:51:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-02 12:51:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2023-12-02 12:51:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 66 states have internal predecessors, (73), 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-12-02 12:51:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2023-12-02 12:51:23,973 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 41 [2023-12-02 12:51:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:51:23,973 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2023-12-02 12:51:23,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 20 states have internal predecessors, (56), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:51:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2023-12-02 12:51:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 12:51:23,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:51:23,975 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:51:23,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-02 12:51:24,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 12:51:24,176 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:51:24,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:51:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1459152444, now seen corresponding path program 1 times [2023-12-02 12:51:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:51:24,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14629301] [2023-12-02 12:51:24,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:51:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:51:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:51:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:51:25,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:51:25,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14629301] [2023-12-02 12:51:25,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14629301] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:51:25,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766783444] [2023-12-02 12:51:25,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:51:25,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:51:25,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:51:25,658 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:51:25,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 12:51:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:51:25,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 12:51:25,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:51:25,874 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-12-02 12:51:26,142 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-12-02 12:51:26,147 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-12-02 12:51:26,215 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-12-02 12:51:26,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:51:26,226 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-12-02 12:51:26,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:51:26,231 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-12-02 12:51:26,240 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 12:51:26,240 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-12-02 12:51:26,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:51:26,244 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-12-02 12:51:26,289 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-12-02 12:51:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-12-02 12:51:26,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:51:26,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766783444] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:51:26,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [67979857] [2023-12-02 12:51:26,549 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 12:51:26,549 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:51:26,549 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:51:26,549 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:51:26,549 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:51:28,538 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 33 for LOIs [2023-12-02 12:51:28,583 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:51:38,524 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3647#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) 0) 0))) (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (or (< (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4) 0) (< (select |#length| |ULTIMATE.start_dll_append_~last~0#1.base|) (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 8))) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) 0) |ULTIMATE.start_dll_append_~last~0#1.offset|) (or (and (exists ((|v_#memory_$Pointer$.base_251| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_251| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_251| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_148| (Array Int Int))) (= |#length| (store |v_#length_148| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_81| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_81| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_246| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_246| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_246| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_178| (Array Int Int))) (and (= (store |v_#valid_178| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_178| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_int_220| (Array Int (Array Int Int))) (|v_#memory_int_221| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_220| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_220| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_221| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_221|) (= |#memory_int| (store |v_#memory_int_222| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_222| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))) (= (store |v_#memory_int_221| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_221| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_222| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_222|))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_81| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_81| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (and (exists ((|v_#memory_$Pointer$.base_251| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_251| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_251| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_148| (Array Int Int))) (= |#length| (store |v_#length_148| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_246| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_246| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_246| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_178| (Array Int Int))) (and (= (store |v_#valid_178| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_178| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_80| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_80| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_int_220| (Array Int (Array Int Int))) (|v_#memory_int_221| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_220| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_220| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_221| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_221|) (= |#memory_int| (store |v_#memory_int_222| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_222| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))) (= (store |v_#memory_int_221| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_221| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_222| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_222|))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_131| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_131| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) 0) |ULTIMATE.start_dll_append_~last~0#1.base|) (= |ULTIMATE.start_dll_append_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)))' at error location [2023-12-02 12:51:38,525 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:51:38,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:51:38,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2023-12-02 12:51:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340877660] [2023-12-02 12:51:38,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:51:38,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 12:51:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:51:38,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 12:51:38,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1986, Unknown=8, NotChecked=90, Total=2256 [2023-12-02 12:51:38,527 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 26 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 23 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:51:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:51:39,372 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-12-02 12:51:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 12:51:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 23 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2023-12-02 12:51:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:51:39,373 INFO L225 Difference]: With dead ends: 78 [2023-12-02 12:51:39,373 INFO L226 Difference]: Without dead ends: 78 [2023-12-02 12:51:39,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=238, Invalid=2620, Unknown=8, NotChecked=104, Total=2970 [2023-12-02 12:51:39,375 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 142 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:51:39,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 360 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 567 Invalid, 0 Unknown, 80 Unchecked, 0.5s Time] [2023-12-02 12:51:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-02 12:51:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2023-12-02 12:51:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 69 states have internal predecessors, (76), 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-12-02 12:51:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-12-02 12:51:39,378 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 41 [2023-12-02 12:51:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:51:39,379 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-12-02 12:51:39,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 23 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:51:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-12-02 12:51:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 12:51:39,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:51:39,380 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:51:39,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 12:51:39,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 12:51:39,581 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:51:39,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:51:39,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2011199175, now seen corresponding path program 1 times [2023-12-02 12:51:39,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:51:39,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521727827] [2023-12-02 12:51:39,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:51:39,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:51:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:51:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 12:51:39,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:51:39,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521727827] [2023-12-02 12:51:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521727827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:51:39,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:51:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:51:39,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102593224] [2023-12-02 12:51:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:51:39,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:51:39,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:51:39,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:51:39,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:51:39,807 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:51:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:51:39,892 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2023-12-02 12:51:39,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:51:39,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2023-12-02 12:51:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:51:39,894 INFO L225 Difference]: With dead ends: 72 [2023-12-02 12:51:39,894 INFO L226 Difference]: Without dead ends: 72 [2023-12-02 12:51:39,894 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-12-02 12:51:39,895 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 102 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:51:39,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 129 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:51:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-02 12:51:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-12-02 12:51:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 67 states have internal predecessors, (74), 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-12-02 12:51:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2023-12-02 12:51:39,899 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 42 [2023-12-02 12:51:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:51:39,899 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2023-12-02 12:51:39,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:51:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2023-12-02 12:51:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 12:51:39,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:51:39,901 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:51:39,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 12:51:39,901 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:51:39,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:51:39,901 INFO L85 PathProgramCache]: Analyzing trace with hash 246464227, now seen corresponding path program 1 times [2023-12-02 12:51:39,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:51:39,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264990163] [2023-12-02 12:51:39,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:51:39,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:51:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:51:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:51:41,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:51:41,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264990163] [2023-12-02 12:51:41,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264990163] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:51:41,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717581806] [2023-12-02 12:51:41,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:51:41,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:51:41,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:51:41,799 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:51:41,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 12:51:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:51:41,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 91 conjunts are in the unsatisfiable core [2023-12-02 12:51:41,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:51:42,191 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 12:51:42,192 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 17 treesize of output 21 [2023-12-02 12:51:42,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:51:42,401 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 12:51:42,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-12-02 12:51:42,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:51:42,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 18 [2023-12-02 12:51:42,586 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-12-02 12:51:42,697 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |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|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-12-02 12:51:42,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:51:42,721 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 12:51:42,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 38 [2023-12-02 12:51:42,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:51:42,729 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 16 treesize of output 11 [2023-12-02 12:51:42,760 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-12-02 12:51:42,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2023-12-02 12:51:42,935 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-12-02 12:51:43,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:51:43,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 29 [2023-12-02 12:51:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 12:51:43,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:51:43,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717581806] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:51:43,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [339577351] [2023-12-02 12:51:43,411 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-12-02 12:51:43,411 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:51:43,412 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:51:43,412 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:51:43,412 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:51:45,396 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 33 for LOIs [2023-12-02 12:51:45,442 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:51:54,723 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4185#(and (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_append_#in~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_dll_append_~last~0#1.base|) 1)) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_append_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 12:51:54,723 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:51:54,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:51:54,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 40 [2023-12-02 12:51:54,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815195536] [2023-12-02 12:51:54,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:51:54,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 12:51:54,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:51:54,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 12:51:54,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=3642, Unknown=5, NotChecked=122, Total=4032 [2023-12-02 12:51:54,726 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 41 states, 33 states have (on average 2.212121212121212) internal successors, (73), 36 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 12:51:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:51:56,327 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-12-02 12:51:56,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 12:51:56,328 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 2.212121212121212) internal successors, (73), 36 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2023-12-02 12:51:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:51:56,329 INFO L225 Difference]: With dead ends: 81 [2023-12-02 12:51:56,329 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 12:51:56,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1750 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=407, Invalid=5142, Unknown=5, NotChecked=146, Total=5700 [2023-12-02 12:51:56,331 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 107 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:51:56,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 569 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1198 Invalid, 0 Unknown, 89 Unchecked, 1.0s Time] [2023-12-02 12:51:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 12:51:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2023-12-02 12:51:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 68 states have internal predecessors, (76), 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-12-02 12:51:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2023-12-02 12:51:56,333 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 44 [2023-12-02 12:51:56,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:51:56,333 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2023-12-02 12:51:56,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 2.212121212121212) internal successors, (73), 36 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 12:51:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2023-12-02 12:51:56,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 12:51:56,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:51:56,334 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:51:56,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-02 12:51:56,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 12:51:56,535 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:51:56,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:51:56,535 INFO L85 PathProgramCache]: Analyzing trace with hash 246464228, now seen corresponding path program 1 times [2023-12-02 12:51:56,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:51:56,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952887596] [2023-12-02 12:51:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:51:56,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:51:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:51:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:51:59,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:51:59,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952887596] [2023-12-02 12:51:59,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952887596] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:51:59,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65934544] [2023-12-02 12:51:59,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:51:59,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:51:59,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:51:59,493 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:51:59,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 12:51:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:51:59,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 108 conjunts are in the unsatisfiable core [2023-12-02 12:51:59,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:52:00,082 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 12:52:00,082 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 17 treesize of output 21 [2023-12-02 12:52:00,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:52:00,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:52:00,371 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 12:52:00,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2023-12-02 12:52:00,381 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 24 treesize of output 11 [2023-12-02 12:52:00,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:52:00,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2023-12-02 12:52:00,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 12:52:00,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:52:00,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 12:52:00,834 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-12-02 12:52:00,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:52:00,857 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 12:52:00,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 54 [2023-12-02 12:52:00,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:52:00,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2023-12-02 12:52:00,906 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 12:52:00,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 12:52:00,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:52:00,915 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 12:52:00,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2023-12-02 12:52:01,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:52:01,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2023-12-02 12:52:01,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:52:01,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 12:52:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 12:52:01,138 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:52:01,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65934544] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:52:01,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1641711091] [2023-12-02 12:52:01,557 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-12-02 12:52:01,557 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:52:01,557 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:52:01,558 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:52:01,558 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:52:03,518 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 33 for LOIs [2023-12-02 12:52:03,583 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:52:13,177 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4591#(and (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (or (< (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4) 0) (< (select |#length| |ULTIMATE.start_dll_append_~last~0#1.base|) (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 8))) (<= 2 |ULTIMATE.start_dll_append_#in~head#1.base|) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_append_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 12:52:13,177 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:52:13,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:52:13,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 47 [2023-12-02 12:52:13,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277812612] [2023-12-02 12:52:13,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:52:13,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-02 12:52:13,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:52:13,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-02 12:52:13,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=4675, Unknown=12, NotChecked=138, Total=5112 [2023-12-02 12:52:13,181 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 48 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 40 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 12:52:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:52:15,645 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2023-12-02 12:52:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 12:52:15,646 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 40 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2023-12-02 12:52:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:52:15,647 INFO L225 Difference]: With dead ends: 86 [2023-12-02 12:52:15,647 INFO L226 Difference]: Without dead ends: 86 [2023-12-02 12:52:15,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2430 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=547, Invalid=7452, Unknown=15, NotChecked=176, Total=8190 [2023-12-02 12:52:15,649 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 212 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:52:15,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 652 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1373 Invalid, 0 Unknown, 95 Unchecked, 1.1s Time] [2023-12-02 12:52:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-02 12:52:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2023-12-02 12:52:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 70 states have internal predecessors, (78), 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-12-02 12:52:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-12-02 12:52:15,652 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 44 [2023-12-02 12:52:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:52:15,652 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-12-02 12:52:15,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 40 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 12:52:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-12-02 12:52:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 12:52:15,653 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:52:15,653 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:52:15,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 12:52:15,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 12:52:15,854 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:52:15,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:52:15,854 INFO L85 PathProgramCache]: Analyzing trace with hash 246458696, now seen corresponding path program 1 times [2023-12-02 12:52:15,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:52:15,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078466226] [2023-12-02 12:52:15,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:52:15,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:52:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:52:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 12:52:15,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:52:15,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078466226] [2023-12-02 12:52:15,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078466226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:52:15,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:52:15,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:52:15,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023042128] [2023-12-02 12:52:15,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:52:15,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:52:15,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:52:15,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:52:15,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:52:15,977 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-12-02 12:52:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:52:16,083 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2023-12-02 12:52:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:52:16,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 44 [2023-12-02 12:52:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:52:16,085 INFO L225 Difference]: With dead ends: 74 [2023-12-02 12:52:16,085 INFO L226 Difference]: Without dead ends: 74 [2023-12-02 12:52:16,085 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-12-02 12:52:16,085 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:52:16,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 159 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:52:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-02 12:52:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-12-02 12:52:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 69 states have internal predecessors, (77), 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-12-02 12:52:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-12-02 12:52:16,089 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 44 [2023-12-02 12:52:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:52:16,090 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-12-02 12:52:16,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-12-02 12:52:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2023-12-02 12:52:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 12:52:16,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:52:16,091 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:52:16,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 12:52:16,091 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:52:16,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:52:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash 246458697, now seen corresponding path program 1 times [2023-12-02 12:52:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:52:16,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894029039] [2023-12-02 12:52:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:52:16,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:52:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:52:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 12:52:16,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:52:16,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894029039] [2023-12-02 12:52:16,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894029039] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:52:16,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:52:16,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:52:16,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252392316] [2023-12-02 12:52:16,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:52:16,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:52:16,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:52:16,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:52:16,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:52:16,314 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-12-02 12:52:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:52:16,446 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2023-12-02 12:52:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:52:16,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 44 [2023-12-02 12:52:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:52:16,447 INFO L225 Difference]: With dead ends: 73 [2023-12-02 12:52:16,447 INFO L226 Difference]: Without dead ends: 73 [2023-12-02 12:52:16,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:52:16,448 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:52:16,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 204 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:52:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-02 12:52:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-12-02 12:52:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 68 states have internal predecessors, (76), 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-12-02 12:52:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2023-12-02 12:52:16,452 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 44 [2023-12-02 12:52:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:52:16,452 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2023-12-02 12:52:16,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-12-02 12:52:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2023-12-02 12:52:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 12:52:16,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:52:16,453 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:52:16,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 12:52:16,454 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:52:16,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:52:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash -27025857, now seen corresponding path program 1 times [2023-12-02 12:52:16,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:52:16,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856752840] [2023-12-02 12:52:16,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:52:16,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:52:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:52:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 12:52:16,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:52:16,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856752840] [2023-12-02 12:52:16,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856752840] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:52:16,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:52:16,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 12:52:16,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260438193] [2023-12-02 12:52:16,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:52:16,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 12:52:16,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:52:16,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 12:52:16,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 12:52:16,910 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:52:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:52:17,110 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2023-12-02 12:52:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 12:52:17,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2023-12-02 12:52:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:52:17,112 INFO L225 Difference]: With dead ends: 123 [2023-12-02 12:52:17,112 INFO L226 Difference]: Without dead ends: 123 [2023-12-02 12:52:17,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-02 12:52:17,113 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 102 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:52:17,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 206 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:52:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-02 12:52:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 79. [2023-12-02 12:52:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 74 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 12:52:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2023-12-02 12:52:17,117 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 44 [2023-12-02 12:52:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:52:17,117 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2023-12-02 12:52:17,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:52:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2023-12-02 12:52:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 12:52:17,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:52:17,118 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:52:17,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 12:52:17,119 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:52:17,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:52:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash -27025858, now seen corresponding path program 1 times [2023-12-02 12:52:17,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:52:17,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929034980] [2023-12-02 12:52:17,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:52:17,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:52:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:52:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 12:52:17,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:52:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929034980] [2023-12-02 12:52:17,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929034980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:52:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:52:17,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 12:52:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601361162] [2023-12-02 12:52:17,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:52:17,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 12:52:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:52:17,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 12:52:17,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 12:52:17,377 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 9 states, 6 states have (on average 4.333333333333333) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:52:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:52:17,552 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2023-12-02 12:52:17,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 12:52:17,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.333333333333333) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2023-12-02 12:52:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:52:17,554 INFO L225 Difference]: With dead ends: 121 [2023-12-02 12:52:17,554 INFO L226 Difference]: Without dead ends: 121 [2023-12-02 12:52:17,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-02 12:52:17,555 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 83 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:52:17,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 248 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:52:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-02 12:52:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 78. [2023-12-02 12:52:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 73 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-12-02 12:52:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-12-02 12:52:17,560 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 44 [2023-12-02 12:52:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:52:17,560 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-12-02 12:52:17,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.333333333333333) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:52:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-12-02 12:52:17,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 12:52:17,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:52:17,561 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:52:17,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-02 12:52:17,561 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:52:17,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:52:17,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1978251973, now seen corresponding path program 2 times [2023-12-02 12:52:17,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:52:17,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409436953] [2023-12-02 12:52:17,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:52:17,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:52:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:52:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 12:52:20,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:52:20,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409436953] [2023-12-02 12:52:20,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409436953] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:52:20,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857367006] [2023-12-02 12:52:20,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 12:52:20,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:52:20,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:52:20,725 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:52:20,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 12:52:21,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 12:52:21,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:52:21,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 132 conjunts are in the unsatisfiable core [2023-12-02 12:52:21,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:52:21,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:52:21,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:52:21,709 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 12:52:21,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 12:52:21,724 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 12:52:21,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 12:52:21,739 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 12:52:21,739 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-12-02 12:52:21,893 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 16 treesize of output 11 [2023-12-02 12:52:21,903 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 16 treesize of output 11 [2023-12-02 12:52:21,985 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 19 treesize of output 18 [2023-12-02 12:52:21,995 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 19 treesize of output 18 [2023-12-02 12:52:22,105 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 12:52:22,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 55 [2023-12-02 12:52:22,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2023-12-02 12:52:22,435 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 12:52:22,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 48 [2023-12-02 12:52:22,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:52:22,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:52:22,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 12:52:22,617 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |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-12-02 12:52:22,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:52:22,657 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 12:52:22,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 87 [2023-12-02 12:52:22,684 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 12:52:22,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 12:52:22,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:52:22,695 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 12:52:22,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 48 [2023-12-02 12:52:23,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:52:23,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 16 [2023-12-02 12:52:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-02 12:52:23,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:52:23,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857367006] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:52:23,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [215854037] [2023-12-02 12:52:23,883 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-12-02 12:52:23,884 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:52:23,884 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:52:23,884 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:52:23,884 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:52:25,169 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 33 for LOIs [2023-12-02 12:52:25,217 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:52:35,571 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5783#(and (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_append_#in~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_dll_append_~last~0#1.base|) 1)) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_append_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 12:52:35,571 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:52:35,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:52:35,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 52 [2023-12-02 12:52:35,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147995972] [2023-12-02 12:52:35,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:52:35,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-02 12:52:35,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:52:35,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-02 12:52:35,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=5562, Unknown=13, NotChecked=150, Total=6006 [2023-12-02 12:52:35,576 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 52 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 46 states have internal predecessors, (76), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 12:52:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:52:38,221 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2023-12-02 12:52:38,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 12:52:38,222 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 46 states have internal predecessors, (76), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2023-12-02 12:52:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:52:38,224 INFO L225 Difference]: With dead ends: 100 [2023-12-02 12:52:38,224 INFO L226 Difference]: Without dead ends: 100 [2023-12-02 12:52:38,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2358 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=434, Invalid=8112, Unknown=14, NotChecked=182, Total=8742 [2023-12-02 12:52:38,228 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 29 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:52:38,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1029 Invalid, 1787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1670 Invalid, 0 Unknown, 99 Unchecked, 1.4s Time] [2023-12-02 12:52:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-02 12:52:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2023-12-02 12:52:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 89 states have internal predecessors, (102), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 12:52:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2023-12-02 12:52:38,232 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 47 [2023-12-02 12:52:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:52:38,232 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2023-12-02 12:52:38,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 46 states have internal predecessors, (76), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 12:52:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2023-12-02 12:52:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 12:52:38,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:52:38,233 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:52:38,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 12:52:38,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-02 12:52:38,434 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:52:38,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:52:38,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1874453531, now seen corresponding path program 1 times [2023-12-02 12:52:38,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:52:38,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478553796] [2023-12-02 12:52:38,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:52:38,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:52:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:52:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 12:52:38,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:52:38,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478553796] [2023-12-02 12:52:38,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478553796] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:52:38,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:52:38,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:52:38,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124258982] [2023-12-02 12:52:38,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:52:38,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:52:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:52:38,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:52:38,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:52:38,525 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 12:52:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:52:38,553 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2023-12-02 12:52:38,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:52:38,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2023-12-02 12:52:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:52:38,554 INFO L225 Difference]: With dead ends: 108 [2023-12-02 12:52:38,554 INFO L226 Difference]: Without dead ends: 108 [2023-12-02 12:52:38,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:52:38,554 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 62 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:52:38,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 98 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:52:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-02 12:52:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2023-12-02 12:52:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 91 states have internal predecessors, (105), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 12:52:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2023-12-02 12:52:38,559 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 47 [2023-12-02 12:52:38,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:52:38,559 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2023-12-02 12:52:38,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 12:52:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2023-12-02 12:52:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 12:52:38,560 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:52:38,560 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:52:38,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 12:52:38,560 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:52:38,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:52:38,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1874557882, now seen corresponding path program 1 times [2023-12-02 12:52:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:52:38,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705856827] [2023-12-02 12:52:38,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:52:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:52:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:52:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 12:52:38,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:52:38,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705856827] [2023-12-02 12:52:38,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705856827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:52:38,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:52:38,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 12:52:38,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512358926] [2023-12-02 12:52:38,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:52:38,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 12:52:38,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:52:38,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 12:52:38,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 12:52:38,732 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:52:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:52:38,843 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2023-12-02 12:52:38,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 12:52:38,843 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2023-12-02 12:52:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:52:38,844 INFO L225 Difference]: With dead ends: 125 [2023-12-02 12:52:38,844 INFO L226 Difference]: Without dead ends: 125 [2023-12-02 12:52:38,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-02 12:52:38,845 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 68 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:52:38,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 271 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:52:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-12-02 12:52:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 98. [2023-12-02 12:52:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 91 states have internal predecessors, (104), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 12:52:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2023-12-02 12:52:38,849 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 47 [2023-12-02 12:52:38,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:52:38,850 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2023-12-02 12:52:38,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:52:38,850 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2023-12-02 12:52:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 12:52:38,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:52:38,851 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:52:38,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-02 12:52:38,851 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:52:38,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:52:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1909084996, now seen corresponding path program 1 times [2023-12-02 12:52:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:52:38,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276123676] [2023-12-02 12:52:38,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:52:38,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:52:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:52:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:52:40,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:52:40,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276123676] [2023-12-02 12:52:40,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276123676] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:52:40,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648109148] [2023-12-02 12:52:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:52:40,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:52:40,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:52:40,043 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:52:40,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 12:52:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:52:40,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-02 12:52:40,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:52:40,540 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-12-02 12:52:40,543 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-12-02 12:52:40,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:52:40,638 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 16 treesize of output 11 [2023-12-02 12:52:40,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:52:40,649 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-12-02 12:52:40,926 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 12:52:40,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2023-12-02 12:52:40,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:52:40,931 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 24 treesize of output 11 [2023-12-02 12:52:40,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:52:40,992 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-12-02 12:52:40,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:52:40,998 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 16 treesize of output 11 [2023-12-02 12:52:41,054 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 26 treesize of output 14 [2023-12-02 12:52:41,058 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-12-02 12:52:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:52:41,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:52:41,162 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2965 (Array Int Int)) (v_ArrVal_2964 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2964) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2965) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2964 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2964) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-02 12:52:41,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:52:41,295 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 49 treesize of output 53 [2023-12-02 12:52:41,328 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_10) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_2965 (Array Int Int)) (v_ArrVal_2963 (Array Int Int))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2963) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2965) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_2964 (Array Int Int)) (v_ArrVal_2962 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2962) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2964) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ 5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) is different from false [2023-12-02 12:52:41,474 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (forall ((v_ArrVal_2965 (Array Int Int)) (v_ArrVal_2963 (Array Int Int))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2963) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2965) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_2964 (Array Int Int)) (v_ArrVal_2962 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2962) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2964) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ 5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_11) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_prenex_10) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-02 12:52:42,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648109148] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:52:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [12826547] [2023-12-02 12:52:42,087 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 12:52:42,087 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:52:42,087 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:52:42,087 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:52:42,087 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:52:43,488 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 33 for LOIs [2023-12-02 12:52:43,537 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:52:55,196 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_#t~mem8#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_append_#in~data#1| 1) (<= 2 |c_ULTIMATE.start_dll_append_~head#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 4 (select |c_#length| |c_ULTIMATE.start_dll_append_~head#1.base|)) (<= 2 |c_ULTIMATE.start_dll_append_#in~head#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~head#1.base|) 1) (= |c_ULTIMATE.start_dll_append_#in~head#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) 0)) (let ((.cse0 (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0))) (.cse1 (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (.cse2 (exists ((|v_#memory_$Pointer$.base_392| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_392| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_392| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |c_#memory_$Pointer$.base|))) (.cse3 (= |c_ULTIMATE.start_dll_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (exists ((|v_#memory_int_328| (Array Int (Array Int Int))) (|v_#memory_int_329| (Array Int (Array Int Int))) (|v_#memory_int_330| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_#memory_int_329| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse12 (select |v_#memory_int_330| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (and (= |v_#memory_int_330| (store |v_#memory_int_329| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store .cse11 8 (select .cse12 8)))) (= (store |v_#memory_int_328| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_328| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select .cse11 4))) |v_#memory_int_329|) (= (store |v_#memory_int_330| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store .cse12 0 1)) |c_#memory_int|))))) (.cse5 (= |c_ULTIMATE.start_dll_append_#in~head#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse6 (exists ((|v_#length_179| (Array Int Int))) (= (store |v_#length_179| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |c_#length|))) (.cse7 (<= (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse8 (exists ((|v_#memory_$Pointer$.offset_385| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_385| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_385| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |c_#memory_$Pointer$.offset|))) (.cse9 (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 1)) (.cse10 (exists ((|v_#valid_216| (Array Int Int))) (and (= (select |v_#valid_216| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_216| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 1)))))) (or (and .cse0 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_132| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_132| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_132| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_132| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) |c_ULTIMATE.start_dll_create_#res#1.base|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_133| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_133| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) |c_ULTIMATE.start_dll_create_#res#1.base|)) .cse6 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_133| (Array Int (Array Int Int)))) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_133| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) .cse7 .cse8 .cse9 .cse10))) (= |c_ULTIMATE.start_dll_append_~data#1| 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-12-02 12:53:41,327 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6700#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.base_405| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~head#1.base_23| Int) (|v_#memory_int_342| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#memory_int_341| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_398| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_#in~head#1.base_11| Int)) (and (<= 0 (+ 4 (select (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0))) (or (and (exists ((|v_#valid_216| (Array Int Int))) (and (= (select |v_#valid_216| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 0) (= (store |v_#valid_216| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| 1) |#valid|))) (not (= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_132| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_132| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#length_179| (Array Int Int))) (= (store |v_#length_179| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_392| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_392| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (store (store (select |v_#memory_$Pointer$.base_392| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 0))) |v_#memory_$Pointer$.base_405|)) (<= (+ |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| 1) |#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_132| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_132| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_328| (Array Int (Array Int Int))) (|v_#memory_int_329| (Array Int (Array Int Int))) (|v_#memory_int_330| (Array Int (Array Int Int)))) (and (= |v_#memory_int_341| (store |v_#memory_int_330| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select |v_#memory_int_330| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 0 1))) (= (store |v_#memory_int_328| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select |v_#memory_int_328| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 4 (select (select |v_#memory_int_329| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 4))) |v_#memory_int_329|) (= (store |v_#memory_int_329| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select |v_#memory_int_329| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8 (select (select |v_#memory_int_330| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8))) |v_#memory_int_330|))) (exists ((|v_#memory_$Pointer$.offset_385| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_385| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (store (store (select |v_#memory_$Pointer$.offset_385| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 0))) |v_#memory_$Pointer$.offset_398|)) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_11| |v_ULTIMATE.start_dll_append_~head#1.base_23|)) (and (exists ((|v_#valid_216| (Array Int Int))) (and (= (select |v_#valid_216| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 0) (= (store |v_#valid_216| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| 1) |#valid|))) (not (= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_133| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_133| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#length_179| (Array Int Int))) (= (store |v_#length_179| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_392| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_392| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (store (store (select |v_#memory_$Pointer$.base_392| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 0))) |v_#memory_$Pointer$.base_405|)) (<= (+ |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| 1) |#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_133| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_133| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_328| (Array Int (Array Int Int))) (|v_#memory_int_329| (Array Int (Array Int Int))) (|v_#memory_int_330| (Array Int (Array Int Int)))) (and (= |v_#memory_int_341| (store |v_#memory_int_330| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select |v_#memory_int_330| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 0 1))) (= (store |v_#memory_int_328| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select |v_#memory_int_328| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 4 (select (select |v_#memory_int_329| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 4))) |v_#memory_int_329|) (= (store |v_#memory_int_329| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select |v_#memory_int_329| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8 (select (select |v_#memory_int_330| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8))) |v_#memory_int_330|))) (exists ((|v_#memory_$Pointer$.offset_385| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_385| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (store (store (select |v_#memory_$Pointer$.offset_385| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 0))) |v_#memory_$Pointer$.offset_398|)) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_11| |v_ULTIMATE.start_dll_append_~head#1.base_23|))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_398| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0) (store (select |v_#memory_$Pointer$.offset_398| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select (store |v_#memory_$Pointer$.offset_398| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0) (store (select |v_#memory_$Pointer$.offset_398| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8 (select (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)))) (= (store (store |v_#memory_$Pointer$.base_405| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0) (store (select |v_#memory_$Pointer$.base_405| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select (store |v_#memory_$Pointer$.base_405| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0) (store (select |v_#memory_$Pointer$.base_405| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8 (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0))) |#memory_$Pointer$.base|) (= (store |v_#memory_int_341| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0) (store (select |v_#memory_int_341| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) (select (select |v_#memory_int_342| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0))))) |v_#memory_int_342|) (= (select (select |v_#memory_$Pointer$.offset_398| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0))) 0) (= |#memory_int| (store |v_#memory_int_342| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select |v_#memory_int_342| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) 1) (= (select (select |v_#memory_$Pointer$.base_405| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0))) 0) (<= (+ 8 (select (select |v_#memory_$Pointer$.offset_398| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0)) (select |#length| (select (select |v_#memory_$Pointer$.base_405| |v_ULTIMATE.start_dll_append_~head#1.base_23|) 0))))) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 1) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 12:53:41,327 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:53:41,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:53:41,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 31 [2023-12-02 12:53:41,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427717991] [2023-12-02 12:53:41,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:53:41,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 12:53:41,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:53:41,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 12:53:41,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3524, Unknown=60, NotChecked=492, Total=4290 [2023-12-02 12:53:41,329 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 32 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 27 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:53:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:53:43,291 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2023-12-02 12:53:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 12:53:43,291 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 27 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2023-12-02 12:53:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:53:43,293 INFO L225 Difference]: With dead ends: 135 [2023-12-02 12:53:43,293 INFO L226 Difference]: Without dead ends: 135 [2023-12-02 12:53:43,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 60.6s TimeCoverageRelationStatistics Valid=344, Invalid=5013, Unknown=61, NotChecked=588, Total=6006 [2023-12-02 12:53:43,294 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 285 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:53:43,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 696 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 12:53:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-02 12:53:43,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 104. [2023-12-02 12:53:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 97 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 12:53:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 122 transitions. [2023-12-02 12:53:43,298 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 122 transitions. Word has length 48 [2023-12-02 12:53:43,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:53:43,299 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 122 transitions. [2023-12-02 12:53:43,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 27 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:53:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 122 transitions. [2023-12-02 12:53:43,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 12:53:43,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:53:43,300 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:53:43,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 12:53:43,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 12:53:43,500 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:53:43,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:53:43,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1909084997, now seen corresponding path program 1 times [2023-12-02 12:53:43,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:53:43,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459266877] [2023-12-02 12:53:43,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:53:43,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:53:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:53:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:53:44,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:53:44,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459266877] [2023-12-02 12:53:44,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459266877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:53:44,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:53:44,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-02 12:53:44,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317897541] [2023-12-02 12:53:44,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:53:44,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 12:53:44,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:53:44,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 12:53:44,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2023-12-02 12:53:44,228 INFO L87 Difference]: Start difference. First operand 104 states and 122 transitions. Second operand has 20 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 12:53:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:53:45,145 INFO L93 Difference]: Finished difference Result 138 states and 157 transitions. [2023-12-02 12:53:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 12:53:45,145 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2023-12-02 12:53:45,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:53:45,147 INFO L225 Difference]: With dead ends: 138 [2023-12-02 12:53:45,147 INFO L226 Difference]: Without dead ends: 138 [2023-12-02 12:53:45,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2023-12-02 12:53:45,148 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 145 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 12:53:45,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 538 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 12:53:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-02 12:53:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 103. [2023-12-02 12:53:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 96 states have internal predecessors, (110), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 12:53:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2023-12-02 12:53:45,152 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 48 [2023-12-02 12:53:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:53:45,152 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2023-12-02 12:53:45,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 12:53:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2023-12-02 12:53:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 12:53:45,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:53:45,153 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:53:45,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-02 12:53:45,154 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:53:45,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:53:45,154 INFO L85 PathProgramCache]: Analyzing trace with hash -890282007, now seen corresponding path program 1 times [2023-12-02 12:53:45,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:53:45,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733007782] [2023-12-02 12:53:45,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:53:45,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:53:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:53:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:53:45,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:53:45,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733007782] [2023-12-02 12:53:45,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733007782] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:53:45,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574522682] [2023-12-02 12:53:45,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:53:45,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:53:45,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:53:45,582 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:53:45,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 12:53:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:53:45,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-02 12:53:45,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:53:46,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:53:46,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:53:46,225 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 20 treesize of output 15 [2023-12-02 12:53:46,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:53:46,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 12:53:46,320 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 28 treesize of output 16 [2023-12-02 12:53:46,325 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-12-02 12:53:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 12:53:46,413 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:53:46,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574522682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:53:46,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:53:46,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 24 [2023-12-02 12:53:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350822202] [2023-12-02 12:53:46,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:53:46,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 12:53:46,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:53:46,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 12:53:46,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2023-12-02 12:53:46,416 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:53:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:53:47,070 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2023-12-02 12:53:47,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 12:53:47,070 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2023-12-02 12:53:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:53:47,071 INFO L225 Difference]: With dead ends: 129 [2023-12-02 12:53:47,071 INFO L226 Difference]: Without dead ends: 129 [2023-12-02 12:53:47,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2023-12-02 12:53:47,072 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 123 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:53:47,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 317 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 12:53:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-02 12:53:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2023-12-02 12:53:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 98 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 12:53:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2023-12-02 12:53:47,076 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 48 [2023-12-02 12:53:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:53:47,076 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2023-12-02 12:53:47,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:53:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2023-12-02 12:53:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 12:53:47,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:53:47,077 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:53:47,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 12:53:47,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:53:47,278 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:53:47,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:53:47,278 INFO L85 PathProgramCache]: Analyzing trace with hash -890187633, now seen corresponding path program 1 times [2023-12-02 12:53:47,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:53:47,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158173898] [2023-12-02 12:53:47,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:53:47,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:53:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:53:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 12:53:47,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:53:47,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158173898] [2023-12-02 12:53:47,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158173898] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:53:47,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51970227] [2023-12-02 12:53:47,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:53:47,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:53:47,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:53:47,655 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:53:47,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 12:53:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:53:47,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 12:53:47,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:53:48,121 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 8 treesize of output 4 [2023-12-02 12:53:48,154 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-12-02 12:53:48,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:53:48,164 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 17 treesize of output 12 [2023-12-02 12:53:48,198 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 16 treesize of output 8 [2023-12-02 12:53:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2023-12-02 12:53:48,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:53:48,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51970227] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:53:48,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1864215790] [2023-12-02 12:53:48,350 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-12-02 12:53:48,350 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:53:48,350 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:53:48,350 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:53:48,350 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:53:50,648 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 33 for LOIs [2023-12-02 12:53:50,696 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:54:12,208 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7890#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (or (< |ULTIMATE.start_main_~ptr~0#1.offset| 0) (< (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= 1 |#StackHeapBarrier|) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 12:54:12,208 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:54:12,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:54:12,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2023-12-02 12:54:12,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411476558] [2023-12-02 12:54:12,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:54:12,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 12:54:12,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:54:12,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 12:54:12,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2078, Unknown=18, NotChecked=92, Total=2352 [2023-12-02 12:54:12,210 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 20 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:54:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:54:12,893 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2023-12-02 12:54:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 12:54:12,893 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 20 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2023-12-02 12:54:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:54:12,894 INFO L225 Difference]: With dead ends: 99 [2023-12-02 12:54:12,894 INFO L226 Difference]: Without dead ends: 99 [2023-12-02 12:54:12,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=229, Invalid=2725, Unknown=20, NotChecked=106, Total=3080 [2023-12-02 12:54:12,895 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 75 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:54:12,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 479 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 493 Invalid, 0 Unknown, 68 Unchecked, 0.4s Time] [2023-12-02 12:54:12,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-02 12:54:12,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-02 12:54:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 92 states have internal predecessors, (104), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 12:54:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2023-12-02 12:54:12,898 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 48 [2023-12-02 12:54:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:54:12,898 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2023-12-02 12:54:12,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 20 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:54:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2023-12-02 12:54:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-02 12:54:12,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:54:12,899 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:54:12,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-02 12:54:13,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:54:13,100 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:54:13,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:54:13,100 INFO L85 PathProgramCache]: Analyzing trace with hash 876627732, now seen corresponding path program 1 times [2023-12-02 12:54:13,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:54:13,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087904692] [2023-12-02 12:54:13,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:54:13,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:54:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:54:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:54:15,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:54:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087904692] [2023-12-02 12:54:15,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087904692] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:54:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785480719] [2023-12-02 12:54:15,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:54:15,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:54:15,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:54:15,457 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:54:15,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 12:54:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:54:15,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 88 conjunts are in the unsatisfiable core [2023-12-02 12:54:15,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:54:15,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 12:54:15,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 12:54:16,361 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 27 treesize of output 15 [2023-12-02 12:54:16,365 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-12-02 12:54:16,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:54:16,548 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 16 treesize of output 11 [2023-12-02 12:54:16,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:54:16,561 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 35 treesize of output 26 [2023-12-02 12:54:16,572 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 12:54:16,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-02 12:54:16,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2023-12-02 12:54:17,296 INFO L349 Elim1Store]: treesize reduction 37, result has 33.9 percent of original size [2023-12-02 12:54:17,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 35 [2023-12-02 12:54:17,312 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2023-12-02 12:54:17,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 12:54:17,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:54:17,334 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 34 treesize of output 25 [2023-12-02 12:54:17,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:54:17,344 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-12-02 12:54:17,419 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 25 treesize of output 13 [2023-12-02 12:54:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:54:17,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:54:19,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785480719] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:54:19,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2112706276] [2023-12-02 12:54:19,823 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-12-02 12:54:19,823 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:54:19,823 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:54:19,823 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:54:19,824 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:54:24,211 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 247 for LOIs [2023-12-02 12:54:25,711 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:54:53,997 WARN L293 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 288 DAG size of output: 274 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:55:13,467 WARN L293 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 296 DAG size of output: 282 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:55:35,833 WARN L293 SmtUtils]: Spent 8.78s on a formula simplification. DAG size of input: 310 DAG size of output: 296 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:56:16,248 WARN L293 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 251 DAG size of output: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:56:36,845 WARN L293 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 251 DAG size of output: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:56:57,721 WARN L293 SmtUtils]: Spent 7.64s on a formula simplification. DAG size of input: 265 DAG size of output: 257 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:57:20,526 WARN L293 SmtUtils]: Spent 7.54s on a formula simplification. DAG size of input: 266 DAG size of output: 258 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:57:59,207 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8375#(and (or (< |ULTIMATE.start_main_~ptr~0#1.offset| 0) (< (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~count~0#1| 0) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_34| Int) (|v_#memory_int_397| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_460| (Array Int (Array Int Int))) (|v_#memory_int_398| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_472| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_460| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) (store (select |v_#memory_$Pointer$.offset_460| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34| (store (select (store |v_#memory_$Pointer$.offset_460| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) (store (select |v_#memory_$Pointer$.offset_460| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8)))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) 4)) (= (select (select |v_#memory_$Pointer$.offset_460| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) 4)) 0) (= |#memory_int| (store |v_#memory_int_398| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34| (store (select |v_#memory_int_398| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8)))) (= (store |v_#memory_int_397| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) (store (select |v_#memory_int_397| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) 4) (select (select |v_#memory_int_398| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) 4)))) |v_#memory_int_398|) (= (store (store |v_#memory_$Pointer$.base_472| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) (store (select |v_#memory_$Pointer$.base_472| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34| (store (select (store |v_#memory_$Pointer$.base_472| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) (store (select |v_#memory_$Pointer$.base_472| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8))) |#memory_$Pointer$.base|) (<= 12 (select |#length| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8)) 1) (= (select (select |v_#memory_$Pointer$.base_472| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) 4)) 0) (= (select |#valid| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8) 8) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_34|) 8))))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))' at error location [2023-12-02 12:57:59,207 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:57:59,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:57:59,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 40 [2023-12-02 12:57:59,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312860328] [2023-12-02 12:57:59,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:57:59,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 12:57:59,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:57:59,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 12:57:59,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=5830, Unknown=21, NotChecked=0, Total=6162 [2023-12-02 12:57:59,209 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 41 states, 34 states have (on average 2.323529411764706) internal successors, (79), 36 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:58:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:04,016 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2023-12-02 12:58:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 12:58:04,016 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 2.323529411764706) internal successors, (79), 36 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-12-02 12:58:04,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:04,017 INFO L225 Difference]: With dead ends: 106 [2023-12-02 12:58:04,017 INFO L226 Difference]: Without dead ends: 106 [2023-12-02 12:58:04,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2403 ImplicationChecksByTransitivity, 220.9s TimeCoverageRelationStatistics Valid=677, Invalid=9001, Unknown=24, NotChecked=0, Total=9702 [2023-12-02 12:58:04,019 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 265 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:04,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 456 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 12:58:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-02 12:58:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2023-12-02 12:58:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 92 states have internal predecessors, (103), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 12:58:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2023-12-02 12:58:04,023 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 51 [2023-12-02 12:58:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:04,023 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2023-12-02 12:58:04,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 2.323529411764706) internal successors, (79), 36 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:58:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2023-12-02 12:58:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-02 12:58:04,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:04,025 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:58:04,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 12:58:04,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 12:58:04,225 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 12:58:04,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash 876627731, now seen corresponding path program 1 times [2023-12-02 12:58:04,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:04,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989537624] [2023-12-02 12:58:04,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:04,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:05,886 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:58:05,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:05,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989537624] [2023-12-02 12:58:05,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989537624] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:58:05,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988892792] [2023-12-02 12:58:05,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:05,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:05,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:05,887 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:58:05,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 12:58:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:06,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 94 conjunts are in the unsatisfiable core [2023-12-02 12:58:06,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:06,202 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-12-02 12:58:06,576 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-12-02 12:58:06,776 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 12:58:06,777 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 17 treesize of output 21 [2023-12-02 12:58:06,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 12:58:07,144 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 12:58:07,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2023-12-02 12:58:07,553 INFO L349 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2023-12-02 12:58:07,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 38 [2023-12-02 12:58:07,559 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 15 treesize of output 11 [2023-12-02 12:58:07,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:58:08,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:58:08,042 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 12:58:08,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 63 [2023-12-02 12:58:08,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:58:08,049 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 69 treesize of output 60 [2023-12-02 12:58:08,106 INFO L349 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2023-12-02 12:58:08,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 64 [2023-12-02 12:58:08,531 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 86 treesize of output 66 [2023-12-02 12:58:09,012 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-12-02 12:58:09,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 83 [2023-12-02 12:58:09,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:58:09,204 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 12:58:09,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 65 [2023-12-02 12:58:09,387 INFO L349 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2023-12-02 12:58:09,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 37 [2023-12-02 12:58:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:09,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:09,513 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3940 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3940) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-12-02 12:58:11,804 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3940 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) v_ArrVal_3939) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3940) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-02 12:58:18,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988892792] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:58:18,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1470595693] [2023-12-02 12:58:18,650 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-12-02 12:58:18,650 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:58:18,650 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:58:18,651 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:58:18,651 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:58:22,539 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 247 for LOIs [2023-12-02 12:58:24,121 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:58:51,536 WARN L293 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 288 DAG size of output: 274 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:59:10,055 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification. DAG size of input: 296 DAG size of output: 282 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:59:29,589 WARN L293 SmtUtils]: Spent 8.90s on a formula simplification. DAG size of input: 310 DAG size of output: 296 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:00:08,396 WARN L293 SmtUtils]: Spent 7.42s on a formula simplification. DAG size of input: 251 DAG size of output: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:00:25,674 WARN L293 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 251 DAG size of output: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:00:47,583 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 265 DAG size of output: 257 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:01:11,129 WARN L293 SmtUtils]: Spent 9.02s on a formula simplification. DAG size of input: 266 DAG size of output: 258 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:01:52,864 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8903#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (= |ULTIMATE.start_main_~count~0#1| 0) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#memory_$Pointer$.offset_489| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_505| (Array Int (Array Int Int))) (|v_#memory_int_422| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_37| Int) (|v_#memory_int_421| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_489| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4)) 0) (<= 0 (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4)) (= (select |#valid| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 8) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_489| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) (store (select |v_#memory_$Pointer$.offset_489| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37| (store (select (store |v_#memory_$Pointer$.offset_489| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) (store (select |v_#memory_$Pointer$.offset_489| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)))) (= (store |v_#memory_int_421| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) (store (select |v_#memory_int_421| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4) (select (select |v_#memory_int_422| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4)))) |v_#memory_int_422|) (= (store (store |v_#memory_$Pointer$.base_505| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) (store (select |v_#memory_$Pointer$.base_505| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37| (store (select (store |v_#memory_$Pointer$.base_505| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) (store (select |v_#memory_$Pointer$.base_505| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8))) |#memory_$Pointer$.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) 1) (= |#memory_int| (store |v_#memory_int_422| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37| (store (select |v_#memory_int_422| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)))) (= (select (select |v_#memory_$Pointer$.base_505| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|) 8) 4)) 0) (<= 12 (select |#length| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_37|)))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))' at error location [2023-12-02 13:01:52,864 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:01:52,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:01:52,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 50 [2023-12-02 13:01:52,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344902455] [2023-12-02 13:01:52,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:01:52,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 13:01:52,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:01:52,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 13:01:52,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=6433, Unknown=77, NotChecked=326, Total=7140 [2023-12-02 13:01:52,867 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 51 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 43 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 13:02:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:02:00,484 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2023-12-02 13:02:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 13:02:00,485 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 43 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2023-12-02 13:02:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:02:00,486 INFO L225 Difference]: With dead ends: 147 [2023-12-02 13:02:00,486 INFO L226 Difference]: Without dead ends: 147 [2023-12-02 13:02:00,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3512 ImplicationChecksByTransitivity, 225.6s TimeCoverageRelationStatistics Valid=732, Invalid=11851, Unknown=81, NotChecked=446, Total=13110 [2023-12-02 13:02:00,488 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 289 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 2392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:02:00,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1169 Invalid, 2392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-02 13:02:00,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-02 13:02:00,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 93. [2023-12-02 13:02:00,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 86 states have internal predecessors, (96), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 13:02:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2023-12-02 13:02:00,492 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 51 [2023-12-02 13:02:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:02:00,492 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2023-12-02 13:02:00,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 43 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 13:02:00,492 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2023-12-02 13:02:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 13:02:00,493 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:02:00,493 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:02:00,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 13:02:00,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:02:00,693 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-12-02 13:02:00,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:02:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash -303306778, now seen corresponding path program 1 times [2023-12-02 13:02:00,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:02:00,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418867246] [2023-12-02 13:02:00,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:02:00,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:02:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:02:03,477 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:02:03,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:02:03,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418867246] [2023-12-02 13:02:03,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418867246] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:02:03,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114389407] [2023-12-02 13:02:03,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:02:03,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:02:03,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:02:03,479 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:02:03,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9137b-a8e9-4d0f-b30e-d172ebc83ee1/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 13:02:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:02:03,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 13:02:03,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:02:04,318 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 13:02:04,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 13:02:04,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:02:04,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 13:02:04,813 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-12-02 13:02:05,332 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 46 treesize of output 26 [2023-12-02 13:02:05,337 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-12-02 13:02:05,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:02:05,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 13:02:05,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:02:05,568 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 54 treesize of output 41 [2023-12-02 13:02:05,599 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-02 13:02:05,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-02 13:02:05,608 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 20 treesize of output 15 [2023-12-02 13:02:05,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:02:05,628 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-12-02 13:02:06,533 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-12-02 13:02:06,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 105 [2023-12-02 13:02:06,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:02:06,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 15 [2023-12-02 13:02:06,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:02:06,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 11 [2023-12-02 13:02:06,680 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 20 treesize of output 15 [2023-12-02 13:02:06,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:02:06,686 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 45 treesize of output 34 [2023-12-02 13:02:06,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:02:06,693 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-12-02 13:02:06,812 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 36 treesize of output 20 [2023-12-02 13:02:06,818 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-12-02 13:02:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:02:06,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:02:06,982 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4182 (Array Int Int)) (v_ArrVal_4183 (Array Int Int)) (v_ArrVal_4184 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4184) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4182) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4183) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-02 13:02:17,386 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4197 (Array Int Int)) (v_ArrVal_4198 (Array Int Int)) (v_ArrVal_4199 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_66| Int) (v_ArrVal_4179 Int) (v_ArrVal_4180 (Array Int Int)) (v_ArrVal_4182 (Array Int Int)) (v_ArrVal_4177 Int) (v_ArrVal_4183 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_61| Int) (v_ArrVal_4184 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_61| v_ArrVal_4198))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_61| v_ArrVal_4199)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_66| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_61| v_ArrVal_4197) .cse0) .cse1 v_ArrVal_4179)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_61| v_ArrVal_4184) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4180) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_61| v_ArrVal_4182) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select .cse2 .cse0) .cse1 v_ArrVal_4177)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_61| v_ArrVal_4183) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_61|) 0)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_66| (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_61| 1)) (not (= (select (select .cse3 .cse0) .cse1) 0)))))) is different from false [2023-12-02 13:02:17,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114389407] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:02:17,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2058708439] [2023-12-02 13:02:17,390 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-12-02 13:02:17,390 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:02:17,391 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:02:17,391 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:02:17,391 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:02:31,450 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 247 for LOIs [2023-12-02 13:02:32,917 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:04:24,425 WARN L293 SmtUtils]: Spent 1.23m on a formula simplification. DAG size of input: 338 DAG size of output: 313 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)