./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 a0165632 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_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje --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.5-dev-a016563 [2024-11-09 06:21:14,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:21:14,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:21:14,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:21:14,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:21:14,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:21:14,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:21:14,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:21:14,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:21:14,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:21:14,588 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:21:14,589 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:21:14,589 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:21:14,590 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:21:14,590 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:21:14,594 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:21:14,594 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:21:14,594 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:21:14,595 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:21:14,595 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:21:14,595 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:21:14,596 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:21:14,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:21:14,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:21:14,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:21:14,599 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:21:14,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:21:14,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:21:14,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:21:14,600 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:21:14,601 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:21:14,602 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:21:14,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:21:14,603 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:21:14,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:21:14,604 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:21:14,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:21:14,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:21:14,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:21:14,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:21:14,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:21:14,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:21:14,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:21:14,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:21:14,607 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:21:14,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:21:14,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:21:14,608 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:21:14,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:21:14,608 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_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/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_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje 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 [2024-11-09 06:21:14,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:21:14,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:21:14,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:21:14,964 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:21:14,964 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:21:14,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/dll2n_append_equal.i Unable to find full path for "g++" [2024-11-09 06:21:16,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:21:17,194 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:21:17,194 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-09 06:21:17,208 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/data/4f4f3dfdf/57917f7ac23c4d8586ec02e883581c11/FLAGf64a0c4eb [2024-11-09 06:21:17,226 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/data/4f4f3dfdf/57917f7ac23c4d8586ec02e883581c11 [2024-11-09 06:21:17,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:21:17,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:21:17,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:21:17,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:21:17,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:21:17,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:21:17" (1/1) ... [2024-11-09 06:21:17,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17291cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17, skipping insertion in model container [2024-11-09 06:21:17,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:21:17" (1/1) ... [2024-11-09 06:21:17,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:21:17,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:21:17,691 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:21:17,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:21:17,794 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:21:17,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17 WrapperNode [2024-11-09 06:21:17,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:21:17,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:21:17,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:21:17,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:21:17,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17" (1/1) ... [2024-11-09 06:21:17,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17" (1/1) ... [2024-11-09 06:21:17,845 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2024-11-09 06:21:17,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:21:17,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:21:17,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:21:17,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:21:17,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17" (1/1) ... [2024-11-09 06:21:17,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17" (1/1) ... [2024-11-09 06:21:17,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17" (1/1) ... [2024-11-09 06:21:17,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17" (1/1) ... [2024-11-09 06:21:17,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17" (1/1) ... [2024-11-09 06:21:17,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17" (1/1) ... [2024-11-09 06:21:17,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17" (1/1) ... [2024-11-09 06:21:17,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17" (1/1) ... [2024-11-09 06:21:17,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:21:17,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:21:17,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:21:17,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:21:17,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17" (1/1) ... [2024-11-09 06:21:17,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:21:17,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:21:17,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:21:17,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:21:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:21:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:21:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 06:21:17,973 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 06:21:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:21:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:21:17,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:21:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:21:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:21:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:21:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 06:21:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:21:17,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:21:17,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:21:18,196 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:21:18,199 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:21:18,635 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-09 06:21:18,636 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:21:18,710 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:21:18,714 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 06:21:18,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:21:18 BoogieIcfgContainer [2024-11-09 06:21:18,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:21:18,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:21:18,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:21:18,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:21:18,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:21:17" (1/3) ... [2024-11-09 06:21:18,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f0fe34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:21:18, skipping insertion in model container [2024-11-09 06:21:18,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:21:17" (2/3) ... [2024-11-09 06:21:18,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f0fe34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:21:18, skipping insertion in model container [2024-11-09 06:21:18,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:21:18" (3/3) ... [2024-11-09 06:21:18,729 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2024-11-09 06:21:18,749 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:21:18,750 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-09 06:21:18,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:21:18,813 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@1ab7f36a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:21:18,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-09 06:21:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 88 states have internal predecessors, (102), 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) [2024-11-09 06:21:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:21:18,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:21:18,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:21:18,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:21:18,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:21:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2022031563, now seen corresponding path program 1 times [2024-11-09 06:21:18,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:21:18,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826803204] [2024-11-09 06:21:18,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:18,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:21:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:19,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:21:19,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826803204] [2024-11-09 06:21:19,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826803204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:21:19,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:21:19,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:21:19,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001599684] [2024-11-09 06:21:19,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:21:19,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:21:19,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:21:19,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:21:19,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:21:19,174 INFO L87 Difference]: Start difference. First operand has 92 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 88 states have internal predecessors, (102), 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, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-09 06:21:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:21:19,313 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2024-11-09 06:21:19,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:21:19,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-11-09 06:21:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:21:19,326 INFO L225 Difference]: With dead ends: 88 [2024-11-09 06:21:19,326 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 06:21:19,328 INFO L431 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 [2024-11-09 06:21:19,335 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:21:19,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:21:19,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 06:21:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 06:21:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 82 states have internal predecessors, (92), 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) [2024-11-09 06:21:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-11-09 06:21:19,390 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 7 [2024-11-09 06:21:19,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:21:19,390 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-11-09 06:21:19,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-09 06:21:19,391 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-11-09 06:21:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:21:19,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:21:19,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:21:19,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:21:19,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:21:19,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:21:19,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2022031564, now seen corresponding path program 1 times [2024-11-09 06:21:19,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:21:19,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204842718] [2024-11-09 06:21:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:19,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:21:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:19,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:21:19,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204842718] [2024-11-09 06:21:19,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204842718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:21:19,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:21:19,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:21:19,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936716445] [2024-11-09 06:21:19,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:21:19,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:21:19,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:21:19,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:21:19,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:21:19,623 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-09 06:21:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:21:19,747 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2024-11-09 06:21:19,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:21:19,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-11-09 06:21:19,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:21:19,749 INFO L225 Difference]: With dead ends: 83 [2024-11-09 06:21:19,750 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 06:21:19,750 INFO L431 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 [2024-11-09 06:21:19,751 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:21:19,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 136 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:21:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 06:21:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 06:21:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 79 states have internal predecessors, (89), 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) [2024-11-09 06:21:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2024-11-09 06:21:19,772 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 7 [2024-11-09 06:21:19,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:21:19,773 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2024-11-09 06:21:19,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-09 06:21:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2024-11-09 06:21:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 06:21:19,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:21:19,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:21:19,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:21:19,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:21:19,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:21:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash 390160369, now seen corresponding path program 1 times [2024-11-09 06:21:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:21:19,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763476027] [2024-11-09 06:21:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:19,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:21:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:20,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:21:20,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763476027] [2024-11-09 06:21:20,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763476027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:21:20,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:21:20,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:21:20,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627604529] [2024-11-09 06:21:20,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:21:20,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:21:20,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:21:20,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:21:20,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:21:20,097 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) [2024-11-09 06:21:20,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:21:20,327 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2024-11-09 06:21:20,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:21:20,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2024-11-09 06:21:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:21:20,330 INFO L225 Difference]: With dead ends: 81 [2024-11-09 06:21:20,331 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 06:21:20,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:21:20,332 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 7 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:21:20,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 267 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:21:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 06:21:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 06:21:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 77 states have internal predecessors, (87), 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) [2024-11-09 06:21:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2024-11-09 06:21:20,339 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 12 [2024-11-09 06:21:20,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:21:20,341 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2024-11-09 06:21:20,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) [2024-11-09 06:21:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2024-11-09 06:21:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 06:21:20,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:21:20,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:21:20,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:21:20,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:21:20,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:21:20,343 INFO L85 PathProgramCache]: Analyzing trace with hash 390160368, now seen corresponding path program 1 times [2024-11-09 06:21:20,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:21:20,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874241769] [2024-11-09 06:21:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:21:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:20,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:21:20,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874241769] [2024-11-09 06:21:20,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874241769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:21:20,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:21:20,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:21:20,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763932094] [2024-11-09 06:21:20,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:21:20,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:21:20,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:21:20,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:21:20,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:21:20,476 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) [2024-11-09 06:21:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:21:20,650 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2024-11-09 06:21:20,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:21:20,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2024-11-09 06:21:20,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:21:20,652 INFO L225 Difference]: With dead ends: 79 [2024-11-09 06:21:20,652 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 06:21:20,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:21:20,654 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 8 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:21:20,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 251 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:21:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 06:21:20,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 06:21:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 75 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) [2024-11-09 06:21:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2024-11-09 06:21:20,661 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 12 [2024-11-09 06:21:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:21:20,661 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2024-11-09 06:21:20,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) [2024-11-09 06:21:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2024-11-09 06:21:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 06:21:20,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:21:20,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:21:20,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:21:20,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:21:20,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:21:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1130528099, now seen corresponding path program 1 times [2024-11-09 06:21:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:21:20,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363580428] [2024-11-09 06:21:20,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:21:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:20,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:21:20,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363580428] [2024-11-09 06:21:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363580428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:21:20,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:21:20,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:21:20,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619906169] [2024-11-09 06:21:20,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:21:20,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:21:20,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:21:20,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:21:20,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:21:20,731 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-09 06:21:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:21:20,782 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2024-11-09 06:21:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:21:20,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-11-09 06:21:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:21:20,784 INFO L225 Difference]: With dead ends: 90 [2024-11-09 06:21:20,784 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 06:21:20,784 INFO L431 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 [2024-11-09 06:21:20,785 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 10 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:21:20,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 150 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:21:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 06:21:20,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2024-11-09 06:21:20,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 47 states have (on average 1.851063829787234) internal successors, (87), 77 states have internal predecessors, (87), 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) [2024-11-09 06:21:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2024-11-09 06:21:20,796 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 12 [2024-11-09 06:21:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:21:20,800 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2024-11-09 06:21:20,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-09 06:21:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2024-11-09 06:21:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 06:21:20,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:21:20,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:21:20,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:21:20,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:21:20,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:21:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1086007364, now seen corresponding path program 1 times [2024-11-09 06:21:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:21:20,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048450722] [2024-11-09 06:21:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:21:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:20,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:21:20,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048450722] [2024-11-09 06:21:20,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048450722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:21:20,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:21:20,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:21:20,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670131339] [2024-11-09 06:21:20,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:21:20,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:21:20,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:21:20,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:21:20,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:21:20,880 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-11-09 06:21:20,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:21:20,920 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2024-11-09 06:21:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:21:20,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2024-11-09 06:21:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:21:20,922 INFO L225 Difference]: With dead ends: 86 [2024-11-09 06:21:20,922 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 06:21:20,923 INFO L431 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 [2024-11-09 06:21:20,924 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:21:20,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:21:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 06:21:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 06:21:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 81 states have internal predecessors, (91), 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) [2024-11-09 06:21:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2024-11-09 06:21:20,930 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 15 [2024-11-09 06:21:20,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:21:20,930 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2024-11-09 06:21:20,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-11-09 06:21:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2024-11-09 06:21:20,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:21:20,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:21:20,932 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:21:20,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:21:20,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:21:20,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:21:20,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1860092016, now seen corresponding path program 1 times [2024-11-09 06:21:20,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:21:20,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54630717] [2024-11-09 06:21:20,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:21:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:21:21,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:21:21,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54630717] [2024-11-09 06:21:21,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54630717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:21:21,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013469049] [2024-11-09 06:21:21,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:21,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:21:21,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:21:21,026 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:21:21,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:21:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:21,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:21:21,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:21:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:21,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:21:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:21:21,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013469049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:21:21,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [438314545] [2024-11-09 06:21:21,305 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-09 06:21:21,305 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:21:21,310 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:21:21,316 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:21:21,318 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:21:23,817 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 127 for LOIs [2024-11-09 06:21:24,503 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:21:40,813 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1276#(and (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_20| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_dll_append_~head#1.base_20|) 1)) (or (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_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_68| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_68| |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_#length_75| (Array Int Int))) (= |#length| (store |v_#length_75| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (= |v_ULTIMATE.start_dll_append_~head#1.base_20| |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_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$.offset_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_68| |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_86| (Array Int Int))) (and (= (select |v_#valid_86| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_86| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1))))) (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_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_68| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_68| |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_#length_75| (Array Int Int))) (= |#length| (store |v_#length_75| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (= |v_ULTIMATE.start_dll_append_~head#1.base_20| |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_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$.offset_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_68| |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_86| (Array Int Int))) (and (= (select |v_#valid_86| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_86| |ULTIMATE.start_dll_append_~new_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_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:21:40,813 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:21:40,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:21:40,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-09 06:21:40,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098123731] [2024-11-09 06:21:40,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:21:40,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:21:40,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:21:40,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:21:40,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=356, Unknown=4, NotChecked=0, Total=420 [2024-11-09 06:21:40,816 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2024-11-09 06:21:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:21:40,903 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-11-09 06:21:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:21:40,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 26 [2024-11-09 06:21:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:21:40,905 INFO L225 Difference]: With dead ends: 88 [2024-11-09 06:21:40,905 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 06:21:40,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=60, Invalid=356, Unknown=4, NotChecked=0, Total=420 [2024-11-09 06:21:40,906 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:21:40,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 148 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:21:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 06:21:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 06:21:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.7358490566037736) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:21:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2024-11-09 06:21:40,914 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 26 [2024-11-09 06:21:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:21:40,914 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-11-09 06:21:40,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2024-11-09 06:21:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2024-11-09 06:21:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 06:21:40,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:21:40,916 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 06:21:40,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:21:41,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:21:41,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:21:41,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:21:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash -151734895, now seen corresponding path program 1 times [2024-11-09 06:21:41,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:21:41,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244528313] [2024-11-09 06:21:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:41,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:21:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:41,639 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:41,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:21:41,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244528313] [2024-11-09 06:21:41,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244528313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:21:41,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363979997] [2024-11-09 06:21:41,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:41,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:21:41,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:21:41,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:21:41,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:21:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:41,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 06:21:41,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:21:41,901 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 06:21:42,023 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 06:21:42,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 06:21:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:42,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:21:42,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363979997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:21:42,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1840838826] [2024-11-09 06:21:42,187 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 06:21:42,187 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:21:42,187 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:21:42,187 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:21:42,188 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:21:43,546 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 118 for LOIs [2024-11-09 06:21:43,825 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:21:59,502 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1584#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_96| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_96| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 0))) (= (store |v_#memory_$Pointer$.offset_95| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_95| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_96| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.offset_96|))) (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 1)) (exists ((|v_#memory_int_76| (Array Int (Array Int Int)))) (= (store |v_#memory_int_76| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_76| |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))) |#memory_int|)) (exists ((|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_95| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_95| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_96| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.base_96|) (= (store |v_#memory_$Pointer$.base_96| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_96| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) |#memory_$Pointer$.base|))) (= |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_~len#1| 1) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_create_~data#1| 1))' at error location [2024-11-09 06:21:59,502 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:21:59,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:21:59,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2024-11-09 06:21:59,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839757430] [2024-11-09 06:21:59,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:21:59,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:21:59,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:21:59,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:21:59,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=555, Unknown=5, NotChecked=48, Total=702 [2024-11-09 06:21:59,504 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 12 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:22:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:22:00,421 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2024-11-09 06:22:00,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:22:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-11-09 06:22:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:22:00,423 INFO L225 Difference]: With dead ends: 87 [2024-11-09 06:22:00,423 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 06:22:00,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=118, Invalid=751, Unknown=5, NotChecked=56, Total=930 [2024-11-09 06:22:00,424 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 5 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:22:00,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 461 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 90 Unchecked, 0.7s Time] [2024-11-09 06:22:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 06:22:00,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 06:22:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 82 states have internal predecessors, (91), 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) [2024-11-09 06:22:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-11-09 06:22:00,430 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 29 [2024-11-09 06:22:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:22:00,431 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-11-09 06:22:00,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:22:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2024-11-09 06:22:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 06:22:00,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:22:00,432 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 06:22:00,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:00,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:22:00,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:22:00,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:22:00,637 INFO L85 PathProgramCache]: Analyzing trace with hash -151734894, now seen corresponding path program 1 times [2024-11-09 06:22:00,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:22:00,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500487496] [2024-11-09 06:22:00,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:00,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:22:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:22:01,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:22:01,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500487496] [2024-11-09 06:22:01,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500487496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:01,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517833966] [2024-11-09 06:22:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:01,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:22:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:22:01,271 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:22:01,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:22:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:01,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 06:22:01,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:22:01,417 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 [2024-11-09 06:22:01,814 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 06:22:01,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:22:01,867 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 [2024-11-09 06:22:01,893 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:22:01,894 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 [2024-11-09 06:22:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 06:22:01,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:22:02,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517833966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:02,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1884234154] [2024-11-09 06:22:02,294 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 06:22:02,294 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:22:02,295 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:22:02,295 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:22:02,295 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:22:03,509 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 118 for LOIs [2024-11-09 06:22:03,721 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:22:17,954 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1904#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (<= |ULTIMATE.start_dll_create_~len#1| 2) (exists ((|v_#memory_$Pointer$.base_116| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_115| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_115| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_116| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.base_116|) (= (store |v_#memory_$Pointer$.base_116| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_116| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) |#memory_$Pointer$.base|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 8 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_116| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_116| (store |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_116| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) (= (store |v_#memory_$Pointer$.offset_116| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_116| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 0)) |#memory_$Pointer$.offset|))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 11) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_96| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_96| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_96| |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_dll_create_~data#1| 1))' at error location [2024-11-09 06:22:17,954 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:22:17,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:22:17,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2024-11-09 06:22:17,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812353468] [2024-11-09 06:22:17,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:22:17,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 06:22:17,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:22:17,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 06:22:17,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=4, NotChecked=64, Total=1190 [2024-11-09 06:22:17,958 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 19 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 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) [2024-11-09 06:22:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:22:19,364 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2024-11-09 06:22:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:22:19,365 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 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 29 [2024-11-09 06:22:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:22:19,366 INFO L225 Difference]: With dead ends: 86 [2024-11-09 06:22:19,366 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 06:22:19,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=158, Invalid=1482, Unknown=4, NotChecked=78, Total=1722 [2024-11-09 06:22:19,368 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:22:19,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 577 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 508 Invalid, 0 Unknown, 89 Unchecked, 0.9s Time] [2024-11-09 06:22:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 06:22:19,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 06:22:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.6981132075471699) internal successors, (90), 81 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:22:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-11-09 06:22:19,379 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 29 [2024-11-09 06:22:19,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:22:19,379 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-11-09 06:22:19,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 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) [2024-11-09 06:22:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-11-09 06:22:19,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 06:22:19,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:22:19,384 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:22:19,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:19,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:22:19,585 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:22:19,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:22:19,585 INFO L85 PathProgramCache]: Analyzing trace with hash -209071869, now seen corresponding path program 2 times [2024-11-09 06:22:19,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:22:19,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868849117] [2024-11-09 06:22:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:19,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:22:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 06:22:19,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:22:19,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868849117] [2024-11-09 06:22:19,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868849117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:19,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571862198] [2024-11-09 06:22:19,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:22:19,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:22:19,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:22:19,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:22:19,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:22:20,165 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 06:22:20,165 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:22:20,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 06:22:20,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:22:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:22:20,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:22:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 06:22:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571862198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:22:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1660625262] [2024-11-09 06:22:20,341 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-09 06:22:20,341 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:22:20,342 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:22:20,342 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:22:20,342 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:22:21,581 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 158 for LOIs [2024-11-09 06:22:22,146 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:22:47,559 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2346#(and (= |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) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_22| Int)) (and (or (and (= |v_ULTIMATE.start_dll_append_~head#1.base_22| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_145| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_145| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_145| |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_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_126| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_126| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_127|) (= (store |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_128|) (= |#memory_int| (store |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))))) (<= (+ |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_145| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_145| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_145| |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))) |#memory_$Pointer$.offset|)) (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_152| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_62| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_37| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_152| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int)) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_153| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_153| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_152| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_152| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_153| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_153|) (= (select |v_old(#valid)_AFTER_CALL_37| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_int)_AFTER_CALL_37| (store |v_#memory_int_133| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_133| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_old(#memory_int)_AFTER_CALL_37| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_#length_BEFORE_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (store |v_#memory_$Pointer$.base_152| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_152| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_153| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_153|) (= (select (select |v_#memory_$Pointer$.offset_153| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| (store |v_#memory_$Pointer$.base_153| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_153| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))))) (exists ((|v_#length_109| (Array Int Int))) (= |#length| (store |v_#length_109| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (exists ((|v_#valid_121| (Array Int Int))) (and (= (store |v_#valid_121| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= 0 (select |v_#valid_121| |ULTIMATE.start_dll_append_~new_last~0#1.base|))))) (and (= |v_ULTIMATE.start_dll_append_~head#1.base_22| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_145| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_145| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_145| |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_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_126| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_126| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_127|) (= (store |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_128|) (= |#memory_int| (store |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))))) (<= (+ |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_152| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_36| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_152| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_153| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_153| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_153| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_153| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_36|) (<= 8 (select |v_old(#length)_AFTER_CALL_36| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_36| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_153| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_152| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_152| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_153| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_153|) (= |v_old(#memory_int)_AFTER_CALL_36| (store |v_#memory_int_133| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_133| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_old(#memory_int)_AFTER_CALL_36| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_$Pointer$.offset_152| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_152| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_153| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_153|))) (exists ((|v_#memory_$Pointer$.offset_145| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_145| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_145| |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))) |#memory_$Pointer$.offset|)) (exists ((|v_#length_109| (Array Int Int))) (= |#length| (store |v_#length_109| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (exists ((|v_#valid_121| (Array Int Int))) (and (= (store |v_#valid_121| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= 0 (select |v_#valid_121| |ULTIMATE.start_dll_append_~new_last~0#1.base|)))))) (not (= (select |#valid| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 1)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:22:47,559 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:22:47,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:22:47,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-11-09 06:22:47,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903106298] [2024-11-09 06:22:47,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:22:47,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:22:47,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:22:47,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:22:47,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=495, Unknown=4, NotChecked=0, Total=552 [2024-11-09 06:22:47,562 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:22:47,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:22:47,961 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-09 06:22:47,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:22:47,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2024-11-09 06:22:47,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:22:47,963 INFO L225 Difference]: With dead ends: 86 [2024-11-09 06:22:47,963 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 06:22:47,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=61, Invalid=585, Unknown=4, NotChecked=0, Total=650 [2024-11-09 06:22:47,964 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:22:47,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 417 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:22:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 06:22:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 06:22:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.679245283018868) internal successors, (89), 81 states have internal predecessors, (89), 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) [2024-11-09 06:22:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-11-09 06:22:47,971 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 40 [2024-11-09 06:22:47,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:22:47,971 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-11-09 06:22:47,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:22:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-11-09 06:22:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 06:22:47,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:22:47,973 INFO L215 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] [2024-11-09 06:22:48,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:22:48,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:22:48,177 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:22:48,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:22:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash 466368807, now seen corresponding path program 1 times [2024-11-09 06:22:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:22:48,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55832219] [2024-11-09 06:22:48,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:22:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:22:49,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:22:49,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55832219] [2024-11-09 06:22:49,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55832219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:49,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392826050] [2024-11-09 06:22:49,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:49,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:22:49,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:22:49,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:22:49,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:22:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:49,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 06:22:49,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:22:49,396 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 [2024-11-09 06:22:49,434 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 [2024-11-09 06:22:49,552 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:22:49,552 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 [2024-11-09 06:22:49,846 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 [2024-11-09 06:22:49,866 WARN L873 $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 [2024-11-09 06:22:49,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:22:49,923 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 [2024-11-09 06:22:50,077 WARN L873 $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 [2024-11-09 06:22:50,115 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 06:22:50,115 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 [2024-11-09 06:22:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 15 not checked. [2024-11-09 06:22:50,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:22:50,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392826050] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:50,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [511077876] [2024-11-09 06:22:50,688 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 06:22:50,688 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:22:50,688 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:22:50,689 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:22:50,689 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:22:52,046 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 86 for LOIs [2024-11-09 06:22:52,399 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:23:05,487 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2736#(and (= |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) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_24| Int)) (and (or (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_78| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_78| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_175| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_175| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_175| |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_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |v_ULTIMATE.start_dll_append_~head#1.base_24| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_121| (Array Int Int))) (= |#length| (store |v_#length_121| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (exists ((|v_#memory_$Pointer$.offset_175| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_175| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_175| |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_158| (Array Int (Array Int Int))) (|v_#memory_int_156| (Array Int (Array Int Int))) (|v_#memory_int_157| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_157| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_157| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_158| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_158|) (= (store |v_#memory_int_156| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_156| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_157| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_157|) (= |#memory_int| (store |v_#memory_int_158| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_158| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))))) (exists ((|v_#valid_141| (Array Int Int))) (and (= (store |v_#valid_141| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_141| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))) (and (exists ((|v_#memory_$Pointer$.base_175| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_175| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_175| |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_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |v_ULTIMATE.start_dll_append_~head#1.base_24| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_76| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_76| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_121| (Array Int Int))) (= |#length| (store |v_#length_121| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (exists ((|v_#memory_$Pointer$.offset_175| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_175| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_175| |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_158| (Array Int (Array Int Int))) (|v_#memory_int_156| (Array Int (Array Int Int))) (|v_#memory_int_157| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_157| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_157| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_158| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_158|) (= (store |v_#memory_int_156| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_156| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_157| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_157|) (= |#memory_int| (store |v_#memory_int_158| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_158| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))))) (exists ((|v_#valid_141| (Array Int Int))) (and (= (store |v_#valid_141| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_141| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (not (= (select |#valid| |v_ULTIMATE.start_dll_append_~head#1.base_24|) 1)))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:23:05,487 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:23:05,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:23:05,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2024-11-09 06:23:05,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717542490] [2024-11-09 06:23:05,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:23:05,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 06:23:05,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:23:05,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 06:23:05,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1321, Unknown=4, NotChecked=150, Total=1640 [2024-11-09 06:23:05,490 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 20 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 17 states have internal predecessors, (58), 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) [2024-11-09 06:23:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:23:07,073 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2024-11-09 06:23:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:23:07,073 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 17 states have internal predecessors, (58), 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 41 [2024-11-09 06:23:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:23:07,074 INFO L225 Difference]: With dead ends: 93 [2024-11-09 06:23:07,075 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 06:23:07,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=197, Invalid=1529, Unknown=4, NotChecked=162, Total=1892 [2024-11-09 06:23:07,076 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 296 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:23:07,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 408 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 478 Invalid, 0 Unknown, 180 Unchecked, 1.2s Time] [2024-11-09 06:23:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 06:23:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2024-11-09 06:23:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:23:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-11-09 06:23:07,087 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 41 [2024-11-09 06:23:07,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:23:07,088 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-11-09 06:23:07,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 17 states have internal predecessors, (58), 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) [2024-11-09 06:23:07,089 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-11-09 06:23:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 06:23:07,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:23:07,090 INFO L215 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] [2024-11-09 06:23:07,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 06:23:07,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:23:07,291 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:23:07,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:23:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash 466368808, now seen corresponding path program 1 times [2024-11-09 06:23:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:23:07,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427522293] [2024-11-09 06:23:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:07,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:23:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 06:23:08,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:23:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427522293] [2024-11-09 06:23:08,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427522293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:23:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170944629] [2024-11-09 06:23:08,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:08,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:23:08,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:23:08,461 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:23:08,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:23:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:08,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 06:23:08,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:23:08,682 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 [2024-11-09 06:23:08,719 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 [2024-11-09 06:23:08,733 WARN L873 $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 [2024-11-09 06:23:08,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:23:08,789 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 [2024-11-09 06:23:08,911 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 [2024-11-09 06:23:08,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:23:08,976 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 [2024-11-09 06:23:09,120 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 [2024-11-09 06:23:09,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:23:09,180 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 [2024-11-09 06:23:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 06:23:09,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:23:09,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170944629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:23:09,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:23:09,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-09 06:23:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537077061] [2024-11-09 06:23:09,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:23:09,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:23:09,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:23:09,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:23:09,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-11-09 06:23:09,193 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2024-11-09 06:23:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:23:09,509 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2024-11-09 06:23:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:23:09,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 41 [2024-11-09 06:23:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:23:09,510 INFO L225 Difference]: With dead ends: 78 [2024-11-09 06:23:09,510 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 06:23:09,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-11-09 06:23:09,511 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:23:09,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 213 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 100 Unchecked, 0.3s Time] [2024-11-09 06:23:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 06:23:09,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 06:23:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.528301886792453) internal successors, (81), 73 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) [2024-11-09 06:23:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-11-09 06:23:09,516 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 41 [2024-11-09 06:23:09,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:23:09,516 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-11-09 06:23:09,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2024-11-09 06:23:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-09 06:23:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 06:23:09,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:23:09,518 INFO L215 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] [2024-11-09 06:23:09,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 06:23:09,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:23:09,722 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:23:09,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:23:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash -626051094, now seen corresponding path program 1 times [2024-11-09 06:23:09,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:23:09,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939106341] [2024-11-09 06:23:09,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:23:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:23:10,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:23:10,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939106341] [2024-11-09 06:23:10,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939106341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:23:10,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590621052] [2024-11-09 06:23:10,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:10,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:23:10,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:23:10,951 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:23:10,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:23:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:11,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 06:23:11,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:23:11,668 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 [2024-11-09 06:23:11,841 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_67| Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_67| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_67|)) |c_#memory_$Pointer$.base|) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_67| 1)) (<= (+ |v_node_create_~temp~0#1.base_67| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-09 06:23:11,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:23:11,859 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 [2024-11-09 06:23:11,899 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-09 06:23:11,899 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 [2024-11-09 06:23:12,078 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 [2024-11-09 06:23:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 06:23:12,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:23:12,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590621052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:23:12,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:23:12,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 21 [2024-11-09 06:23:12,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540287244] [2024-11-09 06:23:12,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:23:12,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:23:12,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:23:12,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:23:12,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2024-11-09 06:23:12,137 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:23:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:23:13,134 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2024-11-09 06:23:13,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:23:13,135 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (2), 2 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 [2024-11-09 06:23:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:23:13,136 INFO L225 Difference]: With dead ends: 77 [2024-11-09 06:23:13,136 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 06:23:13,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=396, Unknown=1, NotChecked=40, Total=506 [2024-11-09 06:23:13,137 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 11 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:23:13,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 370 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 356 Invalid, 0 Unknown, 108 Unchecked, 0.9s Time] [2024-11-09 06:23:13,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 06:23:13,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 06:23:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.5) internal successors, (81), 72 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) [2024-11-09 06:23:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2024-11-09 06:23:13,148 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 44 [2024-11-09 06:23:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:23:13,149 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2024-11-09 06:23:13,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:23:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-11-09 06:23:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 06:23:13,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:23:13,151 INFO L215 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] [2024-11-09 06:23:13,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 06:23:13,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 06:23:13,353 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:23:13,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:23:13,353 INFO L85 PathProgramCache]: Analyzing trace with hash -626051093, now seen corresponding path program 1 times [2024-11-09 06:23:13,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:23:13,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623679128] [2024-11-09 06:23:13,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:13,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:23:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:23:15,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:23:15,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623679128] [2024-11-09 06:23:15,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623679128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:23:15,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605010359] [2024-11-09 06:23:15,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:15,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:23:15,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:23:15,565 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:23:15,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 06:23:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:15,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 06:23:15,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:23:16,742 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 [2024-11-09 06:23:16,754 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 [2024-11-09 06:23:27,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:23:27,902 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 [2024-11-09 06:23:28,008 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 06:23:28,008 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 18 treesize of output 21 [2024-11-09 06:23:28,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:23:28,032 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 [2024-11-09 06:23:30,694 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 48 treesize of output 32 [2024-11-09 06:23:30,706 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 [2024-11-09 06:23:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:23:32,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:24:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605010359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:24:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [58681653] [2024-11-09 06:24:12,419 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 06:24:12,419 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:24:12,419 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:24:12,420 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:24:12,420 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:24:15,865 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 86 for LOIs [2024-11-09 06:24:16,190 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:24:56,603 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3712#(and (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_27| Int)) (and (or (< (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_27|) 0)) (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~head#1.base_27|) 0))) (< (+ 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~head#1.base_27|) 0)) 0)) (or (and (exists ((|v_#valid_149| (Array Int Int))) (and (= (select |v_#valid_149| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_149| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_68| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_68| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.offset_202| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_202| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_202| |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_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |v_ULTIMATE.start_dll_append_~head#1.base_27| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_180| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_int_179| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_179| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_179| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_180| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_180|) (= |#memory_int| (store |v_#memory_int_180| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_180| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))) (= (store |v_#memory_int_178| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_178| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_179| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_179|))) (exists ((|v_#length_135| (Array Int Int))) (= |#length| (store |v_#length_135| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (exists ((|v_#memory_$Pointer$.base_205| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_205| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_205| |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)))))) (and (exists ((|v_#valid_149| (Array Int Int))) (and (= (select |v_#valid_149| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_149| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_69| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_69| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.offset_202| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_202| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_202| |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_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |v_ULTIMATE.start_dll_append_~head#1.base_27| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_180| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_int_179| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_179| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_179| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_180| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_180|) (= |#memory_int| (store |v_#memory_int_180| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_180| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))) (= (store |v_#memory_int_178| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_178| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_179| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_179|))) (exists ((|v_#length_135| (Array Int Int))) (= |#length| (store |v_#length_135| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (exists ((|v_#memory_$Pointer$.base_205| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_205| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_205| |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))))))) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~head#1.base_27|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_27|) 0) 0))) (= (select |#valid| |v_ULTIMATE.start_dll_append_~head#1.base_27|) 1) (<= 4 (select |#length| |v_ULTIMATE.start_dll_append_~head#1.base_27|)))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:24:56,604 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:24:56,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:24:56,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2024-11-09 06:24:56,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44561074] [2024-11-09 06:24:56,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:24:56,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 06:24:56,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:24:56,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 06:24:56,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2632, Unknown=39, NotChecked=0, Total=2862 [2024-11-09 06:24:56,608 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 30 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 26 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 06:25:04,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:25:07,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:25:14,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:25:17,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:25:27,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:25:30,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:25:32,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:25:37,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:25:40,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:25:44,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:25:46,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:25:50,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:25:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:51,030 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2024-11-09 06:25:51,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 06:25:51,031 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 26 states have internal predecessors, (67), 4 states have call successors, (4), 3 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 44 [2024-11-09 06:25:51,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:51,032 INFO L225 Difference]: With dead ends: 83 [2024-11-09 06:25:51,032 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 06:25:51,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 113.5s TimeCoverageRelationStatistics Valid=284, Invalid=3826, Unknown=50, NotChecked=0, Total=4160 [2024-11-09 06:25:51,034 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 130 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 10 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:51,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 840 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 991 Invalid, 12 Unknown, 0 Unchecked, 37.1s Time] [2024-11-09 06:25:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 06:25:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-11-09 06:25:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 75 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) [2024-11-09 06:25:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2024-11-09 06:25:51,039 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 44 [2024-11-09 06:25:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:51,040 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2024-11-09 06:25:51,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 26 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 06:25:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2024-11-09 06:25:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 06:25:51,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:51,041 INFO L215 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] [2024-11-09 06:25:51,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 06:25:51,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 06:25:51,242 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:25:51,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:51,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2066968874, now seen corresponding path program 1 times [2024-11-09 06:25:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:25:51,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076401533] [2024-11-09 06:25:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:52,521 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 06:25:52,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:25:52,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076401533] [2024-11-09 06:25:52,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076401533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:52,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:25:52,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:25:52,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228556083] [2024-11-09 06:25:52,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:52,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:25:52,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:25:52,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:25:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:25:52,524 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 7 states have internal predecessors, (23), 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) [2024-11-09 06:25:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:53,688 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2024-11-09 06:25:53,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:25:53,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 7 states have internal predecessors, (23), 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 45 [2024-11-09 06:25:53,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:53,690 INFO L225 Difference]: With dead ends: 78 [2024-11-09 06:25:53,690 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 06:25:53,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:25:53,691 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:53,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 132 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 06:25:53,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 06:25:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 06:25:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 73 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) [2024-11-09 06:25:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-11-09 06:25:53,697 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 45 [2024-11-09 06:25:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:53,697 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-11-09 06:25:53,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 7 states have internal predecessors, (23), 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) [2024-11-09 06:25:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-11-09 06:25:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 06:25:53,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:53,699 INFO L215 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] [2024-11-09 06:25:53,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:25:53,699 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:25:53,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1940111016, now seen corresponding path program 1 times [2024-11-09 06:25:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:25:53,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178494591] [2024-11-09 06:25:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:53,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 06:25:54,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:25:54,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178494591] [2024-11-09 06:25:54,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178494591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:54,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:25:54,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:25:54,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571664026] [2024-11-09 06:25:54,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:54,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:25:54,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:25:54,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:25:54,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:25:54,250 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 6 states, 4 states have (on average 7.0) internal successors, (28), 5 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) [2024-11-09 06:25:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:55,876 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2024-11-09 06:25:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:25:55,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.0) internal successors, (28), 5 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 47 [2024-11-09 06:25:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:55,878 INFO L225 Difference]: With dead ends: 77 [2024-11-09 06:25:55,878 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 06:25:55,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:25:55,879 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 8 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:55,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 200 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 06:25:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 06:25:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 06:25:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 72 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) [2024-11-09 06:25:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2024-11-09 06:25:55,887 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 47 [2024-11-09 06:25:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:55,888 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2024-11-09 06:25:55,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.0) internal successors, (28), 5 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) [2024-11-09 06:25:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-11-09 06:25:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 06:25:55,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:55,892 INFO L215 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] [2024-11-09 06:25:55,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:25:55,892 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:25:55,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1940111015, now seen corresponding path program 1 times [2024-11-09 06:25:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:25:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909234298] [2024-11-09 06:25:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 06:25:56,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:25:56,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909234298] [2024-11-09 06:25:56,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909234298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:56,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:25:56,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:25:56,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234981298] [2024-11-09 06:25:56,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:56,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:25:56,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:25:56,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:25:56,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:25:56,891 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 6 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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) [2024-11-09 06:25:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:58,186 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2024-11-09 06:25:58,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:25:58,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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 47 [2024-11-09 06:25:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:58,188 INFO L225 Difference]: With dead ends: 76 [2024-11-09 06:25:58,188 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 06:25:58,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:25:58,189 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:58,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 208 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 06:25:58,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 06:25:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-09 06:25:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 71 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:25:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2024-11-09 06:25:58,194 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 47 [2024-11-09 06:25:58,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:58,194 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2024-11-09 06:25:58,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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) [2024-11-09 06:25:58,195 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2024-11-09 06:25:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 06:25:58,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:58,195 INFO L215 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] [2024-11-09 06:25:58,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:25:58,196 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:25:58,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1940105485, now seen corresponding path program 1 times [2024-11-09 06:25:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:25:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629932221] [2024-11-09 06:25:58,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:58,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:26:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:26:08,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:26:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629932221] [2024-11-09 06:26:08,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629932221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:26:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284152687] [2024-11-09 06:26:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:26:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:26:08,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:26:08,890 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:26:08,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 06:26:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:26:09,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-09 06:26:09,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:26:12,180 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:26:12,180 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 [2024-11-09 06:26:14,097 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 [2024-11-09 06:26:15,095 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:26:15,095 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 [2024-11-09 06:26:17,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:26:17,364 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 [2024-11-09 06:26:17,397 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 [2024-11-09 06:26:18,686 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_79| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_79| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_79|))) (<= (+ |v_node_create_~temp~0#1.base_79| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_79| (select |c_#valid| |v_node_create_~temp~0#1.base_79|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_79|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_79| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_79|)) |c_#memory_$Pointer$.offset|))) is different from true [2024-11-09 06:26:18,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:26:18,882 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 06:26:18,883 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 [2024-11-09 06:26:19,319 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-09 06:26:19,320 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 36 treesize of output 52 [2024-11-09 06:26:19,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:26:19,360 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 16 treesize of output 11 [2024-11-09 06:26:20,371 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 [2024-11-09 06:26:21,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:26:21,364 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 50 treesize of output 21 [2024-11-09 06:26:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 06:26:21,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:26:24,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284152687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:26:24,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1076534422] [2024-11-09 06:26:24,735 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 06:26:24,735 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:26:24,736 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:26:24,736 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:26:24,736 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:26:27,403 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 87 for LOIs [2024-11-09 06:26:27,882 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:27:12,341 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4610#(and (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_40| Int)) (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_29| Int)) (and (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_29|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~head#1.base_29|) 0) 0))) (= (select |#valid| |v_ULTIMATE.start_dll_append_~head#1.base_29|) 1) (<= 4 (select |#length| |v_ULTIMATE.start_dll_append_~head#1.base_29|)) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_29|) 0)) (or (and (exists ((|v_#valid_160| (Array Int Int))) (and (= (select |v_#valid_160| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_160| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1)))) (exists ((|v_#length_142| (Array Int Int))) (= |#length| (store |v_#length_142| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_79| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_79| |ULTIMATE.start_main_~#s~0#1.base|) 0) 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$.offset_235| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_235| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_235| |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))))) (= |v_ULTIMATE.start_dll_append_~head#1.base_29| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_240| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_240| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_240| |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_206| (Array Int (Array Int Int))) (|v_#memory_int_207| (Array Int (Array Int Int))) (|v_#memory_int_208| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_207| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_207| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_208| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_208|) (= (store |v_#memory_int_206| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_206| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_207| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_207|) (= (store |v_#memory_int_208| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_208| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1)) |#memory_int|)))) (and (exists ((|v_#valid_160| (Array Int Int))) (and (= (select |v_#valid_160| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_160| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1)))) (exists ((|v_#length_142| (Array Int Int))) (= |#length| (store |v_#length_142| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (<= (+ |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_235| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_235| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_235| |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$.offset_BEFORE_CALL_126| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_126| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |v_ULTIMATE.start_dll_append_~head#1.base_29| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_240| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_240| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_240| |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_206| (Array Int (Array Int Int))) (|v_#memory_int_207| (Array Int (Array Int Int))) (|v_#memory_int_208| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_207| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_207| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_208| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_208|) (= (store |v_#memory_int_206| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_206| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_207| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_207|) (= (store |v_#memory_int_208| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_208| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1)) |#memory_int|))))) (= |ULTIMATE.start_dll_append_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~head#1.base_29|) 0)))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.offset_35| Int) (|v_ULTIMATE.start_dll_append_~last~0#1.base_39| Int)) (and (<= (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_35| 8) (select |#length| |v_ULTIMATE.start_dll_append_~last~0#1.base_39|)) (= |ULTIMATE.start_dll_append_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~last~0#1.base_39|) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_35| 4))) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_39|) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_35| 4))) (= (select |#valid| |v_ULTIMATE.start_dll_append_~last~0#1.base_39|) 1) (<= 0 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_35| 4))))) (not (= (select |#valid| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 1)))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:27:12,342 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:27:12,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:27:12,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 40 [2024-11-09 06:27:12,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963151112] [2024-11-09 06:27:12,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:27:12,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 06:27:12,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:27:12,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 06:27:12,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=3904, Unknown=3, NotChecked=126, Total=4290 [2024-11-09 06:27:12,345 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 41 states, 33 states have (on average 2.303030303030303) internal successors, (76), 36 states have internal predecessors, (76), 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) [2024-11-09 06:27:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:32,171 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2024-11-09 06:27:32,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 06:27:32,172 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 2.303030303030303) internal successors, (76), 36 states have internal predecessors, (76), 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 47 [2024-11-09 06:27:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:32,173 INFO L225 Difference]: With dead ends: 88 [2024-11-09 06:27:32,173 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 06:27:32,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1954 ImplicationChecksByTransitivity, 67.8s TimeCoverageRelationStatistics Valid=408, Invalid=5755, Unknown=3, NotChecked=154, Total=6320 [2024-11-09 06:27:32,176 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:32,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 876 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1218 Invalid, 0 Unknown, 102 Unchecked, 12.8s Time] [2024-11-09 06:27:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 06:27:32,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2024-11-09 06:27:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 72 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) [2024-11-09 06:27:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2024-11-09 06:27:32,182 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 47 [2024-11-09 06:27:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:32,182 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2024-11-09 06:27:32,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 2.303030303030303) internal successors, (76), 36 states have internal predecessors, (76), 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) [2024-11-09 06:27:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2024-11-09 06:27:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 06:27:32,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:32,184 INFO L215 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] [2024-11-09 06:27:32,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 06:27:32,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 06:27:32,385 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:27:32,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:32,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1940105484, now seen corresponding path program 1 times [2024-11-09 06:27:32,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:27:32,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681537749] [2024-11-09 06:27:32,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:32,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:46,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:27:46,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681537749] [2024-11-09 06:27:46,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681537749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:27:46,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718082800] [2024-11-09 06:27:46,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:46,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:27:46,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:27:46,332 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:27:46,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 06:27:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:46,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-09 06:27:46,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:27:47,450 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 [2024-11-09 06:27:47,498 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 [2024-11-09 06:27:51,903 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:27:51,904 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 [2024-11-09 06:27:52,027 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 12 treesize of output 14 [2024-11-09 06:27:54,928 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 [2024-11-09 06:27:55,086 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 [2024-11-09 06:27:56,335 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:27:56,335 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 73 treesize of output 66 [2024-11-09 06:27:56,406 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 30 treesize of output 13 [2024-11-09 06:27:59,511 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-09 06:27:59,511 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 96 treesize of output 41 [2024-11-09 06:27:59,719 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-09 06:27:59,720 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 13 treesize of output 18 [2024-11-09 06:27:59,756 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 [2024-11-09 06:27:59,787 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 [2024-11-09 06:28:02,009 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_90| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_90| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_90|))) (<= (+ |v_node_create_~temp~0#1.base_90| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_90| (select |c_#length| |v_node_create_~temp~0#1.base_90|)) |c_#length|) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_90| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_90|)) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_90|) 0))) is different from true [2024-11-09 06:28:02,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:28:02,226 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 06:28:02,227 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 104 treesize of output 85 [2024-11-09 06:28:02,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:28:02,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:28:02,331 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:28:02,332 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 1 case distinctions, treesize of input 86 treesize of output 78 [2024-11-09 06:28:02,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:28:02,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:28:02,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 37 treesize of output 35 [2024-11-09 06:28:02,863 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-09 06:28:02,863 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 34 treesize of output 36 [2024-11-09 06:28:05,385 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-09 06:28:05,385 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 85 treesize of output 34 [2024-11-09 06:28:05,588 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-09 06:28:05,588 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 13 treesize of output 18 [2024-11-09 06:28:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 06:28:06,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:28:11,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718082800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:28:11,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1275911495] [2024-11-09 06:28:11,354 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 06:28:11,354 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:28:11,354 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:28:11,355 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:28:11,355 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:28:14,684 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 87 for LOIs [2024-11-09 06:28:15,068 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:29:15,308 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5040#(and (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_48| Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_43| Int)) (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_31| Int)) (and (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_31|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~head#1.base_31|) 0) 0))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~head#1.base_31|) 0) |v_ULTIMATE.start_dll_append_~last~0#1.offset_43|) (or (and (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_94| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.offset_264| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_264| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_264| |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_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_269| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_269| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_269| |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_#memory_int_228| (Array Int (Array Int Int))) (|v_#memory_int_229| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_228| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_228| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_229| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_229|) (= (store |v_#memory_int_229| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_229| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_230| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_230|) (= (store |v_#memory_int_230| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_230| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1)) |#memory_int|))) (= |v_ULTIMATE.start_dll_append_~head#1.base_31| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_171| (Array Int Int))) (and (= (store |v_#valid_171| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_171| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_#length_154| (Array Int Int))) (= (store |v_#length_154| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|))) (and (exists ((|v_#memory_$Pointer$.offset_264| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_264| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_264| |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_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_154| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_154| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_269| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_269| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_269| |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_#memory_int_228| (Array Int (Array Int Int))) (|v_#memory_int_229| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_228| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_228| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_229| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_229|) (= (store |v_#memory_int_229| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_229| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_230| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_230|) (= (store |v_#memory_int_230| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_230| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1)) |#memory_int|))) (= |v_ULTIMATE.start_dll_append_~head#1.base_31| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_171| (Array Int Int))) (and (= (store |v_#valid_171| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_171| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_#length_154| (Array Int Int))) (= (store |v_#length_154| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)))) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_31|) 0)) (<= 4 (select |#length| |v_ULTIMATE.start_dll_append_~head#1.base_31|)) (= (select |#valid| |v_ULTIMATE.start_dll_append_~head#1.base_31|) 1))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_47| Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_42| Int)) (and (<= 0 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_42| 4)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~last~0#1.base_47|) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_42| 4)) |v_ULTIMATE.start_dll_append_~last~0#1.offset_43|) (= (select |#valid| |v_ULTIMATE.start_dll_append_~last~0#1.base_47|) 1) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_47|) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_42| 4)) |v_ULTIMATE.start_dll_append_~last~0#1.base_48|) (<= (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_42| 8) (select |#length| |v_ULTIMATE.start_dll_append_~last~0#1.base_47|))))) (or (< (select |#length| |v_ULTIMATE.start_dll_append_~last~0#1.base_48|) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_43| 8)) (< (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_43| 4) 0)))) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:29:15,308 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:29:15,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:29:15,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 45 [2024-11-09 06:29:15,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131237788] [2024-11-09 06:29:15,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:29:15,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 06:29:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:15,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 06:29:15,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4709, Unknown=7, NotChecked=138, Total=5112 [2024-11-09 06:29:15,313 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 46 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:29:42,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:42,680 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2024-11-09 06:29:42,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 06:29:42,681 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2024-11-09 06:29:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:42,683 INFO L225 Difference]: With dead ends: 83 [2024-11-09 06:29:42,684 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 06:29:42,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2022 ImplicationChecksByTransitivity, 94.9s TimeCoverageRelationStatistics Valid=387, Invalid=6582, Unknown=7, NotChecked=164, Total=7140 [2024-11-09 06:29:42,687 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 86 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:42,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1041 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1580 Invalid, 0 Unknown, 94 Unchecked, 17.3s Time] [2024-11-09 06:29:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 06:29:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-11-09 06:29:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.4) internal successors, (84), 74 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) [2024-11-09 06:29:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2024-11-09 06:29:42,692 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 47 [2024-11-09 06:29:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:42,692 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2024-11-09 06:29:42,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:29:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2024-11-09 06:29:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 06:29:42,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:42,693 INFO L215 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] [2024-11-09 06:29:42,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 06:29:42,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:29:42,895 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:29:42,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash 126638444, now seen corresponding path program 1 times [2024-11-09 06:29:42,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:42,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129524193] [2024-11-09 06:29:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 06:29:44,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:44,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129524193] [2024-11-09 06:29:44,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129524193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:44,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:44,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:29:44,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635352885] [2024-11-09 06:29:44,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:44,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:29:44,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:44,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:29:44,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:29:44,518 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 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) [2024-11-09 06:29:48,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:48,101 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2024-11-09 06:29:48,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:29:48,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 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 [2024-11-09 06:29:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:48,105 INFO L225 Difference]: With dead ends: 105 [2024-11-09 06:29:48,105 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 06:29:48,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:29:48,106 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 36 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:48,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 309 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 06:29:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 06:29:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2024-11-09 06:29:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.4) internal successors, (91), 78 states have internal predecessors, (91), 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) [2024-11-09 06:29:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2024-11-09 06:29:48,118 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 48 [2024-11-09 06:29:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:48,119 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2024-11-09 06:29:48,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 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) [2024-11-09 06:29:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2024-11-09 06:29:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 06:29:48,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:48,121 INFO L215 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] [2024-11-09 06:29:48,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:29:48,121 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:29:48,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:48,122 INFO L85 PathProgramCache]: Analyzing trace with hash 126638445, now seen corresponding path program 1 times [2024-11-09 06:29:48,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:48,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180358681] [2024-11-09 06:29:48,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 06:29:50,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:50,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180358681] [2024-11-09 06:29:50,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180358681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:50,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:50,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:29:50,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200880495] [2024-11-09 06:29:50,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:50,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:29:50,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:50,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:29:50,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:29:50,111 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 9 states, 6 states have (on average 5.166666666666667) 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) [2024-11-09 06:29:52,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:52,607 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2024-11-09 06:29:52,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:29:52,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 5.166666666666667) 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 48 [2024-11-09 06:29:52,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:52,609 INFO L225 Difference]: With dead ends: 103 [2024-11-09 06:29:52,609 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 06:29:52,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:29:52,610 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 33 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:52,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 261 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 06:29:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 06:29:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 85. [2024-11-09 06:29:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 80 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:29:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-11-09 06:29:52,623 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 48 [2024-11-09 06:29:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:52,624 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-11-09 06:29:52,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 5.166666666666667) 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) [2024-11-09 06:29:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-11-09 06:29:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 06:29:52,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:52,625 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:52,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:29:52,625 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:29:52,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash -307564726, now seen corresponding path program 2 times [2024-11-09 06:29:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838954907] [2024-11-09 06:29:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:12,262 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:30:12,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:12,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838954907] [2024-11-09 06:30:12,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838954907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:30:12,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367438664] [2024-11-09 06:30:12,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:30:12,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:30:12,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:30:12,264 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:30:12,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 06:30:12,696 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 06:30:12,696 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:30:12,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-09 06:30:12,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:30:16,984 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 [2024-11-09 06:30:17,040 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 [2024-11-09 06:30:22,330 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 06:30:22,330 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 [2024-11-09 06:30:22,430 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 [2024-11-09 06:30:22,473 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 [2024-11-09 06:30:24,534 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 [2024-11-09 06:30:24,598 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 [2024-11-09 06:30:24,751 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 [2024-11-09 06:30:24,901 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 [2024-11-09 06:30:26,020 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:30:26,020 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 [2024-11-09 06:30:26,081 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 [2024-11-09 06:30:29,509 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:30:29,509 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 [2024-11-09 06:30:29,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:30:29,575 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 [2024-11-09 06:30:30,120 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_101| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_101| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_101|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_101| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_101|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_101| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_101|))))) is different from true [2024-11-09 06:30:30,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:30:30,470 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-09 06:30:30,471 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 [2024-11-09 06:30:30,753 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 06:30:30,753 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 [2024-11-09 06:30:30,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:30:30,852 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 06:30:30,853 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 [2024-11-09 06:30:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-09 06:30:54,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:30:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367438664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:30:58,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [839848895] [2024-11-09 06:30:58,995 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 06:30:58,995 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:30:58,996 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:30:58,996 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:30:58,996 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:31:01,638 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 87 for LOIs [2024-11-09 06:31:01,981 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:31:50,827 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5886#(and (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_57| Int)) (and (or (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_56| Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_51| Int)) (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_56|) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_51| 4)) |v_ULTIMATE.start_dll_append_~last~0#1.base_57|) (<= 0 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_51| 4)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~last~0#1.base_56|) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_51| 4)) |ULTIMATE.start_dll_append_~last~0#1.offset|) (<= (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_51| 8) (select |#length| |v_ULTIMATE.start_dll_append_~last~0#1.base_56|)) (= 1 (select |#valid| |v_ULTIMATE.start_dll_append_~last~0#1.base_56|)))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_33| Int)) (and (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_33|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~head#1.base_33|) 0) 0))) (or (and (exists ((|v_#memory_$Pointer$.offset_304| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_304| |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_181| (Array Int Int))) (and (= (store |v_#valid_181| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_181| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_#length_161| (Array Int Int))) (= |#length| (store |v_#length_161| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (= |v_ULTIMATE.start_dll_append_~head#1.base_33| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_309| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_309| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_309| |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_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_257| (Array Int (Array Int Int))) (|v_#memory_int_258| (Array Int (Array Int Int))) (|v_#memory_int_256| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_256| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_256| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_257| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_257|) (= (store |v_#memory_int_257| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_257| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_258| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_258|) (= |#memory_int| (store |v_#memory_int_258| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_258| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))))) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_182| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_182| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (and (exists ((|v_#memory_$Pointer$.offset_304| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_304| |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_181| (Array Int Int))) (and (= (store |v_#valid_181| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_181| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_#length_161| (Array Int Int))) (= |#length| (store |v_#length_161| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (= |v_ULTIMATE.start_dll_append_~head#1.base_33| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_309| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_309| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_309| |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_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_257| (Array Int (Array Int Int))) (|v_#memory_int_258| (Array Int (Array Int Int))) (|v_#memory_int_256| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_256| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_256| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_257| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_257|) (= (store |v_#memory_int_257| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_257| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_258| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_258|) (= |#memory_int| (store |v_#memory_int_258| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_258| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_110| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_110| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) (= |ULTIMATE.start_dll_append_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~head#1.base_33|) 0)) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_33|) 0)) (= (select |#valid| |v_ULTIMATE.start_dll_append_~head#1.base_33|) 1) (<= 4 (select |#length| |v_ULTIMATE.start_dll_append_~head#1.base_33|))))) (not (= (select |#valid| |v_ULTIMATE.start_dll_append_~last~0#1.base_57|) 1)))) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:31:50,827 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:31:50,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:31:50,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 50 [2024-11-09 06:31:50,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396820951] [2024-11-09 06:31:50,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:31:50,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 06:31:50,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:50,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 06:31:50,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=5429, Unknown=8, NotChecked=148, Total=5852 [2024-11-09 06:31:50,831 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 50 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 44 states have internal predecessors, (80), 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) [2024-11-09 06:32:08,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:32:13,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:32:35,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 22.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:32:39,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:32:42,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:32:45,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:32:48,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:32:51,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:32:53,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:32:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:55,952 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2024-11-09 06:32:55,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 06:32:55,953 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 44 states have internal predecessors, (80), 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 50 [2024-11-09 06:32:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:55,955 INFO L225 Difference]: With dead ends: 112 [2024-11-09 06:32:55,955 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 06:32:55,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 106.5s TimeCoverageRelationStatistics Valid=373, Invalid=7455, Unknown=8, NotChecked=174, Total=8010 [2024-11-09 06:32:55,958 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 21 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 13 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 56.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:55,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1237 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1427 Invalid, 8 Unknown, 112 Unchecked, 56.8s Time] [2024-11-09 06:32:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 06:32:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2024-11-09 06:32:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 98 states have internal predecessors, (114), 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) [2024-11-09 06:32:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2024-11-09 06:32:55,964 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 50 [2024-11-09 06:32:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:55,964 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2024-11-09 06:32:55,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 44 states have internal predecessors, (80), 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) [2024-11-09 06:32:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2024-11-09 06:32:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 06:32:55,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:55,965 INFO L215 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] [2024-11-09 06:32:55,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 06:32:56,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:32:56,166 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:32:56,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:56,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1458593373, now seen corresponding path program 1 times [2024-11-09 06:32:56,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:56,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374445701] [2024-11-09 06:32:56,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:56,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 06:32:57,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374445701] [2024-11-09 06:32:57,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374445701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:57,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:57,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:57,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952737818] [2024-11-09 06:32:57,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:57,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:57,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:57,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:57,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:57,246 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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) [2024-11-09 06:32:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:58,576 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2024-11-09 06:32:58,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:58,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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 50 [2024-11-09 06:32:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:58,577 INFO L225 Difference]: With dead ends: 123 [2024-11-09 06:32:58,577 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 06:32:58,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:32:58,578 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:58,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 334 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 06:32:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 06:32:58,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2024-11-09 06:32:58,583 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) [2024-11-09 06:32:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2024-11-09 06:32:58,584 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 50 [2024-11-09 06:32:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:58,584 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2024-11-09 06:32:58,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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) [2024-11-09 06:32:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2024-11-09 06:32:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 06:32:58,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:58,586 INFO L215 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, 1] [2024-11-09 06:32:58,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 06:32:58,586 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:32:58,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash 160578096, now seen corresponding path program 1 times [2024-11-09 06:32:58,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:58,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488200340] [2024-11-09 06:32:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:33:03,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:03,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488200340] [2024-11-09 06:33:03,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488200340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:03,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:03,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-09 06:33:03,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274064002] [2024-11-09 06:33:03,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:03,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 06:33:03,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:03,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 06:33:03,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-09 06:33:03,372 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand has 20 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 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) [2024-11-09 06:33:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:11,085 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2024-11-09 06:33:11,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 06:33:11,086 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 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 52 [2024-11-09 06:33:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:11,087 INFO L225 Difference]: With dead ends: 134 [2024-11-09 06:33:11,087 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 06:33:11,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2024-11-09 06:33:11,088 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 115 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:11,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 580 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-09 06:33:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 06:33:11,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2024-11-09 06:33:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.326086956521739) internal successors, (122), 105 states have internal predecessors, (122), 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) [2024-11-09 06:33:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2024-11-09 06:33:11,094 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 52 [2024-11-09 06:33:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:11,095 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2024-11-09 06:33:11,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 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) [2024-11-09 06:33:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2024-11-09 06:33:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 06:33:11,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:11,096 INFO L215 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, 1] [2024-11-09 06:33:11,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 06:33:11,097 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-09 06:33:11,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash 160578097, now seen corresponding path program 1 times [2024-11-09 06:33:11,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:11,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789849896] [2024-11-09 06:33:11,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:33:18,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:18,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789849896] [2024-11-09 06:33:18,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789849896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:33:18,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087180932] [2024-11-09 06:33:18,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:18,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:33:18,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:33:18,265 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:33:18,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74c6f98e-c6a1-4873-ae9d-a975265b8f83/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 06:33:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:18,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-09 06:33:18,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:33:18,577 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 [2024-11-09 06:33:19,132 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 [2024-11-09 06:33:19,496 WARN L873 $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 [2024-11-09 06:33:19,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:19,684 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 [2024-11-09 06:33:20,171 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 [2024-11-09 06:33:20,193 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 [2024-11-09 06:33:21,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:21,569 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 [2024-11-09 06:33:24,798 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 [2024-11-09 06:33:24,826 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 [2024-11-09 06:33:24,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:24,860 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 [2024-11-09 06:33:24,882 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 [2024-11-09 06:33:27,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:27,593 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 [2024-11-09 06:33:27,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:27,646 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 36 treesize of output 27 [2024-11-09 06:33:27,766 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 06:33:27,766 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 [2024-11-09 06:33:27,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:27,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:27,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-09 06:33:31,349 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-09 06:33:31,349 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 40 treesize of output 35 [2024-11-09 06:33:31,532 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-09 06:33:31,532 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 21 treesize of output 20 [2024-11-09 06:33:33,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:33,471 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 06:33:33,471 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 99 [2024-11-09 06:33:33,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:33,709 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 06:33:33,709 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 110 [2024-11-09 06:33:34,066 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 7 treesize of output 3 [2024-11-09 06:33:34,657 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 7 treesize of output 3 [2024-11-09 06:33:35,103 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 7 treesize of output 3 [2024-11-09 06:33:38,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:33:38,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 187 [2024-11-09 06:33:38,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:33:38,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 179 [2024-11-09 06:34:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 10 not checked. [2024-11-09 06:34:05,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:34:06,665 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2988 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2988) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_2989 (Array Int Int)) (v_ArrVal_2988 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2988) |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_2989) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2024-11-09 06:34:06,733 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)))) (and (forall ((v_ArrVal_2989 (Array Int Int)) (v_ArrVal_2988 (Array Int Int))) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2988) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2989) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2988 (Array Int Int))) (<= 0 (select (select (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2988) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-09 06:34:24,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087180932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:34:24,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [621154582] [2024-11-09 06:34:24,893 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2024-11-09 06:34:24,893 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:34:24,893 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:34:24,894 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:34:24,894 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:34:26,819 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 33 for LOIs [2024-11-09 06:34:26,909 INFO L180 IcfgInterpreter]: Interpretation finished