./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX --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 a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:55:56,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:55:56,186 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:55:56,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:55:56,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:55:56,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:55:56,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:55:56,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:55:56,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:55:56,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:55:56,234 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:55:56,235 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:55:56,235 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:55:56,237 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:55:56,237 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:55:56,238 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:55:56,238 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:55:56,239 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:55:56,239 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:55:56,240 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:55:56,240 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:55:56,241 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:55:56,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:55:56,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:55:56,243 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:55:56,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:55:56,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:55:56,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:55:56,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:55:56,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:55:56,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:55:56,247 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:55:56,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:55:56,248 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:55:56,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:55:56,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:55:56,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:55:56,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:55:56,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:55:56,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:55:56,250 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:55:56,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:55:56,250 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:55:56,250 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:55:56,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:55:56,251 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_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 [2023-11-12 00:55:56,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:55:56,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:55:56,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:55:56,555 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:55:56,556 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:55:56,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2023-11-12 00:55:59,729 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:56:00,060 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:56:00,061 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2023-11-12 00:56:00,078 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/data/b197d01f5/e4440f6476ad46c5ad5bffd932ec4aad/FLAG49b49cc6a [2023-11-12 00:56:00,091 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/data/b197d01f5/e4440f6476ad46c5ad5bffd932ec4aad [2023-11-12 00:56:00,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:56:00,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:56:00,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:56:00,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:56:00,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:56:00,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:56:00" (1/1) ... [2023-11-12 00:56:00,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@221372e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00, skipping insertion in model container [2023-11-12 00:56:00,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:56:00" (1/1) ... [2023-11-12 00:56:00,149 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:56:00,487 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_d282b587-5ed0-4751-9684-4190f678e692/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i[24450,24463] [2023-11-12 00:56:00,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:56:00,514 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:56:00,586 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_d282b587-5ed0-4751-9684-4190f678e692/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i[24450,24463] [2023-11-12 00:56:00,589 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:56:00,624 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:56:00,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00 WrapperNode [2023-11-12 00:56:00,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:56:00,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:56:00,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:56:00,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:56:00,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00" (1/1) ... [2023-11-12 00:56:00,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00" (1/1) ... [2023-11-12 00:56:00,678 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 125 [2023-11-12 00:56:00,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:56:00,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:56:00,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:56:00,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:56:00,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00" (1/1) ... [2023-11-12 00:56:00,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00" (1/1) ... [2023-11-12 00:56:00,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00" (1/1) ... [2023-11-12 00:56:00,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00" (1/1) ... [2023-11-12 00:56:00,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00" (1/1) ... [2023-11-12 00:56:00,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00" (1/1) ... [2023-11-12 00:56:00,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00" (1/1) ... [2023-11-12 00:56:00,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00" (1/1) ... [2023-11-12 00:56:00,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:56:00,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:56:00,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:56:00,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:56:00,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00" (1/1) ... [2023-11-12 00:56:00,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:56:00,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:00,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:56:00,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:56:00,820 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-12 00:56:00,820 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-12 00:56:00,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:56:00,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:56:00,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:56:00,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:56:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:56:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:56:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:56:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:56:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:56:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:56:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:56:00,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:56:00,957 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:56:00,959 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:56:00,983 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-12 00:56:01,208 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:56:01,404 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:56:01,405 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 00:56:01,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:56:01 BoogieIcfgContainer [2023-11-12 00:56:01,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:56:01,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:56:01,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:56:01,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:56:01,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:56:00" (1/3) ... [2023-11-12 00:56:01,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a00a347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:56:01, skipping insertion in model container [2023-11-12 00:56:01,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:00" (2/3) ... [2023-11-12 00:56:01,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a00a347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:56:01, skipping insertion in model container [2023-11-12 00:56:01,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:56:01" (3/3) ... [2023-11-12 00:56:01,424 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.i [2023-11-12 00:56:01,439 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:56:01,439 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 00:56:01,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:56:01,497 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;@5a77bb44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:56:01,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 00:56:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 15 states have (on average 1.6) internal successors, (24), 17 states have internal predecessors, (24), 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-12 00:56:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:56:01,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:01,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:56:01,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:56:01,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:01,519 INFO L85 PathProgramCache]: Analyzing trace with hash -181130984, now seen corresponding path program 1 times [2023-11-12 00:56:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:01,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104295370] [2023-11-12 00:56:01,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:01,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:02,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:02,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104295370] [2023-11-12 00:56:02,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104295370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:02,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:02,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:56:02,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832477607] [2023-11-12 00:56:02,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:02,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:02,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:02,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:02,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:02,127 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.6) internal successors, (24), 17 states have internal predecessors, (24), 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.0) internal successors, (6), 2 states have internal predecessors, (6), 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-12 00:56:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:02,222 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2023-11-12 00:56:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:02,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-11-12 00:56:02,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:02,232 INFO L225 Difference]: With dead ends: 37 [2023-11-12 00:56:02,232 INFO L226 Difference]: Without dead ends: 15 [2023-11-12 00:56:02,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:02,243 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 34 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-12 00:56:02,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 34 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-12 00:56:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2023-11-12 00:56:02,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-12 00:56:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2023-11-12 00:56:02,281 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 6 [2023-11-12 00:56:02,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:02,282 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2023-11-12 00:56:02,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-12 00:56:02,283 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2023-11-12 00:56:02,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:56:02,285 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:02,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:02,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:56:02,286 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:56:02,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:02,290 INFO L85 PathProgramCache]: Analyzing trace with hash -171603972, now seen corresponding path program 1 times [2023-11-12 00:56:02,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:02,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098752673] [2023-11-12 00:56:02,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:02,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:02,571 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-12 00:56:02,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:02,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098752673] [2023-11-12 00:56:02,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098752673] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:02,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464468962] [2023-11-12 00:56:02,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:02,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:02,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:02,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:02,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:56:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:02,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:56:02,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:02,832 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-12 00:56:02,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:56:02,852 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-12 00:56:02,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464468962] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:56:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1918994467] [2023-11-12 00:56:02,875 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2023-11-12 00:56:02,875 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:56:02,887 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:56:02,894 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:56:02,901 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:56:04,527 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:56:07,370 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '142#(and (<= (+ |ULTIMATE.start_node_create_#res#1.base| 1) |#StackHeapBarrier|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (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_node_create_#res#1.offset| 0) (not (= |ULTIMATE.start_node_create_#res#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (not (= 5 (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |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))) (exists ((|v_#memory_int_52| (Array Int (Array Int Int))) (|v_#memory_int_53| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_16| Int) (|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_16| Int) (|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_25| Int) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int))) (|v_#memory_int_94| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_49| (store |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_node_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 0)))) (= (store |v_#memory_int_54| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_54| |ULTIMATE.start_node_create_#res#1.base|) 8 (select (select |v_#memory_int_53| |ULTIMATE.start_node_create_#res#1.base|) 8))) |v_#memory_int_53|) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_#memory_$Pointer$.base_79| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_#memory_int_54| (store |v_#memory_int_94| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_94| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_int_54| |ULTIMATE.start_node_create_#res#1.base|) 4)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_main_~#s~0#1.base|) 0 0))) (= |v_#memory_int_52| (store |v_#memory_int_53| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_int_53| |ULTIMATE.start_node_create_#res#1.base|) 0 5) 4 (select (select |v_#memory_int_52| |ULTIMATE.start_node_create_#res#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_50| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_int_50| |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_79| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_main_~#s~0#1.base|) 0 |ULTIMATE.start_node_create_#res#1.base|))) (or (and (= (store (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) 0)) |v_#memory_$Pointer$.offset_47|) (= (store (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) |ULTIMATE.start_node_create_#res#1.base|)) |v_#memory_$Pointer$.base_47|) (or (not (= (select (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |v_#memory_int_50| (store |v_#memory_int_52| (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_52| (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) (select (select |v_#memory_int_50| (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8)))))) (and (= |v_#memory_int_50| |v_#memory_int_52|) (= (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_16|) (= |v_#memory_$Pointer$.base_47| (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |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_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_#memory_$Pointer$.offset_47|))) (= (store |v_#memory_$Pointer$.base_79| |ULTIMATE.start_node_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.base_79| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_49|))) (= |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$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:56:07,370 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:56:07,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:56:07,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-11-12 00:56:07,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697204914] [2023-11-12 00:56:07,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:56:07,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:56:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:07,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:56:07,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:56:07,374 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-12 00:56:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:07,494 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2023-11-12 00:56:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:56:07,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2023-11-12 00:56:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:07,496 INFO L225 Difference]: With dead ends: 24 [2023-11-12 00:56:07,496 INFO L226 Difference]: Without dead ends: 16 [2023-11-12 00:56:07,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:56:07,499 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:07,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-12 00:56:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-12 00:56:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-12 00:56:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-11-12 00:56:07,506 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2023-11-12 00:56:07,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:07,507 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-12 00:56:07,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-12 00:56:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-11-12 00:56:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:56:07,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:07,514 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:07,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:56:07,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:07,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:56:07,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:07,724 INFO L85 PathProgramCache]: Analyzing trace with hash 179768984, now seen corresponding path program 2 times [2023-11-12 00:56:07,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:07,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282307727] [2023-11-12 00:56:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:07,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:56:09,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:09,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282307727] [2023-11-12 00:56:09,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282307727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:09,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:09,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:56:09,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803317150] [2023-11-12 00:56:09,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:09,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:56:09,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:09,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:56:09,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:56:09,167 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-12 00:56:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:09,462 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2023-11-12 00:56:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:56:09,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2023-11-12 00:56:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:09,465 INFO L225 Difference]: With dead ends: 18 [2023-11-12 00:56:09,465 INFO L226 Difference]: Without dead ends: 16 [2023-11-12 00:56:09,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:56:09,467 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:09,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:56:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-12 00:56:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-12 00:56:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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-12 00:56:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-11-12 00:56:09,475 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2023-11-12 00:56:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:09,476 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-11-12 00:56:09,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-12 00:56:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-11-12 00:56:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:56:09,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:09,478 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:09,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:56:09,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:56:09,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash 959379351, now seen corresponding path program 1 times [2023-11-12 00:56:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:09,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887485388] [2023-11-12 00:56:09,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:56:10,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:10,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887485388] [2023-11-12 00:56:10,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887485388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:10,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:10,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 00:56:10,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840259434] [2023-11-12 00:56:10,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:10,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 00:56:10,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:10,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 00:56:10,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:56:10,794 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-12 00:56:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:11,108 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2023-11-12 00:56:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 00:56:11,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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) Word has length 14 [2023-11-12 00:56:11,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:11,109 INFO L225 Difference]: With dead ends: 23 [2023-11-12 00:56:11,109 INFO L226 Difference]: Without dead ends: 20 [2023-11-12 00:56:11,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-12 00:56:11,111 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:11,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:56:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-12 00:56:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2023-11-12 00:56:11,120 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-12 00:56:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-11-12 00:56:11,121 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2023-11-12 00:56:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:11,122 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-11-12 00:56:11,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-12 00:56:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-11-12 00:56:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:56:11,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:11,125 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:11,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:56:11,125 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:56:11,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash 959336819, now seen corresponding path program 1 times [2023-11-12 00:56:11,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:11,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361911714] [2023-11-12 00:56:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:11,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:12,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:12,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361911714] [2023-11-12 00:56:12,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361911714] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:12,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280672537] [2023-11-12 00:56:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:12,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:12,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:12,849 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:12,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d282b587-5ed0-4751-9684-4190f678e692/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:56:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:13,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 100 conjunts are in the unsatisfiable core [2023-11-12 00:56:13,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:13,100 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:56:13,176 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:56:13,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-12 00:56:13,361 INFO L322 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-12 00:56:13,362 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-11-12 00:56:13,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2023-11-12 00:56:13,589 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-12 00:56:13,599 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-12 00:56:13,607 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:56:13,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:13,778 INFO L322 Elim1Store]: treesize reduction 16, result has 44.8 percent of original size [2023-11-12 00:56:13,779 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 25 [2023-11-12 00:56:14,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:14,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:14,115 INFO L322 Elim1Store]: treesize reduction 170, result has 10.5 percent of original size [2023-11-12 00:56:14,116 INFO L351 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 379 treesize of output 461 [2023-11-12 00:56:14,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:14,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:14,184 INFO L322 Elim1Store]: treesize reduction 46, result has 30.3 percent of original size [2023-11-12 00:56:14,184 INFO L351 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 195 treesize of output 208 [2023-11-12 00:56:14,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:14,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:14,250 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-11-12 00:56:14,275 INFO L351 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 45 treesize of output 37 [2023-11-12 00:56:14,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2023-11-12 00:56:14,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:14,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:14,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:14,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:14,322 INFO L351 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 57 treesize of output 50 [2023-11-12 00:56:14,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:14,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:14,393 INFO L322 Elim1Store]: treesize reduction 86, result has 25.2 percent of original size [2023-11-12 00:56:14,394 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 399 treesize of output 366 [2023-11-12 00:56:14,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 68 [2023-11-12 00:56:14,486 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2023-11-12 00:56:14,694 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 53 [2023-11-12 00:56:14,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2023-11-12 00:56:14,815 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-12 00:56:14,816 INFO L351 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 123 treesize of output 44 [2023-11-12 00:56:14,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:14,826 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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-12 00:56:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:14,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:56:15,859 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse8 (+ v_ArrVal_506 4))) (let ((.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|)))) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_498 .cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse0 (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (or (not (= (select .cse0 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 0)) (not (= (select .cse1 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_prepend_~head#1.offset| v_ArrVal_506))) (.cse2 (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |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_9) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_512) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_498 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse20 (+ v_ArrVal_506 4))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_503 .cse20 (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 ((.cse9 (select (select .cse19 |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 ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_498 .cse20 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse11 (select (select .cse17 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse15 (let ((.cse18 (store .cse19 .cse11 v_DerPreprocessor_12))) (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_ArrVal_506)))) (.cse12 (let ((.cse16 (store .cse17 .cse11 v_DerPreprocessor_11))) (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_500))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ .cse9 8) v_DerPreprocessor_10))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_512) (select (select .cse12 .cse13) .cse14)) (select (select .cse15 .cse13) .cse14)))))))))))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse31 (+ v_ArrVal_506 4))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_498 .cse31 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse22 (select (select .cse29 |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 ((.cse23 (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 ((.cse27 (let ((.cse30 (store .cse23 .cse22 v_DerPreprocessor_8))) (store .cse30 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse30 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| v_ArrVal_506)))) (.cse24 (let ((.cse28 (store .cse29 .cse22 v_DerPreprocessor_7))) (store .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse28 |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 ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse26 (+ (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_500))) (store .cse21 .cse22 (store (select .cse21 .cse22) (+ (select (select .cse23 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_DerPreprocessor_6))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_512) (select (select .cse24 .cse25) .cse26)) (select (select .cse27 .cse25) .cse26)))))) (= .cse22 0))))))) is different from false [2023-11-12 00:56:19,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:56:19,484 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:56:19,494 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:56:19,495 INFO L351 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 92 [2023-11-12 00:56:19,537 INFO L322 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-12 00:56:19,538 INFO L351 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 63 treesize of output 92 [2023-11-12 00:56:19,584 INFO L322 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-12 00:56:19,585 INFO L351 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 54 treesize of output 83