./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh --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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:59:26,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:59:26,598 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 12:59:26,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:59:26,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:59:26,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:59:26,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:59:26,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:59:26,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:59:26,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:59:26,632 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:59:26,633 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:59:26,633 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:59:26,634 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 12:59:26,634 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:59:26,635 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:59:26,635 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 12:59:26,636 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 12:59:26,636 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:59:26,637 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 12:59:26,638 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 12:59:26,640 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 12:59:26,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:59:26,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 12:59:26,642 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:59:26,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:59:26,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:59:26,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:59:26,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 12:59:26,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:59:26,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 12:59:26,645 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:59:26,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 12:59:26,645 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:59:26,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:59:26,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:59:26,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:59:26,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:59:26,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:59:26,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:59:26,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 12:59:26,648 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 12:59:26,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 12:59:26,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:59:26,648 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 12:59:26,648 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:59:26,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:59:26,649 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_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/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_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2023-12-02 12:59:26,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:59:26,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:59:26,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:59:26,904 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:59:26,904 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:59:26,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2023-12-02 12:59:29,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:59:29,879 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:59:29,879 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2023-12-02 12:59:29,894 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/data/3d7d14185/9abbe5f02ff8447c834efa877dbb8308/FLAG50f64fc77 [2023-12-02 12:59:29,906 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/data/3d7d14185/9abbe5f02ff8447c834efa877dbb8308 [2023-12-02 12:59:29,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:59:29,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:59:29,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:59:29,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:59:29,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:59:29,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:59:29" (1/1) ... [2023-12-02 12:59:29,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd38024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:29, skipping insertion in model container [2023-12-02 12:59:29,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:59:29" (1/1) ... [2023-12-02 12:59:29,961 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:59:30,217 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_5f513557-e82a-40d4-b2d7-25b9eebba462/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2023-12-02 12:59:30,221 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:59:30,231 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:59:30,271 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_5f513557-e82a-40d4-b2d7-25b9eebba462/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2023-12-02 12:59:30,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:59:30,297 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:59:30,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:30 WrapperNode [2023-12-02 12:59:30,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:59:30,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:59:30,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:59:30,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:59:30,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:30" (1/1) ... [2023-12-02 12:59:30,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:30" (1/1) ... [2023-12-02 12:59:30,344 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2023-12-02 12:59:30,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:59:30,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:59:30,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:59:30,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:59:30,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:30" (1/1) ... [2023-12-02 12:59:30,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:30" (1/1) ... [2023-12-02 12:59:30,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:30" (1/1) ... [2023-12-02 12:59:30,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:30" (1/1) ... [2023-12-02 12:59:30,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:30" (1/1) ... [2023-12-02 12:59:30,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:30" (1/1) ... [2023-12-02 12:59:30,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:30" (1/1) ... [2023-12-02 12:59:30,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:30" (1/1) ... [2023-12-02 12:59:30,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:59:30,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:59:30,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:59:30,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:59:30,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:30" (1/1) ... [2023-12-02 12:59:30,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:59:30,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:59:30,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:59:30,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:59:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 12:59:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 12:59:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 12:59:30,444 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 12:59:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 12:59:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:59:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 12:59:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 12:59:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 12:59:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 12:59:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 12:59:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 12:59:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:59:30,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:59:30,559 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:59:30,561 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:59:30,756 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:59:30,814 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:59:30,814 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 12:59:30,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:59:30 BoogieIcfgContainer [2023-12-02 12:59:30,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:59:30,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:59:30,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:59:30,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:59:30,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:59:29" (1/3) ... [2023-12-02 12:59:30,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f22194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:59:30, skipping insertion in model container [2023-12-02 12:59:30,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:30" (2/3) ... [2023-12-02 12:59:30,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f22194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:59:30, skipping insertion in model container [2023-12-02 12:59:30,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:59:30" (3/3) ... [2023-12-02 12:59:30,826 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2023-12-02 12:59:30,846 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:59:30,846 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 12:59:30,889 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:59:30,894 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;@6e95ce57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:59:30,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 12:59:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:59:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 12:59:30,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:30,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:30,906 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:30,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1387393065, now seen corresponding path program 1 times [2023-12-02 12:59:30,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:30,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353771147] [2023-12-02 12:59:30,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:30,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:59:31,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:31,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353771147] [2023-12-02 12:59:31,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353771147] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:31,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:31,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:59:31,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608529251] [2023-12-02 12:59:31,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:31,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:59:31,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:31,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:59:31,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:31,303 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:59:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:31,355 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2023-12-02 12:59:31,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:59:31,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-02 12:59:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:31,363 INFO L225 Difference]: With dead ends: 53 [2023-12-02 12:59:31,363 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 12:59:31,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:31,369 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:31,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:59:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 12:59:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-12-02 12:59:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:59:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-02 12:59:31,402 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2023-12-02 12:59:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:31,403 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-02 12:59:31,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:59:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-02 12:59:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 12:59:31,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:31,405 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:31,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 12:59:31,405 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:31,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1385554204, now seen corresponding path program 1 times [2023-12-02 12:59:31,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:31,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649316657] [2023-12-02 12:59:31,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:31,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:59:31,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:31,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649316657] [2023-12-02 12:59:31,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649316657] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:59:31,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158328324] [2023-12-02 12:59:31,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:31,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:59:31,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:59:31,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:59:31,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 12:59:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:31,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:59:31,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:59:31,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:59:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:59:31,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158328324] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:59:31,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [86271584] [2023-12-02 12:59:31,896 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-12-02 12:59:31,897 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:59:31,900 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:59:31,906 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:59:31,906 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:59:34,711 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 183 for LOIs [2023-12-02 12:59:34,998 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:59:43,110 WARN L293 SmtUtils]: Spent 7.57s on a formula simplification. DAG size of input: 222 DAG size of output: 213 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:00:17,465 WARN L293 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 214 DAG size of output: 212 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:00:36,907 WARN L293 SmtUtils]: Spent 11.04s on a formula simplification. DAG size of input: 224 DAG size of output: 222 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:00:36,910 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '238#(and (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_#in~head#1.base_9| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_13| Int) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int))) (|v_#memory_int_81| (Array Int (Array Int Int)))) (and (or (and (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_72| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_72|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#valid_33| (Array Int Int))) (and (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 1) |#valid|) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) (= |ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_dll_append_#in~head#1.base_9|) (exists ((|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_72| (store |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (store (store (select |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_72| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))))) (exists ((|v_#length_23| (Array Int Int))) (= |#length| (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 12))) (= |v_ULTIMATE.start_dll_append_~head#1.base_13| |v_ULTIMATE.start_dll_append_#in~head#1.base_9|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_28| Int) (|v_#memory_int_80| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_71| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_71| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_50|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (and (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| (store (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_28| (store (select (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_28|) 8 0))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_28|)) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_51| |v_ULTIMATE.start_dll_create_~head~0#1.base_28| (store (select |v_#memory_int_51| |v_ULTIMATE.start_dll_create_~head~0#1.base_28|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_10| |v_ULTIMATE.start_dll_create_~head~0#1.base_28|) 8)))) (= (store (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_28|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_28| (store (select (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_28|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_28|) 8 |ULTIMATE.start_dll_create_#res#1.base|)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_10|)) (and (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_28|) (= (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_10|) (= |v_old(#memory_int)_AFTER_CALL_10| |v_#memory_int_51|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0))))) (= (store |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_50|) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_int_80| |ULTIMATE.start_dll_create_#res#1.base| (store (store (select |v_#memory_int_80| |ULTIMATE.start_dll_create_#res#1.base|) 0 1) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_dll_create_#res#1.base|) 4))) |v_#memory_int_51|))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 0)) (exists ((|v_#memory_int_77| (Array Int (Array Int Int))) (|v_#memory_int_37| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int)))) (and (= |v_#memory_int_81| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0 5))) (= |v_#memory_int_38| (store |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 8 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 8)))) (= |v_#memory_int_37| (store |v_#memory_int_77| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_77| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4 (select (select |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4))))))) (and (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_72| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_72|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#valid_33| (Array Int Int))) (and (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 1) |#valid|) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))) (= |ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_dll_append_#in~head#1.base_9|) (exists ((|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_72| (store |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (store (store (select |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_72| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0))))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_28| Int) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_71| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_71| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_50|) (or (and (= |v_old(#memory_int)_AFTER_CALL_9| (store |v_#memory_int_51| |v_ULTIMATE.start_dll_create_~head~0#1.base_28| (store (select |v_#memory_int_51| |v_ULTIMATE.start_dll_create_~head~0#1.base_28|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_9| |v_ULTIMATE.start_dll_create_~head~0#1.base_28|) 8)))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_28|)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_28|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_28| (store (select (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_28|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_28|) 8 |ULTIMATE.start_dll_create_#res#1.base|))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| (store (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_28| (store (select (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_28|) 8 0)))) (and (= |v_#memory_int_51| |v_old(#memory_int)_AFTER_CALL_9|) (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_28|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0))))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_50|) (= (store |v_#memory_int_80| |ULTIMATE.start_dll_create_#res#1.base| (store (store (select |v_#memory_int_80| |ULTIMATE.start_dll_create_#res#1.base|) 0 1) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_dll_create_#res#1.base|) 4))) |v_#memory_int_51|))) (exists ((|v_#length_23| (Array Int Int))) (= |#length| (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 12))) (= |v_ULTIMATE.start_dll_append_~head#1.base_13| |v_ULTIMATE.start_dll_append_#in~head#1.base_9|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 0)) (exists ((|v_#memory_int_77| (Array Int (Array Int Int))) (|v_#memory_int_37| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int)))) (and (= |v_#memory_int_81| (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 0 5))) (= |v_#memory_int_38| (store |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 8 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 8)))) (= |v_#memory_int_37| (store |v_#memory_int_77| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_77| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4 (select (select |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)) 4)))))))) (= (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 0) (= |#memory_int| (store |v_#memory_int_81| |v_ULTIMATE.start_dll_append_~head#1.base_13| (store (select |v_#memory_int_81| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0)))) (= (select (select |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0) 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_dll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0 0))) (= (store |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_dll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.base_72| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_13|) 0))) |#memory_$Pointer$.base|))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |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-12-02 13:00:36,911 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:00:36,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:00:36,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-12-02 13:00:36,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771196515] [2023-12-02 13:00:36,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:00:36,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:00:36,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:00:36,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:00:36,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=229, Unknown=7, NotChecked=0, Total=272 [2023-12-02 13:00:36,914 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 13:00:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:36,964 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2023-12-02 13:00:36,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:00:36,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2023-12-02 13:00:36,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:36,965 INFO L225 Difference]: With dead ends: 46 [2023-12-02 13:00:36,965 INFO L226 Difference]: Without dead ends: 27 [2023-12-02 13:00:36,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 61.9s TimeCoverageRelationStatistics Valid=36, Invalid=229, Unknown=7, NotChecked=0, Total=272 [2023-12-02 13:00:36,967 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:36,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:00:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-02 13:00:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-02 13:00:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:00:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-12-02 13:00:36,972 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2023-12-02 13:00:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:36,972 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-12-02 13:00:36,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 13:00:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-12-02 13:00:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 13:00:36,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:36,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:36,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 13:00:37,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:00:37,174 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:00:37,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash 552932703, now seen corresponding path program 2 times [2023-12-02 13:00:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:00:37,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575907324] [2023-12-02 13:00:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:37,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:00:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 13:00:37,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:00:37,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575907324] [2023-12-02 13:00:37,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575907324] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:00:37,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589166161] [2023-12-02 13:00:37,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:00:37,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:00:37,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:00:37,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:00:37,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 13:00:37,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 13:00:37,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:00:37,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 13:00:37,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:38,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 13:00:38,129 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-12-02 13:00:38,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:00:38,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 13:00:38,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 13:00:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-12-02 13:00:38,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:00:38,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589166161] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:00:38,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1275664026] [2023-12-02 13:00:38,335 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-12-02 13:00:38,335 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:00:38,335 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:00:38,335 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:00:38,336 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:00:40,663 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 183 for LOIs [2023-12-02 13:00:40,861 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:00:53,106 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 222 DAG size of output: 213 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:01:29,813 WARN L293 SmtUtils]: Spent 6.84s on a formula simplification. DAG size of input: 214 DAG size of output: 212 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:01:49,649 WARN L293 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 224 DAG size of output: 222 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:01:49,651 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '457#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_#memory_int_108| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~head#1.base_15| Int) (|v_#memory_$Pointer$.offset_87| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_#in~head#1.base_11| Int)) (and (= |#memory_int| (store |v_#memory_int_108| |v_ULTIMATE.start_dll_append_~head#1.base_15| (store (select |v_#memory_int_108| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_dll_append_~head#1.base_15| (store (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)))) (= (select (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 0) (= (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 0) (or (and (exists ((|v_#memory_int_104| (Array Int (Array Int Int))) (|v_#memory_int_37| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int)))) (and (= |v_#memory_int_37| (store |v_#memory_int_104| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_104| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4 (select (select |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4)))) (= |v_#memory_int_38| (store |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 8 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 8)))) (= (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0 5)) |v_#memory_int_108|))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 0)) (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0) (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 1) |#valid|))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_33| Int) (|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_89| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_21| (Array Int (Array Int Int)))) (and (= |v_#memory_int_51| (store |v_#memory_int_107| |ULTIMATE.start_dll_create_#res#1.base| (store (store (select |v_#memory_int_107| |ULTIMATE.start_dll_create_#res#1.base|) 0 1) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_dll_create_#res#1.base|) 4)))) (= (store |v_#memory_$Pointer$.base_89| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_89| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_50|) (= |v_#memory_$Pointer$.offset_50| (store |v_#memory_$Pointer$.offset_86| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_86| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 0)))) (or (and (= |v_old(#memory_int)_AFTER_CALL_21| (store |v_#memory_int_51| |v_ULTIMATE.start_dll_create_~head~0#1.base_33| (store (select |v_#memory_int_51| |v_ULTIMATE.start_dll_create_~head~0#1.base_33|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_21| |v_ULTIMATE.start_dll_create_~head~0#1.base_33|) 8)))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_33|)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (store (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_33|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_33| (store (select (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_33|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_33|) 8 |ULTIMATE.start_dll_create_#res#1.base|))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_21| (store (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_33| (store (select (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_33|) 8 0)))) (and (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_21| (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0))) (= |v_old(#memory_int)_AFTER_CALL_21| |v_#memory_int_51|) (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_33|) (= (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_21|))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_87| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0))) |v_#memory_$Pointer$.offset_87|)) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_11| |v_ULTIMATE.start_dll_append_~head#1.base_15|) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_30| (Array Int Int))) (= (store |v_#length_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (store (store (select |v_#memory_$Pointer$.base_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_90| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0))) |v_#memory_$Pointer$.base_90|))) (and (exists ((|v_#memory_int_104| (Array Int (Array Int Int))) (|v_#memory_int_37| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int)))) (and (= |v_#memory_int_37| (store |v_#memory_int_104| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_104| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4 (select (select |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4)))) (= |v_#memory_int_38| (store |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 8 (select (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 8)))) (= (store |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0 5)) |v_#memory_int_108|))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 0)) (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0) (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 1) |#valid|))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_87| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0))) |v_#memory_$Pointer$.offset_87|)) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_33| Int) (|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_89| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (and (= |v_#memory_int_51| (store |v_#memory_int_107| |ULTIMATE.start_dll_create_#res#1.base| (store (store (select |v_#memory_int_107| |ULTIMATE.start_dll_create_#res#1.base|) 0 1) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_dll_create_#res#1.base|) 4)))) (= (store |v_#memory_$Pointer$.base_89| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_89| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_50|) (= |v_#memory_$Pointer$.offset_50| (store |v_#memory_$Pointer$.offset_86| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_86| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 0)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (or (and (= |v_old(#memory_int)_AFTER_CALL_20| |v_#memory_int_51|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0))) (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_33|) (= (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_20|)) (and (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (store (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_33| (store (select (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_33|) 8 0))) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_51| |v_ULTIMATE.start_dll_create_~head~0#1.base_33| (store (select |v_#memory_int_51| |v_ULTIMATE.start_dll_create_~head~0#1.base_33|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_20| |v_ULTIMATE.start_dll_create_~head~0#1.base_33|) 8)))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_33|)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_33|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_33| (store (select (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_33|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_33|) 8 |ULTIMATE.start_dll_create_#res#1.base|))))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_11| |v_ULTIMATE.start_dll_append_~head#1.base_15|) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_30| (Array Int Int))) (= (store |v_#length_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0) (store (store (store (select |v_#memory_$Pointer$.base_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_90| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0)) 0))) |v_#memory_$Pointer$.base_90|)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_dll_append_~head#1.base_15| (store (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_dll_append_~head#1.base_15|) 0 0))))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |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-12-02 13:01:49,651 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:01:49,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:01:49,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-12-02 13:01:49,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134209489] [2023-12-02 13:01:49,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:01:49,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 13:01:49,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:01:49,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 13:01:49,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=953, Unknown=8, NotChecked=62, Total=1122 [2023-12-02 13:01:49,654 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 13:01:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:01:50,442 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2023-12-02 13:01:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:01:50,443 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-12-02 13:01:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:01:50,443 INFO L225 Difference]: With dead ends: 37 [2023-12-02 13:01:50,444 INFO L226 Difference]: Without dead ends: 27 [2023-12-02 13:01:50,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 69.7s TimeCoverageRelationStatistics Valid=143, Invalid=1258, Unknown=9, NotChecked=72, Total=1482 [2023-12-02 13:01:50,445 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:01:50,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 198 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 32 Unchecked, 0.3s Time] [2023-12-02 13:01:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-02 13:01:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-02 13:01:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:01:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-12-02 13:01:50,451 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 24 [2023-12-02 13:01:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:01:50,451 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-12-02 13:01:50,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 13:01:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-12-02 13:01:50,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 13:01:50,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:01:50,452 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:01:50,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 13:01:50,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:01:50,653 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:01:50,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:01:50,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1856391385, now seen corresponding path program 1 times [2023-12-02 13:01:50,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:01:50,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690164809] [2023-12-02 13:01:50,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:01:50,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:01:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:01:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:01:52,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:01:52,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690164809] [2023-12-02 13:01:52,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690164809] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:01:52,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618865318] [2023-12-02 13:01:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:01:52,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:01:52,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:01:52,273 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:01:52,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 13:01:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:01:52,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 75 conjunts are in the unsatisfiable core [2023-12-02 13:01:52,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:01:52,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 13:01:52,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 13:01:52,613 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 13:01:52,613 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 13:01:52,752 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 13:01:52,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:01:52,914 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-12-02 13:01:52,914 INFO L378 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-12-02 13:01:53,024 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-12-02 13:01:53,045 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:01:53,045 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 86 [2023-12-02 13:01:53,061 INFO L378 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 25 treesize of output 1 [2023-12-02 13:01:53,274 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-12-02 13:01:53,274 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 85 treesize of output 30 [2023-12-02 13:01:53,285 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 13:01:53,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 13:01:53,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:01:53,405 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 13:01:53,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 74 [2023-12-02 13:01:53,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:01:53,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2023-12-02 13:01:53,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:01:53,446 INFO L349 Elim1Store]: treesize reduction 30, result has 47.4 percent of original size [2023-12-02 13:01:53,446 INFO L378 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 39 treesize of output 39 [2023-12-02 13:01:53,930 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-12-02 13:01:53,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 71 [2023-12-02 13:01:54,009 INFO L349 Elim1Store]: treesize reduction 90, result has 33.3 percent of original size [2023-12-02 13:01:54,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 110 treesize of output 92 [2023-12-02 13:01:54,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:01:54,021 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 84 treesize of output 73 [2023-12-02 13:01:54,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:01:54,044 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 13:01:54,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 87 [2023-12-02 13:01:54,142 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-12-02 13:01:54,142 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 74 treesize of output 23 [2023-12-02 13:01:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 13:01:54,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:01:54,276 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_527 (Array Int Int)) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| Int) (v_ArrVal_529 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_529)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_527))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_526) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 0))) is different from false [2023-12-02 13:01:54,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618865318] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:01:54,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [13009253] [2023-12-02 13:01:54,959 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 13:01:54,959 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:01:54,959 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:01:54,959 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:01:54,959 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:01:56,574 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 193 for LOIs [2023-12-02 13:01:56,793 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:03:18,135 WARN L293 SmtUtils]: Spent 17.04s on a formula simplification. DAG size of input: 237 DAG size of output: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:03:55,074 WARN L293 SmtUtils]: Spent 19.39s on a formula simplification. DAG size of input: 246 DAG size of output: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:03:55,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [13009253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:03:55,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:03:55,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [19, 21] total 50 [2023-12-02 13:03:55,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243774278] [2023-12-02 13:03:55,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:03:55,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 13:03:55,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:03:55,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 13:03:55,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2768, Unknown=15, NotChecked=106, Total=3080 [2023-12-02 13:03:55,078 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:04:02,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:05,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:06,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:10,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:11,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:15,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:20,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:21,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:27,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:32,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:36,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:37,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:42,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:43,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:46,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:49,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:50,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:58,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:04:59,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:05:01,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:05:02,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:05:04,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:05:08,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:05:10,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:05:15,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:05:16,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:05:17,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:05:19,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:05:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:05:20,178 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2023-12-02 13:05:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 13:05:20,179 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-12-02 13:05:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:05:20,180 INFO L225 Difference]: With dead ends: 35 [2023-12-02 13:05:20,180 INFO L226 Difference]: Without dead ends: 32 [2023-12-02 13:05:20,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 120.3s TimeCoverageRelationStatistics Valid=191, Invalid=2768, Unknown=15, NotChecked=106, Total=3080 [2023-12-02 13:05:20,182 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 85.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:05:20,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 14 Unknown, 0 Unchecked, 85.1s Time] [2023-12-02 13:05:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-02 13:05:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-02 13:05:20,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:05:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-12-02 13:05:20,193 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 27 [2023-12-02 13:05:20,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:05:20,194 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-12-02 13:05:20,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:05:20,194 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-12-02 13:05:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 13:05:20,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:05:20,195 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:05:20,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 13:05:20,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:05:20,396 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:05:20,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:05:20,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1605482909, now seen corresponding path program 1 times [2023-12-02 13:05:20,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:05:20,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154161977] [2023-12-02 13:05:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:05:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:05:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:05:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:05:22,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:05:22,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154161977] [2023-12-02 13:05:22,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154161977] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:05:22,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667999176] [2023-12-02 13:05:22,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:05:22,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:05:22,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:05:22,355 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:05:22,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 13:05:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:05:22,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 122 conjunts are in the unsatisfiable core [2023-12-02 13:05:22,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:05:22,711 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-12-02 13:05:23,129 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 13:05:23,130 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-12-02 13:05:23,296 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-12-02 13:05:23,304 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-12-02 13:05:23,314 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-02 13:05:23,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 13:05:23,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2023-12-02 13:05:23,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:05:23,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 13:05:23,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 13:05:23,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:05:23,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 13:05:23,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:05:23,965 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 20 treesize of output 15 [2023-12-02 13:05:23,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:05:23,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2023-12-02 13:05:24,022 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-02 13:05:24,022 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-12-02 13:05:24,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:05:24,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:05:24,856 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 109 [2023-12-02 13:05:24,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:05:24,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 108 [2023-12-02 13:05:24,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:05:24,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 47 treesize of output 35 [2023-12-02 13:05:24,886 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 63 treesize of output 30 [2023-12-02 13:05:24,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:05:24,896 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 30 treesize of output 15 [2023-12-02 13:05:24,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:05:24,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:05:24,909 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 29 treesize of output 27 [2023-12-02 13:05:25,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2023-12-02 13:05:25,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:05:25,097 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-12-02 13:05:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:05:25,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:05:25,298 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_748 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= v_ArrVal_743 (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_743 .cse0)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_744) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_748)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_749) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-12-02 13:05:25,665 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_748 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_22| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse3 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_22| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_743) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_744) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 .cse1 v_ArrVal_748)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_749) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse3 .cse1) 0)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_22| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (not (= v_ArrVal_743 (store (select |c_#memory_int| .cse2) .cse1 (select v_ArrVal_743 .cse1)))))))) is different from false [2023-12-02 13:05:26,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667999176] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:05:26,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1466082138] [2023-12-02 13:05:26,327 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 13:05:26,327 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:05:26,328 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:05:26,328 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:05:26,328 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:05:29,832 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 183 for LOIs [2023-12-02 13:05:30,032 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:06:01,696 WARN L293 SmtUtils]: Spent 20.91s on a formula simplification. DAG size of input: 251 DAG size of output: 239 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:08:00,901 WARN L293 SmtUtils]: Spent 19.65s on a formula simplification. DAG size of input: 237 DAG size of output: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:08:37,709 WARN L293 SmtUtils]: Spent 18.04s on a formula simplification. DAG size of input: 246 DAG size of output: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:09:22,353 WARN L293 SmtUtils]: Spent 17.60s on a formula simplification. DAG size of input: 247 DAG size of output: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:10:09,933 WARN L293 SmtUtils]: Spent 16.80s on a formula simplification. DAG size of input: 251 DAG size of output: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:11:08,369 WARN L293 SmtUtils]: Spent 23.34s on a formula simplification. DAG size of input: 251 DAG size of output: 239 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:11:08,371 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '979#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_#in~head#1.base_15| Int) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_19| Int) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_int_17| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_130| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0) (store (select |v_#memory_$Pointer$.base_130| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select (store |v_#memory_$Pointer$.base_130| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0) (store (select |v_#memory_$Pointer$.base_130| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8 (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)))) (= |v_#memory_int_17| (store |v_#memory_int_178| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0) (store (select |v_#memory_int_178| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)) (select (select |v_#memory_int_17| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)))))) (or (not (= 0 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0))) (not (= (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0) 0))) (or (and (= |v_ULTIMATE.start_dll_append_#in~head#1.base_15| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (store (store (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) |v_#memory_$Pointer$.base_130|)) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_42| (Array Int (Array Int Int))) (|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_42| (Array Int (Array Int Int))) (|v_#memory_int_177| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_45| Int) (|v_old(#memory_int)_AFTER_CALL_42| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_126| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_126| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_50|) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_$Pointer$.base_129| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_129| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_50|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (and (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_42| (store (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_45| (store (select (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_45|) 8 0))) (= (store (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_45|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_45| (store (select (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_45|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_45|) 8 |ULTIMATE.start_dll_create_#res#1.base|)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_42|) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_45|)) (= |v_old(#memory_int)_AFTER_CALL_42| (store |v_#memory_int_51| |v_ULTIMATE.start_dll_create_~head~0#1.base_45| (store (select |v_#memory_int_51| |v_ULTIMATE.start_dll_create_~head~0#1.base_45|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_42| |v_ULTIMATE.start_dll_create_~head~0#1.base_45|) 8))))) (and (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_42| (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0))) (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_45|) (= |v_old(#memory_int)_AFTER_CALL_42| |v_#memory_int_51|) (= (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_42|))) (= (store |v_#memory_int_177| |ULTIMATE.start_dll_create_#res#1.base| (store (store (select |v_#memory_int_177| |ULTIMATE.start_dll_create_#res#1.base|) 0 1) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_dll_create_#res#1.base|) 4))) |v_#memory_int_51|))) (exists ((|v_#valid_63| (Array Int Int))) (and (= (select |v_#valid_63| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0) (= |#valid| (store |v_#valid_63| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 1)))) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_15| |v_ULTIMATE.start_dll_append_~head#1.base_19|) (exists ((|v_#length_44| (Array Int Int))) (= |#length| (store |v_#length_44| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 12))) (<= (+ |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_37| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int))) (|v_#memory_int_174| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_38| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_38| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0 5)) |v_#memory_int_178|) (= (store |v_#memory_int_37| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_37| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8 (select (select |v_#memory_int_38| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8))) |v_#memory_int_38|) (= |v_#memory_int_37| (store |v_#memory_int_174| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_174| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4 (select (select |v_#memory_int_37| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4)))))) (exists ((|v_#memory_$Pointer$.offset_123| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (store (store (select |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) |v_#memory_$Pointer$.offset_127|)) (not (= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 0))) (and (= |v_ULTIMATE.start_dll_append_#in~head#1.base_15| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_#memory_int_177| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_45| Int) (|v_old(#memory_int)_AFTER_CALL_43| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_126| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_126| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_50|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_129| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_129| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_50|) (= (store |v_#memory_int_177| |ULTIMATE.start_dll_create_#res#1.base| (store (store (select |v_#memory_int_177| |ULTIMATE.start_dll_create_#res#1.base|) 0 1) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_dll_create_#res#1.base|) 4))) |v_#memory_int_51|) (or (and (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0))) (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_45|) (= (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_43|) (= |v_old(#memory_int)_AFTER_CALL_43| |v_#memory_int_51|)) (and (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (store (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_45| (store (select (store |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_45|) 8 0))) (= |v_old(#memory_int)_AFTER_CALL_43| (store |v_#memory_int_51| |v_ULTIMATE.start_dll_create_~head~0#1.base_45| (store (select |v_#memory_int_51| |v_ULTIMATE.start_dll_create_~head~0#1.base_45|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_43| |v_ULTIMATE.start_dll_create_~head~0#1.base_45|) 8)))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_45|)) (= (store (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_45|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_45| (store (select (store |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_50| |ULTIMATE.start_dll_create_#res#1.base|) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_45|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_45|) 8 |ULTIMATE.start_dll_create_#res#1.base|)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_43|))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (exists ((|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (store (store (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) |v_#memory_$Pointer$.base_130|)) (exists ((|v_#valid_63| (Array Int Int))) (and (= (select |v_#valid_63| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0) (= |#valid| (store |v_#valid_63| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 1)))) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_15| |v_ULTIMATE.start_dll_append_~head#1.base_19|) (exists ((|v_#length_44| (Array Int Int))) (= |#length| (store |v_#length_44| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 12))) (<= (+ |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_37| (Array Int (Array Int Int))) (|v_#memory_int_38| (Array Int (Array Int Int))) (|v_#memory_int_174| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_38| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_38| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0 5)) |v_#memory_int_178|) (= (store |v_#memory_int_37| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_37| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8 (select (select |v_#memory_int_38| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8))) |v_#memory_int_38|) (= |v_#memory_int_37| (store |v_#memory_int_174| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_174| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4 (select (select |v_#memory_int_37| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4)))))) (exists ((|v_#memory_$Pointer$.offset_123| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (store (store (select |v_#memory_$Pointer$.offset_123| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 0))) |v_#memory_$Pointer$.offset_127|)) (not (= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| 0)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_127| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0) (store (select |v_#memory_$Pointer$.offset_127| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_127| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0) (store (select |v_#memory_$Pointer$.offset_127| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)))) (= |#memory_int| (store |v_#memory_int_17| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| (store (select |v_#memory_int_17| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|) 8)))) (= (select (select |v_#memory_$Pointer$.offset_127| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0))) 0) (= (select (select |v_#memory_$Pointer$.base_130| (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0)) (+ 4 (select (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_dll_append_~head#1.base_19|) 0))) 0))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |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-12-02 13:11:08,371 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:11:08,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:11:08,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 40 [2023-12-02 13:11:08,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745052820] [2023-12-02 13:11:08,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:11:08,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 13:11:08,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:11:08,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 13:11:08,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=3560, Unknown=30, NotChecked=242, Total=4032 [2023-12-02 13:11:08,375 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 40 states, 33 states have (on average 1.303030303030303) internal successors, (43), 31 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 13:11:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:11:12,795 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2023-12-02 13:11:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 13:11:12,796 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 33 states have (on average 1.303030303030303) internal successors, (43), 31 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2023-12-02 13:11:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:11:12,797 INFO L225 Difference]: With dead ends: 52 [2023-12-02 13:11:12,797 INFO L226 Difference]: Without dead ends: 50 [2023-12-02 13:11:12,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 344.5s TimeCoverageRelationStatistics Valid=327, Invalid=5048, Unknown=35, NotChecked=290, Total=5700 [2023-12-02 13:11:12,799 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 74 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:11:12,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 331 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 13:11:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-02 13:11:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2023-12-02 13:11:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:11:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2023-12-02 13:11:12,810 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 29 [2023-12-02 13:11:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:11:12,810 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2023-12-02 13:11:12,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 33 states have (on average 1.303030303030303) internal successors, (43), 31 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 13:11:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2023-12-02 13:11:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 13:11:12,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:11:12,811 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:11:12,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 13:11:13,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:11:13,012 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:11:13,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:11:13,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2046301310, now seen corresponding path program 1 times [2023-12-02 13:11:13,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:11:13,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320269692] [2023-12-02 13:11:13,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:13,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:11:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 13:11:15,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:11:15,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320269692] [2023-12-02 13:11:15,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320269692] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:11:15,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456027498] [2023-12-02 13:11:15,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:15,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:11:15,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:11:15,123 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:11:15,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 13:11:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:15,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 75 conjunts are in the unsatisfiable core [2023-12-02 13:11:15,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:11:15,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 13:11:15,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 13:11:15,509 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 13:11:15,510 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 13:11:15,725 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 13:11:15,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:11:16,010 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-12-02 13:11:16,010 INFO L378 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-12-02 13:11:16,180 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-12-02 13:11:16,205 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:11:16,205 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 86 [2023-12-02 13:11:16,228 INFO L378 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 25 treesize of output 1 [2023-12-02 13:11:16,556 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-12-02 13:11:16,557 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 85 treesize of output 30 [2023-12-02 13:11:16,569 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 13:11:16,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 13:11:16,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:16,758 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 13:11:16,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 74 [2023-12-02 13:11:16,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:16,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2023-12-02 13:11:16,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:16,824 INFO L349 Elim1Store]: treesize reduction 30, result has 47.4 percent of original size [2023-12-02 13:11:16,824 INFO L378 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 39 treesize of output 39 [2023-12-02 13:11:17,609 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-12-02 13:11:17,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 71 [2023-12-02 13:11:17,703 INFO L349 Elim1Store]: treesize reduction 90, result has 33.3 percent of original size [2023-12-02 13:11:17,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 110 treesize of output 92 [2023-12-02 13:11:17,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:17,734 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 13:11:17,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 87 [2023-12-02 13:11:17,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:17,752 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 84 treesize of output 73 [2023-12-02 13:11:17,879 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-12-02 13:11:17,880 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 74 treesize of output 23 [2023-12-02 13:11:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 13:11:17,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:11:17,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| Int) (v_ArrVal_967 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_967)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_965))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_964) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 0))) is different from false [2023-12-02 13:11:19,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456027498] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:11:19,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1772713296] [2023-12-02 13:11:19,055 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 13:11:19,056 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:11:19,056 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:11:19,056 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:11:19,056 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:11:20,403 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 193 for LOIs [2023-12-02 13:11:20,618 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:11:51,417 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1295#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_#memory_int_208| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_150| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_#memory_int_17| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_208| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8) (store (select |v_#memory_int_208| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8) 4) (select (select |v_#memory_int_17| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8) 4)))) |v_#memory_int_17|) (= (store (store |v_#memory_$Pointer$.base_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8) (store (select |v_#memory_$Pointer$.base_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| (store (select (store |v_#memory_$Pointer$.base_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8) (store (select |v_#memory_$Pointer$.base_150| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8))) |#memory_$Pointer$.base|) (= (store |v_#memory_int_17| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| (store (select |v_#memory_int_17| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8))) |#memory_int|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_147| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8) (store (select |v_#memory_$Pointer$.offset_147| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| (store (select (store |v_#memory_$Pointer$.offset_147| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8) (store (select |v_#memory_$Pointer$.offset_147| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 8)))))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |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|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0))' at error location [2023-12-02 13:11:51,417 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:11:51,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:11:51,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2023-12-02 13:11:51,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345520477] [2023-12-02 13:11:51,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:11:51,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 13:11:51,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:11:51,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 13:11:51,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2790, Unknown=7, NotChecked=106, Total=3080 [2023-12-02 13:11:51,420 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 37 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 13:11:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:11:56,100 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2023-12-02 13:11:56,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 13:11:56,101 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2023-12-02 13:11:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:11:56,101 INFO L225 Difference]: With dead ends: 48 [2023-12-02 13:11:56,102 INFO L226 Difference]: Without dead ends: 34 [2023-12-02 13:11:56,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=427, Invalid=4971, Unknown=8, NotChecked=144, Total=5550 [2023-12-02 13:11:56,104 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 83 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:11:56,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 301 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 13:11:56,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-02 13:11:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-12-02 13:11:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:11:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-12-02 13:11:56,114 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 29 [2023-12-02 13:11:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:11:56,114 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-12-02 13:11:56,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 13:11:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-12-02 13:11:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 13:11:56,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:11:56,116 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:11:56,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 13:11:56,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-02 13:11:56,316 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:11:56,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:11:56,317 INFO L85 PathProgramCache]: Analyzing trace with hash 574672894, now seen corresponding path program 1 times [2023-12-02 13:11:56,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:11:56,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208723571] [2023-12-02 13:11:56,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:56,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:11:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 13:11:58,962 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:11:58,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208723571] [2023-12-02 13:11:58,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208723571] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:11:58,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143784713] [2023-12-02 13:11:58,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:58,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:11:58,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:11:58,963 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:11:58,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 13:11:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:59,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 112 conjunts are in the unsatisfiable core [2023-12-02 13:11:59,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:11:59,857 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-12-02 13:12:00,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 13:12:00,621 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 13:12:00,621 INFO L378 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 13:12:00,824 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 31 treesize of output 15 [2023-12-02 13:12:00,830 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 15 treesize of output 7 [2023-12-02 13:12:00,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 1 [2023-12-02 13:12:00,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 treesize of output 16 [2023-12-02 13:12:00,872 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:12:00,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2023-12-02 13:12:01,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:12:01,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 75 treesize of output 34 [2023-12-02 13:12:01,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 13:12:01,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:12:01,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:12:01,549 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 13:12:01,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 60 [2023-12-02 13:12:01,594 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 13:12:01,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 13:12:01,617 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 20 treesize of output 15 [2023-12-02 13:12:01,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:12:01,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 13:12:02,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:12:02,708 INFO L349 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2023-12-02 13:12:02,709 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 160 treesize of output 97 [2023-12-02 13:12:02,717 INFO L378 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 41 treesize of output 15 [2023-12-02 13:12:02,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:12:02,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:12:02,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 37 treesize of output 11 [2023-12-02 13:12:02,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:12:02,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 60 treesize of output 27 [2023-12-02 13:12:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:12:03,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:12:03,176 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1186) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1182) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1184) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1183) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-02 13:12:03,203 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1186) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1182) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1185) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1184) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1183) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-02 13:12:03,224 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1186) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1182) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1185) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1184) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1183) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-02 13:12:03,238 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1186) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1182) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1185) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1184) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1183) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-02 13:12:03,442 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| Int) (v_ArrVal_1197 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| 1)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_1197))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_1196) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1186) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_1182) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1185) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_1181) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1184) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_1183) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-12-02 13:12:03,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143784713] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:12:03,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1128661157] [2023-12-02 13:12:03,447 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 13:12:03,447 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:12:03,447 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:12:03,447 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:12:03,447 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:12:04,752 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 193 for LOIs [2023-12-02 13:12:05,037 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:12:38,191 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1625#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_#memory_$Pointer$.base_170| (Array Int (Array Int Int))) (|v_#memory_int_248| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#memory_int_17| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_167| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_248| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) (store (select |v_#memory_int_248| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) 4) (select (select |v_#memory_int_17| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) 4)))) |v_#memory_int_17|) (= |#memory_int| (store |v_#memory_int_17| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select |v_#memory_int_17| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_167| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) (store (select |v_#memory_$Pointer$.offset_167| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select (store |v_#memory_$Pointer$.offset_167| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) (store (select |v_#memory_$Pointer$.offset_167| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_170| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) (store (select |v_#memory_$Pointer$.base_170| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| (store (select (store |v_#memory_$Pointer$.base_170| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) (store (select |v_#memory_$Pointer$.base_170| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|) 8)))))) (= |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-12-02 13:12:38,191 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:12:38,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:12:38,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2023-12-02 13:12:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133346498] [2023-12-02 13:12:38,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:12:38,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 13:12:38,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:12:38,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 13:12:38,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3024, Unknown=10, NotChecked=570, Total=3782 [2023-12-02 13:12:38,195 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 41 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 13:12:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:12:42,085 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2023-12-02 13:12:42,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 13:12:42,086 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2023-12-02 13:12:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:12:42,086 INFO L225 Difference]: With dead ends: 54 [2023-12-02 13:12:42,087 INFO L226 Difference]: Without dead ends: 52 [2023-12-02 13:12:42,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=310, Invalid=4669, Unknown=11, NotChecked=710, Total=5700 [2023-12-02 13:12:42,090 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:12:42,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 353 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 13:12:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-02 13:12:42,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2023-12-02 13:12:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:12:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-12-02 13:12:42,107 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 31 [2023-12-02 13:12:42,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:12:42,107 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-12-02 13:12:42,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 13:12:42,108 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-12-02 13:12:42,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 13:12:42,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:12:42,109 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:12:42,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 13:12:42,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 13:12:42,309 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:12:42,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:12:42,310 INFO L85 PathProgramCache]: Analyzing trace with hash 634936038, now seen corresponding path program 1 times [2023-12-02 13:12:42,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:12:42,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190829277] [2023-12-02 13:12:42,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:12:42,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:12:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:12:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 13:12:42,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:12:42,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190829277] [2023-12-02 13:12:42,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190829277] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:12:42,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:12:42,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:12:42,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320608644] [2023-12-02 13:12:42,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:12:42,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:12:42,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:12:42,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:12:42,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:12:42,490 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 13:12:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:12:42,687 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2023-12-02 13:12:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:12:42,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2023-12-02 13:12:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:12:42,688 INFO L225 Difference]: With dead ends: 47 [2023-12-02 13:12:42,688 INFO L226 Difference]: Without dead ends: 42 [2023-12-02 13:12:42,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:12:42,689 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:12:42,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:12:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-02 13:12:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2023-12-02 13:12:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:12:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2023-12-02 13:12:42,708 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 32 [2023-12-02 13:12:42,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:12:42,708 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2023-12-02 13:12:42,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 13:12:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2023-12-02 13:12:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 13:12:42,709 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:12:42,709 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:12:42,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 13:12:42,710 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:12:42,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:12:42,710 INFO L85 PathProgramCache]: Analyzing trace with hash -239640871, now seen corresponding path program 2 times [2023-12-02 13:12:42,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:12:42,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954182527] [2023-12-02 13:12:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:12:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:12:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:12:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:12:47,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:12:47,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954182527] [2023-12-02 13:12:47,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954182527] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:12:47,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256208588] [2023-12-02 13:12:47,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:12:47,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:12:47,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:12:47,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:12:47,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 13:12:47,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 13:12:47,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:12:47,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 147 conjunts are in the unsatisfiable core [2023-12-02 13:12:47,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:12:47,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 13:12:47,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 13:12:48,283 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 13:12:48,283 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 13:12:48,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:12:48,652 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 13:12:48,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:12:49,048 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 13:12:49,048 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 13:12:49,132 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-12-02 13:12:49,132 INFO L378 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-12-02 13:12:49,373 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-02 13:12:49,380 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2023-12-02 13:12:49,390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2023-12-02 13:12:49,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:12:49,402 INFO L378 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 34 treesize of output 27 [2023-12-02 13:12:49,414 INFO L378 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 24 treesize of output 11 [2023-12-02 13:12:49,430 INFO L378 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 24 treesize of output 11 [2023-12-02 13:12:49,449 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 26 treesize of output 15 [2023-12-02 13:12:49,943 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 13:12:49,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 50 [2023-12-02 13:12:49,957 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 13:12:49,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 13:12:49,965 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 13:12:50,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:12:50,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:12:50,180 INFO L349 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2023-12-02 13:12:50,180 INFO L378 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 33 treesize of output 33 [2023-12-02 13:12:52,329 INFO L349 Elim1Store]: treesize reduction 111, result has 22.9 percent of original size [2023-12-02 13:12:52,330 INFO L378 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 7 new quantified variables, introduced 9 case distinctions, treesize of input 113 treesize of output 96 [2023-12-02 13:12:52,373 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-12-02 13:12:52,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2023-12-02 13:12:52,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:12:52,422 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 13:12:52,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 79 [2023-12-02 13:12:52,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:12:52,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-12-02 13:12:52,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-12-02 13:12:52,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:12:52,492 INFO L349 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2023-12-02 13:12:52,493 INFO L378 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 83 treesize of output 1 [2023-12-02 13:12:52,670 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 13:12:52,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 43 [2023-12-02 13:12:52,683 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 13:12:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:12:52,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:12:52,992 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1513 (Array Int Int)) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| Int) (v_ArrVal_1514 Int) (v_ArrVal_1518 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1515) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1518) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1514)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1513) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-02 13:12:54,577 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1513 (Array Int Int)) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_43| Int) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| Int) (v_ArrVal_1514 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| v_ArrVal_1529)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| v_ArrVal_1527))) (let ((.cse2 (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ 4 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (select (select .cse4 (select (select .cse4 .cse5) .cse6)) (+ 4 (select (select .cse3 .cse5) .cse6)))))) (let ((.cse0 (select .cse4 .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_43| 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43|) 0)) (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_1515) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| v_ArrVal_1518) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 v_ArrVal_1514)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| v_ArrVal_1513) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select .cse3 .cse2) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| v_ArrVal_1516) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| 1))))))) is different from false [2023-12-02 13:12:54,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256208588] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:12:54,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1431772995] [2023-12-02 13:12:54,583 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 13:12:54,583 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:12:54,584 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:12:54,584 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:12:54,584 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:12:56,245 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 193 for LOIs [2023-12-02 13:12:56,510 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:13:34,806 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2106#(and (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_31| Int) (|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_190| (Array Int (Array Int Int))) (|v_#memory_int_298| (Array Int (Array Int Int))) (|v_#memory_int_17| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.base_195| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) (store (select |v_#memory_$Pointer$.base_195| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31| (store (select (store |v_#memory_$Pointer$.base_195| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) (store (select |v_#memory_$Pointer$.base_195| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8))) |#memory_$Pointer$.base|) (= (store |v_#memory_int_17| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31| (store (select |v_#memory_int_17| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8))) |#memory_int|) (= (store |v_#memory_int_298| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) (store (select |v_#memory_int_298| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) 4) (select (select |v_#memory_int_17| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) 4)))) |v_#memory_int_17|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_190| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) (store (select |v_#memory_$Pointer$.offset_190| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31| (store (select (store |v_#memory_$Pointer$.offset_190| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) (store (select |v_#memory_$Pointer$.offset_190| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)))))) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0))) (= |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-12-02 13:13:34,806 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:13:34,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:13:34,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 49 [2023-12-02 13:13:34,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213391330] [2023-12-02 13:13:34,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:13:34,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-02 13:13:34,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:13:34,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-02 13:13:34,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=4720, Unknown=8, NotChecked=278, Total=5256 [2023-12-02 13:13:34,811 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 49 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 38 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 13:13:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:13:44,480 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2023-12-02 13:13:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 13:13:44,481 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 38 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2023-12-02 13:13:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:13:44,482 INFO L225 Difference]: With dead ends: 89 [2023-12-02 13:13:44,482 INFO L226 Difference]: Without dead ends: 87 [2023-12-02 13:13:44,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2806 ImplicationChecksByTransitivity, 51.6s TimeCoverageRelationStatistics Valid=620, Invalid=9679, Unknown=11, NotChecked=402, Total=10712 [2023-12-02 13:13:44,487 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 117 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-02 13:13:44,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 556 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-02 13:13:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-02 13:13:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 41. [2023-12-02 13:13:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:13:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2023-12-02 13:13:44,502 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 33 [2023-12-02 13:13:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:13:44,502 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2023-12-02 13:13:44,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 38 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 13:13:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2023-12-02 13:13:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 13:13:44,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:13:44,503 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:13:44,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 13:13:44,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:13:44,704 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:13:44,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:13:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash 341200814, now seen corresponding path program 1 times [2023-12-02 13:13:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:13:44,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086631870] [2023-12-02 13:13:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:13:44,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:13:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:13:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:13:47,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:13:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086631870] [2023-12-02 13:13:47,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086631870] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:13:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090070012] [2023-12-02 13:13:47,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:13:47,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:13:47,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:13:47,939 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:13:47,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f513557-e82a-40d4-b2d7-25b9eebba462/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 13:13:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:13:48,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 157 conjunts are in the unsatisfiable core [2023-12-02 13:13:48,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:13:48,280 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-12-02 13:13:48,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:13:48,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:13:48,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 7 [2023-12-02 13:13:48,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 13:13:48,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 13:13:48,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 13:13:48,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 13:13:49,232 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 13:13:49,232 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 13:13:49,289 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 13:13:49,289 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-12-02 13:13:49,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 13:13:49,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 13:13:49,547 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-12-02 13:13:49,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:49,560 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 42 treesize of output 31 [2023-12-02 13:13:49,570 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-12-02 13:13:49,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:49,581 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 34 treesize of output 23 [2023-12-02 13:13:49,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:49,597 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 42 treesize of output 31 [2023-12-02 13:13:49,621 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 30 treesize of output 17 [2023-12-02 13:13:49,639 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 20 treesize of output 30 [2023-12-02 13:13:49,657 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 30 treesize of output 17 [2023-12-02 13:13:50,122 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-12-02 13:13:50,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 80 [2023-12-02 13:13:50,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:50,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:50,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2023-12-02 13:13:50,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 13:13:50,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 13:13:50,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:50,532 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 13:13:50,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 218 treesize of output 173 [2023-12-02 13:13:50,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:50,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:50,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:50,577 INFO L349 Elim1Store]: treesize reduction 37, result has 11.9 percent of original size [2023-12-02 13:13:50,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 164 [2023-12-02 13:13:50,616 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-12-02 13:13:50,617 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 34 treesize of output 36 [2023-12-02 13:13:50,636 INFO L378 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 30 treesize of output 25 [2023-12-02 13:13:52,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:52,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:52,474 INFO L349 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2023-12-02 13:13:52,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 232 treesize of output 207 [2023-12-02 13:13:52,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:52,522 INFO L349 Elim1Store]: treesize reduction 72, result has 13.3 percent of original size [2023-12-02 13:13:52,522 INFO L378 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 229 treesize of output 182 [2023-12-02 13:13:52,566 INFO L378 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 30 treesize of output 25 [2023-12-02 13:13:52,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-02 13:13:52,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:52,968 INFO L349 Elim1Store]: treesize reduction 220, result has 24.7 percent of original size [2023-12-02 13:13:52,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 276 treesize of output 259 [2023-12-02 13:13:53,183 INFO L349 Elim1Store]: treesize reduction 170, result has 17.5 percent of original size [2023-12-02 13:13:53,184 INFO L378 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 7 new quantified variables, introduced 9 case distinctions, treesize of input 285 treesize of output 157 [2023-12-02 13:13:53,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:53,259 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 13:13:53,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 292 treesize of output 229 [2023-12-02 13:13:53,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:53,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:13:53,355 INFO L349 Elim1Store]: treesize reduction 112, result has 11.8 percent of original size [2023-12-02 13:13:53,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 295 treesize of output 269 [2023-12-02 13:13:53,432 INFO L349 Elim1Store]: treesize reduction 79, result has 21.0 percent of original size [2023-12-02 13:13:53,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 38 [2023-12-02 13:13:53,477 INFO L349 Elim1Store]: treesize reduction 45, result has 35.7 percent of original size [2023-12-02 13:13:53,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 29 [2023-12-02 13:13:53,971 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 7 treesize of output 3 [2023-12-02 13:14:02,791 INFO L349 Elim1Store]: treesize reduction 28, result has 94.8 percent of original size [2023-12-02 13:14:02,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 36 case distinctions, treesize of input 590 treesize of output 729 [2023-12-02 13:14:08,193 WARN L293 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 334 DAG size of output: 310 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 13:14:08,193 INFO L349 Elim1Store]: treesize reduction 72, result has 91.3 percent of original size [2023-12-02 13:14:08,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 3 disjoint index pairs (out of 91 index pairs), introduced 17 new quantified variables, introduced 87 case distinctions, treesize of input 562 treesize of output 1171