./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E --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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:13:22,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:13:22,873 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 03:13:22,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:13:22,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:13:22,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:13:22,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:13:22,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:13:22,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:13:22,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:13:22,922 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:13:22,922 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:13:22,922 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:13:22,922 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:13:22,923 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:13:22,923 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:13:22,923 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:13:22,923 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:13:22,923 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:13:22,923 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:13:22,923 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:13:22,923 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:13:22,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:13:22,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:13:22,924 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:13:22,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:13:22,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:13:22,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:13:22,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:13:22,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:13:22,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:13:22,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:13:22,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:13:22,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:13:22,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:13:22,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:13:22,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:13:22,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:13:22,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:13:22,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:13:22,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:13:22,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:13:22,928 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:13:22,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:13:22,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:13:22,928 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:13:22,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:13:22,928 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2024-11-14 03:13:23,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:13:23,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:13:23,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:13:23,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:13:23,264 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:13:23,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i Unable to find full path for "g++" [2024-11-14 03:13:25,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:13:25,470 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:13:25,470 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-14 03:13:25,483 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/data/6a290a0fe/33c90dbb68e7498ea17e6ec6bcefb410/FLAGab032ead6 [2024-11-14 03:13:25,501 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/data/6a290a0fe/33c90dbb68e7498ea17e6ec6bcefb410 [2024-11-14 03:13:25,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:13:25,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:13:25,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:13:25,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:13:25,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:13:25,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:13:25" (1/1) ... [2024-11-14 03:13:25,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@501d11ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:25, skipping insertion in model container [2024-11-14 03:13:25,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:13:25" (1/1) ... [2024-11-14 03:13:25,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:13:25,976 WARN L250 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_3990d99c-a2da-4f3b-b06e-43c3f261498c/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2024-11-14 03:13:25,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:13:25,990 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:13:26,064 WARN L250 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_3990d99c-a2da-4f3b-b06e-43c3f261498c/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2024-11-14 03:13:26,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:13:26,104 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:13:26,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:26 WrapperNode [2024-11-14 03:13:26,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:13:26,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:13:26,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:13:26,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:13:26,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:26" (1/1) ... [2024-11-14 03:13:26,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:26" (1/1) ... [2024-11-14 03:13:26,159 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2024-11-14 03:13:26,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:13:26,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:13:26,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:13:26,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:13:26,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:26" (1/1) ... [2024-11-14 03:13:26,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:26" (1/1) ... [2024-11-14 03:13:26,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:26" (1/1) ... [2024-11-14 03:13:26,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:26" (1/1) ... [2024-11-14 03:13:26,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:26" (1/1) ... [2024-11-14 03:13:26,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:26" (1/1) ... [2024-11-14 03:13:26,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:26" (1/1) ... [2024-11-14 03:13:26,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:26" (1/1) ... [2024-11-14 03:13:26,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:13:26,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:13:26,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:13:26,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:13:26,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:26" (1/1) ... [2024-11-14 03:13:26,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:13:26,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:26,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:13:26,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:13:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:13:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:13:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 03:13:26,267 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 03:13:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:13:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:13:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:13:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:13:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:13:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:13:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 03:13:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:13:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:13:26,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:13:26,402 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:13:26,404 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:13:26,624 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-14 03:13:26,627 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:13:26,689 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:13:26,689 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-14 03:13:26,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:13:26 BoogieIcfgContainer [2024-11-14 03:13:26,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:13:26,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:13:26,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:13:26,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:13:26,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:13:25" (1/3) ... [2024-11-14 03:13:26,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ef08fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:13:26, skipping insertion in model container [2024-11-14 03:13:26,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:26" (2/3) ... [2024-11-14 03:13:26,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ef08fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:13:26, skipping insertion in model container [2024-11-14 03:13:26,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:13:26" (3/3) ... [2024-11-14 03:13:26,702 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2024-11-14 03:13:26,721 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:13:26,724 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_append_equal.i that has 2 procedures, 23 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-14 03:13:26,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:13:26,812 INFO L333 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, 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;@6b37fe01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:13:26,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:13:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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) [2024-11-14 03:13:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:13:26,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:26,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:26,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:13:26,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:26,831 INFO L85 PathProgramCache]: Analyzing trace with hash 377412187, now seen corresponding path program 1 times [2024-11-14 03:13:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:26,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121963967] [2024-11-14 03:13:26,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:26,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:13:27,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:27,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121963967] [2024-11-14 03:13:27,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121963967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:27,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:13:27,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:13:27,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871005267] [2024-11-14 03:13:27,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:27,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:13:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:27,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:13:27,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:13:27,268 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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) [2024-11-14 03:13:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:27,323 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2024-11-14 03:13:27,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:13:27,326 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 [2024-11-14 03:13:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:27,332 INFO L225 Difference]: With dead ends: 45 [2024-11-14 03:13:27,333 INFO L226 Difference]: Without dead ends: 22 [2024-11-14 03:13:27,336 INFO L431 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 [2024-11-14 03:13:27,339 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:27,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:13:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-14 03:13:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-11-14 03:13:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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) [2024-11-14 03:13:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-14 03:13:27,377 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2024-11-14 03:13:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:27,377 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-14 03:13:27,377 INFO L472 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) [2024-11-14 03:13:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-14 03:13:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:13:27,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:27,379 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:27,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:13:27,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:13:27,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash -484864313, now seen corresponding path program 1 times [2024-11-14 03:13:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295064735] [2024-11-14 03:13:27,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:13:27,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:27,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295064735] [2024-11-14 03:13:27,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295064735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:27,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554333454] [2024-11-14 03:13:27,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:27,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:27,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:27,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:27,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:13:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:27,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:13:27,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:13:27,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:13:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:13:27,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554333454] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:13:27,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1158785393] [2024-11-14 03:13:27,930 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-14 03:13:27,930 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:13:27,933 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:13:27,939 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:13:27,940 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:13:30,129 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 112 for LOIs [2024-11-14 03:13:30,352 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:13:35,790 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '227#(and (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_~head#1.base_13| Int)) (and (= (select (select |v_#memory_$Pointer$.base_49| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 0) (= |#memory_int| (store |v_#memory_int_51| |v_ULTIMATE.start_sll_append_~head#1.base_13| (store (select |v_#memory_int_51| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)))) (or (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_17| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_17| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_23| (Array Int Int))) (= (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 8) |#length|)) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_28| (Array Int (Array Int Int)))) (and (= |v_#memory_int_51| (store |v_#memory_int_28| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_28| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0 1))) (= (store |v_#memory_int_47| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_47| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 (select (select |v_#memory_int_28| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4))) |v_#memory_int_28|))) (exists ((|v_#memory_$Pointer$.offset_45| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.offset_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_49|)) (exists ((|v_#memory_$Pointer$.base_45| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.base_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.base_49|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_append_~head#1.base_13| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_33| (Array Int Int))) (and (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0) (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#valid|)))) (and (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_23| (Array Int Int))) (= (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 8) |#length|)) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_28| (Array Int (Array Int Int)))) (and (= |v_#memory_int_51| (store |v_#memory_int_28| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_28| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0 1))) (= (store |v_#memory_int_47| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_47| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 (select (select |v_#memory_int_28| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4))) |v_#memory_int_28|))) (exists ((|v_#memory_$Pointer$.offset_45| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.offset_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_49|)) (exists ((|v_#memory_$Pointer$.base_45| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.base_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_49| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.base_49|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_append_~head#1.base_13| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_33| (Array Int Int))) (and (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0) (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#valid|))))) (= (select (select |v_#memory_$Pointer$.offset_49| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_49| |v_ULTIMATE.start_sll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.offset_49| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0 0))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_49| |v_ULTIMATE.start_sll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.base_49| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)))))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) |ULTIMATE.start_main_~temp~2#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:13:35,790 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:13:35,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:13:35,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-14 03:13:35,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642033011] [2024-11-14 03:13:35,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:13:35,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:13:35,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:35,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:13:35,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-14 03:13:35,794 INFO L87 Difference]: Start difference. First operand 20 states and 25 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) [2024-11-14 03:13:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:35,831 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-11-14 03:13:35,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:13:35,832 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 [2024-11-14 03:13:35,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:35,832 INFO L225 Difference]: With dead ends: 38 [2024-11-14 03:13:35,833 INFO L226 Difference]: Without dead ends: 23 [2024-11-14 03:13:35,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-14 03:13:35,834 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:35,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:13:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-14 03:13:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-14 03:13:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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) [2024-11-14 03:13:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-11-14 03:13:35,839 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2024-11-14 03:13:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:35,839 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-11-14 03:13:35,840 INFO L472 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) [2024-11-14 03:13:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-11-14 03:13:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:13:35,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:35,841 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:35,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:13:36,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:36,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:13:36,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:36,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2030157261, now seen corresponding path program 2 times [2024-11-14 03:13:36,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:36,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926356185] [2024-11-14 03:13:36,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:36,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:13:36,646 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:36,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926356185] [2024-11-14 03:13:36,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926356185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:36,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157736353] [2024-11-14 03:13:36,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:13:36,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:36,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:36,650 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:36,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:13:36,765 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-14 03:13:36,765 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:13:36,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-14 03:13:36,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:36,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-14 03:13:37,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-14 03:13:37,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:37,101 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 20 treesize of output 15 [2024-11-14 03:13:37,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-14 03:13:37,165 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 28 treesize of output 16 [2024-11-14 03:13:37,171 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 [2024-11-14 03:13:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 03:13:37,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:13:37,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157736353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:37,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:13:37,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2024-11-14 03:13:37,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627514283] [2024-11-14 03:13:37,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:37,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:13:37,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:37,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:13:37,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2024-11-14 03:13:37,234 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:13:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:37,682 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-11-14 03:13:37,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:13:37,684 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-14 03:13:37,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:37,685 INFO L225 Difference]: With dead ends: 35 [2024-11-14 03:13:37,686 INFO L226 Difference]: Without dead ends: 33 [2024-11-14 03:13:37,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2024-11-14 03:13:37,688 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:37,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 80 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:13:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-14 03:13:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2024-11-14 03:13:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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) [2024-11-14 03:13:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-14 03:13:37,703 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 24 [2024-11-14 03:13:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:37,704 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-14 03:13:37,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:13:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-14 03:13:37,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:13:37,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:37,707 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:37,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 03:13:37,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:37,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:13:37,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2030105119, now seen corresponding path program 1 times [2024-11-14 03:13:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:37,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007122066] [2024-11-14 03:13:37,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:37,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 03:13:38,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:38,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007122066] [2024-11-14 03:13:38,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007122066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:38,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:13:38,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:13:38,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953434803] [2024-11-14 03:13:38,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:38,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:13:38,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:38,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:13:38,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:13:38,217 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:13:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:38,303 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-14 03:13:38,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:13:38,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-14 03:13:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:38,304 INFO L225 Difference]: With dead ends: 34 [2024-11-14 03:13:38,306 INFO L226 Difference]: Without dead ends: 31 [2024-11-14 03:13:38,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:13:38,307 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:38,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:13:38,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-14 03:13:38,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2024-11-14 03:13:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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) [2024-11-14 03:13:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-14 03:13:38,317 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 24 [2024-11-14 03:13:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:38,317 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-14 03:13:38,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:13:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-14 03:13:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:13:38,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:38,319 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:38,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:13:38,319 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:13:38,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1065940146, now seen corresponding path program 1 times [2024-11-14 03:13:38,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:38,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438968921] [2024-11-14 03:13:38,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:38,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 03:13:38,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:38,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438968921] [2024-11-14 03:13:38,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438968921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:38,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393961276] [2024-11-14 03:13:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:38,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:38,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:38,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:38,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:13:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:38,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 03:13:38,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:38,934 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 [2024-11-14 03:13:38,953 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_23| Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_23| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_23|)) |c_#memory_$Pointer$.base|) (<= (+ |v_node_create_~temp~0#1.base_23| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-14 03:13:38,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:38,961 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 [2024-11-14 03:13:38,967 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 [2024-11-14 03:13:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2024-11-14 03:13:38,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:13:39,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393961276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:39,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [95325180] [2024-11-14 03:13:39,050 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-14 03:13:39,050 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:13:39,051 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:13:39,051 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:13:39,051 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:13:39,979 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 129 for LOIs [2024-11-14 03:13:40,120 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:13:44,900 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '723#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_18| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_18| Int)) (and (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) |v_ULTIMATE.start_main_~ptr~0#1.offset_18|) 1)) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_18| 4))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_18| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (or (not (= |v_ULTIMATE.start_main_~ptr~0#1.offset_18| 0)) (not (= |v_ULTIMATE.start_main_~ptr~0#1.base_18| 0))))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:13:44,900 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:13:44,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:13:44,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2024-11-14 03:13:44,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368430773] [2024-11-14 03:13:44,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:13:44,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:13:44,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:44,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:13:44,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=679, Unknown=5, NotChecked=52, Total=812 [2024-11-14 03:13:44,902 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 15 states, 10 states have (on average 2.0) internal successors, (20), 12 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:13:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:45,213 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-14 03:13:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:13:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 2.0) internal successors, (20), 12 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-11-14 03:13:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:45,214 INFO L225 Difference]: With dead ends: 31 [2024-11-14 03:13:45,214 INFO L226 Difference]: Without dead ends: 23 [2024-11-14 03:13:45,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=101, Invalid=890, Unknown=5, NotChecked=60, Total=1056 [2024-11-14 03:13:45,216 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:45,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 125 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2024-11-14 03:13:45,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-14 03:13:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-14 03:13:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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) [2024-11-14 03:13:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-14 03:13:45,221 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 26 [2024-11-14 03:13:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:45,221 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-14 03:13:45,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 2.0) internal successors, (20), 12 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:13:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-11-14 03:13:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:13:45,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:45,222 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:45,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 03:13:45,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:45,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:13:45,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1138519794, now seen corresponding path program 1 times [2024-11-14 03:13:45,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:45,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997012656] [2024-11-14 03:13:45,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:45,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:13:47,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:47,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997012656] [2024-11-14 03:13:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997012656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:47,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906350955] [2024-11-14 03:13:47,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:47,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:47,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:47,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:47,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:13:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:47,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-14 03:13:47,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:47,363 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 [2024-11-14 03:13:47,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-14 03:13:47,391 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 18 treesize of output 7 [2024-11-14 03:13:47,520 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 23 treesize of output 11 [2024-11-14 03:13:47,528 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-14 03:13:47,673 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 30 treesize of output 18 [2024-11-14 03:13:47,677 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 [2024-11-14 03:13:47,681 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 [2024-11-14 03:13:47,689 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 [2024-11-14 03:13:47,774 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 9 treesize of output 12 [2024-11-14 03:13:47,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:47,870 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 38 treesize of output 29 [2024-11-14 03:13:47,893 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 03:13:47,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 03:13:47,907 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 20 treesize of output 15 [2024-11-14 03:13:47,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:47,921 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 16 treesize of output 11 [2024-11-14 03:13:48,501 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 48 treesize of output 28 [2024-11-14 03:13:48,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:13:48,518 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 03:13:48,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-14 03:13:48,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:13:48,670 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2024-11-14 03:13:48,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:13:48,682 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 03:13:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:13:48,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:13:49,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:13:49,730 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 1 case distinctions, treesize of input 106 treesize of output 106 [2024-11-14 03:13:49,805 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|v_ULTIMATE.start_sll_append_#t~ret7#1.base_24| Int) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_521 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_24| v_ArrVal_521))) (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_24| v_arrayElimArr_2)) (.cse0 (select .cse4 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ (select (select .cse4 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_append_#t~ret7#1.base_24| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_24|) 0)) (not (= (select .cse0 .cse1) 0)) (not (= |c_ULTIMATE.start_sll_append_~data#1| (select v_arrayElimArr_2 0))) (not (= v_ArrVal_510 (store (select .cse2 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse1 (select v_ArrVal_510 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse2 |ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_510) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_24| v_ArrVal_520))) (store .cse3 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse1 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_24|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store .cse4 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2024-11-14 03:13:49,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906350955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:49,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [126735939] [2024-11-14 03:13:49,816 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:13:49,817 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:13:49,817 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:13:49,817 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:13:49,817 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:13:50,861 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 129 for LOIs [2024-11-14 03:13:51,020 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:14:20,147 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '966#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_19| Int) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_78| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_78| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) (store (select |v_#memory_$Pointer$.offset_78| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4) 0))) (or (and (= |v_ULTIMATE.start_sll_append_~head#1.base_19| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) 1) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) 0)) (exists ((|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int))) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_35| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_78| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_78| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_78| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_35|) (= (select (select |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_35| (store |v_#memory_int_103| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_103| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_35| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_28| (Array Int (Array Int Int)))) (and (= |v_#memory_int_28| (store |v_#memory_int_100| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) (store (select |v_#memory_int_100| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 4 (select (select |v_#memory_int_28| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 4)))) (= (store |v_#memory_int_28| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) (store (select |v_#memory_int_28| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 0 1)) |v_#memory_int_104|))) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) (store (store (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 4 0) 0 (select (select |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 0))) |v_#memory_$Pointer$.base_79|)) (exists ((|v_#memory_$Pointer$.offset_74| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_74| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) (store (store (select |v_#memory_$Pointer$.offset_74| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_78| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 0))) |v_#memory_$Pointer$.offset_78|)) (exists ((|v_#valid_50| (Array Int Int))) (and (= (store |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) 1) |#valid|) (= (select |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 0))) (exists ((|v_#length_37| (Array Int Int))) (= |#length| (store |v_#length_37| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) 8)))) (and (= |v_ULTIMATE.start_sll_append_~head#1.base_19| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_34| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_34| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_78| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_34| (store |v_#memory_int_103| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_103| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_34| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_$Pointer$.base_78| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_78| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_34|))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) 1) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) 0)) (exists ((|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_28| (Array Int (Array Int Int)))) (and (= |v_#memory_int_28| (store |v_#memory_int_100| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) (store (select |v_#memory_int_100| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 4 (select (select |v_#memory_int_28| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 4)))) (= (store |v_#memory_int_28| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) (store (select |v_#memory_int_28| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 0 1)) |v_#memory_int_104|))) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) (store (store (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 4 0) 0 (select (select |v_#memory_$Pointer$.base_79| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 0))) |v_#memory_$Pointer$.base_79|)) (exists ((|v_#memory_$Pointer$.offset_74| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_74| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) (store (store (select |v_#memory_$Pointer$.offset_74| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_78| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 0))) |v_#memory_$Pointer$.offset_78|)) (exists ((|v_#valid_50| (Array Int Int))) (and (= (store |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) 1) |#valid|) (= (select |v_#valid_50| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) 0))) (exists ((|v_#length_37| (Array Int Int))) (= |#length| (store |v_#length_37| (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)) 8))))) (= (store |v_#memory_int_104| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) (store (select |v_#memory_int_104| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4)))) |#memory_int|) (= 0 (select (select |v_#memory_$Pointer$.base_79| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_79| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) (store (select |v_#memory_$Pointer$.base_79| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_append_~head#1.base_19|) 0) 4))))))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) |ULTIMATE.start_main_~temp~2#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:14:20,147 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:14:20,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:14:20,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 32 [2024-11-14 03:14:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061807616] [2024-11-14 03:14:20,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:14:20,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 03:14:20,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:14:20,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 03:14:20,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2580, Unknown=14, NotChecked=102, Total=2862 [2024-11-14 03:14:20,152 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 32 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 03:14:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:14:22,751 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-14 03:14:22,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 03:14:22,751 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2024-11-14 03:14:22,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:14:22,752 INFO L225 Difference]: With dead ends: 36 [2024-11-14 03:14:22,752 INFO L226 Difference]: Without dead ends: 34 [2024-11-14 03:14:22,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=240, Invalid=3656, Unknown=14, NotChecked=122, Total=4032 [2024-11-14 03:14:22,755 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:14:22,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 03:14:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-14 03:14:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2024-11-14 03:14:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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) [2024-11-14 03:14:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-14 03:14:22,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 27 [2024-11-14 03:14:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:14:22,767 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-14 03:14:22,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 03:14:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-14 03:14:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:14:22,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:14:22,768 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:14:22,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 03:14:22,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 03:14:22,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:14:22,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:14:22,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1138467652, now seen corresponding path program 1 times [2024-11-14 03:14:22,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:14:22,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806001518] [2024-11-14 03:14:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:14:22,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:14:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:14:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:14:24,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:14:24,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806001518] [2024-11-14 03:14:24,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806001518] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:14:24,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876031052] [2024-11-14 03:14:24,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:14:24,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:14:24,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:14:24,195 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:14:24,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:14:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:14:24,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 03:14:24,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:14:24,737 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 [2024-11-14 03:14:24,891 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_41| Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_41| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_41|)) |c_#memory_$Pointer$.base|) (<= (+ |v_node_create_~temp~0#1.base_41| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-14 03:14:24,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:14:24,902 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 [2024-11-14 03:14:25,140 INFO L349 Elim1Store]: treesize reduction 37, result has 33.9 percent of original size [2024-11-14 03:14:25,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 26 [2024-11-14 03:14:25,151 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 [2024-11-14 03:14:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2024-11-14 03:14:25,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:14:27,608 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (v_ArrVal_638 (Array Int Int)) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (|v_node_create_~temp~0#1.base_46| Int) (|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_46| v_ArrVal_638))) (let ((.cse1 (select .cse0 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse2 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (or (not (= (select (select (store .cse0 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse1 .cse2 |ULTIMATE.start_sll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= (select .cse1 .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_46| 1)))))) is different from false [2024-11-14 03:14:27,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876031052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:14:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [998763357] [2024-11-14 03:14:27,612 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:14:27,612 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:14:27,613 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:14:27,613 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:14:27,613 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:14:28,247 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 112 for LOIs [2024-11-14 03:14:28,382 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:14:40,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [998763357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:14:40,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:14:40,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16, 15] total 40 [2024-11-14 03:14:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257688262] [2024-11-14 03:14:40,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:14:40,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 03:14:40,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:14:40,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 03:14:40,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1592, Unknown=5, NotChecked=162, Total=1892 [2024-11-14 03:14:40,586 INFO L87 Difference]: Start difference. First operand 29 states and 36 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) [2024-11-14 03:14:42,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:14:45,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:14:48,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:14:50,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:14:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:14:51,576 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-14 03:14:51,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 03:14:51,576 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 [2024-11-14 03:14:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:14:51,577 INFO L225 Difference]: With dead ends: 32 [2024-11-14 03:14:51,577 INFO L226 Difference]: Without dead ends: 29 [2024-11-14 03:14:51,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=133, Invalid=1592, Unknown=5, NotChecked=162, Total=1892 [2024-11-14 03:14:51,578 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:14:51,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 5 Unknown, 0 Unchecked, 11.0s Time] [2024-11-14 03:14:51,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-14 03:14:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-14 03:14:51,586 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) [2024-11-14 03:14:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-14 03:14:51,587 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 27 [2024-11-14 03:14:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:14:51,588 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-14 03:14:51,588 INFO L472 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) [2024-11-14 03:14:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-14 03:14:51,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 03:14:51,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:14:51,589 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:14:51,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:14:51,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:14:51,789 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:14:51,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:14:51,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1099173737, now seen corresponding path program 1 times [2024-11-14 03:14:51,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:14:51,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905832346] [2024-11-14 03:14:51,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:14:51,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:14:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:14:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:14:53,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:14:53,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905832346] [2024-11-14 03:14:53,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905832346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:14:53,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006202495] [2024-11-14 03:14:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:14:53,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:14:53,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:14:53,503 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:14:53,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:14:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:14:53,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-14 03:14:53,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:14:54,037 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 [2024-11-14 03:14:54,396 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 15 treesize of output 1 [2024-11-14 03:14:54,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:14:54,760 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 31 treesize of output 18 [2024-11-14 03:14:54,770 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 [2024-11-14 03:14:54,779 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 [2024-11-14 03:14:55,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:14:55,146 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 03:14:55,146 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 39 treesize of output 36 [2024-11-14 03:14:55,192 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 03:14:55,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 03:14:55,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:14:55,204 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 16 treesize of output 11 [2024-11-14 03:14:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:14:55,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:14:56,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006202495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:14:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [237407300] [2024-11-14 03:14:56,534 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:14:56,534 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:14:56,534 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:14:56,534 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:14:56,534 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:14:57,209 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 112 for LOIs [2024-11-14 03:14:57,327 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:15:10,672 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1486#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_30| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_29| Int)) (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~ptr~0#1.base_30|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_29| 4)) |ULTIMATE.start_main_~temp~2#1.base|) (or (not (= |v_ULTIMATE.start_main_~ptr~0#1.base_30| 0)) (not (= |v_ULTIMATE.start_main_~ptr~0#1.offset_29| 0))) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~ptr~0#1.base_30|) |v_ULTIMATE.start_main_~ptr~0#1.offset_29|) 1)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_30|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_29| 4)) |ULTIMATE.start_main_~temp~2#1.offset|))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:15:10,672 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:15:10,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:15:10,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2024-11-14 03:15:10,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105212243] [2024-11-14 03:15:10,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:15:10,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 03:15:10,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:15:10,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 03:15:10,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2579, Unknown=3, NotChecked=0, Total=2756 [2024-11-14 03:15:10,674 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 33 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:15:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:15:13,324 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-14 03:15:13,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 03:15:13,325 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 6 states have call successors, (6), 2 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 [2024-11-14 03:15:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:15:13,326 INFO L225 Difference]: With dead ends: 35 [2024-11-14 03:15:13,326 INFO L226 Difference]: Without dead ends: 26 [2024-11-14 03:15:13,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=242, Invalid=3415, Unknown=3, NotChecked=0, Total=3660 [2024-11-14 03:15:13,328 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:15:13,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 210 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 03:15:13,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-14 03:15:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-14 03:15:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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) [2024-11-14 03:15:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-14 03:15:13,339 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 29 [2024-11-14 03:15:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:15:13,339 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-14 03:15:13,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:15:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-14 03:15:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 03:15:13,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:15:13,340 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:15:13,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 03:15:13,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:15:13,541 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:15:13,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:15:13,541 INFO L85 PathProgramCache]: Analyzing trace with hash 653572873, now seen corresponding path program 1 times [2024-11-14 03:15:13,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:15:13,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749631671] [2024-11-14 03:15:13,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:15:13,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:15:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:15:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:15:17,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:15:17,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749631671] [2024-11-14 03:15:17,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749631671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:15:17,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163793640] [2024-11-14 03:15:17,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:15:17,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:15:17,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:15:17,743 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:15:17,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 03:15:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:15:17,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-14 03:15:17,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:15:19,017 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 [2024-11-14 03:15:19,267 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 [2024-11-14 03:15:19,287 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 [2024-11-14 03:15:19,923 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 23 treesize of output 3 [2024-11-14 03:15:19,972 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 23 treesize of output 11 [2024-11-14 03:15:20,729 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 [2024-11-14 03:15:20,739 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 [2024-11-14 03:15:20,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:15:20,755 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 [2024-11-14 03:15:20,765 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 [2024-11-14 03:15:21,080 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 9 treesize of output 12 [2024-11-14 03:15:25,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:15:25,617 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 57 treesize of output 44 [2024-11-14 03:15:25,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:15:25,654 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 [2024-11-14 03:15:25,709 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 03:15:25,709 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 15 treesize of output 15 [2024-11-14 03:15:25,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:15:25,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:15:25,734 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 27 treesize of output 25 [2024-11-14 03:15:29,435 INFO L349 Elim1Store]: treesize reduction 81, result has 22.9 percent of original size [2024-11-14 03:15:29,436 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 225 treesize of output 132 [2024-11-14 03:15:29,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:15:29,514 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 25 [2024-11-14 03:15:29,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:15:29,710 INFO L349 Elim1Store]: treesize reduction 142, result has 11.8 percent of original size [2024-11-14 03:15:29,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 48 [2024-11-14 03:15:30,919 INFO L349 Elim1Store]: treesize reduction 12, result has 80.3 percent of original size [2024-11-14 03:15:30,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 200 treesize of output 162 [2024-11-14 03:15:30,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:15:31,331 INFO L349 Elim1Store]: treesize reduction 12, result has 80.3 percent of original size [2024-11-14 03:15:31,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 116 [2024-11-14 03:15:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:15:50,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:15:56,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:15:56,727 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 1 case distinctions, treesize of input 216 treesize of output 216 [2024-11-14 03:15:57,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163793640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:15:57,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1857879117] [2024-11-14 03:15:57,462 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:15:57,462 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:15:57,463 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:15:57,463 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:15:57,463 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:15:58,404 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 129 for LOIs [2024-11-14 03:15:58,523 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:16:20,087 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1774#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_35| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_35| Int) (|v_#memory_$Pointer$.offset_120| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_124| (Array Int (Array Int Int))) (|v_#memory_int_163| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_120| |v_ULTIMATE.start_sll_append_~last~0#1.base_35| (store (select |v_#memory_$Pointer$.offset_120| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4) 0))) (= (select (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4)) 0) (= (select (select |v_#memory_$Pointer$.offset_120| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4)) 0) (= |#memory_int| (store |v_#memory_int_163| |v_ULTIMATE.start_sll_append_~last~0#1.base_35| (store (select |v_#memory_int_163| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4) (select (select |#memory_int| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4))))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_sll_append_~last~0#1.base_35| (store (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4))))))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) |ULTIMATE.start_main_~temp~2#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:16:20,087 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:16:20,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:16:20,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2024-11-14 03:16:20,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831568912] [2024-11-14 03:16:20,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:16:20,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-14 03:16:20,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:20,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-14 03:16:20,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=4191, Unknown=16, NotChecked=0, Total=4422 [2024-11-14 03:16:20,090 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 35 states have internal predecessors, (45), 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) [2024-11-14 03:16:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:29,053 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-11-14 03:16:29,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 03:16:29,054 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 36 states have (on average 1.25) internal successors, (45), 35 states have internal predecessors, (45), 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 29 [2024-11-14 03:16:29,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:29,055 INFO L225 Difference]: With dead ends: 40 [2024-11-14 03:16:29,055 INFO L226 Difference]: Without dead ends: 37 [2024-11-14 03:16:29,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=340, Invalid=6448, Unknown=18, NotChecked=0, Total=6806 [2024-11-14 03:16:29,058 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:29,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 195 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-14 03:16:29,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-14 03:16:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2024-11-14 03:16:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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) [2024-11-14 03:16:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-14 03:16:29,071 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 29 [2024-11-14 03:16:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:29,071 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-14 03:16:29,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 36 states have (on average 1.25) internal successors, (45), 35 states have internal predecessors, (45), 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) [2024-11-14 03:16:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-14 03:16:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:16:29,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:29,073 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:29,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 03:16:29,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:29,273 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:16:29,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:29,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1018341028, now seen corresponding path program 1 times [2024-11-14 03:16:29,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:29,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215309427] [2024-11-14 03:16:29,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:29,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:16:36,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:36,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215309427] [2024-11-14 03:16:36,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215309427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:36,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788705856] [2024-11-14 03:16:36,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:36,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:36,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:36,642 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:36,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:16:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:36,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 134 conjuncts are in the unsatisfiable core [2024-11-14 03:16:36,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:37,167 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 [2024-11-14 03:16:37,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-14 03:16:37,984 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 23 treesize of output 11 [2024-11-14 03:16:39,089 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:16:39,089 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 03:16:39,241 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:16:39,241 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 [2024-11-14 03:16:39,704 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 [2024-11-14 03:16:39,794 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 [2024-11-14 03:16:39,819 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 15 treesize of output 1 [2024-11-14 03:16:40,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:16:40,744 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 73 treesize of output 36 [2024-11-14 03:16:40,756 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 [2024-11-14 03:16:40,767 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 [2024-11-14 03:16:40,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:16:40,787 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 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 03:16:53,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:16:53,134 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 03:16:53,134 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 81 treesize of output 62 [2024-11-14 03:16:53,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:16:53,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:16:53,239 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:16:53,240 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 03:16:53,466 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 03:16:53,466 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 [2024-11-14 03:16:53,487 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 24 treesize of output 19 [2024-11-14 03:16:59,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:16:59,449 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-11-14 03:16:59,449 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 4 case distinctions, treesize of input 183 treesize of output 93 [2024-11-14 03:16:59,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:16:59,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:16:59,523 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 1 case distinctions, treesize of input 48 treesize of output 42 [2024-11-14 03:16:59,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:16:59,575 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 59 treesize of output 19 [2024-11-14 03:17:01,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:01,630 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 79 treesize of output 38 [2024-11-14 03:17:01,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:17:01,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:01,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 24 treesize of output 10 [2024-11-14 03:17:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:17:03,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:17:14,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788705856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:17:14,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1995988984] [2024-11-14 03:17:14,403 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:17:14,403 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:17:14,404 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:17:14,404 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:17:14,404 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:17:15,479 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 129 for LOIs [2024-11-14 03:17:15,603 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:17:49,115 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2112#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_40| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (and (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~ptr~0#1.base_40|) |v_ULTIMATE.start_main_~ptr~0#1.offset_39|) 1)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_40|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~ptr~0#1.base_40|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4)) |ULTIMATE.start_main_~temp~2#1.base|) (or (not (= |v_ULTIMATE.start_main_~ptr~0#1.base_40| 0)) (not (= |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 0))))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:17:49,115 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:17:49,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:17:49,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 50 [2024-11-14 03:17:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488484530] [2024-11-14 03:17:49,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:17:49,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-14 03:17:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:17:49,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-14 03:17:49,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=5263, Unknown=31, NotChecked=0, Total=5550 [2024-11-14 03:17:49,118 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 50 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 41 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) [2024-11-14 03:18:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:12,047 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-14 03:18:12,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 03:18:12,048 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 41 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 [2024-11-14 03:18:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:12,049 INFO L225 Difference]: With dead ends: 42 [2024-11-14 03:18:12,049 INFO L226 Difference]: Without dead ends: 40 [2024-11-14 03:18:12,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 83.4s TimeCoverageRelationStatistics Valid=436, Invalid=8275, Unknown=31, NotChecked=0, Total=8742 [2024-11-14 03:18:12,051 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:12,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 209 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-11-14 03:18:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-14 03:18:12,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2024-11-14 03:18:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 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) [2024-11-14 03:18:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-14 03:18:12,064 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 31 [2024-11-14 03:18:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:12,064 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-14 03:18:12,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 41 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) [2024-11-14 03:18:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-14 03:18:12,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:18:12,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:12,065 INFO L215 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] [2024-11-14 03:18:12,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 03:18:12,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:18:12,268 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:18:12,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:12,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1018393170, now seen corresponding path program 1 times [2024-11-14 03:18:12,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:18:12,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743391618] [2024-11-14 03:18:12,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:12,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:18:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:18:21,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:18:21,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743391618] [2024-11-14 03:18:21,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743391618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:18:21,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995618719] [2024-11-14 03:18:21,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:21,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:18:21,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:18:21,049 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:18:21,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 03:18:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:21,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-14 03:18:21,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:18:23,324 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 [2024-11-14 03:18:25,107 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 15 treesize of output 1 [2024-11-14 03:18:26,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:18:26,496 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 30 treesize of output 29 [2024-11-14 03:18:26,519 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 [2024-11-14 03:18:26,541 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 [2024-11-14 03:18:30,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:18:30,456 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 03:18:30,457 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 38 treesize of output 35 [2024-11-14 03:18:30,576 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 03:18:30,576 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 15 treesize of output 15 [2024-11-14 03:18:30,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:18:30,611 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 16 treesize of output 11 [2024-11-14 03:18:33,614 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-14 03:18:33,614 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-14 03:18:34,215 INFO L349 Elim1Store]: treesize reduction 82, result has 29.9 percent of original size [2024-11-14 03:18:34,215 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 49 [2024-11-14 03:18:36,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:18:36,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 193 [2024-11-14 03:18:38,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:18:38,686 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 32 treesize of output 27 [2024-11-14 03:18:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:18:38,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:18:44,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995618719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:18:44,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [675345590] [2024-11-14 03:18:44,493 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 03:18:44,493 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:18:44,493 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:18:44,493 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:18:44,493 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:18:45,345 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 112 for LOIs [2024-11-14 03:18:45,499 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:19:10,699 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2451#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:19:10,699 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:19:10,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:19:10,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 41 [2024-11-14 03:19:10,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337707289] [2024-11-14 03:19:10,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:19:10,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-14 03:19:10,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:19:10,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-14 03:19:10,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3813, Unknown=6, NotChecked=0, Total=4032 [2024-11-14 03:19:10,702 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 41 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 03:19:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:26,702 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-14 03:19:26,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 03:19:26,703 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 3 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 31 [2024-11-14 03:19:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:26,704 INFO L225 Difference]: With dead ends: 42 [2024-11-14 03:19:26,704 INFO L226 Difference]: Without dead ends: 39 [2024-11-14 03:19:26,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 57.6s TimeCoverageRelationStatistics Valid=426, Invalid=6708, Unknown=6, NotChecked=0, Total=7140 [2024-11-14 03:19:26,706 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 53 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:26,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 209 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-14 03:19:26,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-14 03:19:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-14 03:19:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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) [2024-11-14 03:19:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-14 03:19:26,724 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 31 [2024-11-14 03:19:26,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:26,724 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-14 03:19:26,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 03:19:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-14 03:19:26,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:19:26,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:26,725 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:19:26,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 03:19:26,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:19:26,926 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:19:26,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:26,926 INFO L85 PathProgramCache]: Analyzing trace with hash 572740164, now seen corresponding path program 2 times [2024-11-14 03:19:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:19:26,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279640872] [2024-11-14 03:19:26,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:26,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:19:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:19:38,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:19:38,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279640872] [2024-11-14 03:19:38,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279640872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:19:38,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402136237] [2024-11-14 03:19:38,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:19:38,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:19:38,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:19:38,827 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:19:38,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 03:19:39,030 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:19:39,030 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:19:39,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-14 03:19:39,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:39,878 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 [2024-11-14 03:19:41,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2024-11-14 03:19:43,037 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 [2024-11-14 03:19:43,843 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:19:43,843 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 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-14 03:19:43,900 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 [2024-11-14 03:19:44,216 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:19:44,216 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 [2024-11-14 03:19:44,989 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 15 treesize of output 1 [2024-11-14 03:19:45,150 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 33 treesize of output 21 [2024-11-14 03:19:45,190 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 23 treesize of output 11 [2024-11-14 03:19:47,068 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-14 03:19:47,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 53 [2024-11-14 03:19:47,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:19:47,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-11-14 03:19:47,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-14 03:19:47,154 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 [2024-11-14 03:19:48,001 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_95| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_95| 1) |c_#StackHeapBarrier|) (= |c_#memory_int| (store |c_old(#memory_int)| |v_node_create_~temp~0#1.base_95| (select |c_#memory_int| |v_node_create_~temp~0#1.base_95|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_95| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_95|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_95|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_95| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_95|))))) is different from true [2024-11-14 03:19:48,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:19:48,261 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-14 03:19:48,262 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 91 treesize of output 76 [2024-11-14 03:19:48,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:19:48,297 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 [2024-11-14 03:19:48,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:19:48,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:19:48,385 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:19:48,385 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 1 case distinctions, treesize of input 41 treesize of output 39 [2024-11-14 03:19:48,612 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 03:19:48,613 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 [2024-11-14 03:19:55,117 INFO L349 Elim1Store]: treesize reduction 60, result has 27.7 percent of original size [2024-11-14 03:19:55,118 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 78 treesize of output 81 [2024-11-14 03:19:55,157 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 20 treesize of output 15 [2024-11-14 03:19:55,220 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:19:55,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 31 treesize of output 29 [2024-11-14 03:19:55,365 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-14 03:19:55,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2024-11-14 03:19:56,365 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-14 03:19:56,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 50 [2024-11-14 03:19:56,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:19:56,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-11-14 03:19:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-14 03:19:57,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:06,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402136237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:20:06,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2056321531] [2024-11-14 03:20:06,600 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:20:06,601 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:20:06,601 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:20:06,601 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:20:06,601 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:20:07,358 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 112 for LOIs [2024-11-14 03:20:07,477 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:20:35,834 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2807#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (exists ((|v_#memory_$Pointer$.base_174| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_62| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_63| Int) (|v_#memory_int_233| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_167| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.base_174| |v_ULTIMATE.start_sll_append_~last~0#1.base_63|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_62| 4)) 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_174| |v_ULTIMATE.start_sll_append_~last~0#1.base_63| (store (select |v_#memory_$Pointer$.base_174| |v_ULTIMATE.start_sll_append_~last~0#1.base_63|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_62| 4) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_63|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_62| 4))))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_167| |v_ULTIMATE.start_sll_append_~last~0#1.base_63| (store (select |v_#memory_$Pointer$.offset_167| |v_ULTIMATE.start_sll_append_~last~0#1.base_63|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_62| 4) 0))) (= |#memory_int| (store |v_#memory_int_233| |v_ULTIMATE.start_sll_append_~last~0#1.base_63| (store (select |v_#memory_int_233| |v_ULTIMATE.start_sll_append_~last~0#1.base_63|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_62| 4) (select (select |#memory_int| |v_ULTIMATE.start_sll_append_~last~0#1.base_63|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_62| 4))))) (= (select (select |v_#memory_$Pointer$.offset_167| |v_ULTIMATE.start_sll_append_~last~0#1.base_63|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_62| 4)) 0))) (= |ULTIMATE.start_main_~count~0#1| 0) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) |ULTIMATE.start_main_~temp~2#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 03:20:35,834 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:20:35,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:20:35,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 48 [2024-11-14 03:20:35,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263475190] [2024-11-14 03:20:35,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:20:35,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-14 03:20:35,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:20:35,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-14 03:20:35,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=4518, Unknown=85, NotChecked=136, Total=4970 [2024-11-14 03:20:35,837 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 48 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 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) [2024-11-14 03:20:57,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:57,197 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2024-11-14 03:20:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 03:20:57,198 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 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 [2024-11-14 03:20:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:57,199 INFO L225 Difference]: With dead ends: 76 [2024-11-14 03:20:57,199 INFO L226 Difference]: Without dead ends: 74 [2024-11-14 03:20:57,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 67.4s TimeCoverageRelationStatistics Valid=350, Invalid=6865, Unknown=99, NotChecked=168, Total=7482 [2024-11-14 03:20:57,201 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:57,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 318 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1121 Invalid, 0 Unknown, 71 Unchecked, 10.4s Time] [2024-11-14 03:20:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-14 03:20:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2024-11-14 03:20:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 03:20:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2024-11-14 03:20:57,228 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 31 [2024-11-14 03:20:57,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:57,228 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-11-14 03:20:57,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 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) [2024-11-14 03:20:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2024-11-14 03:20:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:20:57,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:57,229 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:57,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 03:20:57,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:20:57,430 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:20:57,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash -626780289, now seen corresponding path program 2 times [2024-11-14 03:20:57,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:20:57,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417662808] [2024-11-14 03:20:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:57,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:20:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:10,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:21:10,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417662808] [2024-11-14 03:21:10,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417662808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:21:10,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075229755] [2024-11-14 03:21:10,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:21:10,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:21:10,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:21:10,123 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:21:10,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3990d99c-a2da-4f3b-b06e-43c3f261498c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 03:21:10,443 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:21:10,443 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:21:10,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 163 conjuncts are in the unsatisfiable core [2024-11-14 03:21:10,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:11,240 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 [2024-11-14 03:21:13,226 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 [2024-11-14 03:21:13,265 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 [2024-11-14 03:21:14,308 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 [2024-11-14 03:21:14,332 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 [2024-11-14 03:21:14,355 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 [2024-11-14 03:21:16,004 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:21:16,004 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 [2024-11-14 03:21:16,136 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 16 treesize of output 11 [2024-11-14 03:21:16,233 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 16 treesize of output 11 [2024-11-14 03:21:17,308 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 23 treesize of output 22 [2024-11-14 03:21:17,408 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 27 treesize of output 15 [2024-11-14 03:21:19,997 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:21:19,997 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 98 treesize of output 52 [2024-11-14 03:21:20,021 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 [2024-11-14 03:21:20,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:20,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:20,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 03:21:20,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-14 03:21:21,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:21,421 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-14 03:21:21,422 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 106 treesize of output 83 [2024-11-14 03:21:21,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:21,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:21,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:21,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:21,860 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-14 03:21:21,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 63 [2024-11-14 03:21:22,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:22,245 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 03:21:22,245 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 [2024-11-14 03:21:30,504 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-14 03:21:30,505 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 8 case distinctions, treesize of input 137 treesize of output 85 [2024-11-14 03:21:30,734 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-14 03:21:30,734 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 20 treesize of output 23 [2024-11-14 03:21:30,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:30,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:30,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:30,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:30,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:30,939 INFO L349 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2024-11-14 03:21:30,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 53 [2024-11-14 03:21:52,012 INFO L349 Elim1Store]: treesize reduction 40, result has 87.2 percent of original size [2024-11-14 03:21:52,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 18 new quantified variables, introduced 66 case distinctions, treesize of input 456 treesize of output 490 [2024-11-14 03:21:53,190 INFO L224 Elim1Store]: Index analysis took 1130 ms [2024-11-14 03:21:58,845 WARN L286 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 181 DAG size of output: 161 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 03:21:58,845 INFO L349 Elim1Store]: treesize reduction 40, result has 87.2 percent of original size [2024-11-14 03:21:58,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 204 treesize of output 428 [2024-11-14 03:27:40,230 INFO L349 Elim1Store]: treesize reduction 125, result has 68.2 percent of original size [2024-11-14 03:27:40,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 128 treesize of output 355 [2024-11-14 03:27:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:27:41,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:28:02,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:28:02,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 2645 treesize of output 2622 [2024-11-14 03:28:04,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:28:04,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5298 treesize of output 10644 [2024-11-14 03:28:04,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:28:04,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3521 treesize of output 3526 [2024-11-14 03:28:04,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:28:04,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3079 treesize of output 3084