./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/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_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:57:02,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:57:02,914 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 04:57:02,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:57:02,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:57:02,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:57:02,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:57:02,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:57:02,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:57:02,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:57:02,975 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:57:02,976 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:57:02,977 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:57:02,982 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:57:02,983 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:57:02,984 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:57:02,985 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:57:02,986 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:57:02,987 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:57:02,987 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:57:02,989 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:57:02,990 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:57:02,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:57:02,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:57:02,992 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:57:02,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:57:02,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:57:02,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:57:02,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:57:02,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:57:02,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:57:02,996 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:57:02,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:57:02,997 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:57:02,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:57:02,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:57:02,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:57:03,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:57:03,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:57:03,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:57:03,014 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:57:03,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:57:03,015 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:57:03,015 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:57:03,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:57:03,016 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_b6fcf563-b191-4575-a990-fe11fd096d8f/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_b6fcf563-b191-4575-a990-fe11fd096d8f/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 ! call(reach_error())) ) 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2023-11-19 04:57:03,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:57:03,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:57:03,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:57:03,481 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:57:03,482 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:57:03,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-11-19 04:57:06,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:57:07,073 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:57:07,074 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-11-19 04:57:07,100 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/data/b1ea5499a/22a6fb99e61440c0b93d5a077d12348e/FLAG35d13ad33 [2023-11-19 04:57:07,119 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/data/b1ea5499a/22a6fb99e61440c0b93d5a077d12348e [2023-11-19 04:57:07,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:57:07,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:57:07,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:57:07,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:57:07,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:57:07,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:57:07" (1/1) ... [2023-11-19 04:57:07,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302ea2e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07, skipping insertion in model container [2023-11-19 04:57:07,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:57:07" (1/1) ... [2023-11-19 04:57:07,208 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:57:07,546 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2023-11-19 04:57:07,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:57:07,563 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:57:07,652 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2023-11-19 04:57:07,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:57:07,715 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:57:07,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07 WrapperNode [2023-11-19 04:57:07,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:57:07,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:57:07,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:57:07,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:57:07,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07" (1/1) ... [2023-11-19 04:57:07,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07" (1/1) ... [2023-11-19 04:57:07,818 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 161 [2023-11-19 04:57:07,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:57:07,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:57:07,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:57:07,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:57:07,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07" (1/1) ... [2023-11-19 04:57:07,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07" (1/1) ... [2023-11-19 04:57:07,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07" (1/1) ... [2023-11-19 04:57:07,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07" (1/1) ... [2023-11-19 04:57:07,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07" (1/1) ... [2023-11-19 04:57:07,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07" (1/1) ... [2023-11-19 04:57:07,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07" (1/1) ... [2023-11-19 04:57:07,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07" (1/1) ... [2023-11-19 04:57:07,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:57:07,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:57:07,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:57:07,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:57:07,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07" (1/1) ... [2023-11-19 04:57:07,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:57:07,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:57:07,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:57:07,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:57:07,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:57:07,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:57:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 04:57:07,976 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 04:57:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 04:57:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:57:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:57:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 04:57:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 04:57:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:57:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 04:57:07,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:57:07,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:57:07,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:57:08,248 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:57:08,251 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:57:08,621 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:57:08,663 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:57:08,663 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-19 04:57:08,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:57:08 BoogieIcfgContainer [2023-11-19 04:57:08,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:57:08,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:57:08,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:57:08,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:57:08,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:57:07" (1/3) ... [2023-11-19 04:57:08,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7926e857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:57:08, skipping insertion in model container [2023-11-19 04:57:08,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:57:07" (2/3) ... [2023-11-19 04:57:08,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7926e857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:57:08, skipping insertion in model container [2023-11-19 04:57:08,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:57:08" (3/3) ... [2023-11-19 04:57:08,681 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2023-11-19 04:57:08,705 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:57:08,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 04:57:08,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:57:08,773 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2c88180b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:57:08,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 04:57:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:57:08,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 04:57:08,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:57:08,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:57:08,790 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:57:08,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:57:08,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1374255989, now seen corresponding path program 1 times [2023-11-19 04:57:08,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:57:08,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349771461] [2023-11-19 04:57:08,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:57:08,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:57:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:57:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 04:57:09,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:57:09,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349771461] [2023-11-19 04:57:09,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349771461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:57:09,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:57:09,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:57:09,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806137392] [2023-11-19 04:57:09,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:57:09,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:57:09,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:57:09,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:57:09,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:57:09,416 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 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, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:57:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:57:09,472 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2023-11-19 04:57:09,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:57:09,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-19 04:57:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:57:09,491 INFO L225 Difference]: With dead ends: 61 [2023-11-19 04:57:09,491 INFO L226 Difference]: Without dead ends: 29 [2023-11-19 04:57:09,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:57:09,504 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:57:09,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:57:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-19 04:57:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-11-19 04:57:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:57:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-11-19 04:57:09,554 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2023-11-19 04:57:09,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:57:09,555 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-11-19 04:57:09,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:57:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-11-19 04:57:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 04:57:09,558 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:57:09,558 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:57:09,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:57:09,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:57:09,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:57:09,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1632824436, now seen corresponding path program 1 times [2023-11-19 04:57:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:57:09,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710414291] [2023-11-19 04:57:09,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:57:09,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:57:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:57:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:57:10,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:57:10,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710414291] [2023-11-19 04:57:10,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710414291] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:57:10,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064743501] [2023-11-19 04:57:10,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:57:10,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:57:10,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:57:10,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:57:10,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:57:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:57:10,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-19 04:57:10,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:57:11,031 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 04:57:11,064 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 04:57:11,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:57:11,103 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 04:57:11,133 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 04:57:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-19 04:57:11,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:57:11,243 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_172 (Array Int Int)) (|v_node_create_~temp~0#1.base_11| Int)) (or (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_11| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_11| v_ArrVal_172) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)))) is different from false [2023-11-19 04:57:11,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064743501] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:57:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [791805165] [2023-11-19 04:57:11,270 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-19 04:57:11,270 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:57:11,274 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:57:11,280 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:57:11,280 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:57:14,115 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-19 04:57:14,131 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:57:53,313 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '269#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~last~2#1.offset|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_14| Int) (|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int))) (|v_#memory_int_68| (Array Int (Array Int Int))) (|v_#memory_int_16| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8| Int)) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0 0))) (or (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8|) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.offset_57|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_64| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0))) |v_#memory_int_38|) (= |v_#memory_int_68| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4 5))))) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 8))) (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_old(#memory_int)_AFTER_CALL_12| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_59| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_int_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_12| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0))) |v_old(#memory_int)_AFTER_CALL_12|) (= (select (select (store |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0)) (exists ((|v_#valid_33| (Array Int Int))) (and (= |#valid| (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1)) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.base_60|))) (and (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_#memory_$Pointer$.base_59| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_21| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (store |v_#memory_int_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_#memory_int_BEFORE_CALL_21| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0))) |v_#memory_int_BEFORE_CALL_21|))) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8|) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.offset_57|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_64| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0))) |v_#memory_int_38|) (= |v_#memory_int_68| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4 5))))) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 8))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0)) (exists ((|v_#valid_33| (Array Int Int))) (and (= |#valid| (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1)) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.base_60|)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)))) (= |#memory_int| (store |v_#memory_int_16| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| (store (select |v_#memory_int_16| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)))) (= |v_#memory_int_16| (store |v_#memory_int_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |v_#memory_int_16| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0)))) (= (select (select |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0) (= 0 (select (select |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-19 04:57:53,314 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:57:53,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 04:57:53,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2023-11-19 04:57:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801272178] [2023-11-19 04:57:53,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 04:57:53,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-19 04:57:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:57:53,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 04:57:53,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=957, Unknown=15, NotChecked=126, Total=1190 [2023-11-19 04:57:53,330 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 17 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 04:57:53,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:57:53,936 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2023-11-19 04:57:53,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 04:57:53,937 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-11-19 04:57:53,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:57:53,938 INFO L225 Difference]: With dead ends: 40 [2023-11-19 04:57:53,938 INFO L226 Difference]: Without dead ends: 29 [2023-11-19 04:57:53,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=117, Invalid=1208, Unknown=15, NotChecked=142, Total=1482 [2023-11-19 04:57:53,941 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:57:53,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 192 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 36 Unchecked, 0.3s Time] [2023-11-19 04:57:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-19 04:57:53,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-11-19 04:57:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:57:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-11-19 04:57:53,949 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 25 [2023-11-19 04:57:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:57:53,950 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-11-19 04:57:53,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 04:57:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-11-19 04:57:53,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-19 04:57:53,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:57:53,952 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:57:53,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:57:54,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-19 04:57:54,161 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:57:54,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:57:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1696549931, now seen corresponding path program 1 times [2023-11-19 04:57:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:57:54,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395379917] [2023-11-19 04:57:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:57:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:57:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:57:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:57:55,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:57:55,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395379917] [2023-11-19 04:57:55,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395379917] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:57:55,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152623906] [2023-11-19 04:57:55,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:57:55,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:57:55,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:57:55,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:57:55,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6fcf563-b191-4575-a990-fe11fd096d8f/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 04:57:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:57:55,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 123 conjunts are in the unsatisfiable core [2023-11-19 04:57:55,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:57:55,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 04:57:56,247 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 04:57:56,248 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 17 treesize of output 21 [2023-11-19 04:57:56,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 04:57:56,498 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-19 04:57:56,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2023-11-19 04:57:56,647 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 04:57:56,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2023-11-19 04:57:56,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 04:57:56,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 04:57:56,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:57:56,926 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-19 04:57:56,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2023-11-19 04:57:56,959 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-19 04:57:56,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-19 04:57:56,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:57:57,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:57:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:57:57,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:57:57,880 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array Int Int)) (v_ArrVal_304 Int)) (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_304)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_307))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse2) .cse0))) (not (= .cse2 (select (select .cse3 .cse2) .cse0))))))) is different from false [2023-11-19 04:57:58,797 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_314 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_304 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| v_ArrVal_314))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| v_ArrVal_313)) (.cse6 (select (select .cse11 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse7 (select .cse11 .cse6)) (.cse4 (select .cse10 .cse6)) (.cse3 (select (select .cse10 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse5 (let ((.cse8 (store .cse4 .cse3 0))) (store (store |c_#memory_$Pointer$.offset| .cse6 .cse8) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| (let ((.cse9 (store .cse10 .cse6 .cse8))) (store (select .cse9 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18|) 0 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse6 (store .cse7 .cse3 v_ArrVal_304)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| v_ArrVal_307))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) .cse2))) (not (= .cse3 (select .cse4 .cse3))) (not (= .cse2 (select (select .cse5 .cse0) .cse2))) (not (= .cse6 (select .cse7 .cse3))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| 1)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18|)))))))))) is different from false [2023-11-19 04:57:58,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152623906] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:57:58,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [294651756] [2023-11-19 04:57:58,805 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-11-19 04:57:58,805 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:57:58,806 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:57:58,806 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:57:58,806 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:58:00,992 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-19 04:58:01,019 INFO L180 IcfgInterpreter]: Interpretation finished