./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:01:27,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:01:27,765 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 05:01:27,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:01:27,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:01:27,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:01:27,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:01:27,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:01:27,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:01:27,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:01:27,811 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:01:27,812 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:01:27,813 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:01:27,813 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:01:27,816 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:01:27,816 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:01:27,817 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:01:27,820 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:01:27,821 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:01:27,822 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:01:27,822 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:01:27,827 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:01:27,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 05:01:27,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 05:01:27,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:01:27,829 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:01:27,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:01:27,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:01:27,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:01:27,831 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 05:01:27,832 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 05:01:27,833 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 05:01:27,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:01:27,835 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 05:01:27,835 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:01:27,835 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:01:27,836 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:01:27,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:01:27,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:01:27,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:01:27,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:01:27,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:01:27,837 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:01:27,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:01:27,838 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:01:27,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:01:27,839 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_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2023-11-19 05:01:28,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:01:28,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:01:28,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:01:28,215 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:01:28,216 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:01:28,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-11-19 05:01:31,501 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:01:31,768 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:01:31,768 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-11-19 05:01:31,787 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/data/e7ee854db/2dc907e58cdb4c9787ecc948a33d4411/FLAG2e682a54e [2023-11-19 05:01:31,803 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/data/e7ee854db/2dc907e58cdb4c9787ecc948a33d4411 [2023-11-19 05:01:31,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:01:31,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:01:31,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:01:31,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:01:31,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:01:31,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:01:31" (1/1) ... [2023-11-19 05:01:31,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bf73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:31, skipping insertion in model container [2023-11-19 05:01:31,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:01:31" (1/1) ... [2023-11-19 05:01:31,870 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:01:32,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:01:32,302 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:01:32,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:01:32,381 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:01:32,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:32 WrapperNode [2023-11-19 05:01:32,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:01:32,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:01:32,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:01:32,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:01:32,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:32" (1/1) ... [2023-11-19 05:01:32,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:32" (1/1) ... [2023-11-19 05:01:32,452 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 158 [2023-11-19 05:01:32,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:01:32,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:01:32,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:01:32,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:01:32,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:32" (1/1) ... [2023-11-19 05:01:32,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:32" (1/1) ... [2023-11-19 05:01:32,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:32" (1/1) ... [2023-11-19 05:01:32,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:32" (1/1) ... [2023-11-19 05:01:32,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:32" (1/1) ... [2023-11-19 05:01:32,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:32" (1/1) ... [2023-11-19 05:01:32,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:32" (1/1) ... [2023-11-19 05:01:32,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:32" (1/1) ... [2023-11-19 05:01:32,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:01:32,554 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:01:32,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:01:32,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:01:32,555 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:32" (1/1) ... [2023-11-19 05:01:32,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:01:32,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:32,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:01:32,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:01:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:01:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:01:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 05:01:32,633 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 05:01:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 05:01:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:01:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:01:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 05:01:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 05:01:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:01:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 05:01:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:01:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:01:32,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:01:32,770 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:01:32,772 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:01:33,278 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:01:33,351 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:01:33,351 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 05:01:33,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:01:33 BoogieIcfgContainer [2023-11-19 05:01:33,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:01:33,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:01:33,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:01:33,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:01:33,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:01:31" (1/3) ... [2023-11-19 05:01:33,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bccc21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:01:33, skipping insertion in model container [2023-11-19 05:01:33,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:32" (2/3) ... [2023-11-19 05:01:33,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bccc21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:01:33, skipping insertion in model container [2023-11-19 05:01:33,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:01:33" (3/3) ... [2023-11-19 05:01:33,377 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2023-11-19 05:01:33,428 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:01:33,428 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2023-11-19 05:01:33,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:01:33,512 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;@6ff432b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:01:33,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-11-19 05:01:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 53 states have (on average 2.30188679245283) internal successors, (122), 109 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:01:33,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:01:33,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:33,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:01:33,526 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:01:33,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash 240098767, now seen corresponding path program 1 times [2023-11-19 05:01:33,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:33,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914219307] [2023-11-19 05:01:33,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:33,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:01:33,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:33,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914219307] [2023-11-19 05:01:33,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914219307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:33,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:33,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:01:33,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415086316] [2023-11-19 05:01:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:33,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:01:33,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:33,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:01:33,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:01:33,953 INFO L87 Difference]: Start difference. First operand has 114 states, 53 states have (on average 2.30188679245283) internal successors, (122), 109 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:01:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:34,180 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2023-11-19 05:01:34,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:01:34,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-19 05:01:34,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:34,193 INFO L225 Difference]: With dead ends: 111 [2023-11-19 05:01:34,193 INFO L226 Difference]: Without dead ends: 109 [2023-11-19 05:01:34,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:01:34,200 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:34,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 155 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:01:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-19 05:01:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-19 05:01:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 51 states have (on average 2.196078431372549) internal successors, (112), 104 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:01:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2023-11-19 05:01:34,255 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 5 [2023-11-19 05:01:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:34,255 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2023-11-19 05:01:34,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:01:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2023-11-19 05:01:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:01:34,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:34,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:01:34,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:01:34,257 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:01:34,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash 240098768, now seen corresponding path program 1 times [2023-11-19 05:01:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:34,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999350619] [2023-11-19 05:01:34,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:34,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:01:34,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:34,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999350619] [2023-11-19 05:01:34,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999350619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:34,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:34,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:01:34,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998838347] [2023-11-19 05:01:34,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:34,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:01:34,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:01:34,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:01:34,376 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:01:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:34,486 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2023-11-19 05:01:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:01:34,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-19 05:01:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:34,489 INFO L225 Difference]: With dead ends: 107 [2023-11-19 05:01:34,489 INFO L226 Difference]: Without dead ends: 107 [2023-11-19 05:01:34,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:01:34,491 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:34,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 160 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:01:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-19 05:01:34,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-19 05:01:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 51 states have (on average 2.156862745098039) internal successors, (110), 102 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:01:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2023-11-19 05:01:34,504 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 5 [2023-11-19 05:01:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:34,504 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2023-11-19 05:01:34,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:01:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2023-11-19 05:01:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 05:01:34,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:34,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:34,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:01:34,506 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:01:34,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash -538109043, now seen corresponding path program 1 times [2023-11-19 05:01:34,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:34,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117255816] [2023-11-19 05:01:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:34,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:01:34,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117255816] [2023-11-19 05:01:34,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117255816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:34,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:34,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:01:34,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411815008] [2023-11-19 05:01:34,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:34,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:01:34,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:34,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:01:34,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:01:34,635 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:01:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:34,700 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2023-11-19 05:01:34,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:01:34,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-19 05:01:34,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:34,708 INFO L225 Difference]: With dead ends: 113 [2023-11-19 05:01:34,709 INFO L226 Difference]: Without dead ends: 113 [2023-11-19 05:01:34,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:01:34,714 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 4 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:34,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 196 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:01:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-19 05:01:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2023-11-19 05:01:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 52 states have (on average 2.1346153846153846) internal successors, (111), 103 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:01:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2023-11-19 05:01:34,735 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 10 [2023-11-19 05:01:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:34,736 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2023-11-19 05:01:34,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:01:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2023-11-19 05:01:34,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 05:01:34,737 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:34,738 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:34,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:01:34,739 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:01:34,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:34,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1293681336, now seen corresponding path program 1 times [2023-11-19 05:01:34,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:34,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565988987] [2023-11-19 05:01:34,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 05:01:35,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:35,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565988987] [2023-11-19 05:01:35,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565988987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:35,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:35,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:01:35,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150388427] [2023-11-19 05:01:35,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:35,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:01:35,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:35,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:01:35,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:01:35,084 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:01:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:35,331 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2023-11-19 05:01:35,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:01:35,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-19 05:01:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:35,333 INFO L225 Difference]: With dead ends: 107 [2023-11-19 05:01:35,333 INFO L226 Difference]: Without dead ends: 107 [2023-11-19 05:01:35,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:01:35,345 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:35,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 311 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:01:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-19 05:01:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-19 05:01:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 102 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:01:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2023-11-19 05:01:35,361 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 17 [2023-11-19 05:01:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:35,362 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2023-11-19 05:01:35,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:01:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2023-11-19 05:01:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 05:01:35,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:35,364 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:35,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:01:35,365 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:01:35,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:35,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1293681337, now seen corresponding path program 1 times [2023-11-19 05:01:35,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:35,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133432137] [2023-11-19 05:01:35,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:35,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:01:35,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:35,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133432137] [2023-11-19 05:01:35,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133432137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:35,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:35,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:01:35,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267580300] [2023-11-19 05:01:35,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:35,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:01:35,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:35,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:01:35,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:01:35,636 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:01:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:35,839 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2023-11-19 05:01:35,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:01:35,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-19 05:01:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:35,841 INFO L225 Difference]: With dead ends: 106 [2023-11-19 05:01:35,841 INFO L226 Difference]: Without dead ends: 106 [2023-11-19 05:01:35,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:01:35,845 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:35,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 369 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:01:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-19 05:01:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-19 05:01:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 101 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:01:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2023-11-19 05:01:35,872 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 17 [2023-11-19 05:01:35,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:35,872 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2023-11-19 05:01:35,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:01:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2023-11-19 05:01:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:01:35,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:35,874 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:35,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:01:35,874 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:01:35,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:35,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1982425401, now seen corresponding path program 1 times [2023-11-19 05:01:35,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:35,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772006927] [2023-11-19 05:01:35,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:35,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:01:36,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:36,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772006927] [2023-11-19 05:01:36,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772006927] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:36,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952506380] [2023-11-19 05:01:36,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:36,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:36,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:36,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:36,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:01:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:36,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-19 05:01:36,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:36,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 05:01:36,413 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-19 05:01:36,455 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 05:01:36,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-19 05:01:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-19 05:01:36,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:01:36,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952506380] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:01:36,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [944782760] [2023-11-19 05:01:36,753 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 05:01:36,754 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:36,758 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:01:36,764 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:01:36,765 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:01:38,571 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-19 05:01:38,702 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:01:40,610 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1343#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-11-19 05:01:40,610 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:01:40,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:01:40,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2023-11-19 05:01:40,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261889250] [2023-11-19 05:01:40,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:40,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 05:01:40,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:40,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 05:01:40,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2023-11-19 05:01:40,614 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-19 05:01:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:41,039 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2023-11-19 05:01:41,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:01:41,040 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-11-19 05:01:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:41,042 INFO L225 Difference]: With dead ends: 105 [2023-11-19 05:01:41,042 INFO L226 Difference]: Without dead ends: 105 [2023-11-19 05:01:41,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=91, Invalid=464, Unknown=1, NotChecked=44, Total=600 [2023-11-19 05:01:41,043 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 6 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:41,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 447 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 427 Invalid, 0 Unknown, 109 Unchecked, 0.4s Time] [2023-11-19 05:01:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-19 05:01:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-11-19 05:01:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 52 states have (on average 2.076923076923077) internal successors, (108), 100 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:01:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2023-11-19 05:01:41,050 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 19 [2023-11-19 05:01:41,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:41,050 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2023-11-19 05:01:41,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-19 05:01:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2023-11-19 05:01:41,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:01:41,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:41,052 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:41,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:41,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 05:01:41,274 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:01:41,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:41,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1982425402, now seen corresponding path program 1 times [2023-11-19 05:01:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:41,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385062577] [2023-11-19 05:01:41,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:41,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:01:41,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:41,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385062577] [2023-11-19 05:01:41,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385062577] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:41,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282099524] [2023-11-19 05:01:41,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:41,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:41,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:41,720 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:41,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:01:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:41,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-19 05:01:41,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:41,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 05:01:41,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 05:01:41,925 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-19 05:01:41,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:01:41,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 05:01:41,962 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:01:41,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 05:01:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-19 05:01:41,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:42,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282099524] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:42,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1280950365] [2023-11-19 05:01:42,108 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 05:01:42,108 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:42,108 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:01:42,109 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:01:42,109 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:01:43,135 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-19 05:01:43,243 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:01:44,995 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1651#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-11-19 05:01:44,996 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:01:44,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:01:44,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2023-11-19 05:01:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455123546] [2023-11-19 05:01:44,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:44,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 05:01:44,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 05:01:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=523, Unknown=1, NotChecked=46, Total=650 [2023-11-19 05:01:44,998 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 05:01:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:45,503 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2023-11-19 05:01:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:01:45,503 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2023-11-19 05:01:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:45,506 INFO L225 Difference]: With dead ends: 105 [2023-11-19 05:01:45,506 INFO L226 Difference]: Without dead ends: 105 [2023-11-19 05:01:45,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=98, Invalid=607, Unknown=1, NotChecked=50, Total=756 [2023-11-19 05:01:45,507 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 4 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:45,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 413 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 462 Invalid, 0 Unknown, 111 Unchecked, 0.4s Time] [2023-11-19 05:01:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-19 05:01:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2023-11-19 05:01:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:01:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2023-11-19 05:01:45,519 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 19 [2023-11-19 05:01:45,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:45,520 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2023-11-19 05:01:45,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 05:01:45,521 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2023-11-19 05:01:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-19 05:01:45,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:45,523 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:45,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:45,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:45,743 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:01:45,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:45,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1210538543, now seen corresponding path program 1 times [2023-11-19 05:01:45,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:45,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948557507] [2023-11-19 05:01:45,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:45,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 05:01:46,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:46,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948557507] [2023-11-19 05:01:46,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948557507] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:46,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465405186] [2023-11-19 05:01:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:46,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:46,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:46,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:46,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:01:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:46,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-19 05:01:46,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:46,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 05:01:46,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 05:01:46,460 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-19 05:01:46,494 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-19 05:01:46,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-19 05:01:46,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 05:01:46,516 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-19 05:01:46,534 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 05:01:46,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-19 05:01:46,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 05:01:46,589 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-19 05:01:46,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:01:46,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 05:01:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 12 not checked. [2023-11-19 05:01:46,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:46,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465405186] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:46,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1298400150] [2023-11-19 05:01:46,692 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-19 05:01:46,692 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:46,693 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:01:46,693 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:01:46,693 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:01:47,886 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-19 05:01:47,911 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:01:51,713 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1981#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (or (and (exists ((|v_#valid_146| (Array Int Int))) (and (= (select |v_#valid_146| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_146| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_121| (Array Int Int))) (= |#length| (store |v_#length_121| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#memory_$Pointer$.base_119| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_119| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_119| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) |#memory_$Pointer$.base|)) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_92| (Array Int (Array Int Int))) (|v_#memory_int_93| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_92| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_92| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_93| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_93|) (= |#memory_int| (store |v_#memory_int_93| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_93| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 5))))) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_119| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_119| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (exists ((|v_#memory_int_96| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#length_BEFORE_CALL_57| (Array Int Int)) (|v_#memory_$Pointer$.base_123| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int) (|v_#memory_$Pointer$.offset_123| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_32| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 4 (select |v_#length_BEFORE_CALL_57| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|)) (= (select |v_old(#valid)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_32| (store |v_#memory_int_96| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_96| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0))))))) (and (exists ((|v_#valid_146| (Array Int Int))) (and (= (select |v_#valid_146| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_146| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_121| (Array Int Int))) (= |#length| (store |v_#length_121| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#memory_$Pointer$.base_119| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_119| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_119| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#length_BEFORE_CALL_59| (Array Int Int)) (|v_#memory_int_96| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#memory_$Pointer$.base_123| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_33| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int) (|v_#memory_$Pointer$.offset_123| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_old(#memory_int)_AFTER_CALL_33| (store |v_#memory_int_96| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_96| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))) (<= 4 (select |v_#length_BEFORE_CALL_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|)) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_92| (Array Int (Array Int Int))) (|v_#memory_int_93| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_92| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_92| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_93| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_93|) (= |#memory_int| (store |v_#memory_int_93| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_93| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 5))))) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_119| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_119| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 5))' at error location [2023-11-19 05:01:51,713 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:01:51,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:01:51,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2023-11-19 05:01:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121987386] [2023-11-19 05:01:51,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:51,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-19 05:01:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:51,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 05:01:51,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=786, Unknown=4, NotChecked=174, Total=1056 [2023-11-19 05:01:51,716 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 17 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-19 05:01:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:52,245 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2023-11-19 05:01:52,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:01:52,246 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2023-11-19 05:01:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:52,247 INFO L225 Difference]: With dead ends: 112 [2023-11-19 05:01:52,247 INFO L226 Difference]: Without dead ends: 112 [2023-11-19 05:01:52,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=108, Invalid=892, Unknown=4, NotChecked=186, Total=1190 [2023-11-19 05:01:52,248 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 152 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:52,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 237 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 384 Invalid, 0 Unknown, 351 Unchecked, 0.4s Time] [2023-11-19 05:01:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-19 05:01:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2023-11-19 05:01:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:01:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2023-11-19 05:01:52,254 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 27 [2023-11-19 05:01:52,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:52,254 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2023-11-19 05:01:52,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-19 05:01:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2023-11-19 05:01:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-19 05:01:52,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:52,255 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:52,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:52,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:52,478 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:01:52,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1210538542, now seen corresponding path program 1 times [2023-11-19 05:01:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:52,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913556709] [2023-11-19 05:01:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:52,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 05:01:53,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:53,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913556709] [2023-11-19 05:01:53,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913556709] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:53,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040267594] [2023-11-19 05:01:53,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:53,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:53,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:53,110 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:53,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 05:01:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:53,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-19 05:01:53,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:53,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 05:01:53,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 05:01:53,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 05:01:53,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 05:01:53,354 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:01:53,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 05:01:53,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 05:01:53,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 05:01:53,433 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-19 05:01:53,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:01:53,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 05:01:53,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 05:01:53,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:01:53,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 05:01:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2023-11-19 05:01:53,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:53,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040267594] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:53,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1721179962] [2023-11-19 05:01:53,715 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-19 05:01:53,715 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:53,715 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:01:53,715 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:01:53,716 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:01:54,851 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-19 05:01:54,873 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:01:58,933 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2315#(and (<= 1 |#StackHeapBarrier|) (<= (select |#length| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 3) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (or (and (exists ((|v_#length_134| (Array Int Int))) (= (store |v_#length_134| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#memory_int_108| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#length_BEFORE_CALL_86| (Array Int Int)) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_45| (store |v_#memory_int_108| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_108| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_45| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select (select (store |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (<= 4 (select |v_#length_BEFORE_CALL_86| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)))) (exists ((|v_#valid_155| (Array Int Int))) (and (= (store |v_#valid_155| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_155| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (exists ((|v_#memory_int_104| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 5))) (= (store |v_#memory_int_104| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_104| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_105|))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0))) (and (exists ((|v_#length_134| (Array Int Int))) (= (store |v_#length_134| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#valid_155| (Array Int Int))) (and (= (store |v_#valid_155| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_155| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_131| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (exists ((|v_#memory_int_104| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 5))) (= (store |v_#memory_int_104| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_104| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_105|))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_108| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_46| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_88| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_46| (store |v_#memory_int_108| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_108| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_46| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (<= 4 (select |v_#length_BEFORE_CALL_88| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)))) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)))) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 5))' at error location [2023-11-19 05:01:58,933 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:01:58,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:01:58,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-11-19 05:01:58,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115888964] [2023-11-19 05:01:58,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:58,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-19 05:01:58,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:58,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-19 05:01:58,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1081, Unknown=1, NotChecked=66, Total=1260 [2023-11-19 05:01:58,936 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 19 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 15 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 05:01:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:59,682 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2023-11-19 05:01:59,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 05:01:59,683 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 15 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2023-11-19 05:01:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:59,684 INFO L225 Difference]: With dead ends: 103 [2023-11-19 05:01:59,684 INFO L226 Difference]: Without dead ends: 103 [2023-11-19 05:01:59,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=141, Invalid=1344, Unknown=1, NotChecked=74, Total=1560 [2023-11-19 05:01:59,685 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 211 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:59,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 336 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 658 Invalid, 0 Unknown, 108 Unchecked, 0.6s Time] [2023-11-19 05:01:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-19 05:01:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2023-11-19 05:01:59,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:01:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2023-11-19 05:01:59,689 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 27 [2023-11-19 05:01:59,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:59,690 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2023-11-19 05:01:59,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 15 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 05:01:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2023-11-19 05:01:59,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 05:01:59,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:59,691 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:59,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:59,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-19 05:01:59,898 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:01:59,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:59,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1686655992, now seen corresponding path program 1 times [2023-11-19 05:01:59,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:59,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117190087] [2023-11-19 05:01:59,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:59,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 05:02:00,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:02:00,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117190087] [2023-11-19 05:02:00,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117190087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:02:00,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:02:00,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:02:00,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275251923] [2023-11-19 05:02:00,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:02:00,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:02:00,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:02:00,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:02:00,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:02:00,024 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 05:02:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:02:00,192 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2023-11-19 05:02:00,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:02:00,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-11-19 05:02:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:02:00,193 INFO L225 Difference]: With dead ends: 84 [2023-11-19 05:02:00,193 INFO L226 Difference]: Without dead ends: 84 [2023-11-19 05:02:00,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:02:00,194 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:02:00,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 220 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:02:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-19 05:02:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-19 05:02:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 79 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:02:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2023-11-19 05:02:00,198 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 30 [2023-11-19 05:02:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:02:00,198 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2023-11-19 05:02:00,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 05:02:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2023-11-19 05:02:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 05:02:00,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:02:00,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:02:00,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 05:02:00,200 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:02:00,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:02:00,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1686655993, now seen corresponding path program 1 times [2023-11-19 05:02:00,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:02:00,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634111105] [2023-11-19 05:02:00,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:00,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:02:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 05:02:00,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:02:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634111105] [2023-11-19 05:02:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634111105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:02:00,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:02:00,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:02:00,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948252758] [2023-11-19 05:02:00,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:02:00,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:02:00,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:02:00,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:02:00,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:02:00,465 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 05:02:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:02:00,624 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2023-11-19 05:02:00,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:02:00,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-11-19 05:02:00,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:02:00,626 INFO L225 Difference]: With dead ends: 82 [2023-11-19 05:02:00,626 INFO L226 Difference]: Without dead ends: 82 [2023-11-19 05:02:00,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:02:00,627 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 19 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:02:00,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 244 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:02:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-19 05:02:00,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-19 05:02:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:02:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2023-11-19 05:02:00,630 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30 [2023-11-19 05:02:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:02:00,631 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2023-11-19 05:02:00,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 05:02:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2023-11-19 05:02:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 05:02:00,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:02:00,632 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:02:00,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 05:02:00,632 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:02:00,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:02:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1686669521, now seen corresponding path program 1 times [2023-11-19 05:02:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:02:00,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125107006] [2023-11-19 05:02:00,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:02:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:02:01,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:02:01,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125107006] [2023-11-19 05:02:01,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125107006] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:02:01,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714826635] [2023-11-19 05:02:01,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:01,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:01,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:02:01,203 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:02:01,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 05:02:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:01,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-19 05:02:01,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:02:01,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-11-19 05:02:01,648 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-11-19 05:02:01,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:02:01,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-19 05:02:01,673 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-19 05:02:01,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-11-19 05:02:01,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 05:02:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 05:02:01,781 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:02:01,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714826635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:02:01,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 05:02:01,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2023-11-19 05:02:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710167455] [2023-11-19 05:02:01,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:02:01,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-19 05:02:01,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:02:01,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-19 05:02:01,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2023-11-19 05:02:01,784 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 11 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 05:02:02,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:02:02,273 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2023-11-19 05:02:02,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 05:02:02,273 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 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 30 [2023-11-19 05:02:02,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:02:02,274 INFO L225 Difference]: With dead ends: 85 [2023-11-19 05:02:02,274 INFO L226 Difference]: Without dead ends: 85 [2023-11-19 05:02:02,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=465, Unknown=1, NotChecked=44, Total=600 [2023-11-19 05:02:02,275 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 113 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 05:02:02,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 285 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 412 Invalid, 0 Unknown, 94 Unchecked, 0.4s Time] [2023-11-19 05:02:02,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-19 05:02:02,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2023-11-19 05:02:02,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 76 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:02:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2023-11-19 05:02:02,279 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 30 [2023-11-19 05:02:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:02:02,280 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2023-11-19 05:02:02,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 05:02:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2023-11-19 05:02:02,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 05:02:02,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:02:02,281 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:02:02,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 05:02:02,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:02,496 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:02:02,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:02:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1686669522, now seen corresponding path program 1 times [2023-11-19 05:02:02,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:02:02,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026357552] [2023-11-19 05:02:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:02,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:02:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:02:03,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:02:03,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026357552] [2023-11-19 05:02:03,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026357552] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:02:03,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147789731] [2023-11-19 05:02:03,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:03,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:03,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:02:03,612 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:02:03,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 05:02:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:03,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-19 05:02:03,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:02:03,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 05:02:04,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-19 05:02:04,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 05:02:04,178 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-19 05:02:04,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:02:04,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-19 05:02:04,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:02:04,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 05:02:04,217 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-19 05:02:04,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-19 05:02:04,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-19 05:02:04,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 05:02:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-19 05:02:04,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:02:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147789731] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:02:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1588066985] [2023-11-19 05:02:04,566 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-19 05:02:04,566 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:02:04,567 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:02:04,567 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:02:04,567 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:02:05,850 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-19 05:02:05,869 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:02:12,946 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3290#(and (<= 1 |#StackHeapBarrier|) (or (< |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 4))) (or (and (exists ((|v_#length_145| (Array Int Int))) (= |#length| (store |v_#length_145| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_165| (Array Int Int))) (and (= (store |v_#valid_165| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_165| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#memory_$Pointer$.base_149| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_149| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_149| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (exists ((|v_#memory_int_116| (Array Int (Array Int Int))) (|v_#memory_int_117| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 5))) (= (store |v_#memory_int_116| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_116| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_117|))) (exists ((|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_#length_BEFORE_CALL_111| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_$Pointer$.offset_151| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_153| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_101| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1) (= (select (select (store |v_#memory_$Pointer$.base_153| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_153| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |v_#memory_int_BEFORE_CALL_101| (store |v_#memory_int_120| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_120| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_#memory_int_BEFORE_CALL_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_#length_BEFORE_CALL_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|))))) (and (exists ((|v_#length_145| (Array Int Int))) (= |#length| (store |v_#length_145| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_165| (Array Int Int))) (and (= (store |v_#valid_165| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_165| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#memory_$Pointer$.base_149| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_149| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_149| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (exists ((|v_#memory_int_116| (Array Int (Array Int Int))) (|v_#memory_int_117| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 5))) (= (store |v_#memory_int_116| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_116| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_117|))) (exists ((|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_old(#memory_int)_AFTER_CALL_62| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_151| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_62| (Array Int Int)) (|v_#memory_$Pointer$.base_153| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_62| (store |v_#memory_int_120| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_120| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))) (<= 4 (select |v_old(#length)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (select (select (store |v_#memory_$Pointer$.base_153| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_153| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select |v_old(#valid)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 5) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_prepend_~head#1.base|)))' at error location [2023-11-19 05:02:12,946 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:02:12,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:02:12,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2023-11-19 05:02:12,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907514426] [2023-11-19 05:02:12,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:02:12,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-19 05:02:12,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:02:12,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-19 05:02:12,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1747, Unknown=2, NotChecked=84, Total=1980 [2023-11-19 05:02:12,949 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 24 states, 17 states have (on average 2.235294117647059) internal successors, (38), 21 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 05:02:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:02:14,188 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2023-11-19 05:02:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 05:02:14,189 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 17 states have (on average 2.235294117647059) internal successors, (38), 21 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-19 05:02:14,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:02:14,190 INFO L225 Difference]: With dead ends: 89 [2023-11-19 05:02:14,190 INFO L226 Difference]: Without dead ends: 89 [2023-11-19 05:02:14,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=217, Invalid=2541, Unknown=2, NotChecked=102, Total=2862 [2023-11-19 05:02:14,192 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 123 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 05:02:14,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 514 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 813 Invalid, 0 Unknown, 99 Unchecked, 0.8s Time] [2023-11-19 05:02:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-19 05:02:14,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2023-11-19 05:02:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:02:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2023-11-19 05:02:14,196 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 30 [2023-11-19 05:02:14,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:02:14,197 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2023-11-19 05:02:14,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 17 states have (on average 2.235294117647059) internal successors, (38), 21 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 05:02:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2023-11-19 05:02:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-19 05:02:14,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:02:14,204 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:02:14,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-19 05:02:14,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:14,418 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-19 05:02:14,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:02:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash 346321659, now seen corresponding path program 1 times [2023-11-19 05:02:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:02:14,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209907398] [2023-11-19 05:02:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:14,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:02:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:02:15,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:02:15,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209907398] [2023-11-19 05:02:15,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209907398] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:02:15,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099954037] [2023-11-19 05:02:15,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:15,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:15,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:02:15,132 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:02:15,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aed8bca-cc6b-472b-96de-73985f26b75b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-19 05:02:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:15,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-19 05:02:15,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:02:15,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-19 05:02:15,518 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-19 05:02:15,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:02:15,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-19 05:02:15,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-19 05:02:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-19 05:02:15,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:02:15,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099954037] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:02:15,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1469888830] [2023-11-19 05:02:15,681 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-11-19 05:02:15,681 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:02:15,681 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:02:15,681 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:02:15,682 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:02:17,229 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2023-11-19 05:02:17,247 INFO L180 IcfgInterpreter]: Interpretation finished