./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire --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 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:32:34,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:32:34,830 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-23 21:32:34,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:32:34,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:32:34,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:32:34,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:32:34,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:32:34,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:32:34,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:32:34,885 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:32:34,886 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:32:34,887 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:32:34,889 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 21:32:34,889 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:32:34,890 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:32:34,890 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 21:32:34,891 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 21:32:34,891 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:32:34,892 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 21:32:34,893 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 21:32:34,893 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 21:32:34,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:32:34,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:32:34,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:32:34,896 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:32:34,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:32:34,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:32:34,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:32:34,898 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 21:32:34,899 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 21:32:34,900 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 21:32:34,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:32:34,900 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:32:34,901 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:32:34,901 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:32:34,901 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:32:34,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:32:34,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:32:34,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:32:34,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:32:34,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:32:34,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:32:34,904 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 21:32:34,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:32:34,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:32:34,905 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:32:34,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:32:34,906 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_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/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_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2023-11-23 21:32:35,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:32:35,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:32:35,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:32:35,295 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:32:35,296 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:32:35,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2023-11-23 21:32:38,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:32:38,765 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:32:38,766 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2023-11-23 21:32:38,786 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/data/82df480f3/d34ed810c36d4363b24294257af36132/FLAGc641abab4 [2023-11-23 21:32:38,803 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/data/82df480f3/d34ed810c36d4363b24294257af36132 [2023-11-23 21:32:38,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:32:38,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:32:38,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:32:38,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:32:38,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:32:38,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:32:38" (1/1) ... [2023-11-23 21:32:38,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6c96a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:38, skipping insertion in model container [2023-11-23 21:32:38,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:32:38" (1/1) ... [2023-11-23 21:32:38,885 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:32:39,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:32:39,238 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:32:39,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:32:39,322 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:32:39,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:39 WrapperNode [2023-11-23 21:32:39,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:32:39,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:32:39,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:32:39,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:32:39,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:39" (1/1) ... [2023-11-23 21:32:39,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:39" (1/1) ... [2023-11-23 21:32:39,383 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 143 [2023-11-23 21:32:39,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:32:39,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:32:39,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:32:39,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:32:39,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:39" (1/1) ... [2023-11-23 21:32:39,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:39" (1/1) ... [2023-11-23 21:32:39,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:39" (1/1) ... [2023-11-23 21:32:39,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:39" (1/1) ... [2023-11-23 21:32:39,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:39" (1/1) ... [2023-11-23 21:32:39,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:39" (1/1) ... [2023-11-23 21:32:39,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:39" (1/1) ... [2023-11-23 21:32:39,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:39" (1/1) ... [2023-11-23 21:32:39,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:32:39,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:32:39,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:32:39,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:32:39,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:39" (1/1) ... [2023-11-23 21:32:39,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:32:39,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:32:39,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:32:39,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:32:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 21:32:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:32:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-23 21:32:39,517 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-23 21:32:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 21:32:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:32:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:32:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 21:32:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 21:32:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:32:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 21:32:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:32:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:32:39,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:32:39,652 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:32:39,661 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:32:40,114 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:32:40,197 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:32:40,197 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-23 21:32:40,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:32:40 BoogieIcfgContainer [2023-11-23 21:32:40,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:32:40,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:32:40,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:32:40,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:32:40,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:32:38" (1/3) ... [2023-11-23 21:32:40,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d77fe3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:32:40, skipping insertion in model container [2023-11-23 21:32:40,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:32:39" (2/3) ... [2023-11-23 21:32:40,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d77fe3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:32:40, skipping insertion in model container [2023-11-23 21:32:40,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:32:40" (3/3) ... [2023-11-23 21:32:40,208 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2023-11-23 21:32:40,230 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:32:40,230 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2023-11-23 21:32:40,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:32:40,285 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;@1d9e8e66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:32:40,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2023-11-23 21:32:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 41 states have (on average 2.268292682926829) internal successors, (93), 80 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:32:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-23 21:32:40,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:32:40,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-23 21:32:40,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-23 21:32:40,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:32:40,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2129893091, now seen corresponding path program 1 times [2023-11-23 21:32:40,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:32:40,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862949276] [2023-11-23 21:32:40,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:32:40,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:32:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:32:40,608 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-23 21:32:40,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:32:40,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862949276] [2023-11-23 21:32:40,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862949276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:32:40,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:32:40,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:32:40,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522899792] [2023-11-23 21:32:40,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:32:40,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:32:40,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:32:40,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:32:40,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:32:40,650 INFO L87 Difference]: Start difference. First operand has 84 states, 41 states have (on average 2.268292682926829) internal successors, (93), 80 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:32:40,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:32:40,710 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2023-11-23 21:32:40,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:32:40,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-23 21:32:40,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:32:40,721 INFO L225 Difference]: With dead ends: 89 [2023-11-23 21:32:40,721 INFO L226 Difference]: Without dead ends: 87 [2023-11-23 21:32:40,728 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-23 21:32:40,734 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:32:40,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 156 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:32:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-23 21:32:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2023-11-23 21:32:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 40 states have (on average 2.15) internal successors, (86), 78 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:32:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2023-11-23 21:32:40,787 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 6 [2023-11-23 21:32:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:32:40,787 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2023-11-23 21:32:40,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:32:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2023-11-23 21:32:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-23 21:32:40,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:32:40,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-23 21:32:40,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:32:40,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-23 21:32:40,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:32:40,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1989545633, now seen corresponding path program 1 times [2023-11-23 21:32:40,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:32:40,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436210755] [2023-11-23 21:32:40,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:32:40,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:32:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:32:40,901 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-23 21:32:40,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:32:40,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436210755] [2023-11-23 21:32:40,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436210755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:32:40,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:32:40,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:32:40,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097511802] [2023-11-23 21:32:40,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:32:40,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:32:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:32:40,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:32:40,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:32:40,906 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:32:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:32:40,992 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2023-11-23 21:32:40,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:32:40,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-23 21:32:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:32:40,994 INFO L225 Difference]: With dead ends: 80 [2023-11-23 21:32:40,995 INFO L226 Difference]: Without dead ends: 80 [2023-11-23 21:32:40,995 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-23 21:32:40,997 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:32:40,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 114 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:32:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-23 21:32:41,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-23 21:32:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 40 states have (on average 2.1) internal successors, (84), 76 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:32:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-11-23 21:32:41,007 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 6 [2023-11-23 21:32:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:32:41,007 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-11-23 21:32:41,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:32:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-11-23 21:32:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-23 21:32:41,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:32:41,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-23 21:32:41,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:32:41,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-23 21:32:41,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:32:41,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1989545634, now seen corresponding path program 1 times [2023-11-23 21:32:41,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:32:41,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924676868] [2023-11-23 21:32:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:32:41,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:32:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:32:41,162 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-23 21:32:41,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:32:41,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924676868] [2023-11-23 21:32:41,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924676868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:32:41,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:32:41,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:32:41,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698078449] [2023-11-23 21:32:41,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:32:41,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:32:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:32:41,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:32:41,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:32:41,171 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:32:41,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:32:41,286 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-11-23 21:32:41,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:32:41,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-23 21:32:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:32:41,288 INFO L225 Difference]: With dead ends: 78 [2023-11-23 21:32:41,288 INFO L226 Difference]: Without dead ends: 78 [2023-11-23 21:32:41,288 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-23 21:32:41,290 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:32:41,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 117 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:32:41,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-23 21:32:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-23 21:32:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 40 states have (on average 2.05) internal successors, (82), 74 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:32:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2023-11-23 21:32:41,298 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 6 [2023-11-23 21:32:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:32:41,298 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2023-11-23 21:32:41,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:32:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2023-11-23 21:32:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 21:32:41,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:32:41,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:32:41,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:32:41,305 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-23 21:32:41,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:32:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash 168393874, now seen corresponding path program 1 times [2023-11-23 21:32:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:32:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745945390] [2023-11-23 21:32:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:32:41,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:32:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:32:41,473 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-23 21:32:41,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:32:41,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745945390] [2023-11-23 21:32:41,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745945390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:32:41,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:32:41,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:32:41,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101634480] [2023-11-23 21:32:41,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:32:41,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:32:41,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:32:41,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:32:41,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:32:41,477 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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-23 21:32:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:32:41,650 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2023-11-23 21:32:41,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:32:41,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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-23 21:32:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:32:41,654 INFO L225 Difference]: With dead ends: 78 [2023-11-23 21:32:41,654 INFO L226 Difference]: Without dead ends: 78 [2023-11-23 21:32:41,655 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-23 21:32:41,666 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 5 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:32:41,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 238 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:32:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-23 21:32:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2023-11-23 21:32:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 40 states have (on average 2.025) internal successors, (81), 73 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:32:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2023-11-23 21:32:41,676 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 10 [2023-11-23 21:32:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:32:41,676 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2023-11-23 21:32:41,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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-23 21:32:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2023-11-23 21:32:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 21:32:41,677 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:32:41,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:32:41,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:32:41,678 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-23 21:32:41,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:32:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash 168393875, now seen corresponding path program 1 times [2023-11-23 21:32:41,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:32:41,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160370688] [2023-11-23 21:32:41,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:32:41,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:32:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:32:41,942 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-23 21:32:41,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:32:41,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160370688] [2023-11-23 21:32:41,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160370688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:32:41,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:32:41,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:32:41,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206953137] [2023-11-23 21:32:41,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:32:41,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:32:41,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:32:41,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:32:41,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:32:41,945 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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-23 21:32:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:32:42,135 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2023-11-23 21:32:42,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:32:42,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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-23 21:32:42,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:32:42,139 INFO L225 Difference]: With dead ends: 77 [2023-11-23 21:32:42,139 INFO L226 Difference]: Without dead ends: 77 [2023-11-23 21:32:42,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:32:42,143 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:32:42,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 320 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:32:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-23 21:32:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2023-11-23 21:32:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 40 states have (on average 2.0) internal successors, (80), 72 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:32:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2023-11-23 21:32:42,169 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 10 [2023-11-23 21:32:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:32:42,169 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2023-11-23 21:32:42,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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-23 21:32:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2023-11-23 21:32:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 21:32:42,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:32:42,171 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:32:42,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:32:42,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-23 21:32:42,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:32:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash -644371449, now seen corresponding path program 1 times [2023-11-23 21:32:42,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:32:42,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645559393] [2023-11-23 21:32:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:32:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:32:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:32:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 21:32:42,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:32:42,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645559393] [2023-11-23 21:32:42,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645559393] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:32:42,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033759003] [2023-11-23 21:32:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:32:42,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:32:42,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:32:42,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:32:42,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:32:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:32:42,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 21:32:42,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:32:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:32:42,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:32:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 21:32:42,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033759003] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:32:42,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1588590754] [2023-11-23 21:32:42,622 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-23 21:32:42,622 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:32:42,630 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-23 21:32:42,636 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-23 21:32:42,636 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-23 21:32:45,225 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2023-11-23 21:32:45,944 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-23 21:32:55,199 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1020#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (or (and (exists ((|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_int_44| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_43| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_43| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_44|) (= |#memory_int| (store |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_69| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_69| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_69| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_9| (store |v_#memory_int_47| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_47| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_69| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_69| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_69| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_old(#length)_AFTER_CALL_9| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#length_75| (Array Int Int))) (= |#length| (store |v_#length_75| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_65| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_65| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_90| (Array Int Int))) (and (= (select |v_#valid_90| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_90| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_65| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_65| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_65| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (and (exists ((|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_int_44| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_43| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_43| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_44|) (= |#memory_int| (store |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))))) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_47| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_47| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (= 1 (select |v_old(#valid)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_BEFORE_CALL_17| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_17| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_69| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_69| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_69| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (exists ((|v_#memory_$Pointer$.offset_69| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_69| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_69| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#length_75| (Array Int Int))) (= |#length| (store |v_#length_75| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_65| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_65| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_90| (Array Int Int))) (and (= (select |v_#valid_90| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_90| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_65| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_65| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_65| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))))) (= 5 |ULTIMATE.start_sll_append_#in~data#1|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 2 |ULTIMATE.start_sll_append_~head#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0))' at error location [2023-11-23 21:32:55,199 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-23 21:32:55,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:32:55,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-11-23 21:32:55,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151643774] [2023-11-23 21:32:55,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:32:55,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:32:55,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:32:55,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:32:55,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=206, Unknown=1, NotChecked=0, Total=240 [2023-11-23 21:32:55,203 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 21:32:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:32:55,253 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-11-23 21:32:55,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:32:55,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2023-11-23 21:32:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:32:55,255 INFO L225 Difference]: With dead ends: 80 [2023-11-23 21:32:55,255 INFO L226 Difference]: Without dead ends: 80 [2023-11-23 21:32:55,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=33, Invalid=206, Unknown=1, NotChecked=0, Total=240 [2023-11-23 21:32:55,257 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:32:55,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 207 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:32:55,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-23 21:32:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-23 21:32:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.930232558139535) 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-23 21:32:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2023-11-23 21:32:55,265 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 19 [2023-11-23 21:32:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:32:55,265 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2023-11-23 21:32:55,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 21:32:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2023-11-23 21:32:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 21:32:55,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:32:55,267 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-23 21:32:55,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 21:32:55,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-23 21:32:55,491 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-23 21:32:55,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:32:55,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1248051152, now seen corresponding path program 2 times [2023-11-23 21:32:55,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:32:55,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427627675] [2023-11-23 21:32:55,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:32:55,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:32:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:32:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 21:32:56,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:32:56,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427627675] [2023-11-23 21:32:56,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427627675] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:32:56,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241852538] [2023-11-23 21:32:56,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 21:32:56,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:32:56,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:32:56,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:32:56,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 21:32:56,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-23 21:32:56,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:32:56,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-23 21:32:56,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:32:56,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 21:32:56,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 21:32:56,551 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 21:32:56,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-23 21:32:56,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 21:32:56,652 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-23 21:32:56,673 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 21:32:56,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-23 21:32:56,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 21:32:56,740 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-23 21:32:56,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:32:56,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 21:32:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 12 not checked. [2023-11-23 21:32:56,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:32:56,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241852538] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:32:56,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1484145304] [2023-11-23 21:32:56,931 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-23 21:32:56,931 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:32:56,932 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-23 21:32:56,932 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-23 21:32:56,932 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-23 21:32:58,484 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2023-11-23 21:32:59,034 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-23 21:33:07,971 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1300#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (or (and (exists ((|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_77| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_77| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#memory_int_59| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_21| (Array Int (Array Int Int)))) (= (store |v_#memory_int_59| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_59| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_int)_AFTER_CALL_21|)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_81| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_81| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_81| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_56| (store |v_#memory_int_55| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_55| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#length_82| (Array Int Int))) (= (store |v_#length_82| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_81| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_81| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_81| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_21|) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#length_BEFORE_CALL_35| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_35| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#valid_103| (Array Int Int))) (and (= (select |v_#valid_103| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_103| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|)))) (and (exists ((|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_77| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_77| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.base_81| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store |v_#memory_$Pointer$.base_81| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_81| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_81| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_81| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_81| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#length)_AFTER_CALL_20| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_56| (store |v_#memory_int_55| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_55| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#memory_int_59| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_59| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_59| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#length_82| (Array Int Int))) (= (store |v_#length_82| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_#valid_103| (Array Int Int))) (and (= (select |v_#valid_103| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_103| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))))) (= 5 |ULTIMATE.start_sll_append_#in~data#1|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 2 |ULTIMATE.start_sll_append_~head#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0))' at error location [2023-11-23 21:33:07,972 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-23 21:33:07,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 21:33:07,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2023-11-23 21:33:07,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441074737] [2023-11-23 21:33:07,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 21:33:07,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 21:33:07,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:33:07,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 21:33:07,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=667, Unknown=3, NotChecked=106, Total=870 [2023-11-23 21:33:07,974 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 17 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 14 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 21:33:08,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:33:08,525 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2023-11-23 21:33:08,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:33:08,527 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 14 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-11-23 21:33:08,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:33:08,528 INFO L225 Difference]: With dead ends: 85 [2023-11-23 21:33:08,528 INFO L226 Difference]: Without dead ends: 85 [2023-11-23 21:33:08,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=123, Invalid=812, Unknown=3, NotChecked=118, Total=1056 [2023-11-23 21:33:08,530 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 212 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:33:08,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 230 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 310 Invalid, 0 Unknown, 170 Unchecked, 0.3s Time] [2023-11-23 21:33:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-23 21:33:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2023-11-23 21:33:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.813953488372093) internal successors, (78), 70 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:33:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-11-23 21:33:08,535 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 28 [2023-11-23 21:33:08,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:33:08,536 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-11-23 21:33:08,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 14 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 21:33:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-11-23 21:33:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 21:33:08,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:33:08,537 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:08,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 21:33:08,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:33:08,756 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-23 21:33:08,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1248051151, now seen corresponding path program 1 times [2023-11-23 21:33:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:33:08,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722109614] [2023-11-23 21:33:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:33:09,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:33:09,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722109614] [2023-11-23 21:33:09,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722109614] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:33:09,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003161839] [2023-11-23 21:33:09,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:09,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:33:09,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:33:09,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:33:09,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 21:33:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:09,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-23 21:33:09,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:33:09,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 21:33:09,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 21:33:09,926 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-23 21:33:09,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:33:09,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 21:33:09,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 21:33:10,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:33:10,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 21:33:10,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 21:33:10,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:33:10,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 21:33:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-23 21:33:10,170 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:33:10,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003161839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:10,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 21:33:10,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2023-11-23 21:33:10,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618218413] [2023-11-23 21:33:10,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:10,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:33:10,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:33:10,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:33:10,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2023-11-23 21:33:10,173 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:33:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:33:10,348 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2023-11-23 21:33:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:33:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-11-23 21:33:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:33:10,350 INFO L225 Difference]: With dead ends: 72 [2023-11-23 21:33:10,350 INFO L226 Difference]: Without dead ends: 72 [2023-11-23 21:33:10,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2023-11-23 21:33:10,351 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 17 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:33:10,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 189 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 93 Unchecked, 0.1s Time] [2023-11-23 21:33:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-23 21:33:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-23 21:33:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.744186046511628) internal successors, (75), 67 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:33:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2023-11-23 21:33:10,356 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 28 [2023-11-23 21:33:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:33:10,357 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2023-11-23 21:33:10,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:33:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2023-11-23 21:33:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-23 21:33:10,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:33:10,358 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:10,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 21:33:10,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:33:10,576 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-23 21:33:10,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:10,576 INFO L85 PathProgramCache]: Analyzing trace with hash 840024037, now seen corresponding path program 1 times [2023-11-23 21:33:10,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:33:10,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139619109] [2023-11-23 21:33:10,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:10,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:33:11,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:33:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139619109] [2023-11-23 21:33:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139619109] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:33:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822357551] [2023-11-23 21:33:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:11,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:33:11,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:33:11,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:33:11,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 21:33:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:11,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-23 21:33:11,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:33:12,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-23 21:33:12,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-23 21:33:12,432 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-23 21:33:12,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:33:12,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-11-23 21:33:12,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:33:12,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-23 21:33:12,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:33:12,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-23 21:33:12,503 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-23 21:33:12,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-23 21:33:12,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-23 21:33:12,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-23 21:33:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-11-23 21:33:12,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:33:12,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822357551] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:33:12,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2143856676] [2023-11-23 21:33:12,981 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-23 21:33:12,981 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:33:12,982 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-23 21:33:12,982 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-23 21:33:12,982 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-23 21:33:14,473 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2023-11-23 21:33:14,881 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-23 21:33:28,140 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1860#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_append_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) 0)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 2 |ULTIMATE.start_sll_append_#in~head#1.base|) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) 0)))) (= |ULTIMATE.start_sll_append_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) 0)) (= 5 |ULTIMATE.start_sll_append_#in~data#1|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (exists ((|v_#memory_$Pointer$.offset_93| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_93| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_93| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_112| (Array Int Int))) (and (= |#valid| (store |v_#valid_112| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1)) (= (select |v_#valid_112| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_old(#memory_int)_AFTER_CALL_34| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_34| (store |v_#memory_int_71| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_71| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_34| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_34| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| (store |v_#memory_$Pointer$.base_97| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_97| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_old(#length)_AFTER_CALL_34| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_34| |ULTIMATE.start_sll_create_#res#1.base|))) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_93| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_93| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_93| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_int_68| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_67| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_67| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_68|))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#valid)_AFTER_CALL_34| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_34| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#length_96| (Array Int Int))) (= |#length| (store |v_#length_96| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8)))) (and (exists ((|v_#memory_$Pointer$.offset_93| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_93| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_93| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_112| (Array Int Int))) (and (= |#valid| (store |v_#valid_112| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1)) (= (select |v_#valid_112| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_93| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_93| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_93| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_35| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_35| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_int_68| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_67| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_67| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_68|))) (exists ((|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_35| (store |v_#memory_int_71| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_71| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_35| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_35| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= (store |v_#memory_$Pointer$.base_97| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_97| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_35|))) (exists ((|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_BEFORE_CALL_61| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_61| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#length_96| (Array Int Int))) (= |#length| (store |v_#length_96| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (< (select |#length| |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 8)) (< (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4) 0)) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1))' at error location [2023-11-23 21:33:28,140 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-23 21:33:28,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 21:33:28,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2023-11-23 21:33:28,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603811820] [2023-11-23 21:33:28,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 21:33:28,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 21:33:28,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:33:28,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 21:33:28,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1664, Unknown=2, NotChecked=82, Total=1892 [2023-11-23 21:33:28,143 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 21:33:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:33:29,635 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2023-11-23 21:33:29,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 21:33:29,636 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2023-11-23 21:33:29,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:33:29,636 INFO L225 Difference]: With dead ends: 80 [2023-11-23 21:33:29,636 INFO L226 Difference]: Without dead ends: 80 [2023-11-23 21:33:29,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=233, Invalid=2525, Unknown=2, NotChecked=102, Total=2862 [2023-11-23 21:33:29,644 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 191 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 21:33:29,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 515 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 632 Invalid, 0 Unknown, 87 Unchecked, 0.8s Time] [2023-11-23 21:33:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-23 21:33:29,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2023-11-23 21:33:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 71 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-23 21:33:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2023-11-23 21:33:29,667 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 31 [2023-11-23 21:33:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:33:29,667 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2023-11-23 21:33:29,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 21:33:29,668 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2023-11-23 21:33:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-23 21:33:29,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:33:29,672 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:29,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 21:33:29,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-23 21:33:29,873 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-23 21:33:29,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash 840024036, now seen corresponding path program 1 times [2023-11-23 21:33:29,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:33:29,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929207670] [2023-11-23 21:33:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:29,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:33:30,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:33:30,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929207670] [2023-11-23 21:33:30,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929207670] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:33:30,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078347334] [2023-11-23 21:33:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:30,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:33:30,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:33:30,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:33:30,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 21:33:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:30,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-23 21:33:30,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:33:31,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-11-23 21:33:31,155 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-23 21:33:31,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:33:31,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-23 21:33:31,192 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-23 21:33:31,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-11-23 21:33:31,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-23 21:33:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 21:33:31,246 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:33:31,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078347334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:31,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 21:33:31,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2023-11-23 21:33:31,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637230459] [2023-11-23 21:33:31,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:31,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 21:33:31,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:33:31,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 21:33:31,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2023-11-23 21:33:31,248 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:33:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:33:31,609 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2023-11-23 21:33:31,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:33:31,610 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2023-11-23 21:33:31,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:33:31,610 INFO L225 Difference]: With dead ends: 74 [2023-11-23 21:33:31,611 INFO L226 Difference]: Without dead ends: 74 [2023-11-23 21:33:31,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=433, Unknown=1, NotChecked=42, Total=552 [2023-11-23 21:33:31,612 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 92 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:33:31,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 237 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 274 Invalid, 0 Unknown, 78 Unchecked, 0.3s Time] [2023-11-23 21:33:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-23 21:33:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-23 21:33:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 69 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:33:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2023-11-23 21:33:31,615 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 31 [2023-11-23 21:33:31,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:33:31,616 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2023-11-23 21:33:31,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:33:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2023-11-23 21:33:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 21:33:31,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:33:31,617 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:31,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 21:33:31,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d8dedf1-a335-4b46-a492-fa36512899e8/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 21:33:31,835 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-23 21:33:31,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash 270639283, now seen corresponding path program 1 times [2023-11-23 21:33:31,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:33:31,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218736341] [2023-11-23 21:33:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:31,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat