./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ --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 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:56:06,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:56:06,210 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 04:56:06,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:56:06,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:56:06,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:56:06,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:56:06,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:56:06,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:56:06,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:56:06,269 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:56:06,269 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:56:06,269 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:56:06,271 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:56:06,272 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:56:06,272 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:56:06,272 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:56:06,273 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:56:06,273 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:56:06,274 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:56:06,274 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:56:06,275 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:56:06,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 04:56:06,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 04:56:06,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:56:06,277 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:56:06,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:56:06,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:56:06,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:56:06,279 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 04:56:06,280 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 04:56:06,280 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 04:56:06,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:56:06,281 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 04:56:06,281 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:56:06,281 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:56:06,281 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:56:06,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:56:06,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:56:06,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:56:06,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:56:06,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:56:06,283 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:56:06,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:56:06,284 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:56:06,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:56:06,284 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_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/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_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2023-11-19 04:56:06,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:56:06,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:56:06,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:56:06,586 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:56:06,586 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:56:06,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-19 04:56:09,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:56:10,136 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:56:10,136 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-19 04:56:10,151 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/data/427707d08/f8cb5a800e69491a922a091e1eead55e/FLAGc1e15eafa [2023-11-19 04:56:10,166 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/data/427707d08/f8cb5a800e69491a922a091e1eead55e [2023-11-19 04:56:10,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:56:10,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:56:10,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:56:10,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:56:10,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:56:10,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:56:10" (1/1) ... [2023-11-19 04:56:10,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4296da4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10, skipping insertion in model container [2023-11-19 04:56:10,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:56:10" (1/1) ... [2023-11-19 04:56:10,224 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:56:10,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:56:10,547 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:56:10,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:56:10,672 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:56:10,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10 WrapperNode [2023-11-19 04:56:10,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:56:10,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:56:10,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:56:10,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:56:10,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10" (1/1) ... [2023-11-19 04:56:10,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10" (1/1) ... [2023-11-19 04:56:10,753 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 152 [2023-11-19 04:56:10,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:56:10,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:56:10,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:56:10,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:56:10,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10" (1/1) ... [2023-11-19 04:56:10,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10" (1/1) ... [2023-11-19 04:56:10,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10" (1/1) ... [2023-11-19 04:56:10,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10" (1/1) ... [2023-11-19 04:56:10,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10" (1/1) ... [2023-11-19 04:56:10,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10" (1/1) ... [2023-11-19 04:56:10,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10" (1/1) ... [2023-11-19 04:56:10,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10" (1/1) ... [2023-11-19 04:56:10,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:56:10,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:56:10,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:56:10,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:56:10,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10" (1/1) ... [2023-11-19 04:56:10,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:56:10,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:56:10,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:56:10,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:56:10,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:56:10,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:56:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 04:56:10,871 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 04:56:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 04:56:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:56:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:56:10,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 04:56:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 04:56:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:56:10,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 04:56:10,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:56:10,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:56:10,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:56:11,009 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:56:11,013 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:56:11,559 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:56:11,621 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:56:11,621 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 04:56:11,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:56:11 BoogieIcfgContainer [2023-11-19 04:56:11,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:56:11,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:56:11,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:56:11,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:56:11,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:56:10" (1/3) ... [2023-11-19 04:56:11,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66aa1baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:56:11, skipping insertion in model container [2023-11-19 04:56:11,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:56:10" (2/3) ... [2023-11-19 04:56:11,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66aa1baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:56:11, skipping insertion in model container [2023-11-19 04:56:11,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:56:11" (3/3) ... [2023-11-19 04:56:11,636 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2023-11-19 04:56:11,656 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:56:11,656 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2023-11-19 04:56:11,704 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:56:11,710 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;@70b987ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:56:11,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-11-19 04:56:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 51 states have (on average 2.2549019607843137) internal successors, (115), 103 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:56:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 04:56:11,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:11,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 04:56:11,722 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-11-19 04:56:11,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:11,726 INFO L85 PathProgramCache]: Analyzing trace with hash 233449416, now seen corresponding path program 1 times [2023-11-19 04:56:11,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:11,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495343843] [2023-11-19 04:56:11,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:11,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:56:12,037 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:12,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495343843] [2023-11-19 04:56:12,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495343843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:12,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:56:12,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:56:12,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850409829] [2023-11-19 04:56:12,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:12,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:56:12,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:12,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:56:12,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:56:12,101 INFO L87 Difference]: Start difference. First operand has 108 states, 51 states have (on average 2.2549019607843137) internal successors, (115), 103 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:56:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:12,295 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2023-11-19 04:56:12,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:56:12,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-19 04:56:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:12,308 INFO L225 Difference]: With dead ends: 105 [2023-11-19 04:56:12,308 INFO L226 Difference]: Without dead ends: 103 [2023-11-19 04:56:12,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:56:12,315 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:12,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 146 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:56:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-19 04:56:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-19 04:56:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 49 states have (on average 2.163265306122449) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:56:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2023-11-19 04:56:12,376 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 5 [2023-11-19 04:56:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:12,377 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2023-11-19 04:56:12,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:56:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2023-11-19 04:56:12,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 04:56:12,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:12,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 04:56:12,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:56:12,380 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-11-19 04:56:12,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash 233449417, now seen corresponding path program 1 times [2023-11-19 04:56:12,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:12,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511412577] [2023-11-19 04:56:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:12,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:56:12,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:12,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511412577] [2023-11-19 04:56:12,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511412577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:12,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:56:12,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:56:12,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765014262] [2023-11-19 04:56:12,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:12,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:56:12,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:12,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:56:12,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:56:12,624 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:56:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:12,739 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2023-11-19 04:56:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:56:12,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-19 04:56:12,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:12,742 INFO L225 Difference]: With dead ends: 101 [2023-11-19 04:56:12,742 INFO L226 Difference]: Without dead ends: 101 [2023-11-19 04:56:12,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:56:12,744 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:12,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 151 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:56:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-19 04:56:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-19 04:56:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 49 states have (on average 2.122448979591837) internal successors, (104), 96 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-11-19 04:56:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2023-11-19 04:56:12,755 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 5 [2023-11-19 04:56:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:12,755 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2023-11-19 04:56:12,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:56:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2023-11-19 04:56:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:56:12,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:12,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:12,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:56:12,757 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-11-19 04:56:12,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:12,758 INFO L85 PathProgramCache]: Analyzing trace with hash 17800506, now seen corresponding path program 1 times [2023-11-19 04:56:12,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:12,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906923726] [2023-11-19 04:56:12,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:12,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:56:12,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:12,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906923726] [2023-11-19 04:56:12,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906923726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:12,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:56:12,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:56:12,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080511896] [2023-11-19 04:56:12,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:12,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:56:12,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:12,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:56:12,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:56:12,909 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:56:12,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:12,974 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2023-11-19 04:56:12,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:56:12,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-19 04:56:12,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:12,980 INFO L225 Difference]: With dead ends: 102 [2023-11-19 04:56:12,980 INFO L226 Difference]: Without dead ends: 102 [2023-11-19 04:56:12,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:56:12,982 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:12,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 180 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:56:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-19 04:56:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-19 04:56:13,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 50 states have (on average 2.1) internal successors, (105), 97 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:56:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2023-11-19 04:56:13,001 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 10 [2023-11-19 04:56:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:13,002 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2023-11-19 04:56:13,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:56:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2023-11-19 04:56:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 04:56:13,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:13,004 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:13,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:56:13,004 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-11-19 04:56:13,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:13,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1859873841, now seen corresponding path program 1 times [2023-11-19 04:56:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:13,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59504931] [2023-11-19 04:56:13,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:13,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 04:56:13,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:13,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59504931] [2023-11-19 04:56:13,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59504931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:13,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:56:13,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:56:13,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237581706] [2023-11-19 04:56:13,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:13,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:56:13,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:13,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:56:13,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:56:13,164 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:56:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:13,385 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2023-11-19 04:56:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:56:13,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-19 04:56:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:13,388 INFO L225 Difference]: With dead ends: 101 [2023-11-19 04:56:13,388 INFO L226 Difference]: Without dead ends: 101 [2023-11-19 04:56:13,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:56:13,400 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:13,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 293 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:56:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-19 04:56:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-19 04:56:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 50 states have (on average 2.08) internal successors, (104), 96 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-11-19 04:56:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2023-11-19 04:56:13,409 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 17 [2023-11-19 04:56:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:13,409 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2023-11-19 04:56:13,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:56:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2023-11-19 04:56:13,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 04:56:13,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:13,410 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:13,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:56:13,411 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-11-19 04:56:13,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:13,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1859873842, now seen corresponding path program 1 times [2023-11-19 04:56:13,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:13,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694666330] [2023-11-19 04:56:13,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:13,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:56:13,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:13,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694666330] [2023-11-19 04:56:13,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694666330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:13,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:56:13,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:56:13,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396995140] [2023-11-19 04:56:13,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:13,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:56:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:13,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:56:13,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:56:13,755 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:56:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:13,968 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2023-11-19 04:56:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:56:13,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-19 04:56:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:13,971 INFO L225 Difference]: With dead ends: 100 [2023-11-19 04:56:13,971 INFO L226 Difference]: Without dead ends: 100 [2023-11-19 04:56:13,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:56:13,975 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:13,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 317 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:56:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-19 04:56:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-19 04:56:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 50 states have (on average 2.06) internal successors, (103), 95 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-11-19 04:56:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2023-11-19 04:56:13,983 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 17 [2023-11-19 04:56:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:13,984 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2023-11-19 04:56:13,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:56:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2023-11-19 04:56:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:56:13,985 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:13,985 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:13,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:56:13,986 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-11-19 04:56:13,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:13,987 INFO L85 PathProgramCache]: Analyzing trace with hash 632569201, now seen corresponding path program 1 times [2023-11-19 04:56:13,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:13,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901392839] [2023-11-19 04:56:13,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:13,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:56:14,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:14,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901392839] [2023-11-19 04:56:14,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901392839] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:56:14,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147444271] [2023-11-19 04:56:14,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:14,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:56:14,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:56:14,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:56:14,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:56:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:14,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-19 04:56:14,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:56:14,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 04:56:14,661 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 04:56:14,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-19 04:56:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:56:14,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:56:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:56:15,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147444271] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:56:15,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [757011808] [2023-11-19 04:56:15,058 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:56:15,058 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:56:15,062 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:56:15,068 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:56:15,068 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:56:16,737 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-19 04:56:16,916 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:56:18,872 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1278#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-11-19 04:56:18,872 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:56:18,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:56:18,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2023-11-19 04:56:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294145871] [2023-11-19 04:56:18,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:56:18,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-19 04:56:18,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:18,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-19 04:56:18,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2023-11-19 04:56:18,875 INFO L87 Difference]: Start difference. First operand 100 states and 109 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-11-19 04:56:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:19,290 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2023-11-19 04:56:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:56:19,291 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-11-19 04:56:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:19,292 INFO L225 Difference]: With dead ends: 99 [2023-11-19 04:56:19,292 INFO L226 Difference]: Without dead ends: 99 [2023-11-19 04:56:19,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2023-11-19 04:56:19,293 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:19,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 561 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 04:56:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-19 04:56:19,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-19 04:56:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 50 states have (on average 2.04) internal successors, (102), 94 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-11-19 04:56:19,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2023-11-19 04:56:19,300 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 19 [2023-11-19 04:56:19,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:19,301 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2023-11-19 04:56:19,301 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-11-19 04:56:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2023-11-19 04:56:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:56:19,302 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:19,303 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:19,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:56:19,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:56:19,524 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-11-19 04:56:19,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash 632569202, now seen corresponding path program 1 times [2023-11-19 04:56:19,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:19,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19617555] [2023-11-19 04:56:19,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:19,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:56:19,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:19,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19617555] [2023-11-19 04:56:19,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19617555] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:56:19,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288192567] [2023-11-19 04:56:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:19,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:56:19,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:56:19,840 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:56:19,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 04:56:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:19,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-19 04:56:19,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:56:20,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 04:56:20,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 04:56:20,257 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 04:56:20,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-19 04:56:20,279 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:56:20,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 04:56:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:56:20,355 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:56:20,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288192567] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:56:20,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [491755256] [2023-11-19 04:56:20,540 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:56:20,540 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:56:20,540 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:56:20,540 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:56:20,541 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:56:21,642 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-19 04:56:21,790 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:56:23,841 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1579#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-11-19 04:56:23,841 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:56:23,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 04:56:23,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-11-19 04:56:23,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114342151] [2023-11-19 04:56:23,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 04:56:23,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-19 04:56:23,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:23,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-19 04:56:23,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2023-11-19 04:56:23,844 INFO L87 Difference]: Start difference. First operand 99 states and 108 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-11-19 04:56:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:24,602 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2023-11-19 04:56:24,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 04:56:24,602 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-11-19 04:56:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:24,603 INFO L225 Difference]: With dead ends: 100 [2023-11-19 04:56:24,603 INFO L226 Difference]: Without dead ends: 100 [2023-11-19 04:56:24,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2023-11-19 04:56:24,605 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:24,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 786 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 04:56:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-19 04:56:24,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2023-11-19 04:56:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 50 states have (on average 2.02) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:56:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2023-11-19 04:56:24,612 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 19 [2023-11-19 04:56:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:24,613 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2023-11-19 04:56:24,613 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-11-19 04:56:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2023-11-19 04:56:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-19 04:56:24,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:24,614 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:24,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 04:56:24,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:56:24,840 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-11-19 04:56:24,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash -18651199, now seen corresponding path program 1 times [2023-11-19 04:56:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:24,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363128257] [2023-11-19 04:56:24,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:24,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 04:56:25,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:25,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363128257] [2023-11-19 04:56:25,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363128257] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:56:25,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465114046] [2023-11-19 04:56:25,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:25,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:56:25,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:56:25,560 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:56:25,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 04:56:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:25,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-19 04:56:25,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:56:25,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 04:56:25,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 04:56:25,734 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-19 04:56:25,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:56:25,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:56:25,800 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 04:56:25,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-19 04:56:25,852 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-19 04:56:25,869 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 04:56:25,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-19 04:56:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 12 not checked. [2023-11-19 04:56:25,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:56:26,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465114046] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:56:26,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [931402659] [2023-11-19 04:56:26,330 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-19 04:56:26,330 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:56:26,330 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:56:26,331 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:56:26,331 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:56:27,615 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-19 04:56:27,634 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:56:31,652 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1964#(and (or (and (exists ((|v_#valid_154| (Array Int Int))) (and (= (store |v_#valid_154| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_154| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_125| (Array Int Int))) (= |#length| (store |v_#length_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_133| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_133| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_133| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_133| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_109| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_109| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_110| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_110|) (= |#memory_int| (store |v_#memory_int_110| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_110| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 1))))) (exists ((|v_#memory_$Pointer$.offset_137| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_30| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_30| (Array Int Int)) (|v_#memory_int_113| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_30| (store |v_#memory_int_113| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_113| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (<= 4 (select |v_old(#length)_AFTER_CALL_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= 1 (select |v_old(#valid)_AFTER_CALL_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (and (exists ((|v_#valid_154| (Array Int Int))) (and (= (store |v_#valid_154| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_154| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_125| (Array Int Int))) (= |#length| (store |v_#length_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_133| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_133| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_133| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_133| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_109| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_109| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_110| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_110|) (= |#memory_int| (store |v_#memory_int_110| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_110| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 1))))) (exists ((|v_#memory_$Pointer$.offset_137| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_31| (store |v_#memory_int_113| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_113| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_31| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (<= 4 (select |v_old(#length)_AFTER_CALL_31| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 1 |ULTIMATE.start_sll_circular_insert_~data#1|) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| 1) (not (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-19 04:56:31,652 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:56:31,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 04:56:31,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2023-11-19 04:56:31,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309963000] [2023-11-19 04:56:31,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 04:56:31,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-19 04:56:31,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:31,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-19 04:56:31,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1194, Unknown=3, NotChecked=142, Total=1482 [2023-11-19 04:56:31,656 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 18 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-19 04:56:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:32,281 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2023-11-19 04:56:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:56:32,282 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2023-11-19 04:56:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:32,283 INFO L225 Difference]: With dead ends: 107 [2023-11-19 04:56:32,283 INFO L226 Difference]: Without dead ends: 107 [2023-11-19 04:56:32,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=179, Invalid=1386, Unknown=3, NotChecked=154, Total=1722 [2023-11-19 04:56:32,284 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 119 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:32,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 305 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 494 Invalid, 0 Unknown, 224 Unchecked, 0.4s Time] [2023-11-19 04:56:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-19 04:56:32,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2023-11-19 04:56:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 50 states have (on average 1.86) 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-11-19 04:56:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2023-11-19 04:56:32,304 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 27 [2023-11-19 04:56:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:32,305 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2023-11-19 04:56:32,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-19 04:56:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2023-11-19 04:56:32,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-19 04:56:32,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:32,306 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:32,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 04:56:32,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:56:32,507 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-11-19 04:56:32,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:32,508 INFO L85 PathProgramCache]: Analyzing trace with hash -18651198, now seen corresponding path program 1 times [2023-11-19 04:56:32,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:32,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55746493] [2023-11-19 04:56:32,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:32,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:56:33,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:33,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55746493] [2023-11-19 04:56:33,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55746493] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:56:33,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639532600] [2023-11-19 04:56:33,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:33,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:56:33,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:56:33,164 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:56:33,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 04:56:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:33,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-19 04:56:33,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:56:33,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 04:56:33,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 04:56:33,397 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-19 04:56:33,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:56:33,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:56:33,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 04:56:33,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:56:33,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:56:33,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 04:56:33,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:56:33,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:56:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 04:56:33,593 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:56:33,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639532600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:33,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 04:56:33,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2023-11-19 04:56:33,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172020904] [2023-11-19 04:56:33,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:33,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:56:33,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:33,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:56:33,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=253, Unknown=1, NotChecked=32, Total=342 [2023-11-19 04:56:33,596 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:56:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:33,760 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2023-11-19 04:56:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:56:33,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-19 04:56:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:33,762 INFO L225 Difference]: With dead ends: 85 [2023-11-19 04:56:33,762 INFO L226 Difference]: Without dead ends: 85 [2023-11-19 04:56:33,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=284, Unknown=1, NotChecked=34, Total=380 [2023-11-19 04:56:33,763 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 30 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:33,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 188 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 115 Unchecked, 0.1s Time] [2023-11-19 04:56:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-19 04:56:33,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-19 04:56:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.76) internal successors, (88), 80 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:56:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2023-11-19 04:56:33,768 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 27 [2023-11-19 04:56:33,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:33,768 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2023-11-19 04:56:33,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:56:33,768 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2023-11-19 04:56:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-19 04:56:33,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:33,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:33,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 04:56:33,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:56:33,991 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-19 04:56:33,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:33,992 INFO L85 PathProgramCache]: Analyzing trace with hash -743752931, now seen corresponding path program 1 times [2023-11-19 04:56:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:33,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38498328] [2023-11-19 04:56:33,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:33,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:56:34,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:34,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38498328] [2023-11-19 04:56:34,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38498328] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:56:34,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321182888] [2023-11-19 04:56:34,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:34,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:56:34,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:56:34,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:56:34,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 04:56:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:34,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-19 04:56:34,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:56:35,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-11-19 04:56:35,131 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-19 04:56:35,157 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-19 04:56:35,158 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-11-19 04:56:35,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:56:35,163 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-11-19 04:56:35,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 04:56:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:56:35,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:56:35,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321182888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:35,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 04:56:35,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2023-11-19 04:56:35,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328421022] [2023-11-19 04:56:35,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:35,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-19 04:56:35,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:35,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-19 04:56:35,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2023-11-19 04:56:35,208 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:56:35,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:35,618 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2023-11-19 04:56:35,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 04:56:35,618 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-19 04:56:35,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:35,620 INFO L225 Difference]: With dead ends: 115 [2023-11-19 04:56:35,620 INFO L226 Difference]: Without dead ends: 115 [2023-11-19 04:56:35,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=473, Unknown=1, NotChecked=44, Total=600 [2023-11-19 04:56:35,621 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 202 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:35,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 258 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 389 Invalid, 0 Unknown, 127 Unchecked, 0.3s Time] [2023-11-19 04:56:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-19 04:56:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 87. [2023-11-19 04:56:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 82 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:56:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2023-11-19 04:56:35,626 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 29 [2023-11-19 04:56:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:35,626 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2023-11-19 04:56:35,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:56:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2023-11-19 04:56:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-19 04:56:35,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:35,627 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:35,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 04:56:35,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-19 04:56:35,832 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-19 04:56:35,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash -743752930, now seen corresponding path program 1 times [2023-11-19 04:56:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:35,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079802581] [2023-11-19 04:56:35,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:35,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:56:36,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:36,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079802581] [2023-11-19 04:56:36,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079802581] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:56:36,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131347464] [2023-11-19 04:56:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:36,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:56:36,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:56:36,808 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:56:36,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 04:56:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:37,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-19 04:56:37,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:56:37,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 04:56:37,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-19 04:56:37,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 04:56:37,532 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-19 04:56:37,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:56:37,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-19 04:56:37,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:56:37,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-19 04:56:37,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:56:37,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:56:37,573 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-19 04:56:37,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-19 04:56:37,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 04:56:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-19 04:56:37,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:56:37,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131347464] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:56:37,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [228176303] [2023-11-19 04:56:37,915 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-19 04:56:37,915 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:56:37,915 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:56:37,916 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:56:37,916 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:56:39,189 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-19 04:56:39,208 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:56:45,548 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2896#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1) (= |ULTIMATE.start_sll_circular_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (or (< (select |#length| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 4)) (< |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= 1 |ULTIMATE.start_sll_circular_insert_~data#1|) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (or (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_149| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_149| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_149| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#valid_164| (Array Int Int))) (and (= (select |v_#valid_164| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_164| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#length_140| (Array Int Int))) (= |#length| (store |v_#length_140| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_153| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_52| (Array Int Int)) (|v_#memory_$Pointer$.base_155| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_153| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_153| |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_52| (store |v_#memory_int_125| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_125| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))) (= (select (select (store |v_#memory_$Pointer$.base_155| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_155| |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|) (<= 4 (select |v_old(#length)_AFTER_CALL_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 1))) (exists ((|v_#memory_int_121| (Array Int (Array Int Int))) (|v_#memory_int_122| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_122| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_122| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 1))) (= (store |v_#memory_int_121| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_121| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_122| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_122|))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_151| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_151| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_151| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|))) (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_149| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_149| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_149| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#valid_164| (Array Int Int))) (and (= (select |v_#valid_164| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_164| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#length_140| (Array Int Int))) (= |#length| (store |v_#length_140| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_int_121| (Array Int (Array Int Int))) (|v_#memory_int_122| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_122| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_122| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 1))) (= (store |v_#memory_int_121| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_121| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_122| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_122|))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_51| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$.offset_153| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_155| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_153| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_153| |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_51| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 1) (= |v_old(#memory_int)_AFTER_CALL_51| (store |v_#memory_int_125| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_125| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_51| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))) (= (select (select (store |v_#memory_$Pointer$.base_155| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_155| |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|) (<= 4 (select |v_old(#length)_AFTER_CALL_51| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_151| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_151| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_151| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)))))' at error location [2023-11-19 04:56:45,548 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:56:45,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 04:56:45,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-11-19 04:56:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824224027] [2023-11-19 04:56:45,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 04:56:45,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-19 04:56:45,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:45,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-19 04:56:45,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2016, Unknown=2, NotChecked=90, Total=2256 [2023-11-19 04:56:45,551 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 28 states, 21 states have (on average 2.0) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 04:56:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:47,136 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2023-11-19 04:56:47,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 04:56:47,137 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.0) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2023-11-19 04:56:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:47,138 INFO L225 Difference]: With dead ends: 112 [2023-11-19 04:56:47,138 INFO L226 Difference]: Without dead ends: 112 [2023-11-19 04:56:47,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=248, Invalid=3176, Unknown=2, NotChecked=114, Total=3540 [2023-11-19 04:56:47,140 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 231 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:47,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 681 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 966 Invalid, 0 Unknown, 124 Unchecked, 0.9s Time] [2023-11-19 04:56:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-19 04:56:47,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 87. [2023-11-19 04:56:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.75) 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-11-19 04:56:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2023-11-19 04:56:47,145 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 29 [2023-11-19 04:56:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:47,146 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2023-11-19 04:56:47,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.0) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 04:56:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2023-11-19 04:56:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 04:56:47,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:47,151 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:47,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-19 04:56:47,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:56:47,361 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-19 04:56:47,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1581327254, now seen corresponding path program 1 times [2023-11-19 04:56:47,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:47,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323334071] [2023-11-19 04:56:47,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:47,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 04:56:47,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:47,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323334071] [2023-11-19 04:56:47,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323334071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:47,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:56:47,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:56:47,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057620119] [2023-11-19 04:56:47,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:47,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:56:47,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:47,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:56:47,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:56:47,426 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 04:56:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:47,466 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2023-11-19 04:56:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:56:47,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-11-19 04:56:47,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:47,468 INFO L225 Difference]: With dead ends: 89 [2023-11-19 04:56:47,468 INFO L226 Difference]: Without dead ends: 89 [2023-11-19 04:56:47,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:56:47,469 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 16 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:47,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 132 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:56:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-19 04:56:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2023-11-19 04:56:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.7358490566037736) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:56:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2023-11-19 04:56:47,473 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 30 [2023-11-19 04:56:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:47,474 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2023-11-19 04:56:47,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 04:56:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2023-11-19 04:56:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-19 04:56:47,475 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:47,475 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:47,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 04:56:47,475 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-19 04:56:47,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1781829846, now seen corresponding path program 1 times [2023-11-19 04:56:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:47,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804410204] [2023-11-19 04:56:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:47,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 04:56:47,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:47,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804410204] [2023-11-19 04:56:47,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804410204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:47,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:56:47,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:56:47,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445379690] [2023-11-19 04:56:47,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:47,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:56:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:47,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:56:47,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:56:47,620 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:56:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:47,667 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2023-11-19 04:56:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:56:47,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 31 [2023-11-19 04:56:47,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:47,669 INFO L225 Difference]: With dead ends: 85 [2023-11-19 04:56:47,669 INFO L226 Difference]: Without dead ends: 85 [2023-11-19 04:56:47,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:56:47,671 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 122 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:47,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 127 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:56:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-19 04:56:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-19 04:56:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.6923076923076923) internal successors, (88), 80 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:56:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2023-11-19 04:56:47,677 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 31 [2023-11-19 04:56:47,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:47,677 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2023-11-19 04:56:47,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:56:47,678 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2023-11-19 04:56:47,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-19 04:56:47,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:47,679 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:47,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 04:56:47,681 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-19 04:56:47,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash 763179403, now seen corresponding path program 1 times [2023-11-19 04:56:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:47,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634766732] [2023-11-19 04:56:47,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:47,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 04:56:47,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:47,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634766732] [2023-11-19 04:56:47,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634766732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:47,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:56:47,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:56:47,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661430518] [2023-11-19 04:56:47,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:47,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:56:47,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:47,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:56:47,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:56:47,796 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 04:56:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:47,952 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2023-11-19 04:56:47,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:56:47,953 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 32 [2023-11-19 04:56:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:47,954 INFO L225 Difference]: With dead ends: 82 [2023-11-19 04:56:47,954 INFO L226 Difference]: Without dead ends: 82 [2023-11-19 04:56:47,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:56:47,955 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 21 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:47,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 212 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:56:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-19 04:56:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-19 04:56:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:56:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2023-11-19 04:56:47,958 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 32 [2023-11-19 04:56:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:47,958 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2023-11-19 04:56:47,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 04:56:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2023-11-19 04:56:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-19 04:56:47,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:47,959 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:47,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 04:56:47,959 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-19 04:56:47,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash 763179404, now seen corresponding path program 1 times [2023-11-19 04:56:47,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:47,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363163122] [2023-11-19 04:56:47,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:47,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 04:56:48,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:48,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363163122] [2023-11-19 04:56:48,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363163122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:48,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:56:48,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:56:48,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495967456] [2023-11-19 04:56:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:48,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:56:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:48,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:56:48,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:56:48,071 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:56:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:48,125 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2023-11-19 04:56:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:56:48,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-11-19 04:56:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:48,127 INFO L225 Difference]: With dead ends: 81 [2023-11-19 04:56:48,127 INFO L226 Difference]: Without dead ends: 81 [2023-11-19 04:56:48,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:56:48,129 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 73 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:48,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 141 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:56:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-19 04:56:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-19 04:56:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:56:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-11-19 04:56:48,133 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 32 [2023-11-19 04:56:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:48,133 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-11-19 04:56:48,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:56:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-11-19 04:56:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-19 04:56:48,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:48,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:48,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 04:56:48,137 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-19 04:56:48,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash 598026749, now seen corresponding path program 1 times [2023-11-19 04:56:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:48,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432693501] [2023-11-19 04:56:48,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:48,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 04:56:48,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:48,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432693501] [2023-11-19 04:56:48,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432693501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:48,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:56:48,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:56:48,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068792457] [2023-11-19 04:56:48,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:48,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:56:48,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:48,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:56:48,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:56:48,214 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 04:56:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:48,304 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2023-11-19 04:56:48,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:56:48,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2023-11-19 04:56:48,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:48,305 INFO L225 Difference]: With dead ends: 80 [2023-11-19 04:56:48,305 INFO L226 Difference]: Without dead ends: 80 [2023-11-19 04:56:48,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:56:48,306 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:48,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 140 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:56:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-19 04:56:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-19 04:56:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.607843137254902) 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-11-19 04:56:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-11-19 04:56:48,311 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 32 [2023-11-19 04:56:48,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:48,312 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-11-19 04:56:48,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 04:56:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-11-19 04:56:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-19 04:56:48,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:48,314 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:48,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 04:56:48,314 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-19 04:56:48,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:48,315 INFO L85 PathProgramCache]: Analyzing trace with hash 598026750, now seen corresponding path program 1 times [2023-11-19 04:56:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:48,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17379327] [2023-11-19 04:56:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:48,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 04:56:48,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:48,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17379327] [2023-11-19 04:56:48,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17379327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:48,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:56:48,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:56:48,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372265833] [2023-11-19 04:56:48,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:48,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:56:48,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:48,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:56:48,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:56:48,487 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 04:56:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:48,582 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2023-11-19 04:56:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:56:48,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2023-11-19 04:56:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:48,583 INFO L225 Difference]: With dead ends: 79 [2023-11-19 04:56:48,583 INFO L226 Difference]: Without dead ends: 79 [2023-11-19 04:56:48,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:56:48,584 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 17 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:48,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 140 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:56:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-19 04:56:48,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-19 04:56:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.588235294117647) internal successors, (81), 74 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:56:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2023-11-19 04:56:48,588 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 32 [2023-11-19 04:56:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:48,588 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2023-11-19 04:56:48,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 04:56:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2023-11-19 04:56:48,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-19 04:56:48,590 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:48,590 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:56:48,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 04:56:48,590 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-19 04:56:48,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:48,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1358960063, now seen corresponding path program 1 times [2023-11-19 04:56:48,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:48,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720624198] [2023-11-19 04:56:48,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:48,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-19 04:56:48,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:48,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720624198] [2023-11-19 04:56:48,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720624198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:48,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:56:48,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:56:48,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692295540] [2023-11-19 04:56:48,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:48,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:56:48,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:48,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:56:48,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:56:48,825 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 04:56:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:48,977 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2023-11-19 04:56:48,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:56:48,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 33 [2023-11-19 04:56:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:48,978 INFO L225 Difference]: With dead ends: 76 [2023-11-19 04:56:48,978 INFO L226 Difference]: Without dead ends: 76 [2023-11-19 04:56:48,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:56:48,979 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:48,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 220 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:56:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-19 04:56:48,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-19 04:56:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 71 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:56:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2023-11-19 04:56:48,982 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 33 [2023-11-19 04:56:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:48,983 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2023-11-19 04:56:48,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 04:56:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2023-11-19 04:56:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-19 04:56:48,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:48,983 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] [2023-11-19 04:56:48,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 04:56:48,984 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-19 04:56:48,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash 290563584, now seen corresponding path program 1 times [2023-11-19 04:56:48,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:48,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187791927] [2023-11-19 04:56:48,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:48,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-19 04:56:49,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:49,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187791927] [2023-11-19 04:56:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187791927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:56:49,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:56:49,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:56:49,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295046199] [2023-11-19 04:56:49,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:56:49,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:56:49,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:49,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:56:49,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:56:49,168 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:56:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:56:49,269 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2023-11-19 04:56:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:56:49,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 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 35 [2023-11-19 04:56:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:56:49,271 INFO L225 Difference]: With dead ends: 73 [2023-11-19 04:56:49,271 INFO L226 Difference]: Without dead ends: 73 [2023-11-19 04:56:49,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:56:49,272 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:56:49,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 137 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:56:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-19 04:56:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-19 04:56:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 68 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:56:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2023-11-19 04:56:49,275 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 35 [2023-11-19 04:56:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:56:49,275 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2023-11-19 04:56:49,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:56:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2023-11-19 04:56:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-19 04:56:49,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:56:49,276 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] [2023-11-19 04:56:49,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 04:56:49,277 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-19 04:56:49,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:56:49,277 INFO L85 PathProgramCache]: Analyzing trace with hash 417540643, now seen corresponding path program 1 times [2023-11-19 04:56:49,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:56:49,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444436187] [2023-11-19 04:56:49,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:49,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:56:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:56:50,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:56:50,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444436187] [2023-11-19 04:56:50,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444436187] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:56:50,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552486231] [2023-11-19 04:56:50,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:56:50,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:56:50,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:56:50,034 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:56:50,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f472131-b6ea-4538-9a14-159215395c88/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-19 04:56:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:56:50,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-19 04:56:50,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:56:50,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 04:56:50,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-11-19 04:56:50,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:56:50,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-19 04:56:50,593 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-19 04:56:50,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-19 04:56:50,733 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-19 04:56:50,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2023-11-19 04:56:50,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:56:50,836 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-19 04:56:50,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 34 [2023-11-19 04:56:50,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 04:56:50,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 04:56:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 04:56:50,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:56:51,223 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_21| Int) (v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_21| 1) (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_21| v_ArrVal_1338) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_21|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_21| v_ArrVal_1332) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_21| 1)))) is different from false [2023-11-19 04:56:51,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552486231] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:56:51,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1160625151] [2023-11-19 04:56:51,227 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-11-19 04:56:51,227 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:56:51,228 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:56:51,228 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:56:51,228 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:56:52,467 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-19 04:56:52,486 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:56:58,272 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4655#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| Int) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29| Int) (|v_#memory_int_140| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_168| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_176| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23| Int)) (and (= |#memory_int| (store |v_#memory_int_141| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29| (store (select |v_#memory_int_141| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23|) 1) (= |v_#memory_int_141| (store |v_#memory_int_140| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23| (store (select |v_#memory_int_140| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| (select (select |v_#memory_int_141| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23|)))) (<= 0 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23|) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| 0))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_168| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23| (store (select |v_#memory_$Pointer$.offset_168| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29| (store (select (store |v_#memory_$Pointer$.offset_168| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23| (store (select |v_#memory_$Pointer$.offset_168| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29|) 0)))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29|) 1) (<= (+ |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| 4) (select |#length| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23|)) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_176| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23| (store (select |v_#memory_$Pointer$.base_176| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29| (store (select (store |v_#memory_$Pointer$.base_176| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23| (store (select |v_#memory_$Pointer$.base_176| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_23|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_29|) 0)))))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-19 04:56:58,273 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:56:58,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 04:56:58,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2023-11-19 04:56:58,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321388664] [2023-11-19 04:56:58,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 04:56:58,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-19 04:56:58,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:56:58,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-19 04:56:58,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3461, Unknown=7, NotChecked=118, Total=3782 [2023-11-19 04:56:58,276 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 35 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5)