./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 01:04:00,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 01:04:00,791 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 01:04:00,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 01:04:00,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 01:04:00,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 01:04:00,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 01:04:00,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 01:04:00,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 01:04:00,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 01:04:00,862 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 01:04:00,863 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 01:04:00,863 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 01:04:00,865 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 01:04:00,866 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 01:04:00,866 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 01:04:00,867 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 01:04:00,868 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 01:04:00,868 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 01:04:00,869 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 01:04:00,869 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 01:04:00,870 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 01:04:00,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 01:04:00,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 01:04:00,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 01:04:00,873 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 01:04:00,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 01:04:00,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 01:04:00,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 01:04:00,875 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 01:04:00,877 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 01:04:00,877 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 01:04:00,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 01:04:00,878 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 01:04:00,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 01:04:00,878 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 01:04:00,878 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 01:04:00,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 01:04:00,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 01:04:00,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:04:00,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 01:04:00,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 01:04:00,880 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 01:04:00,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 01:04:00,881 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 01:04:00,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 01:04:00,882 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_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/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_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2023-11-12 01:04:01,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 01:04:01,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 01:04:01,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 01:04:01,324 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 01:04:01,326 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 01:04:01,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-12 01:04:05,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 01:04:05,456 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 01:04:05,457 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-12 01:04:05,477 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/data/02c1b99b2/aab574760c4045cda4e0f510a0ec415b/FLAG90607e706 [2023-11-12 01:04:05,497 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/data/02c1b99b2/aab574760c4045cda4e0f510a0ec415b [2023-11-12 01:04:05,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 01:04:05,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 01:04:05,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 01:04:05,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 01:04:05,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 01:04:05,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:04:05" (1/1) ... [2023-11-12 01:04:05,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786b3bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:05, skipping insertion in model container [2023-11-12 01:04:05,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:04:05" (1/1) ... [2023-11-12 01:04:05,598 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 01:04:06,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:04:06,047 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 01:04:06,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:04:06,147 INFO L206 MainTranslator]: Completed translation [2023-11-12 01:04:06,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:06 WrapperNode [2023-11-12 01:04:06,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 01:04:06,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 01:04:06,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 01:04:06,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 01:04:06,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:06" (1/1) ... [2023-11-12 01:04:06,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:06" (1/1) ... [2023-11-12 01:04:06,230 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 148 [2023-11-12 01:04:06,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 01:04:06,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 01:04:06,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 01:04:06,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 01:04:06,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:06" (1/1) ... [2023-11-12 01:04:06,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:06" (1/1) ... [2023-11-12 01:04:06,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:06" (1/1) ... [2023-11-12 01:04:06,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:06" (1/1) ... [2023-11-12 01:04:06,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:06" (1/1) ... [2023-11-12 01:04:06,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:06" (1/1) ... [2023-11-12 01:04:06,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:06" (1/1) ... [2023-11-12 01:04:06,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:06" (1/1) ... [2023-11-12 01:04:06,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 01:04:06,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 01:04:06,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 01:04:06,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 01:04:06,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:06" (1/1) ... [2023-11-12 01:04:06,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:04:06,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:04:06,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 01:04:06,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 01:04:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 01:04:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 01:04:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 01:04:06,400 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 01:04:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 01:04:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 01:04:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 01:04:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 01:04:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 01:04:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 01:04:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 01:04:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 01:04:06,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 01:04:06,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 01:04:06,569 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 01:04:06,572 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 01:04:07,117 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 01:04:07,204 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 01:04:07,204 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 01:04:07,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:04:07 BoogieIcfgContainer [2023-11-12 01:04:07,208 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 01:04:07,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 01:04:07,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 01:04:07,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 01:04:07,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:04:05" (1/3) ... [2023-11-12 01:04:07,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162ad6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:04:07, skipping insertion in model container [2023-11-12 01:04:07,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:04:06" (2/3) ... [2023-11-12 01:04:07,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162ad6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:04:07, skipping insertion in model container [2023-11-12 01:04:07,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:04:07" (3/3) ... [2023-11-12 01:04:07,219 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-11-12 01:04:07,244 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 01:04:07,244 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2023-11-12 01:04:07,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 01:04:07,329 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;@3b5a1a27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 01:04:07,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-11-12 01:04:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 49 states have (on average 2.2653061224489797) internal successors, (111), 99 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 01:04:07,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:07,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 01:04:07,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:07,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:07,358 INFO L85 PathProgramCache]: Analyzing trace with hash 223906366, now seen corresponding path program 1 times [2023-11-12 01:04:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:07,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224851140] [2023-11-12 01:04:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:07,753 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-12 01:04:07,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:07,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224851140] [2023-11-12 01:04:07,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224851140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:04:07,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:04:07,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 01:04:07,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920475650] [2023-11-12 01:04:07,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:04:07,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 01:04:07,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:07,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 01:04:07,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 01:04:07,830 INFO L87 Difference]: Start difference. First operand has 104 states, 49 states have (on average 2.2653061224489797) internal successors, (111), 99 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:04:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:08,058 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2023-11-12 01:04:08,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 01:04:08,062 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-12 01:04:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:08,078 INFO L225 Difference]: With dead ends: 101 [2023-11-12 01:04:08,078 INFO L226 Difference]: Without dead ends: 99 [2023-11-12 01:04:08,081 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-12 01:04:08,091 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:08,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 141 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:04:08,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-12 01:04:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-12 01:04:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 47 states have (on average 2.148936170212766) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2023-11-12 01:04:08,153 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 5 [2023-11-12 01:04:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:08,154 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2023-11-12 01:04:08,154 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-12 01:04:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2023-11-12 01:04:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 01:04:08,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:08,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 01:04:08,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 01:04:08,156 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:08,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:08,158 INFO L85 PathProgramCache]: Analyzing trace with hash 223906367, now seen corresponding path program 1 times [2023-11-12 01:04:08,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:08,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097108340] [2023-11-12 01:04:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:08,303 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-12 01:04:08,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:08,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097108340] [2023-11-12 01:04:08,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097108340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:04:08,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:04:08,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 01:04:08,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112490727] [2023-11-12 01:04:08,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:04:08,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 01:04:08,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:08,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 01:04:08,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 01:04:08,309 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:04:08,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:08,430 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2023-11-12 01:04:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 01:04:08,431 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-12 01:04:08,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:08,433 INFO L225 Difference]: With dead ends: 97 [2023-11-12 01:04:08,434 INFO L226 Difference]: Without dead ends: 97 [2023-11-12 01:04:08,434 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-12 01:04:08,437 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:08,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:04:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-12 01:04:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-12 01:04:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 47 states have (on average 2.106382978723404) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-11-12 01:04:08,451 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 5 [2023-11-12 01:04:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:08,451 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-11-12 01:04:08,452 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-12 01:04:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-11-12 01:04:08,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 01:04:08,453 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:08,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:04:08,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 01:04:08,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:08,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:08,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2048449616, now seen corresponding path program 1 times [2023-11-12 01:04:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:08,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481732746] [2023-11-12 01:04:08,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:08,574 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-12 01:04:08,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:08,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481732746] [2023-11-12 01:04:08,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481732746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:04:08,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:04:08,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 01:04:08,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645819974] [2023-11-12 01:04:08,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:04:08,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 01:04:08,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:08,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 01:04:08,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 01:04:08,583 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 01:04:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:08,653 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-11-12 01:04:08,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 01:04:08,654 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-12 01:04:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:08,660 INFO L225 Difference]: With dead ends: 98 [2023-11-12 01:04:08,661 INFO L226 Difference]: Without dead ends: 98 [2023-11-12 01:04:08,662 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-12 01:04:08,666 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:08,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 174 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:04:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-12 01:04:08,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-12 01:04:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-11-12 01:04:08,692 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 10 [2023-11-12 01:04:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:08,695 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-11-12 01:04:08,695 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-12 01:04:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-11-12 01:04:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 01:04:08,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:08,697 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:04:08,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 01:04:08,697 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:08,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:08,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2099234649, now seen corresponding path program 1 times [2023-11-12 01:04:08,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:08,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118260104] [2023-11-12 01:04:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:08,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:08,977 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-12 01:04:08,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:08,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118260104] [2023-11-12 01:04:08,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118260104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:04:08,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:04:08,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:04:08,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986438259] [2023-11-12 01:04:08,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:04:08,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:04:08,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:08,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:04:08,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:04:08,980 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 01:04:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:09,250 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2023-11-12 01:04:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 01:04:09,251 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-12 01:04:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:09,253 INFO L225 Difference]: With dead ends: 97 [2023-11-12 01:04:09,253 INFO L226 Difference]: Without dead ends: 97 [2023-11-12 01:04:09,253 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-12 01:04:09,255 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:09,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 282 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:04:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-12 01:04:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-12 01:04:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 48 states have (on average 2.0625) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-11-12 01:04:09,266 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 17 [2023-11-12 01:04:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:09,267 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-11-12 01:04:09,267 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-12 01:04:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-11-12 01:04:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 01:04:09,268 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:09,268 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:04:09,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 01:04:09,269 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:09,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2099234648, now seen corresponding path program 1 times [2023-11-12 01:04:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:09,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782265126] [2023-11-12 01:04:09,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:09,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:09,527 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-12 01:04:09,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:09,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782265126] [2023-11-12 01:04:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782265126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:04:09,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:04:09,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:04:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807827531] [2023-11-12 01:04:09,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:04:09,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:04:09,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:09,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:04:09,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:04:09,530 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 01:04:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:09,782 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2023-11-12 01:04:09,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 01:04:09,783 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-12 01:04:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:09,784 INFO L225 Difference]: With dead ends: 96 [2023-11-12 01:04:09,785 INFO L226 Difference]: Without dead ends: 96 [2023-11-12 01:04:09,785 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-12 01:04:09,786 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:09,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 306 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:04:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-12 01:04:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-12 01:04:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 91 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2023-11-12 01:04:09,801 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 17 [2023-11-12 01:04:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:09,802 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2023-11-12 01:04:09,802 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-12 01:04:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2023-11-12 01:04:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 01:04:09,803 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:09,803 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:04:09,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 01:04:09,804 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:09,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1270324585, now seen corresponding path program 1 times [2023-11-12 01:04:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:09,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529450825] [2023-11-12 01:04:09,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:09,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:10,238 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-12 01:04:10,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:10,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529450825] [2023-11-12 01:04:10,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529450825] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:04:10,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793023137] [2023-11-12 01:04:10,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:10,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:04:10,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:04:10,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:04:10,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 01:04:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:10,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-12 01:04:10,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:04:10,536 INFO L351 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-12 01:04:10,631 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 01:04:10,738 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 01:04:10,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-12 01:04:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-12 01:04:10,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:04:10,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793023137] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:04:10,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [619162188] [2023-11-12 01:04:10,912 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 01:04:10,912 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:04:10,917 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:04:10,924 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:04:10,925 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:04:12,951 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-12 01:04:13,126 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 01:04:15,523 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1189#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-11-12 01:04:15,524 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 01:04:15,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 01:04:15,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2023-11-12 01:04:15,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768354502] [2023-11-12 01:04:15,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 01:04:15,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 01:04:15,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:15,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 01:04:15,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=432, Unknown=2, NotChecked=42, Total=552 [2023-11-12 01:04:15,526 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 01:04:15,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:15,954 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2023-11-12 01:04:15,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:04:15,955 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2023-11-12 01:04:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:15,957 INFO L225 Difference]: With dead ends: 95 [2023-11-12 01:04:15,957 INFO L226 Difference]: Without dead ends: 95 [2023-11-12 01:04:15,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=94, Invalid=508, Unknown=2, NotChecked=46, Total=650 [2023-11-12 01:04:15,959 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:15,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 403 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 383 Invalid, 0 Unknown, 98 Unchecked, 0.3s Time] [2023-11-12 01:04:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-12 01:04:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-12 01:04:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2023-11-12 01:04:15,982 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 19 [2023-11-12 01:04:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:15,982 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2023-11-12 01:04:15,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 01:04:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2023-11-12 01:04:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 01:04:15,984 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:15,985 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:04:16,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 01:04:16,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:04:16,193 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:16,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:16,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1270324586, now seen corresponding path program 1 times [2023-11-12 01:04:16,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:16,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080653486] [2023-11-12 01:04:16,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:16,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:16,753 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-12 01:04:16,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:16,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080653486] [2023-11-12 01:04:16,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080653486] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:04:16,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625676645] [2023-11-12 01:04:16,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:16,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:04:16,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:04:16,756 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:04:16,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 01:04:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:16,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-12 01:04:16,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:04:16,916 INFO L351 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-12 01:04:17,133 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 01:04:17,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:04:17,178 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 01:04:17,194 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 01:04:17,195 INFO L351 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-12 01:04:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-12 01:04:17,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:04:17,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625676645] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:04:17,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1152144998] [2023-11-12 01:04:17,421 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 01:04:17,421 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:04:17,421 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:04:17,422 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:04:17,422 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:04:18,406 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-12 01:04:18,569 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 01:04:21,011 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1483#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= (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-12 01:04:21,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 01:04:21,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 01:04:21,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-11-12 01:04:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923737980] [2023-11-12 01:04:21,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 01:04:21,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-12 01:04:21,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:21,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 01:04:21,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=768, Unknown=1, NotChecked=56, Total=930 [2023-11-12 01:04:21,013 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 01:04:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:21,597 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2023-11-12 01:04:21,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 01:04:21,597 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-11-12 01:04:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:21,600 INFO L225 Difference]: With dead ends: 95 [2023-11-12 01:04:21,600 INFO L226 Difference]: Without dead ends: 95 [2023-11-12 01:04:21,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=126, Invalid=869, Unknown=1, NotChecked=60, Total=1056 [2023-11-12 01:04:21,602 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 7 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:21,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 427 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 463 Invalid, 0 Unknown, 100 Unchecked, 0.5s Time] [2023-11-12 01:04:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-12 01:04:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2023-11-12 01:04:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 48 states have (on average 2.0) internal successors, (96), 89 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2023-11-12 01:04:21,609 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 19 [2023-11-12 01:04:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:21,610 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2023-11-12 01:04:21,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 01:04:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2023-11-12 01:04:21,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 01:04:21,611 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:21,611 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-12 01:04:21,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 01:04:21,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-12 01:04:21,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:21,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2102056431, now seen corresponding path program 1 times [2023-11-12 01:04:21,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:21,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727960890] [2023-11-12 01:04:21,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:21,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:22,347 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-12 01:04:22,347 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:22,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727960890] [2023-11-12 01:04:22,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727960890] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:04:22,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719790829] [2023-11-12 01:04:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:22,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:04:22,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:04:22,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:04:22,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 01:04:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:22,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-12 01:04:22,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:04:22,515 INFO L351 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-12 01:04:22,535 INFO L351 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-12 01:04:22,613 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 01:04:22,613 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-12 01:04:22,655 INFO L351 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-12 01:04:22,664 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-12 01:04:22,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:04:22,692 INFO L351 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-12 01:04:22,747 INFO L351 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-12 01:04:22,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:04:22,778 INFO L351 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-12 01:04:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2023-11-12 01:04:22,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:04:22,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719790829] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:04:22,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [984213345] [2023-11-12 01:04:22,860 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 01:04:22,860 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:04:22,861 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:04:22,861 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:04:22,861 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:04:24,022 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 01:04:24,043 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 01:04:26,490 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1793#(and (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (or (and (exists ((|v_#memory_int_76| (Array Int (Array Int Int))) (|v_#memory_int_77| (Array Int (Array Int Int)))) (and (= |v_#memory_int_77| (store |v_#memory_int_76| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_76| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_77| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_77| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_77| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.base_101| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_101| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#length_104| (Array Int Int))) (= (store |v_#length_104| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#length_BEFORE_CALL_57| (Array Int Int)) (|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_#memory_int_80| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_32| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_32| (store |v_#memory_int_80| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_80| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0)))) (= (select (select (store |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 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|) (= (select |v_old(#valid)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_#length_BEFORE_CALL_57| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|)))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_128| (Array Int Int))) (and (= (store |v_#valid_128| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_128| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0)))) (and (exists ((|v_#memory_int_76| (Array Int (Array Int Int))) (|v_#memory_int_77| (Array Int (Array Int Int)))) (and (= |v_#memory_int_77| (store |v_#memory_int_76| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_76| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_77| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_77| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_77| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.base_101| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_101| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#length_104| (Array Int Int))) (= (store |v_#length_104| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#length_BEFORE_CALL_59| (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_#memory_int_80| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_33| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 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|) (= (select (select (store |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_#length_BEFORE_CALL_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|)) (= |v_old(#memory_int)_AFTER_CALL_33| (store |v_#memory_int_80| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_80| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 1))) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_128| (Array Int Int))) (and (= (store |v_#valid_128| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_128| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_append_~head#1.base|) (= |ULTIMATE.start_sll_circular_append_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_append_~head#1.base|) 1)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 01:04:26,491 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 01:04:26,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 01:04:26,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2023-11-12 01:04:26,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428305869] [2023-11-12 01:04:26,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 01:04:26,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-12 01:04:26,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:26,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 01:04:26,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=895, Unknown=6, NotChecked=60, Total=1056 [2023-11-12 01:04:26,493 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 17 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-12 01:04:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:27,149 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2023-11-12 01:04:27,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 01:04:27,149 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2023-11-12 01:04:27,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:27,150 INFO L225 Difference]: With dead ends: 103 [2023-11-12 01:04:27,151 INFO L226 Difference]: Without dead ends: 103 [2023-11-12 01:04:27,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=122, Invalid=1066, Unknown=6, NotChecked=66, Total=1260 [2023-11-12 01:04:27,152 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 107 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:27,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 361 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 608 Invalid, 0 Unknown, 107 Unchecked, 0.5s Time] [2023-11-12 01:04:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-12 01:04:27,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2023-11-12 01:04:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 81 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-11-12 01:04:27,159 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 27 [2023-11-12 01:04:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:27,159 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-11-12 01:04:27,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-12 01:04:27,160 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-11-12 01:04:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 01:04:27,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:27,161 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-12 01:04:27,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 01:04:27,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-12 01:04:27,362 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:27,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:27,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2102056432, now seen corresponding path program 1 times [2023-11-12 01:04:27,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:27,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88683907] [2023-11-12 01:04:27,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:27,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 01:04:27,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88683907] [2023-11-12 01:04:27,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88683907] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:04:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681676819] [2023-11-12 01:04:27,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:27,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:04:27,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:04:27,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:04:27,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 01:04:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:28,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-12 01:04:28,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:04:28,142 INFO L351 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-12 01:04:28,165 INFO L351 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-12 01:04:28,173 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-12 01:04:28,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:04:28,196 INFO L351 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-12 01:04:28,219 INFO L351 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-12 01:04:28,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:04:28,250 INFO L351 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-12 01:04:28,314 INFO L351 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-12 01:04:28,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:04:28,346 INFO L351 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-12 01:04:28,373 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-12 01:04:28,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 01:04:28,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681676819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:04:28,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 01:04:28,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-11-12 01:04:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519228003] [2023-11-12 01:04:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:04:28,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 01:04:28,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 01:04:28,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2023-11-12 01:04:28,376 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 01:04:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:28,545 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2023-11-12 01:04:28,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:04:28,547 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-12 01:04:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:28,548 INFO L225 Difference]: With dead ends: 81 [2023-11-12 01:04:28,548 INFO L226 Difference]: Without dead ends: 81 [2023-11-12 01:04:28,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2023-11-12 01:04:28,549 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 25 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:28,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 180 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 110 Unchecked, 0.1s Time] [2023-11-12 01:04:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-12 01:04:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-12 01:04:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-11-12 01:04:28,554 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 27 [2023-11-12 01:04:28,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:28,555 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-11-12 01:04:28,555 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-12 01:04:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-11-12 01:04:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 01:04:28,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:28,556 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-12 01:04:28,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 01:04:28,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:04:28,762 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:28,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:28,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1441601264, now seen corresponding path program 1 times [2023-11-12 01:04:28,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:28,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277044139] [2023-11-12 01:04:28,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:28,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:28,885 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-12 01:04:28,885 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:28,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277044139] [2023-11-12 01:04:28,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277044139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:04:28,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:04:28,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:04:28,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393067123] [2023-11-12 01:04:28,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:04:28,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:04:28,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:28,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:04:28,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:04:28,887 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 01:04:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:29,036 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2023-11-12 01:04:29,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 01:04:29,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2023-11-12 01:04:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:29,037 INFO L225 Difference]: With dead ends: 79 [2023-11-12 01:04:29,037 INFO L226 Difference]: Without dead ends: 79 [2023-11-12 01:04:29,038 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-12 01:04:29,038 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:29,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 212 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:04:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-12 01:04:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-12 01:04:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.6875) internal successors, (81), 74 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2023-11-12 01:04:29,043 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 29 [2023-11-12 01:04:29,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:29,043 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2023-11-12 01:04:29,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 01:04:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2023-11-12 01:04:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 01:04:29,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:29,045 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-12 01:04:29,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 01:04:29,045 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:29,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:29,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1441601265, now seen corresponding path program 1 times [2023-11-12 01:04:29,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:29,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842577633] [2023-11-12 01:04:29,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:29,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-12 01:04:29,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:29,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842577633] [2023-11-12 01:04:29,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842577633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:04:29,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:04:29,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:04:29,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924577659] [2023-11-12 01:04:29,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:04:29,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:04:29,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:29,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:04:29,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:04:29,242 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 01:04:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:29,390 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-11-12 01:04:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 01:04:29,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2023-11-12 01:04:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:29,391 INFO L225 Difference]: With dead ends: 77 [2023-11-12 01:04:29,391 INFO L226 Difference]: Without dead ends: 77 [2023-11-12 01:04:29,391 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-12 01:04:29,392 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:29,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 224 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:04:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-12 01:04:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-12 01:04:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 72 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2023-11-12 01:04:29,395 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 29 [2023-11-12 01:04:29,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:29,396 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2023-11-12 01:04:29,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 01:04:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2023-11-12 01:04:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 01:04:29,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:29,397 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-12 01:04:29,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 01:04:29,397 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:29,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:29,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1739979174, now seen corresponding path program 1 times [2023-11-12 01:04:29,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:29,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591906144] [2023-11-12 01:04:29,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:29,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:29,981 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-12 01:04:29,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:29,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591906144] [2023-11-12 01:04:29,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591906144] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:04:29,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146191550] [2023-11-12 01:04:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:29,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:04:29,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:04:29,985 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:04:30,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 01:04:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:30,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-12 01:04:30,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:04:30,199 INFO L351 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-12 01:04:30,348 INFO L351 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-12 01:04:30,457 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-12 01:04:30,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:04:30,469 INFO L351 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-12 01:04:30,489 INFO L322 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-12 01:04:30,489 INFO L351 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-12 01:04:30,531 INFO L351 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-12 01:04:30,533 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-12 01:04:30,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:04:30,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146191550] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:04:30,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [290225763] [2023-11-12 01:04:30,662 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-12 01:04:30,663 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:04:30,663 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:04:30,663 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:04:30,663 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:04:31,933 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 01:04:31,955 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 01:04:36,366 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2719#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_append_~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) 1)) (= |ULTIMATE.start_sll_circular_append_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (<= 2 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (or (and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_88| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_80| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int) (|v_#memory_int_92| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_121| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select |v_old(#valid)_AFTER_CALL_49| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_#length_BEFORE_CALL_88| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|)) (= (store |v_#memory_int_92| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_92| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_#memory_int_BEFORE_CALL_80| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0))) |v_#memory_int_BEFORE_CALL_80|))) (exists ((|v_#memory_$Pointer$.offset_113| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#length_115| (Array Int Int))) (= |#length| (store |v_#length_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_int_89| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_89| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_89| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))) (= (store |v_#memory_int_88| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_88| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_89| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_89|))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_139| (Array Int Int))) (and (= (store |v_#valid_139| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_139| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0)))) (and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#length_BEFORE_CALL_86| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int) (|v_#memory_int_92| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_121| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select (select (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1) (<= 4 (select |v_#length_BEFORE_CALL_86| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|)) (= (store |v_#memory_int_92| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_92| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_#memory_int_BEFORE_CALL_78| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0))) |v_#memory_int_BEFORE_CALL_78|))) (exists ((|v_#memory_$Pointer$.offset_113| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#length_115| (Array Int Int))) (= |#length| (store |v_#length_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_int_89| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_89| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_89| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))) (= (store |v_#memory_int_88| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_88| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_89| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_89|))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_139| (Array Int Int))) (and (= (store |v_#valid_139| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_139| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~head#1.base|) 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 01:04:36,366 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 01:04:36,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 01:04:36,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-11-12 01:04:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7097106] [2023-11-12 01:04:36,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 01:04:36,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-12 01:04:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:36,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-12 01:04:36,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1578, Unknown=13, NotChecked=80, Total=1806 [2023-11-12 01:04:36,370 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 24 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 21 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 01:04:37,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:37,387 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-11-12 01:04:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 01:04:37,388 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 21 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-12 01:04:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:37,389 INFO L225 Difference]: With dead ends: 80 [2023-11-12 01:04:37,389 INFO L226 Difference]: Without dead ends: 80 [2023-11-12 01:04:37,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=200, Invalid=2237, Unknown=17, NotChecked=96, Total=2550 [2023-11-12 01:04:37,391 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 126 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:37,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 438 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 762 Invalid, 0 Unknown, 88 Unchecked, 0.6s Time] [2023-11-12 01:04:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-12 01:04:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2023-11-12 01:04:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 71 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-11-12 01:04:37,394 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 30 [2023-11-12 01:04:37,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:37,395 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-11-12 01:04:37,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 21 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 01:04:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-11-12 01:04:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 01:04:37,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:37,397 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-12 01:04:37,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 01:04:37,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-12 01:04:37,598 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:37,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:37,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1739979175, now seen corresponding path program 1 times [2023-11-12 01:04:37,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:37,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569524945] [2023-11-12 01:04:37,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:37,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:38,687 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-12 01:04:38,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:38,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569524945] [2023-11-12 01:04:38,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569524945] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:04:38,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50006395] [2023-11-12 01:04:38,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:38,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:04:38,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:04:38,693 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:04:38,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 01:04:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:38,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-12 01:04:38,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:04:38,901 INFO L351 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-12 01:04:39,186 INFO L351 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-12 01:04:39,191 INFO L351 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-12 01:04:39,392 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-12 01:04:39,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:04:39,411 INFO L351 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-12 01:04:39,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:04:39,421 INFO L351 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-12 01:04:39,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:04:39,428 INFO L351 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-12 01:04:39,436 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-12 01:04:39,437 INFO L351 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-12 01:04:39,503 INFO L351 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-12 01:04:39,539 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-12 01:04:39,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:04:39,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50006395] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:04:39,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1849436199] [2023-11-12 01:04:39,857 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-12 01:04:39,857 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:04:39,857 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:04:39,858 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:04:39,858 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:04:41,035 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 01:04:41,062 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 01:04:46,099 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3045#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_append_~head#1.base|) (= |ULTIMATE.start_sll_circular_append_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (<= 2 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (or (< |ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_append_~last~1#1.offset| 4))) (= |ULTIMATE.start_main_~data~0#1| 1) (or (and (exists ((|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_133| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_133| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_61| (Array Int Int)) (|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_#memory_int_BEFORE_CALL_101| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= |v_#memory_int_BEFORE_CALL_101| (store |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_#memory_int_BEFORE_CALL_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (= |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)))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (exists ((|v_#valid_149| (Array Int Int))) (and (= (select |v_#valid_149| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_149| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.offset_129| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_129| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_129| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_100| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_100| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_101|) (= |#memory_int| (store |v_#memory_int_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#length_125| (Array Int Int))) (= |#length| (store |v_#length_125| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|)) (and (exists ((|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_133| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_133| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (exists ((|v_#valid_149| (Array Int Int))) (and (= (select |v_#valid_149| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_149| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_62| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_62| (Array Int Int)) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_133| |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_62| (store |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (<= 4 (select |v_old(#length)_AFTER_CALL_62| |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)))) (exists ((|v_#memory_$Pointer$.offset_129| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_129| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_129| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_100| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_100| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_101|) (= |#memory_int| (store |v_#memory_int_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#length_125| (Array Int Int))) (= |#length| (store |v_#length_125| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~head#1.base|) 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 01:04:46,099 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 01:04:46,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 01:04:46,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-11-12 01:04:46,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455873372] [2023-11-12 01:04:46,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 01:04:46,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-12 01:04:46,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:46,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-12 01:04:46,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2097, Unknown=10, NotChecked=92, Total=2352 [2023-11-12 01:04:46,102 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 28 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 24 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 01:04:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:47,791 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2023-11-12 01:04:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 01:04:47,792 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 24 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-12 01:04:47,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:47,793 INFO L225 Difference]: With dead ends: 85 [2023-11-12 01:04:47,793 INFO L226 Difference]: Without dead ends: 85 [2023-11-12 01:04:47,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=253, Invalid=3277, Unknown=14, NotChecked=116, Total=3660 [2023-11-12 01:04:47,796 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 196 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:47,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 639 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 995 Invalid, 0 Unknown, 94 Unchecked, 0.9s Time] [2023-11-12 01:04:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-12 01:04:47,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2023-11-12 01:04:47,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 75 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2023-11-12 01:04:47,800 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 30 [2023-11-12 01:04:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:47,800 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2023-11-12 01:04:47,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 24 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 01:04:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2023-11-12 01:04:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 01:04:47,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:47,802 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-12 01:04:47,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 01:04:48,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:04:48,012 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:48,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1365274396, now seen corresponding path program 1 times [2023-11-12 01:04:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:48,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652963200] [2023-11-12 01:04:48,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:48,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:48,285 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-12 01:04:48,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:48,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652963200] [2023-11-12 01:04:48,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652963200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:04:48,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:04:48,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 01:04:48,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745183693] [2023-11-12 01:04:48,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:04:48,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 01:04:48,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:48,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 01:04:48,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:04:48,287 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 01:04:48,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:48,382 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2023-11-12 01:04:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 01:04:48,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-11-12 01:04:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:48,383 INFO L225 Difference]: With dead ends: 77 [2023-11-12 01:04:48,383 INFO L226 Difference]: Without dead ends: 77 [2023-11-12 01:04:48,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-12 01:04:48,384 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 103 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:48,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 98 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:04:48,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-12 01:04:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-12 01:04:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.509433962264151) internal successors, (80), 72 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:04:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-11-12 01:04:48,387 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 32 [2023-11-12 01:04:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:48,388 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-11-12 01:04:48,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 01:04:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-11-12 01:04:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-12 01:04:48,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:48,389 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-12 01:04:48,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 01:04:48,389 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:48,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:48,389 INFO L85 PathProgramCache]: Analyzing trace with hash -626162811, now seen corresponding path program 1 times [2023-11-12 01:04:48,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:48,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021850818] [2023-11-12 01:04:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:48,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:48,690 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-12 01:04:48,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:48,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021850818] [2023-11-12 01:04:48,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021850818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:04:48,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:04:48,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 01:04:48,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13799271] [2023-11-12 01:04:48,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:04:48,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 01:04:48,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:48,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 01:04:48,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-12 01:04:48,694 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 9 states, 6 states have (on average 3.5) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 01:04:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:48,932 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2023-11-12 01:04:48,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 01:04:48,933 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.5) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2023-11-12 01:04:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:48,934 INFO L225 Difference]: With dead ends: 123 [2023-11-12 01:04:48,934 INFO L226 Difference]: Without dead ends: 123 [2023-11-12 01:04:48,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-12 01:04:48,935 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 88 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:48,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 221 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:04:48,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-12 01:04:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 79. [2023-11-12 01:04:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 74 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-12 01:04:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2023-11-12 01:04:48,940 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 33 [2023-11-12 01:04:48,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:48,940 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2023-11-12 01:04:48,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.5) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 01:04:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2023-11-12 01:04:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-12 01:04:48,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:48,941 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-12 01:04:48,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 01:04:48,941 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:48,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:48,942 INFO L85 PathProgramCache]: Analyzing trace with hash -626162810, now seen corresponding path program 1 times [2023-11-12 01:04:48,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:48,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787252562] [2023-11-12 01:04:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:48,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-12 01:04:49,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:49,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787252562] [2023-11-12 01:04:49,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787252562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:04:49,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:04:49,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 01:04:49,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096657511] [2023-11-12 01:04:49,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:04:49,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 01:04:49,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:04:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 01:04:49,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-12 01:04:49,464 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 01:04:49,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:04:49,719 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2023-11-12 01:04:49,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 01:04:49,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2023-11-12 01:04:49,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:04:49,721 INFO L225 Difference]: With dead ends: 120 [2023-11-12 01:04:49,721 INFO L226 Difference]: Without dead ends: 120 [2023-11-12 01:04:49,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-12 01:04:49,722 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 68 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:04:49,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 311 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:04:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-12 01:04:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 81. [2023-11-12 01:04:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 76 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-12 01:04:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2023-11-12 01:04:49,726 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 33 [2023-11-12 01:04:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:04:49,727 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2023-11-12 01:04:49,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 01:04:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2023-11-12 01:04:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-12 01:04:49,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:04:49,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:04:49,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 01:04:49,729 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-12 01:04:49,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:04:49,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1128339705, now seen corresponding path program 1 times [2023-11-12 01:04:49,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:04:49,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143853011] [2023-11-12 01:04:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:49,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:04:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:04:51,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:04:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143853011] [2023-11-12 01:04:51,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143853011] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:04:51,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460546523] [2023-11-12 01:04:51,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:04:51,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:04:51,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:04:51,151 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:04:51,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a38576c-4448-4d9d-92a4-b668c5e04ab3/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 01:04:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:04:51,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 90 conjunts are in the unsatisfiable core [2023-11-12 01:04:51,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:04:51,377 INFO L351 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-12 01:04:51,481 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 01:04:51,481 INFO L351 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-12 01:04:51,718 INFO L322 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-12 01:04:51,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-11-12 01:04:51,874 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7