./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/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_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/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_54b09614-dace-460d-b287-47b7879edbd5/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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:23:43,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:23:43,245 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 05:23:43,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:23:43,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:23:43,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:23:43,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:23:43,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:23:43,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:23:43,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:23:43,296 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:23:43,297 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:23:43,298 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:23:43,300 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:23:43,301 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:23:43,301 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:23:43,302 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:23:43,302 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:23:43,303 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:23:43,303 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:23:43,304 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:23:43,304 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:23:43,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:23:43,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:23:43,307 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:23:43,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:23:43,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:23:43,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:23:43,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:23:43,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:23:43,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:23:43,311 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:23:43,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:23:43,312 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:23:43,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:23:43,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:23:43,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:23:43,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:23:43,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:23:43,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:23:43,314 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:23:43,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:23:43,315 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:23:43,315 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:23:43,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:23:43,316 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_54b09614-dace-460d-b287-47b7879edbd5/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_54b09614-dace-460d-b287-47b7879edbd5/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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2023-11-19 05:23:43,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:23:43,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:23:43,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:23:43,654 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:23:43,655 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:23:43,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2023-11-19 05:23:46,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:23:47,192 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:23:47,193 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2023-11-19 05:23:47,221 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/data/129a5166a/b0d31942bd364d8c9bccfd134c97f38b/FLAGa2769d647 [2023-11-19 05:23:47,235 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/data/129a5166a/b0d31942bd364d8c9bccfd134c97f38b [2023-11-19 05:23:47,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:23:47,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:23:47,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:23:47,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:23:47,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:23:47,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:23:47" (1/1) ... [2023-11-19 05:23:47,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349ccd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:47, skipping insertion in model container [2023-11-19 05:23:47,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:23:47" (1/1) ... [2023-11-19 05:23:47,329 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:23:47,648 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_54b09614-dace-460d-b287-47b7879edbd5/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2023-11-19 05:23:47,653 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:23:47,663 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:23:47,704 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_54b09614-dace-460d-b287-47b7879edbd5/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2023-11-19 05:23:47,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:23:47,739 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:23:47,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:47 WrapperNode [2023-11-19 05:23:47,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:23:47,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:23:47,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:23:47,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:23:47,750 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:23:47" (1/1) ... [2023-11-19 05:23:47,763 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:23:47" (1/1) ... [2023-11-19 05:23:47,790 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 116 [2023-11-19 05:23:47,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:23:47,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:23:47,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:23:47,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:23:47,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:47" (1/1) ... [2023-11-19 05:23:47,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:47" (1/1) ... [2023-11-19 05:23:47,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:47" (1/1) ... [2023-11-19 05:23:47,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:47" (1/1) ... [2023-11-19 05:23:47,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:47" (1/1) ... [2023-11-19 05:23:47,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:47" (1/1) ... [2023-11-19 05:23:47,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:47" (1/1) ... [2023-11-19 05:23:47,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:47" (1/1) ... [2023-11-19 05:23:47,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:23:47,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:23:47,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:23:47,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:23:47,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:47" (1/1) ... [2023-11-19 05:23:47,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:23:47,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:23:47,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/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:23:47,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/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:23:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-19 05:23:47,937 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-19 05:23:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:23:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:23:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 05:23:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:23:47,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:23:47,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 05:23:47,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 05:23:47,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:23:47,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 05:23:47,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:23:47,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:23:47,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:23:48,083 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:23:48,085 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:23:48,130 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-19 05:23:48,380 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:23:48,504 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:23:48,504 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-19 05:23:48,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:23:48 BoogieIcfgContainer [2023-11-19 05:23:48,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:23:48,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:23:48,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:23:48,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:23:48,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:23:47" (1/3) ... [2023-11-19 05:23:48,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f002a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:23:48, skipping insertion in model container [2023-11-19 05:23:48,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:47" (2/3) ... [2023-11-19 05:23:48,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f002a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:23:48, skipping insertion in model container [2023-11-19 05:23:48,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:23:48" (3/3) ... [2023-11-19 05:23:48,520 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2023-11-19 05:23:48,542 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:23:48,542 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 05:23:48,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:23:48,604 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;@79099760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:23:48,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 05:23:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 05:23:48,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:48,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:48,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:23:48,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:48,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1605963889, now seen corresponding path program 1 times [2023-11-19 05:23:48,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:48,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880255722] [2023-11-19 05:23:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:48,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:49,130 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:23:49,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:49,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880255722] [2023-11-19 05:23:49,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880255722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:49,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:49,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:23:49,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322996942] [2023-11-19 05:23:49,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:49,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:23:49,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:49,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:23:49,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:23:49,194 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:49,300 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-11-19 05:23:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:23:49,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-19 05:23:49,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:49,309 INFO L225 Difference]: With dead ends: 35 [2023-11-19 05:23:49,310 INFO L226 Difference]: Without dead ends: 14 [2023-11-19 05:23:49,313 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:23:49,320 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:49,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-19 05:23:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2023-11-19 05:23:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-11-19 05:23:49,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2023-11-19 05:23:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:49,359 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-11-19 05:23:49,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-11-19 05:23:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 05:23:49,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:49,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:49,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:23:49,363 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:23:49,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:49,365 INFO L85 PathProgramCache]: Analyzing trace with hash -328058992, now seen corresponding path program 1 times [2023-11-19 05:23:49,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:49,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680522418] [2023-11-19 05:23:49,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:49,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:49,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:49,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680522418] [2023-11-19 05:23:49,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680522418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:23:49,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339038413] [2023-11-19 05:23:49,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:49,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:23:49,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:23:49,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:23:49,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:23:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:49,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 05:23:49,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:23:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:49,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:23:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:49,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339038413] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:23:49,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [218215944] [2023-11-19 05:23:49,905 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-19 05:23:49,905 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:23:49,909 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:23:49,917 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:23:49,918 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:23:51,497 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:23:56,826 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '144#(and (<= (+ |ULTIMATE.start_node_create_#res#1.base| 1) |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| |ULTIMATE.start_node_create_#res#1.base| 1)) (= (select |v_#valid_36| |ULTIMATE.start_node_create_#res#1.base|) 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |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) (exists ((|v_#length_26| (Array Int Int))) (= |#length| (store |v_#length_26| |ULTIMATE.start_node_create_#res#1.base| 12))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (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|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_52| (Array Int (Array Int Int))) (|v_#memory_int_53| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (|v_#memory_int_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_16| Int) (|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_16| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_25| Int) (|v_#memory_int_93| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.base_48| (store |v_#memory_$Pointer$.base_78| |ULTIMATE.start_node_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.base_78| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 0)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~#s~0#1.base|) 0 |ULTIMATE.start_node_create_#res#1.base|))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~#s~0#1.base|) 0 0))) (or (and (= (store |v_#memory_int_53| (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_53| (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) (select (select |v_#memory_int_49| (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8)))) |v_#memory_int_49|) (= |v_#memory_$Pointer$.base_46| (store (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) |ULTIMATE.start_node_create_#res#1.base|))) (or (not (= (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= (store (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) 0)) |v_#memory_$Pointer$.offset_46|)) (and (= (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_#memory_$Pointer$.base_46|) (= |v_#memory_int_49| |v_#memory_int_53|) (= |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_16|) (= |v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_25| |v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_16|) (= (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_#memory_$Pointer$.offset_46|))) (= |v_#memory_int_53| (store |v_#memory_int_51| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_int_51| |ULTIMATE.start_node_create_#res#1.base|) 0 1) 4 (select (select |v_#memory_int_53| |ULTIMATE.start_node_create_#res#1.base|) 4)))) (= (store |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_node_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_48|) (= |#memory_int| (store |v_#memory_int_49| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_int_49| |ULTIMATE.start_main_~#s~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= (select (select |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_#memory_$Pointer$.base_78| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_#memory_int_51| (store |v_#memory_int_52| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_52| |ULTIMATE.start_node_create_#res#1.base|) 8 (select (select |v_#memory_int_51| |ULTIMATE.start_node_create_#res#1.base|) 8)))) (= (store |v_#memory_int_93| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_93| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_int_52| |ULTIMATE.start_node_create_#res#1.base|) 4))) |v_#memory_int_52|))))' at error location [2023-11-19 05:23:56,826 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:23:56,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:23:56,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-11-19 05:23:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85227391] [2023-11-19 05:23:56,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:23:56,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:23:56,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:56,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:23:56,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-19 05:23:56,829 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:56,923 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2023-11-19 05:23:56,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:23:56,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-19 05:23:56,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:56,925 INFO L225 Difference]: With dead ends: 22 [2023-11-19 05:23:56,925 INFO L226 Difference]: Without dead ends: 15 [2023-11-19 05:23:56,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-19 05:23:56,927 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:56,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-19 05:23:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-19 05:23:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-11-19 05:23:56,932 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2023-11-19 05:23:56,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:56,932 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-11-19 05:23:56,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-11-19 05:23:56,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 05:23:56,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:56,933 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:56,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:23:57,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:23:57,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:23:57,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:57,135 INFO L85 PathProgramCache]: Analyzing trace with hash -853384209, now seen corresponding path program 2 times [2023-11-19 05:23:57,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:57,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263240018] [2023-11-19 05:23:57,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:57,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:58,352 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:23:58,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:58,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263240018] [2023-11-19 05:23:58,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263240018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:58,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:58,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 05:23:58,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928297777] [2023-11-19 05:23:58,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:58,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 05:23:58,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:58,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 05:23:58,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:23:58,363 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:58,620 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2023-11-19 05:23:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 05:23:58,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 05:23:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:58,622 INFO L225 Difference]: With dead ends: 22 [2023-11-19 05:23:58,622 INFO L226 Difference]: Without dead ends: 20 [2023-11-19 05:23:58,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-19 05:23:58,624 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:58,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 15 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:23:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-19 05:23:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2023-11-19 05:23:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-11-19 05:23:58,629 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2023-11-19 05:23:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:58,630 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-11-19 05:23:58,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-11-19 05:23:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 05:23:58,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:58,631 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:58,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:23:58,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:23:58,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:58,632 INFO L85 PathProgramCache]: Analyzing trace with hash -853336872, now seen corresponding path program 1 times [2023-11-19 05:23:58,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:58,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996053313] [2023-11-19 05:23:58,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:58,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 05:23:58,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:58,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996053313] [2023-11-19 05:23:58,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996053313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:58,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:58,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:23:58,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631882922] [2023-11-19 05:23:58,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:58,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:23:58,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:58,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:23:58,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:58,847 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:58,928 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2023-11-19 05:23:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:23:58,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 05:23:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:58,929 INFO L225 Difference]: With dead ends: 20 [2023-11-19 05:23:58,929 INFO L226 Difference]: Without dead ends: 17 [2023-11-19 05:23:58,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:58,930 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:58,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:58,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-19 05:23:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-19 05:23:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-11-19 05:23:58,935 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2023-11-19 05:23:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:58,935 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-11-19 05:23:58,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-11-19 05:23:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:23:58,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:58,937 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:58,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:23:58,937 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:23:58,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:58,938 INFO L85 PathProgramCache]: Analyzing trace with hash 236563562, now seen corresponding path program 1 times [2023-11-19 05:23:58,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:58,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666585469] [2023-11-19 05:23:58,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:58,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:24:00,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:00,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666585469] [2023-11-19 05:24:00,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666585469] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:24:00,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303246647] [2023-11-19 05:24:00,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:00,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:24:00,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:24:00,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:24:00,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b09614-dace-460d-b287-47b7879edbd5/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:24:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:01,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-19 05:24:01,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:24:01,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-19 05:24:01,260 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 05:24:01,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 05:24:01,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-19 05:24:01,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-19 05:24:01,420 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 38 treesize of output 22 [2023-11-19 05:24:01,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2023-11-19 05:24:01,581 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-19 05:24:01,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-19 05:24:01,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:01,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:01,837 INFO L349 Elim1Store]: treesize reduction 170, result has 10.5 percent of original size [2023-11-19 05:24:01,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 420 treesize of output 500 [2023-11-19 05:24:01,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:01,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:01,919 INFO L349 Elim1Store]: treesize reduction 46, result has 30.3 percent of original size [2023-11-19 05:24:01,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 204 treesize of output 215 [2023-11-19 05:24:01,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:01,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2023-11-19 05:24:01,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2023-11-19 05:24:01,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:01,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:01,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:02,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:02,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:02,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2023-11-19 05:24:02,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:02,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:02,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2023-11-19 05:24:02,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:02,056 INFO L349 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2023-11-19 05:24:02,057 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 1 case distinctions, treesize of input 134 treesize of output 79 [2023-11-19 05:24:02,068 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 0 case distinctions, treesize of input 71 treesize of output 47 [2023-11-19 05:24:02,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:02,079 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 49 treesize of output 28 [2023-11-19 05:24:02,087 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 46 treesize of output 25 [2023-11-19 05:24:02,095 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 0 case distinctions, treesize of input 18 treesize of output 3 [2023-11-19 05:24:02,103 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 18 treesize of output 17 [2023-11-19 05:24:02,220 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-19 05:24:02,221 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 124 treesize of output 45 [2023-11-19 05:24:02,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:02,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-19 05:24:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:24:02,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:24:03,330 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_node_create_#res#1.offset_16| Int) (v_ArrVal_497 (Array Int Int))) (let ((.cse8 (+ |v_ULTIMATE.start_node_create_#res#1.offset_16| 4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_497 .cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_503 .cse8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse6 (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (or (not (= (select .cse0 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_node_create_#res#1.offset_16|))) (.cse1 (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_508) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) (not (= (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 0))))))) (forall ((v_ArrVal_503 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_node_create_#res#1.offset_16| Int) (v_DerPreprocessor_3 Int) (v_ArrVal_497 (Array Int Int))) (let ((.cse19 (+ |v_ULTIMATE.start_node_create_#res#1.offset_16| 4))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_497 .cse19 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse9 (select (select .cse17 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (= .cse9 0) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_503 .cse19 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse15 (let ((.cse18 (store .cse11 .cse9 v_DerPreprocessor_5))) (store .cse18 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse18 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_node_create_#res#1.offset_16|)))) (.cse12 (let ((.cse16 (store .cse17 .cse9 v_DerPreprocessor_4))) (store .cse16 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (+ (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_507))) (store .cse10 .cse9 (store (select .cse10 .cse9) (+ 8 (select (select .cse11 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_DerPreprocessor_3))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_508) (select (select .cse12 .cse13) .cse14)) (select (select .cse15 .cse13) .cse14))))))))))) (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_node_create_#res#1.offset_16| Int) (v_ArrVal_497 (Array Int Int))) (let ((.cse31 (+ |v_ULTIMATE.start_node_create_#res#1.offset_16| 4))) (let ((.cse30 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_503 .cse31 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse22 (select (select .cse30 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_497 .cse31 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse21 (select (select .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse26 (let ((.cse29 (store .cse30 .cse21 v_DerPreprocessor_9))) (store .cse29 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse29 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_node_create_#res#1.offset_16|)))) (.cse23 (let ((.cse27 (store .cse28 .cse21 v_DerPreprocessor_8))) (store .cse27 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse27 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse25 (+ (select (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_507))) (store .cse20 .cse21 (store (select .cse20 .cse21) (+ 8 .cse22) v_DerPreprocessor_7))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_508) (select (select .cse23 .cse24) .cse25)) (select (select .cse26 .cse24) .cse25))))))) (= .cse22 0))))))) is different from false [2023-11-19 05:24:06,203 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-19 05:24:06,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 123 [2023-11-19 05:24:06,244 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-19 05:24:06,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 89 [2023-11-19 05:24:06,288 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-19 05:24:06,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 80 [2023-11-19 05:24:06,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:24:06,327 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 1 case distinctions, treesize of input 31 treesize of output 8 [2023-11-19 05:24:20,850 WARN L293 SmtUtils]: Spent 12.21s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-19 05:24:20,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:24:20,866 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13125520957 treesize of output 13083393559 [2023-11-19 05:24:24,788 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 15366 treesize of output 15318 [2023-11-19 05:24:24,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15992 treesize of output 15928 [2023-11-19 05:24:25,247 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 16070 treesize of output 16054 [2023-11-19 05:24:25,522 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 16982 treesize of output 16918 [2023-11-19 05:24:25,768 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 17606 treesize of output 17542 [2023-11-19 05:24:26,126 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 17594 treesize of output 17590 [2023-11-19 05:24:26,513 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 17934 treesize of output 17918 [2023-11-19 05:24:26,898 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 18181 treesize of output 18159 [2023-11-19 05:24:27,272 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 18503 treesize of output 18487 [2023-11-19 05:24:27,520 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 18757 treesize of output 18737