./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:42:46,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:42:46,346 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 16:42:46,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:42:46,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:42:46,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:42:46,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:42:46,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:42:46,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:42:46,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:42:46,379 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:42:46,380 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:42:46,380 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:42:46,381 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 16:42:46,381 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:42:46,382 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:42:46,382 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 16:42:46,383 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 16:42:46,383 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:42:46,384 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 16:42:46,385 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 16:42:46,385 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 16:42:46,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 16:42:46,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 16:42:46,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:42:46,388 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:42:46,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 16:42:46,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:42:46,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:42:46,389 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 16:42:46,390 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 16:42:46,390 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 16:42:46,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:42:46,391 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 16:42:46,391 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 16:42:46,391 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:42:46,391 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:42:46,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:42:46,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:42:46,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:42:46,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:42:46,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:42:46,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:42:46,393 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 16:42:46,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 16:42:46,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:42:46,393 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:42:46,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:42:46,393 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_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2023-12-02 16:42:46,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:42:46,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:42:46,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:42:46,660 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:42:46,660 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:42:46,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-12-02 16:42:49,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:42:49,663 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:42:49,663 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-12-02 16:42:49,679 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/data/c2e81cec8/62acba8edb6742d8817906f2e8f1608e/FLAGdcb25346f [2023-12-02 16:42:49,696 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/data/c2e81cec8/62acba8edb6742d8817906f2e8f1608e [2023-12-02 16:42:49,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:42:49,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:42:49,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:42:49,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:42:49,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:42:49,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:42:49" (1/1) ... [2023-12-02 16:42:49,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1208f1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:49, skipping insertion in model container [2023-12-02 16:42:49,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:42:49" (1/1) ... [2023-12-02 16:42:49,754 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:42:50,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:42:50,052 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 16:42:50,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:42:50,125 INFO L206 MainTranslator]: Completed translation [2023-12-02 16:42:50,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:50 WrapperNode [2023-12-02 16:42:50,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:42:50,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 16:42:50,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 16:42:50,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 16:42:50,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:50" (1/1) ... [2023-12-02 16:42:50,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:50" (1/1) ... [2023-12-02 16:42:50,173 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2023-12-02 16:42:50,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 16:42:50,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 16:42:50,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 16:42:50,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 16:42:50,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:50" (1/1) ... [2023-12-02 16:42:50,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:50" (1/1) ... [2023-12-02 16:42:50,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:50" (1/1) ... [2023-12-02 16:42:50,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:50" (1/1) ... [2023-12-02 16:42:50,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:50" (1/1) ... [2023-12-02 16:42:50,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:50" (1/1) ... [2023-12-02 16:42:50,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:50" (1/1) ... [2023-12-02 16:42:50,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:50" (1/1) ... [2023-12-02 16:42:50,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 16:42:50,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 16:42:50,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 16:42:50,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 16:42:50,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:50" (1/1) ... [2023-12-02 16:42:50,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:42:50,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:42:50,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 16:42:50,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 16:42:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 16:42:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 16:42:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 16:42:50,275 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 16:42:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 16:42:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 16:42:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 16:42:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 16:42:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 16:42:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 16:42:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 16:42:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 16:42:50,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 16:42:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 16:42:50,383 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 16:42:50,385 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 16:42:50,739 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 16:42:50,781 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 16:42:50,782 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 16:42:50,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:42:50 BoogieIcfgContainer [2023-12-02 16:42:50,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 16:42:50,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 16:42:50,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 16:42:50,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 16:42:50,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:42:49" (1/3) ... [2023-12-02 16:42:50,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133a98e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:42:50, skipping insertion in model container [2023-12-02 16:42:50,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:42:50" (2/3) ... [2023-12-02 16:42:50,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133a98e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:42:50, skipping insertion in model container [2023-12-02 16:42:50,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:42:50" (3/3) ... [2023-12-02 16:42:50,792 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-12-02 16:42:50,806 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 16:42:50,807 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2023-12-02 16:42:50,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 16:42:50,853 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5dee2970, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 16:42:50,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-12-02 16:42:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 50 states have (on average 2.28) internal successors, (114), 102 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:42:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 16:42:50,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:50,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 16:42:50,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:42:50,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:50,866 INFO L85 PathProgramCache]: Analyzing trace with hash 233264712, now seen corresponding path program 1 times [2023-12-02 16:42:50,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:50,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479652900] [2023-12-02 16:42:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:50,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:42:51,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:51,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479652900] [2023-12-02 16:42:51,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479652900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:42:51,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:42:51,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:42:51,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490599232] [2023-12-02 16:42:51,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:42:51,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:42:51,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:42:51,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:42:51,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:42:51,140 INFO L87 Difference]: Start difference. First operand has 107 states, 50 states have (on average 2.28) internal successors, (114), 102 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:42:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:42:51,269 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2023-12-02 16:42:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:42:51,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 16:42:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:42:51,280 INFO L225 Difference]: With dead ends: 104 [2023-12-02 16:42:51,281 INFO L226 Difference]: Without dead ends: 102 [2023-12-02 16:42:51,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:42:51,286 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:42:51,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 144 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:42:51,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-02 16:42:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-02 16:42:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 97 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:42:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2023-12-02 16:42:51,332 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 5 [2023-12-02 16:42:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:42:51,332 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2023-12-02 16:42:51,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:42:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2023-12-02 16:42:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 16:42:51,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:51,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 16:42:51,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 16:42:51,334 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:42:51,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:51,335 INFO L85 PathProgramCache]: Analyzing trace with hash 233264713, now seen corresponding path program 1 times [2023-12-02 16:42:51,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:51,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947208883] [2023-12-02 16:42:51,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:51,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:42:51,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:51,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947208883] [2023-12-02 16:42:51,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947208883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:42:51,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:42:51,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:42:51,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664057190] [2023-12-02 16:42:51,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:42:51,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:42:51,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:42:51,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:42:51,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:42:51,452 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:42:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:42:51,555 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-12-02 16:42:51,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:42:51,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 16:42:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:42:51,557 INFO L225 Difference]: With dead ends: 100 [2023-12-02 16:42:51,557 INFO L226 Difference]: Without dead ends: 100 [2023-12-02 16:42:51,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:42:51,559 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:42:51,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 149 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:42:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-02 16:42:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-12-02 16:42:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 2.125) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:42:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-12-02 16:42:51,571 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 5 [2023-12-02 16:42:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:42:51,571 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-12-02 16:42:51,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:42:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-12-02 16:42:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 16:42:51,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:51,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:42:51,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 16:42:51,573 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:42:51,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:51,574 INFO L85 PathProgramCache]: Analyzing trace with hash -791725780, now seen corresponding path program 1 times [2023-12-02 16:42:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:51,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397775894] [2023-12-02 16:42:51,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:51,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:42:51,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:51,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397775894] [2023-12-02 16:42:51,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397775894] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:42:51,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:42:51,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:42:51,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412645253] [2023-12-02 16:42:51,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:42:51,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:42:51,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:42:51,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:42:51,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:42:51,657 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 16:42:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:42:51,695 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2023-12-02 16:42:51,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:42:51,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-02 16:42:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:42:51,696 INFO L225 Difference]: With dead ends: 101 [2023-12-02 16:42:51,697 INFO L226 Difference]: Without dead ends: 101 [2023-12-02 16:42:51,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:42:51,698 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 4 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:42:51,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 178 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:42:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-02 16:42:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-02 16:42:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 96 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:42:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2023-12-02 16:42:51,709 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 10 [2023-12-02 16:42:51,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:42:51,710 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2023-12-02 16:42:51,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 16:42:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2023-12-02 16:42:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 16:42:51,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:51,711 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:42:51,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 16:42:51,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:42:51,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:51,712 INFO L85 PathProgramCache]: Analyzing trace with hash 434569947, now seen corresponding path program 1 times [2023-12-02 16:42:51,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:51,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122710483] [2023-12-02 16:42:51,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:51,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:42:51,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:51,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122710483] [2023-12-02 16:42:51,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122710483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:42:51,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:42:51,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:42:51,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999093711] [2023-12-02 16:42:51,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:42:51,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:42:51,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:42:51,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:42:51,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:42:51,852 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 16:42:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:42:52,061 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-12-02 16:42:52,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:42:52,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-02 16:42:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:42:52,063 INFO L225 Difference]: With dead ends: 100 [2023-12-02 16:42:52,063 INFO L226 Difference]: Without dead ends: 100 [2023-12-02 16:42:52,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:42:52,065 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:42:52,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 288 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:42:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-02 16:42:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-12-02 16:42:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:42:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-12-02 16:42:52,074 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 17 [2023-12-02 16:42:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:42:52,074 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-12-02 16:42:52,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 16:42:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-12-02 16:42:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 16:42:52,075 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:52,075 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:42:52,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 16:42:52,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:42:52,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash 434569948, now seen corresponding path program 1 times [2023-12-02 16:42:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:52,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610570439] [2023-12-02 16:42:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:52,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:42:52,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:52,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610570439] [2023-12-02 16:42:52,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610570439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:42:52,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:42:52,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:42:52,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715087536] [2023-12-02 16:42:52,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:42:52,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:42:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:42:52,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:42:52,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:42:52,242 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 16:42:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:42:52,390 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2023-12-02 16:42:52,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:42:52,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-02 16:42:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:42:52,392 INFO L225 Difference]: With dead ends: 99 [2023-12-02 16:42:52,392 INFO L226 Difference]: Without dead ends: 99 [2023-12-02 16:42:52,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:42:52,393 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:42:52,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 343 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:42:52,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-02 16:42:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-02 16:42:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 49 states have (on average 2.061224489795918) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:42:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2023-12-02 16:42:52,401 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 17 [2023-12-02 16:42:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:42:52,401 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2023-12-02 16:42:52,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 16:42:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2023-12-02 16:42:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 16:42:52,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:52,402 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:42:52,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 16:42:52,403 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:42:52,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:52,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1010090430, now seen corresponding path program 1 times [2023-12-02 16:42:52,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:52,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628280692] [2023-12-02 16:42:52,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:52,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:42:52,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:52,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628280692] [2023-12-02 16:42:52,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628280692] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:42:52,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125760616] [2023-12-02 16:42:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:52,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:42:52,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:42:52,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:42:52,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 16:42:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:52,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 16:42:52,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:42:52,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:42:52,863 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:42:52,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-02 16:42:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:42:52,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:42:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:42:53,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125760616] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:42:53,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1083970868] [2023-12-02 16:42:53,213 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 16:42:53,213 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:42:53,216 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:42:53,220 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:42:53,220 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:42:54,510 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-12-02 16:42:54,609 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:42:56,841 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1267#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-12-02 16:42:56,842 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:42:56,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:42:56,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2023-12-02 16:42:56,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978249985] [2023-12-02 16:42:56,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:42:56,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 16:42:56,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:42:56,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 16:42:56,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=747, Unknown=2, NotChecked=0, Total=870 [2023-12-02 16:42:56,844 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 16:42:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:42:57,232 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-12-02 16:42:57,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 16:42:57,232 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-12-02 16:42:57,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:42:57,233 INFO L225 Difference]: With dead ends: 98 [2023-12-02 16:42:57,233 INFO L226 Difference]: Without dead ends: 98 [2023-12-02 16:42:57,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=133, Invalid=795, Unknown=2, NotChecked=0, Total=930 [2023-12-02 16:42:57,235 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:42:57,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 550 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 16:42:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-02 16:42:57,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-12-02 16:42:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:42:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-12-02 16:42:57,242 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 19 [2023-12-02 16:42:57,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:42:57,242 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-12-02 16:42:57,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 16:42:57,243 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-12-02 16:42:57,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 16:42:57,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:42:57,243 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:42:57,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 16:42:57,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:42:57,444 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:42:57,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:42:57,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1010090431, now seen corresponding path program 1 times [2023-12-02 16:42:57,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:42:57,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557212190] [2023-12-02 16:42:57,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:57,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:42:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:42:57,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:42:57,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557212190] [2023-12-02 16:42:57,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557212190] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:42:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847742848] [2023-12-02 16:42:57,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:42:57,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:42:57,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:42:57,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:42:57,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 16:42:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:42:57,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 16:42:57,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:42:57,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:42:57,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 16:42:58,005 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:42:58,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-02 16:42:58,019 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:42:58,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 16:42:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:42:58,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:42:58,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847742848] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:42:58,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1719215564] [2023-12-02 16:42:58,207 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 16:42:58,207 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:42:58,207 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:42:58,207 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:42:58,207 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:42:58,893 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-12-02 16:42:58,968 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:43:01,361 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1566#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-12-02 16:43:01,361 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:43:01,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:43:01,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-12-02 16:43:01,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775071393] [2023-12-02 16:43:01,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:43:01,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 16:43:01,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:43:01,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 16:43:01,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2023-12-02 16:43:01,364 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:43:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:43:01,850 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2023-12-02 16:43:01,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 16:43:01,851 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-12-02 16:43:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:43:01,852 INFO L225 Difference]: With dead ends: 99 [2023-12-02 16:43:01,852 INFO L226 Difference]: Without dead ends: 99 [2023-12-02 16:43:01,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2023-12-02 16:43:01,854 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 4 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:43:01,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 639 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 16:43:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-02 16:43:01,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2023-12-02 16:43:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 49 states have (on average 2.020408163265306) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:43:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-12-02 16:43:01,860 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 19 [2023-12-02 16:43:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:43:01,861 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-12-02 16:43:01,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:43:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-12-02 16:43:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 16:43:01,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:43:01,862 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:43:01,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 16:43:02,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:43:02,063 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:43:02,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:43:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash -179497255, now seen corresponding path program 1 times [2023-12-02 16:43:02,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:43:02,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730108359] [2023-12-02 16:43:02,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:43:02,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:43:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:43:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:43:02,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:43:02,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730108359] [2023-12-02 16:43:02,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730108359] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:43:02,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869555074] [2023-12-02 16:43:02,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:43:02,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:43:02,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:43:02,468 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:43:02,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 16:43:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:43:02,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 16:43:02,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:43:02,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:43:02,631 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:43:02,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-02 16:43:02,678 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-12-02 16:43:02,695 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-12-02 16:43:02,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-12-02 16:43:02,781 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 16:43:02,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 16:43:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2023-12-02 16:43:02,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:43:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:43:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869555074] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:43:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [11223175] [2023-12-02 16:43:03,326 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 16:43:03,327 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:43:03,327 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:43:03,327 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:43:03,327 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:43:04,118 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 16:43:04,137 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:43:07,371 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1963#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 1) (or (and (exists ((|v_#length_124| (Array Int Int))) (= (store |v_#length_124| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int)))) (and (= |v_#memory_int_106| (store |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_106| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_106| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_106| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1))))) (exists ((|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_109| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#length_BEFORE_CALL_57| (Array Int Int)) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int) (|v_old(#memory_int)_AFTER_CALL_32| (Array Int (Array Int Int)))) (and (<= 4 (select |v_#length_BEFORE_CALL_57| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)) (= (select |v_old(#valid)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_32| (store |v_#memory_int_109| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_109| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))) (= (select (select (store |v_#memory_$Pointer$.base_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_153| (Array Int Int))) (and (= (store |v_#valid_153| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_153| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) |#memory_$Pointer$.base|))) (and (exists ((|v_#length_124| (Array Int Int))) (= (store |v_#length_124| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int)))) (and (= |v_#memory_int_106| (store |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_106| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_106| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_106| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1))))) (exists ((|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_153| (Array Int Int))) (and (= (store |v_#valid_153| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_153| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_109| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_old(#length)_AFTER_CALL_33| (Array Int Int)) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_33| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= |v_old(#memory_int)_AFTER_CALL_33| (store |v_#memory_int_109| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_109| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)) (= (select (select (store |v_#memory_$Pointer$.base_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|))))) (not (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1))' at error location [2023-12-02 16:43:07,372 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:43:07,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:43:07,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2023-12-02 16:43:07,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130960215] [2023-12-02 16:43:07,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:43:07,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 16:43:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:43:07,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 16:43:07,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1190, Unknown=5, NotChecked=70, Total=1406 [2023-12-02 16:43:07,375 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-02 16:43:07,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:43:07,878 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2023-12-02 16:43:07,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 16:43:07,879 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 27 [2023-12-02 16:43:07,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:43:07,880 INFO L225 Difference]: With dead ends: 105 [2023-12-02 16:43:07,880 INFO L226 Difference]: Without dead ends: 105 [2023-12-02 16:43:07,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=178, Invalid=1381, Unknown=5, NotChecked=76, Total=1640 [2023-12-02 16:43:07,881 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 263 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:43:07,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 329 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 537 Invalid, 0 Unknown, 109 Unchecked, 0.4s Time] [2023-12-02 16:43:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-02 16:43:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2023-12-02 16:43:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.836734693877551) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:43:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-12-02 16:43:07,886 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 27 [2023-12-02 16:43:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:43:07,886 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-12-02 16:43:07,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-02 16:43:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-12-02 16:43:07,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 16:43:07,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:43:07,887 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:43:07,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 16:43:08,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:43:08,088 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:43:08,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:43:08,088 INFO L85 PathProgramCache]: Analyzing trace with hash -179497254, now seen corresponding path program 1 times [2023-12-02 16:43:08,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:43:08,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155756040] [2023-12-02 16:43:08,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:43:08,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:43:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:43:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:43:08,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:43:08,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155756040] [2023-12-02 16:43:08,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155756040] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:43:08,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772436766] [2023-12-02 16:43:08,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:43:08,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:43:08,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:43:08,504 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:43:08,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 16:43:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:43:08,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 16:43:08,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:43:08,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 16:43:08,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 16:43:08,688 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-12-02 16:43:08,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:43:08,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 16:43:08,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 16:43:08,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:43:08,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 16:43:08,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 16:43:08,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:43:08,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 16:43:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:43:08,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:43:08,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772436766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:43:08,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:43:08,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-12-02 16:43:08,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041986070] [2023-12-02 16:43:08,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:43:08,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 16:43:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:43:08,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 16:43:08,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2023-12-02 16:43:08,841 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 16:43:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:43:08,990 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2023-12-02 16:43:08,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 16:43:08,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-12-02 16:43:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:43:08,992 INFO L225 Difference]: With dead ends: 82 [2023-12-02 16:43:08,992 INFO L226 Difference]: Without dead ends: 82 [2023-12-02 16:43:08,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2023-12-02 16:43:08,992 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:43:08,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 209 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 111 Unchecked, 0.1s Time] [2023-12-02 16:43:08,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-02 16:43:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-12-02 16:43:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 77 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:43:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2023-12-02 16:43:08,997 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 27 [2023-12-02 16:43:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:43:08,997 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2023-12-02 16:43:08,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 16:43:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2023-12-02 16:43:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 16:43:08,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:43:08,999 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:43:09,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 16:43:09,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:43:09,205 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:43:09,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:43:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash -168434192, now seen corresponding path program 1 times [2023-12-02 16:43:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:43:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368034521] [2023-12-02 16:43:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:43:09,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:43:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:43:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 16:43:09,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:43:09,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368034521] [2023-12-02 16:43:09,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368034521] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:43:09,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:43:09,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:43:09,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176994255] [2023-12-02 16:43:09,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:43:09,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:43:09,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:43:09,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:43:09,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:43:09,322 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 16:43:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:43:09,449 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2023-12-02 16:43:09,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:43:09,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-12-02 16:43:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:43:09,451 INFO L225 Difference]: With dead ends: 80 [2023-12-02 16:43:09,451 INFO L226 Difference]: Without dead ends: 80 [2023-12-02 16:43:09,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:43:09,452 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:43:09,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 212 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:43:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-02 16:43:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-12-02 16:43:09,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:43:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-12-02 16:43:09,456 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 30 [2023-12-02 16:43:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:43:09,456 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-12-02 16:43:09,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 16:43:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-12-02 16:43:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 16:43:09,457 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:43:09,457 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:43:09,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 16:43:09,457 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:43:09,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:43:09,458 INFO L85 PathProgramCache]: Analyzing trace with hash -168434191, now seen corresponding path program 1 times [2023-12-02 16:43:09,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:43:09,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580543857] [2023-12-02 16:43:09,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:43:09,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:43:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:43:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 16:43:09,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:43:09,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580543857] [2023-12-02 16:43:09,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580543857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:43:09,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:43:09,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:43:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909572542] [2023-12-02 16:43:09,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:43:09,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:43:09,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:43:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:43:09,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:43:09,668 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 16:43:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:43:09,809 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-12-02 16:43:09,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:43:09,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-12-02 16:43:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:43:09,810 INFO L225 Difference]: With dead ends: 78 [2023-12-02 16:43:09,810 INFO L226 Difference]: Without dead ends: 78 [2023-12-02 16:43:09,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:43:09,811 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:43:09,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 224 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:43:09,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-02 16:43:09,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-02 16:43:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 73 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:43:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2023-12-02 16:43:09,815 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 30 [2023-12-02 16:43:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:43:09,815 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2023-12-02 16:43:09,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 16:43:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2023-12-02 16:43:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 16:43:09,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:43:09,816 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:43:09,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 16:43:09,817 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:43:09,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:43:09,817 INFO L85 PathProgramCache]: Analyzing trace with hash -168420942, now seen corresponding path program 1 times [2023-12-02 16:43:09,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:43:09,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262835724] [2023-12-02 16:43:09,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:43:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:43:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:43:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:43:10,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:43:10,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262835724] [2023-12-02 16:43:10,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262835724] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:43:10,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075241010] [2023-12-02 16:43:10,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:43:10,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:43:10,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:43:10,322 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:43:10,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 16:43:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:43:10,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 16:43:10,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:43:10,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:43:10,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-12-02 16:43:10,693 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 16:43:10,717 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-12-02 16:43:10,717 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 23 treesize of output 24 [2023-12-02 16:43:10,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:43:10,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-12-02 16:43:10,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 16:43:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 16:43:10,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:43:10,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075241010] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:43:10,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1442495272] [2023-12-02 16:43:10,862 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 16:43:10,862 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:43:10,863 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:43:10,863 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:43:10,863 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:43:11,820 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 16:43:11,839 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:43:17,591 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2899#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1)) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (or (and (exists ((|v_#memory_$Pointer$.base_150| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_49| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_80| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_int_121| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_#memory_$Pointer$.offset_146| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_150| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_150| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 4 (select |v_old(#length)_AFTER_CALL_49| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (select (select (store |v_#memory_$Pointer$.offset_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_49| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (store |v_#memory_int_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_#memory_int_BEFORE_CALL_80| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0))) |v_#memory_int_BEFORE_CALL_80|))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_146| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_146| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#valid_164| (Array Int Int))) (and (= (select |v_#valid_164| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_164| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_135| (Array Int Int))) (= (store |v_#length_135| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_142| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_142| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_142| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (exists ((|v_#memory_int_118| (Array Int (Array Int Int))) (|v_#memory_int_117| (Array Int (Array Int Int)))) (and (= |v_#memory_int_118| (store |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_118| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_118| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_118| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1)))))) (and (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_146| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_146| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#valid_164| (Array Int Int))) (and (= (select |v_#valid_164| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_164| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_old(#memory_int)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$.base_150| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_int_121| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$.offset_146| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_150| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_150| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select (select (store |v_#memory_$Pointer$.offset_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_48| (store |v_#memory_int_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_48| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))) (<= 4 (select |v_old(#length)_AFTER_CALL_48| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1))) (exists ((|v_#length_135| (Array Int Int))) (= (store |v_#length_135| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_142| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_142| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_142| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (exists ((|v_#memory_int_118| (Array Int (Array Int Int))) (|v_#memory_int_117| (Array Int (Array Int Int)))) (and (= |v_#memory_int_118| (store |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_118| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_118| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_118| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1))))))) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_prepend_~head#1.base|)))' at error location [2023-12-02 16:43:17,591 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:43:17,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:43:17,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-12-02 16:43:17,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026623683] [2023-12-02 16:43:17,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:43:17,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 16:43:17,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:43:17,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 16:43:17,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1584, Unknown=7, NotChecked=80, Total=1806 [2023-12-02 16:43:17,594 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 24 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 21 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:43:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:43:18,409 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-12-02 16:43:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 16:43:18,410 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 21 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-12-02 16:43:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:43:18,411 INFO L225 Difference]: With dead ends: 81 [2023-12-02 16:43:18,411 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 16:43:18,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=200, Invalid=2244, Unknown=10, NotChecked=96, Total=2550 [2023-12-02 16:43:18,413 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 96 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:43:18,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 470 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 867 Invalid, 0 Unknown, 89 Unchecked, 0.5s Time] [2023-12-02 16:43:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 16:43:18,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2023-12-02 16:43:18,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 72 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:43:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-12-02 16:43:18,415 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 30 [2023-12-02 16:43:18,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:43:18,415 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-12-02 16:43:18,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 21 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:43:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-12-02 16:43:18,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 16:43:18,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:43:18,416 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:43:18,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 16:43:18,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 16:43:18,617 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:43:18,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:43:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash -168420941, now seen corresponding path program 1 times [2023-12-02 16:43:18,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:43:18,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336260699] [2023-12-02 16:43:18,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:43:18,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:43:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:43:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:43:19,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:43:19,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336260699] [2023-12-02 16:43:19,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336260699] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:43:19,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420218107] [2023-12-02 16:43:19,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:43:19,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:43:19,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:43:19,562 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:43:19,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 16:43:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:43:19,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 16:43:19,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:43:19,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-02 16:43:19,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 16:43:20,031 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 16:43:20,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:43:20,063 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 33 treesize of output 26 [2023-12-02 16:43:20,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:43:20,070 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 24 treesize of output 19 [2023-12-02 16:43:20,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:43:20,081 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 31 treesize of output 24 [2023-12-02 16:43:20,095 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 16:43:20,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-02 16:43:20,149 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 23 treesize of output 15 [2023-12-02 16:43:20,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-02 16:43:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2023-12-02 16:43:20,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:43:20,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420218107] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:43:20,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1867388317] [2023-12-02 16:43:20,415 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 16:43:20,416 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:43:20,416 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:43:20,416 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:43:20,416 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:43:21,264 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 16:43:21,278 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:43:27,544 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3224#(and (or (and (exists ((|v_#length_145| (Array Int Int))) (= |#length| (store |v_#length_145| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_int_130| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_129| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_129| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_130|) (= (store |v_#memory_int_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1)) |#memory_int|))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_old(#memory_int)_AFTER_CALL_62| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_162| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_62| (Array Int Int)) (|v_#memory_$Pointer$.base_166| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_62| (store |v_#memory_int_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_166| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_166| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 4 (select |v_old(#length)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)) (= (select (select (store |v_#memory_$Pointer$.offset_162| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_162| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_#memory_$Pointer$.base_162| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_162| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_162| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (exists ((|v_#valid_173| (Array Int Int))) (and (= |#valid| (store |v_#valid_173| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_173| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_158| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_158| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_158| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0))) (and (exists ((|v_#length_145| (Array Int Int))) (= |#length| (store |v_#length_145| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_int_130| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_129| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_129| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_130|) (= (store |v_#memory_int_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1)) |#memory_int|))) (exists ((|v_#memory_$Pointer$.base_162| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_162| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_162| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_#length_BEFORE_CALL_111| (Array Int Int)) (|v_#memory_$Pointer$.offset_162| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_166| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_101| (Array Int (Array Int Int)))) (and (= |v_#memory_int_BEFORE_CALL_101| (store |v_#memory_int_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_#memory_int_BEFORE_CALL_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_166| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_166| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select (select (store |v_#memory_$Pointer$.offset_162| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_162| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_#length_BEFORE_CALL_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)))) (exists ((|v_#valid_173| (Array Int Int))) (and (= |#valid| (store |v_#valid_173| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_173| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_158| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_158| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_158| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)))) (<= 1 |#StackHeapBarrier|) (or (< |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 4))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_prepend_~head#1.base|)))' at error location [2023-12-02 16:43:27,544 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:43:27,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:43:27,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2023-12-02 16:43:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813360652] [2023-12-02 16:43:27,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:43:27,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 16:43:27,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:43:27,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 16:43:27,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1829, Unknown=8, NotChecked=86, Total=2070 [2023-12-02 16:43:27,546 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 25 states, 18 states have (on average 2.111111111111111) internal successors, (38), 22 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:43:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:43:28,744 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2023-12-02 16:43:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 16:43:28,744 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 18 states have (on average 2.111111111111111) internal successors, (38), 22 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-12-02 16:43:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:43:28,746 INFO L225 Difference]: With dead ends: 85 [2023-12-02 16:43:28,746 INFO L226 Difference]: Without dead ends: 85 [2023-12-02 16:43:28,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=225, Invalid=2740, Unknown=9, NotChecked=106, Total=3080 [2023-12-02 16:43:28,748 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 119 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 16:43:28,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 602 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 963 Invalid, 0 Unknown, 94 Unchecked, 0.7s Time] [2023-12-02 16:43:28,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-02 16:43:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2023-12-02 16:43:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 79 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:43:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2023-12-02 16:43:28,751 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 30 [2023-12-02 16:43:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:43:28,751 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2023-12-02 16:43:28,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 18 states have (on average 2.111111111111111) internal successors, (38), 22 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 16:43:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2023-12-02 16:43:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 16:43:28,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:43:28,752 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:43:28,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 16:43:28,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 16:43:28,953 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:43:28,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:43:28,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1343500530, now seen corresponding path program 1 times [2023-12-02 16:43:28,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:43:28,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175259110] [2023-12-02 16:43:28,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:43:28,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:43:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:43:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 16:43:29,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:43:29,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175259110] [2023-12-02 16:43:29,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175259110] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:43:29,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:43:29,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 16:43:29,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114651214] [2023-12-02 16:43:29,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:43:29,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 16:43:29,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:43:29,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 16:43:29,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:43:29,180 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 16:43:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:43:29,271 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-12-02 16:43:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:43:29,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-12-02 16:43:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:43:29,273 INFO L225 Difference]: With dead ends: 81 [2023-12-02 16:43:29,273 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 16:43:29,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:43:29,274 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 149 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:43:29,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 91 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:43:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 16:43:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-02 16:43:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:43:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-12-02 16:43:29,278 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 32 [2023-12-02 16:43:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:43:29,278 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-12-02 16:43:29,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 16:43:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-12-02 16:43:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 16:43:29,279 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:43:29,279 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:43:29,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 16:43:29,280 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:43:29,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:43:29,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1301152590, now seen corresponding path program 1 times [2023-12-02 16:43:29,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:43:29,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083584829] [2023-12-02 16:43:29,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:43:29,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:43:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:43:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:43:29,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:43:29,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083584829] [2023-12-02 16:43:29,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083584829] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:43:29,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874678902] [2023-12-02 16:43:29,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:43:29,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:43:29,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:43:29,706 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:43:29,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 16:43:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:43:29,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 16:43:29,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:43:30,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 16:43:30,036 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-12-02 16:43:30,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:43:30,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 16:43:30,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 16:43:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 16:43:30,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:43:30,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874678902] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:43:30,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [916566321] [2023-12-02 16:43:30,176 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 16:43:30,177 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:43:30,177 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:43:30,177 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:43:30,177 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:43:31,293 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 16:43:31,308 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:43:33,182 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_#in~data#1| 1) (let ((.cse0 (exists ((|v_#memory_$Pointer$.offset_172| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_172| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_172| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)))))) (.cse1 (<= (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |c_#StackHeapBarrier|)) (.cse2 (exists ((|v_#memory_int_143| (Array Int (Array Int Int))) (|v_#memory_int_144| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_#memory_int_144| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (= (store |v_#memory_int_143| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_143| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select .cse11 0))) |v_#memory_int_144|) (= |c_#memory_int| (store |v_#memory_int_144| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse11 4 1))))))) (.cse3 (exists ((|v_#length_152| (Array Int Int))) (= |c_#length| (store |v_#length_152| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8)))) (.cse4 (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (.cse5 (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0))) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (= |c_ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse8 (exists ((|v_#valid_180| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_180| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_180| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))) (.cse9 (exists ((|v_#memory_$Pointer$.base_180| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_180| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_180| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)))))) (.cse10 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_74| (Array Int Int)) (|v_#memory_int_147| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| Int) (|v_old(#memory_int)_AFTER_CALL_74| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_74| (Array Int Int)) (|v_#memory_$Pointer$.offset_176| (Array Int (Array Int Int)))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_184| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.base_184| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 4 (select |v_old(#length)_AFTER_CALL_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|)) (= (select |v_old(#valid)_AFTER_CALL_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 1) (= |v_old(#memory_int)_AFTER_CALL_74| (store |v_#memory_int_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_int_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_176| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.offset_176| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) (and (exists ((|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_#length_BEFORE_CALL_136| (Array Int Int)) (|v_#memory_int_147| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| Int) (|v_#memory_$Pointer$.offset_176| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_75| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_75| (store |v_#memory_int_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_int_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_75| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_75| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_184| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.base_184| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 4 (select |v_#length_BEFORE_CALL_136| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|)) (= (select (select (store |v_#memory_$Pointer$.offset_176| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.offset_176| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 2 |c_ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (<= 2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-12-02 16:44:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [916566321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:44:04,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:44:04,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [15, 15] total 43 [2023-12-02 16:44:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250060187] [2023-12-02 16:44:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:44:04,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 16:44:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:44:04,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 16:44:04,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1647, Unknown=26, NotChecked=166, Total=1980 [2023-12-02 16:44:04,432 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:44:08,046 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] [2023-12-02 16:44:10,088 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] [2023-12-02 16:44:12,211 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] [2023-12-02 16:44:14,248 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] [2023-12-02 16:44:15,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 16:44:18,005 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] [2023-12-02 16:44:20,046 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] [2023-12-02 16:44:22,331 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] [2023-12-02 16:44:24,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] [2023-12-02 16:44:26,772 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] [2023-12-02 16:45:09,519 WARN L293 SmtUtils]: Spent 33.42s on a formula simplification. DAG size of input: 179 DAG size of output: 178 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:45:14,809 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] [2023-12-02 16:45:32,497 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] [2023-12-02 16:45:37,146 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] [2023-12-02 16:45:55,330 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] [2023-12-02 16:45:59,118 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] [2023-12-02 16:45:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:45:59,272 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2023-12-02 16:45:59,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 16:45:59,272 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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) Word has length 33 [2023-12-02 16:45:59,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:45:59,273 INFO L225 Difference]: With dead ends: 126 [2023-12-02 16:45:59,273 INFO L226 Difference]: Without dead ends: 126 [2023-12-02 16:45:59,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 75.2s TimeCoverageRelationStatistics Valid=145, Invalid=1728, Unknown=27, NotChecked=170, Total=2070 [2023-12-02 16:45:59,275 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 51 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 6 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 73.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:45:59,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 262 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 975 Invalid, 24 Unknown, 147 Unchecked, 73.0s Time] [2023-12-02 16:45:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-02 16:45:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 86. [2023-12-02 16:45:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.435483870967742) 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) [2023-12-02 16:45:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2023-12-02 16:45:59,278 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 33 [2023-12-02 16:45:59,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:45:59,278 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2023-12-02 16:45:59,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:45:59,278 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2023-12-02 16:45:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 16:45:59,279 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:45:59,279 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:45:59,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 16:45:59,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 16:45:59,480 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:45:59,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:45:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1964659647, now seen corresponding path program 1 times [2023-12-02 16:45:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:45:59,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389907196] [2023-12-02 16:45:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:45:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:45:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:46:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:46:00,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:46:00,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389907196] [2023-12-02 16:46:00,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389907196] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:46:00,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366094135] [2023-12-02 16:46:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:46:00,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:46:00,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:46:00,529 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:46:00,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 16:46:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:46:00,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 86 conjunts are in the unsatisfiable core [2023-12-02 16:46:00,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:46:00,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:46:00,838 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:46:00,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 16:46:00,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 16:46:01,027 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 16:46:01,028 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 54 treesize of output 41 [2023-12-02 16:46:01,094 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:46:01,094 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 39 treesize of output 22 [2023-12-02 16:46:01,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 16:46:01,194 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 16:46:01,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:46:01,217 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 16:46:01,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 38 [2023-12-02 16:46:01,255 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2023-12-02 16:46:01,255 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 [2023-12-02 16:46:01,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:46:01,262 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 [2023-12-02 16:46:01,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 16:46:01,449 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:46:01,450 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 50 treesize of output 25 [2023-12-02 16:46:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 16:46:01,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:46:01,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366094135] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:46:01,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1672680087] [2023-12-02 16:46:01,652 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 16:46:01,652 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:46:01,652 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:46:01,652 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:46:01,652 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:46:02,790 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 16:46:02,805 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:46:03,435 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (let ((.cse1 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|))) (.cse3 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse4 (exists ((|v_#length_159| (Array Int Int))) (= (store |v_#length_159| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 8) |c_#length|))) (.cse5 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse6 (exists ((|v_#memory_int_158| (Array Int (Array Int Int))) (|v_#memory_int_157| (Array Int (Array Int Int)))) (let ((.cse17 (select |v_#memory_int_158| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|))) (and (= (store |v_#memory_int_158| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store .cse17 4 1)) |c_#memory_int|) (= (store |v_#memory_int_157| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (select |v_#memory_int_157| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 (select .cse17 0))) |v_#memory_int_158|))))) (.cse7 (<= (+ |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 1) |c_#StackHeapBarrier|)) (.cse8 (exists ((|v_#valid_192| (Array Int Int))) (and (= (select |v_#valid_192| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (store |v_#valid_192| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 1))))) (.cse9 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)) (.cse10 (exists ((|v_#memory_$Pointer$.base_200| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_200| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (store (select |v_#memory_$Pointer$.base_200| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4)))))) (.cse11 (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 0))) (.cse12 (exists ((|v_#length_158| (Array Int Int))) (and (= (select |v_#length_158| 2) 22) (= 2 (select |v_#length_158| 1))))) (.cse13 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse14 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (exists ((|v_#memory_$Pointer$.offset_190| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (store (select |v_#memory_$Pointer$.offset_190| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4))))))) (or (and (exists ((|v_#memory_int_BEFORE_CALL_132| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_int_BEFORE_CALL_132| 1))) (and (= (select .cse0 1) 0) (= (select .cse0 0) 48)))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (exists ((|v_#memory_int_BEFORE_CALL_130| (Array Int (Array Int Int)))) (let ((.cse16 (select |v_#memory_int_BEFORE_CALL_130| 1))) (and (= 48 (select .cse16 0)) (= (select .cse16 1) 0)))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 2 |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~len#1| 2) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-12-02 16:46:08,353 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4150#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1)) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:46:08,353 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:46:08,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:46:08,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 35 [2023-12-02 16:46:08,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687983330] [2023-12-02 16:46:08,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:46:08,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 16:46:08,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:46:08,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 16:46:08,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2775, Unknown=20, NotChecked=214, Total=3192 [2023-12-02 16:46:08,357 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 36 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 30 states have internal predecessors, (53), 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) [2023-12-02 16:46:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:46:09,781 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2023-12-02 16:46:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 16:46:09,782 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 30 states have internal predecessors, (53), 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 34 [2023-12-02 16:46:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:46:09,782 INFO L225 Difference]: With dead ends: 88 [2023-12-02 16:46:09,783 INFO L226 Difference]: Without dead ends: 88 [2023-12-02 16:46:09,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=276, Invalid=3743, Unknown=21, NotChecked=250, Total=4290 [2023-12-02 16:46:09,785 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 174 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 16:46:09,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 686 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1089 Invalid, 0 Unknown, 88 Unchecked, 0.9s Time] [2023-12-02 16:46:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-02 16:46:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2023-12-02 16:46:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.4444444444444444) 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) [2023-12-02 16:46:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2023-12-02 16:46:09,789 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 34 [2023-12-02 16:46:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:46:09,790 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2023-12-02 16:46:09,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 30 states have internal predecessors, (53), 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) [2023-12-02 16:46:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2023-12-02 16:46:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 16:46:09,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:46:09,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:46:09,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 16:46:09,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 16:46:09,991 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:46:09,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:46:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1964659648, now seen corresponding path program 1 times [2023-12-02 16:46:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:46:09,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525215016] [2023-12-02 16:46:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:46:09,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:46:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:46:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:46:11,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:46:11,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525215016] [2023-12-02 16:46:11,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525215016] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:46:11,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398790665] [2023-12-02 16:46:11,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:46:11,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:46:11,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:46:11,482 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:46:11,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 16:46:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:46:11,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 110 conjunts are in the unsatisfiable core [2023-12-02 16:46:11,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:46:11,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:46:11,908 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:46:11,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 16:46:12,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 16:46:12,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 16:46:12,168 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 16:46:12,168 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 91 treesize of output 60 [2023-12-02 16:46:12,174 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 15 [2023-12-02 16:46:12,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:46:12,259 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 63 treesize of output 34 [2023-12-02 16:46:12,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 16:46:12,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 16:46:12,276 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 16:46:12,434 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 16:46:12,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:46:12,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:46:12,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:46:12,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-12-02 16:46:12,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:46:12,477 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 16:46:12,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 54 [2023-12-02 16:46:12,495 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 16:46:12,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 16:46:12,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2023-12-02 16:46:12,821 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:46:12,821 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 52 treesize of output 27 [2023-12-02 16:46:12,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 16:46:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 16:46:12,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:46:13,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398790665] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:46:13,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [995231884] [2023-12-02 16:46:13,415 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 16:46:13,415 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:46:13,415 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:46:13,415 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:46:13,415 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:46:14,597 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 16:46:14,611 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:46:20,667 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4539#(and (<= 1 |#StackHeapBarrier|) (or (< |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 4))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:46:20,667 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:46:20,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:46:20,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2023-12-02 16:46:20,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075483482] [2023-12-02 16:46:20,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:46:20,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 16:46:20,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:46:20,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 16:46:20,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=4049, Unknown=20, NotChecked=128, Total=4422 [2023-12-02 16:46:20,671 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 42 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 34 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 16:46:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:46:22,851 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2023-12-02 16:46:22,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 16:46:22,851 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 34 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-12-02 16:46:22,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:46:22,852 INFO L225 Difference]: With dead ends: 94 [2023-12-02 16:46:22,852 INFO L226 Difference]: Without dead ends: 94 [2023-12-02 16:46:22,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1764 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=372, Invalid=6090, Unknown=22, NotChecked=158, Total=6642 [2023-12-02 16:46:22,854 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 222 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:46:22,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 937 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1521 Invalid, 0 Unknown, 97 Unchecked, 1.1s Time] [2023-12-02 16:46:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-02 16:46:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2023-12-02 16:46:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:46:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2023-12-02 16:46:22,858 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 34 [2023-12-02 16:46:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:46:22,858 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2023-12-02 16:46:22,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 34 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 16:46:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2023-12-02 16:46:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 16:46:22,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:46:22,859 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:46:22,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-02 16:46:23,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 16:46:23,060 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:46:23,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:46:23,060 INFO L85 PathProgramCache]: Analyzing trace with hash -84693547, now seen corresponding path program 1 times [2023-12-02 16:46:23,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:46:23,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460146628] [2023-12-02 16:46:23,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:46:23,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:46:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:46:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:46:23,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:46:23,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460146628] [2023-12-02 16:46:23,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460146628] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:46:23,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257861676] [2023-12-02 16:46:23,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:46:23,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:46:23,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:46:23,460 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:46:23,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 16:46:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:46:23,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 16:46:23,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:46:23,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 16:46:23,830 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-12-02 16:46:23,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:46:23,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 16:46:23,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 16:46:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 16:46:23,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:46:23,928 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (|v_node_create_~temp~0#1.base_55| Int)) (or (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_55| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_55| v_ArrVal_1469) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0)))) is different from false [2023-12-02 16:46:23,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257861676] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:46:23,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [882919709] [2023-12-02 16:46:23,932 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-12-02 16:46:23,932 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:46:23,932 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:46:23,932 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:46:23,932 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:46:25,104 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 16:46:25,118 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:47:10,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [882919709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:47:10,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:47:10,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [15, 15] total 44 [2023-12-02 16:47:10,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303406548] [2023-12-02 16:47:10,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:47:10,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 16:47:10,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:47:10,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 16:47:10,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1734, Unknown=23, NotChecked=170, Total=2070 [2023-12-02 16:47:10,187 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:47:13,905 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] [2023-12-02 16:47:17,370 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] [2023-12-02 16:47:19,396 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] [2023-12-02 16:47:21,509 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] [2023-12-02 16:47:23,568 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] [2023-12-02 16:47:25,599 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] [2023-12-02 16:47:27,764 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] [2023-12-02 16:47:30,124 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] [2023-12-02 16:47:33,057 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] [2023-12-02 16:47:35,217 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] [2023-12-02 16:47:37,323 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] [2023-12-02 16:47:39,470 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] [2023-12-02 16:47:43,368 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] [2023-12-02 16:47:45,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 16:48:31,181 WARN L293 SmtUtils]: Spent 31.13s on a formula simplification. DAG size of input: 179 DAG size of output: 178 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:49:20,161 WARN L293 SmtUtils]: Spent 33.08s on a formula simplification. DAG size of input: 184 DAG size of output: 183 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:49:22,224 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] [2023-12-02 16:49:24,293 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] [2023-12-02 16:49:26,324 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] [2023-12-02 16:49:39,191 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] [2023-12-02 16:49:49,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 16:49:51,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 16:49:59,805 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] [2023-12-02 16:50:02,314 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] [2023-12-02 16:50:07,326 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] [2023-12-02 16:50:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:50:07,655 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2023-12-02 16:50:07,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 16:50:07,656 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 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) Word has length 37 [2023-12-02 16:50:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:50:07,657 INFO L225 Difference]: With dead ends: 126 [2023-12-02 16:50:07,657 INFO L226 Difference]: Without dead ends: 126 [2023-12-02 16:50:07,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 134.2s TimeCoverageRelationStatistics Valid=152, Invalid=1898, Unknown=28, NotChecked=178, Total=2256 [2023-12-02 16:50:07,658 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 54 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 2 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.6s IncrementalHoareTripleChecker+Time [2023-12-02 16:50:07,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 197 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 850 Invalid, 31 Unknown, 0 Unchecked, 88.6s Time] [2023-12-02 16:50:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-02 16:50:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2023-12-02 16:50:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:50:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2023-12-02 16:50:07,662 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 37 [2023-12-02 16:50:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:50:07,663 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2023-12-02 16:50:07,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:50:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2023-12-02 16:50:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 16:50:07,663 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:50:07,663 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:50:07,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 16:50:07,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 16:50:07,864 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:50:07,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:50:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1672501405, now seen corresponding path program 1 times [2023-12-02 16:50:07,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:50:07,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146259739] [2023-12-02 16:50:07,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:50:07,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:50:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:50:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:50:08,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:50:08,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146259739] [2023-12-02 16:50:08,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146259739] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:50:08,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903361670] [2023-12-02 16:50:08,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:50:08,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:50:08,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:50:08,174 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:50:08,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 16:50:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:50:08,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 16:50:08,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:50:08,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 16:50:08,483 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-12-02 16:50:08,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:50:08,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 16:50:08,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 16:50:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2023-12-02 16:50:08,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:50:08,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903361670] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:50:08,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1373648929] [2023-12-02 16:50:08,613 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-12-02 16:50:08,613 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:50:08,613 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:50:08,613 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:50:08,613 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:50:10,289 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 16:50:10,302 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:51:18,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1373648929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:51:18,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:51:18,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [15, 15] total 47 [2023-12-02 16:51:18,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59892370] [2023-12-02 16:51:18,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:51:18,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 16:51:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:51:18,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 16:51:18,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2078, Unknown=31, NotChecked=92, Total=2352 [2023-12-02 16:51:18,623 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:51:22,703 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] [2023-12-02 16:51:24,879 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] [2023-12-02 16:51:26,956 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] [2023-12-02 16:51:29,012 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] [2023-12-02 16:51:32,040 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] [2023-12-02 16:51:34,299 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] [2023-12-02 16:51:36,363 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] [2023-12-02 16:51:38,423 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] [2023-12-02 16:51:40,821 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] [2023-12-02 16:51:43,460 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] [2023-12-02 16:51:45,634 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] [2023-12-02 16:51:47,716 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] [2023-12-02 16:51:50,311 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] [2023-12-02 16:51:52,641 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] [2023-12-02 16:51:56,088 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] [2023-12-02 16:51:58,271 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] [2023-12-02 16:52:00,335 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] [2023-12-02 16:52:02,676 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] [2023-12-02 16:52:55,159 WARN L293 SmtUtils]: Spent 33.89s on a formula simplification. DAG size of input: 179 DAG size of output: 178 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:53:06,026 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] [2023-12-02 16:54:02,729 WARN L293 SmtUtils]: Spent 42.12s on a formula simplification. DAG size of input: 184 DAG size of output: 183 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:54:04,741 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] [2023-12-02 16:54:06,921 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] [2023-12-02 16:54:08,982 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] [2023-12-02 16:54:21,108 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] [2023-12-02 16:54:24,024 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] [2023-12-02 16:54:29,298 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] [2023-12-02 16:55:19,343 WARN L293 SmtUtils]: Spent 33.04s on a formula simplification. DAG size of input: 183 DAG size of output: 182 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:55:28,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 16:56:18,088 WARN L293 SmtUtils]: Spent 38.61s on a formula simplification. DAG size of input: 187 DAG size of output: 186 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:56:33,327 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] [2023-12-02 16:56:38,769 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] [2023-12-02 16:56:42,002 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] [2023-12-02 16:56:45,777 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] [2023-12-02 16:56:47,866 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] [2023-12-02 16:56:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:56:49,602 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2023-12-02 16:56:49,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 16:56:49,603 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) Word has length 38 [2023-12-02 16:56:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:56:49,604 INFO L225 Difference]: With dead ends: 97 [2023-12-02 16:56:49,604 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 16:56:49,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 275.5s TimeCoverageRelationStatistics Valid=171, Invalid=2440, Unknown=45, NotChecked=100, Total=2756 [2023-12-02 16:56:49,605 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 4 mSolverCounterUnsat, 54 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 122.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 54 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 124.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:56:49,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 369 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1312 Invalid, 54 Unknown, 0 Unchecked, 124.0s Time] [2023-12-02 16:56:49,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 16:56:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2023-12-02 16:56:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.391304347826087) internal successors, (96), 88 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:56:49,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2023-12-02 16:56:49,608 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 38 [2023-12-02 16:56:49,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:56:49,608 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2023-12-02 16:56:49,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:56:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2023-12-02 16:56:49,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 16:56:49,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:56:49,609 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:56:49,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-02 16:56:49,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:49,809 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:56:49,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:56:49,810 INFO L85 PathProgramCache]: Analyzing trace with hash -196559028, now seen corresponding path program 2 times [2023-12-02 16:56:49,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:56:49,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89689490] [2023-12-02 16:56:49,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:56:49,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:56:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:56:51,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:56:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89689490] [2023-12-02 16:56:51,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89689490] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:56:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312690596] [2023-12-02 16:56:51,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:56:51,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:51,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:56:51,023 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:56:51,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 16:56:51,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 16:56:51,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:56:51,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 108 conjunts are in the unsatisfiable core [2023-12-02 16:56:51,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:56:51,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:56:51,519 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:56:51,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 16:56:51,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 16:56:51,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 16:56:51,751 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-02 16:56:51,751 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 85 treesize of output 47 [2023-12-02 16:56:51,758 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 15 [2023-12-02 16:56:51,826 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 16:56:51,826 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 35 [2023-12-02 16:56:51,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 16:56:51,836 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 16:56:51,879 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 16:56:51,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:51,913 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 16:56:51,913 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 77 treesize of output 64 [2023-12-02 16:56:51,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:51,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:51,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:51,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-12-02 16:56:51,942 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 16:56:51,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 16:56:52,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:52,216 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-12-02 16:56:52,322 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 16:56:52,322 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2023-12-02 16:56:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 16:56:52,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:56:52,375 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2023-12-02 16:56:52,375 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 24 treesize of output 23 [2023-12-02 16:56:52,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312690596] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:56:52,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1628014357] [2023-12-02 16:56:52,520 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 16:56:52,520 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:56:52,520 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:56:52,520 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:56:52,520 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:56:53,627 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 16:56:53,641 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:56:58,693 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5783#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1)) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:56:58,693 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:56:58,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:56:58,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 40 [2023-12-02 16:56:58,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367095678] [2023-12-02 16:56:58,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:56:58,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 16:56:58,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:56:58,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 16:56:58,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3552, Unknown=16, NotChecked=120, Total=3906 [2023-12-02 16:56:58,697 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 41 states, 30 states have (on average 2.0) internal successors, (60), 35 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 16:57:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:57:00,097 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2023-12-02 16:57:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 16:57:00,098 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 30 states have (on average 2.0) internal successors, (60), 35 states have internal predecessors, (60), 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 38 [2023-12-02 16:57:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:57:00,098 INFO L225 Difference]: With dead ends: 97 [2023-12-02 16:57:00,098 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 16:57:00,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=332, Invalid=4912, Unknown=16, NotChecked=142, Total=5402 [2023-12-02 16:57:00,100 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 205 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 16:57:00,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 777 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1317 Invalid, 0 Unknown, 95 Unchecked, 0.8s Time] [2023-12-02 16:57:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 16:57:00,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2023-12-02 16:57:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:57:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2023-12-02 16:57:00,103 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 38 [2023-12-02 16:57:00,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:57:00,103 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2023-12-02 16:57:00,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 30 states have (on average 2.0) internal successors, (60), 35 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 16:57:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2023-12-02 16:57:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 16:57:00,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:57:00,104 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:57:00,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 16:57:00,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:57:00,305 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:57:00,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:57:00,305 INFO L85 PathProgramCache]: Analyzing trace with hash -196559027, now seen corresponding path program 2 times [2023-12-02 16:57:00,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:57:00,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133506258] [2023-12-02 16:57:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:57:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:57:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:57:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:57:01,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:57:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133506258] [2023-12-02 16:57:01,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133506258] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:57:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122194772] [2023-12-02 16:57:01,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:57:01,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:57:01,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:57:01,504 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:57:01,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 16:57:01,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 16:57:01,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:57:01,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 116 conjunts are in the unsatisfiable core [2023-12-02 16:57:01,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:57:01,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:57:02,058 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:57:02,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 16:57:02,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 16:57:02,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 16:57:02,299 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-02 16:57:02,299 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 88 treesize of output 50 [2023-12-02 16:57:02,306 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 39 treesize of output 30 [2023-12-02 16:57:02,393 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-02 16:57:02,393 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 42 [2023-12-02 16:57:02,400 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 16:57:02,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 16:57:02,440 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 16:57:02,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:02,483 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 16:57:02,483 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 92 treesize of output 73 [2023-12-02 16:57:02,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:02,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:02,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:02,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:02,496 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-02 16:57:02,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2023-12-02 16:57:02,516 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 16:57:02,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 16:57:02,892 INFO L349 Elim1Store]: treesize reduction 41, result has 16.3 percent of original size [2023-12-02 16:57:02,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 44 [2023-12-02 16:57:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 16:57:02,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:57:03,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122194772] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:57:03,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [301570718] [2023-12-02 16:57:03,190 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 16:57:03,190 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:57:03,190 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:57:03,190 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:57:03,191 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:57:04,296 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 16:57:04,309 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:57:09,810 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6212#(and (<= 1 |#StackHeapBarrier|) (or (< |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 4))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 16:57:09,810 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:57:09,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:57:09,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 42 [2023-12-02 16:57:09,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530332137] [2023-12-02 16:57:09,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 16:57:09,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 16:57:09,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:57:09,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 16:57:09,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3545, Unknown=22, NotChecked=120, Total=3906 [2023-12-02 16:57:09,813 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 42 states, 32 states have (on average 1.84375) internal successors, (59), 36 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 16:57:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:57:11,121 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2023-12-02 16:57:11,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 16:57:11,121 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 1.84375) internal successors, (59), 36 states have internal predecessors, (59), 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 38 [2023-12-02 16:57:11,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:57:11,122 INFO L225 Difference]: With dead ends: 82 [2023-12-02 16:57:11,122 INFO L226 Difference]: Without dead ends: 82 [2023-12-02 16:57:11,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1513 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=317, Invalid=4634, Unknown=23, NotChecked=138, Total=5112 [2023-12-02 16:57:11,125 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 77 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 16:57:11,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 794 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1095 Invalid, 0 Unknown, 80 Unchecked, 0.8s Time] [2023-12-02 16:57:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-02 16:57:11,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2023-12-02 16:57:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.35) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:57:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2023-12-02 16:57:11,128 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 38 [2023-12-02 16:57:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:57:11,128 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2023-12-02 16:57:11,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 1.84375) internal successors, (59), 36 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 16:57:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2023-12-02 16:57:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 16:57:11,129 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:57:11,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:57:11,134 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 16:57:11,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 16:57:11,329 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:57:11,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:57:11,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1177289065, now seen corresponding path program 1 times [2023-12-02 16:57:11,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:57:11,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624727413] [2023-12-02 16:57:11,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:57:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:57:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:57:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 16:57:11,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:57:11,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624727413] [2023-12-02 16:57:11,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624727413] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:57:11,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:57:11,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 16:57:11,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512480751] [2023-12-02 16:57:11,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:57:11,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 16:57:11,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:57:11,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 16:57:11,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-02 16:57:11,845 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 16:57:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:57:12,071 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2023-12-02 16:57:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 16:57:12,072 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 1 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 39 [2023-12-02 16:57:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:57:12,073 INFO L225 Difference]: With dead ends: 89 [2023-12-02 16:57:12,073 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 16:57:12,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-02 16:57:12,073 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 69 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:57:12,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 257 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:57:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 16:57:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2023-12-02 16:57:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.380952380952381) internal successors, (87), 78 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:57:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2023-12-02 16:57:12,076 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 39 [2023-12-02 16:57:12,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:57:12,076 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2023-12-02 16:57:12,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 16:57:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2023-12-02 16:57:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 16:57:12,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:57:12,077 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:57:12,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 16:57:12,077 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-12-02 16:57:12,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:57:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1177289066, now seen corresponding path program 1 times [2023-12-02 16:57:12,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:57:12,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058717334] [2023-12-02 16:57:12,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:57:12,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:57:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:57:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:57:12,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:57:12,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058717334] [2023-12-02 16:57:12,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058717334] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:57:12,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515865577] [2023-12-02 16:57:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:57:12,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:57:12,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:57:12,717 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:57:12,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac3b167b-00db-4fdf-9290-4d6b690ed636/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 16:57:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:57:12,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 16:57:12,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:57:13,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-12-02 16:57:13,210 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-12-02 16:57:13,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:13,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 16:57:13,283 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 16:57:13,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 16:57:13,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:13,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 16:57:13,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 16:57:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 16:57:13,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:57:13,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:57:13,561 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2023-12-02 16:57:13,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:57:13,569 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2023-12-02 16:57:13,573 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 5 [2023-12-02 16:57:13,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:57:13,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 79 [2023-12-02 16:57:13,877 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_67| Int)) (or (forall ((v_ArrVal_2104 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_67| v_ArrVal_2104) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |c_ULTIMATE.start_main_~#s~0#1.base|))) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_67| 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-12-02 16:57:13,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515865577] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:57:13,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1257740447] [2023-12-02 16:57:13,880 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 16:57:13,880 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:57:13,881 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:57:13,881 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:57:13,881 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:57:15,312 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 16:57:15,325 INFO L180 IcfgInterpreter]: Interpretation finished