./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.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_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/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_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/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_e6f9065d-3afb-4557-9183-571aba4345da/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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:35:48,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:35:48,128 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 04:35:48,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:35:48,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:35:48,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:35:48,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:35:48,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:35:48,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:35:48,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:35:48,159 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:35:48,160 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:35:48,160 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:35:48,160 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:35:48,160 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:35:48,160 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:35:48,160 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:35:48,161 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:35:48,161 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:35:48,161 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:35:48,161 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:35:48,161 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:35:48,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:35:48,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:35:48,162 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:35:48,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:35:48,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:35:48,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:35:48,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:35:48,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:35:48,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:35:48,163 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:35:48,163 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:35:48,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:35:48,163 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:35:48,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:35:48,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:35:48,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:35:48,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:35:48,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:35:48,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:35:48,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:35:48,164 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:35:48,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:35:48,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:35:48,165 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:35:48,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:35:48,165 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_e6f9065d-3afb-4557-9183-571aba4345da/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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2024-11-14 04:35:48,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:35:48,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:35:48,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:35:48,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:35:48,486 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:35:48,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i Unable to find full path for "g++" [2024-11-14 04:35:50,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:35:50,742 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:35:50,743 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-14 04:35:50,764 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/data/4704f024a/b8caae17e5ad459994d3641d0e1a7158/FLAG0cb876f89 [2024-11-14 04:35:50,782 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/data/4704f024a/b8caae17e5ad459994d3641d0e1a7158 [2024-11-14 04:35:50,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:35:50,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:35:50,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:35:50,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:35:50,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:35:50,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:35:50" (1/1) ... [2024-11-14 04:35:50,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dcd0de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:50, skipping insertion in model container [2024-11-14 04:35:50,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:35:50" (1/1) ... [2024-11-14 04:35:50,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:35:51,298 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_e6f9065d-3afb-4557-9183-571aba4345da/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2024-11-14 04:35:51,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:35:51,370 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:35:51,425 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_e6f9065d-3afb-4557-9183-571aba4345da/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2024-11-14 04:35:51,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:35:51,498 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:35:51,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:51 WrapperNode [2024-11-14 04:35:51,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:35:51,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:35:51,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:35:51,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:35:51,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:51" (1/1) ... [2024-11-14 04:35:51,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:51" (1/1) ... [2024-11-14 04:35:51,551 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 114 [2024-11-14 04:35:51,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:35:51,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:35:51,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:35:51,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:35:51,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:51" (1/1) ... [2024-11-14 04:35:51,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:51" (1/1) ... [2024-11-14 04:35:51,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:51" (1/1) ... [2024-11-14 04:35:51,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:51" (1/1) ... [2024-11-14 04:35:51,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:51" (1/1) ... [2024-11-14 04:35:51,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:51" (1/1) ... [2024-11-14 04:35:51,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:51" (1/1) ... [2024-11-14 04:35:51,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:51" (1/1) ... [2024-11-14 04:35:51,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:35:51,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:35:51,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:35:51,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:35:51,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:51" (1/1) ... [2024-11-14 04:35:51,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:35:51,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:35:51,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:35:51,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:35:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:35:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-11-14 04:35:51,651 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-11-14 04:35:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:35:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 04:35:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-11-14 04:35:51,652 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-11-14 04:35:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:35:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-14 04:35:51,652 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-14 04:35:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:35:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:35:51,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:35:51,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:35:51,653 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-11-14 04:35:51,653 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-11-14 04:35:51,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:35:51,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:35:51,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:35:51,835 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:35:51,837 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:35:52,363 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-14 04:35:52,367 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:35:52,467 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:35:52,468 INFO L316 CfgBuilder]: Removed 41 assume(true) statements. [2024-11-14 04:35:52,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:35:52 BoogieIcfgContainer [2024-11-14 04:35:52,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:35:52,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:35:52,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:35:52,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:35:52,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:35:50" (1/3) ... [2024-11-14 04:35:52,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71978529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:35:52, skipping insertion in model container [2024-11-14 04:35:52,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:51" (2/3) ... [2024-11-14 04:35:52,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71978529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:35:52, skipping insertion in model container [2024-11-14 04:35:52,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:35:52" (3/3) ... [2024-11-14 04:35:52,485 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2024-11-14 04:35:52,507 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:35:52,511 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG bubble_sort_linux-2.i that has 5 procedures, 105 locations, 1 initial locations, 23 loop locations, and 1 error locations. [2024-11-14 04:35:52,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:35:52,630 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;@4a45e3c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:35:52,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:35:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 76 states have (on average 1.8421052631578947) internal successors, (140), 95 states have internal predecessors, (140), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-14 04:35:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 04:35:52,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:35:52,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:35:52,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:52,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2104238593, now seen corresponding path program 1 times [2024-11-14 04:35:52,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:35:52,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335451951] [2024-11-14 04:35:52,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:52,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:52,873 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 04:35:52,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:35:52,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335451951] [2024-11-14 04:35:52,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335451951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:35:52,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:35:52,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:35:52,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043624082] [2024-11-14 04:35:52,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:35:52,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:35:52,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:35:52,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:35:52,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:35:52,911 INFO L87 Difference]: Start difference. First operand has 105 states, 76 states have (on average 1.8421052631578947) internal successors, (140), 95 states have internal predecessors, (140), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:35:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:35:52,999 INFO L93 Difference]: Finished difference Result 206 states and 369 transitions. [2024-11-14 04:35:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:53,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-14 04:35:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:35:53,010 INFO L225 Difference]: With dead ends: 206 [2024-11-14 04:35:53,011 INFO L226 Difference]: Without dead ends: 97 [2024-11-14 04:35:53,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:35:53,022 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:35:53,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:35:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-14 04:35:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-14 04:35:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 87 states have internal predecessors, (92), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 04:35:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-11-14 04:35:53,076 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 8 [2024-11-14 04:35:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:35:53,076 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-11-14 04:35:53,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:35:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-11-14 04:35:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 04:35:53,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:35:53,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:35:53,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:35:53,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:53,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:53,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1225052673, now seen corresponding path program 1 times [2024-11-14 04:35:53,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:35:53,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814879803] [2024-11-14 04:35:53,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:53,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:53,572 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 04:35:53,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:35:53,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814879803] [2024-11-14 04:35:53,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814879803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:35:53,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:35:53,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:35:53,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58623052] [2024-11-14 04:35:53,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:35:53,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:35:53,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:35:53,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:35:53,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:35:53,576 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:35:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:35:53,936 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2024-11-14 04:35:53,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:35:53,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-14 04:35:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:35:53,941 INFO L225 Difference]: With dead ends: 99 [2024-11-14 04:35:53,941 INFO L226 Difference]: Without dead ends: 96 [2024-11-14 04:35:53,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:35:53,942 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 168 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:35:53,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 202 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:35:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-14 04:35:53,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-14 04:35:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 04:35:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2024-11-14 04:35:53,976 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 15 [2024-11-14 04:35:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:35:53,977 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2024-11-14 04:35:53,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:35:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2024-11-14 04:35:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 04:35:53,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:35:53,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:35:53,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:35:53,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:53,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1481551645, now seen corresponding path program 1 times [2024-11-14 04:35:53,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:35:53,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840182551] [2024-11-14 04:35:53,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:54,977 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 04:35:54,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:35:54,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840182551] [2024-11-14 04:35:54,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840182551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:35:54,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:35:54,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 04:35:54,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908150027] [2024-11-14 04:35:54,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:35:54,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 04:35:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:35:54,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 04:35:54,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:35:54,983 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:35:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:35:55,980 INFO L93 Difference]: Finished difference Result 181 states and 217 transitions. [2024-11-14 04:35:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 04:35:55,981 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-14 04:35:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:35:55,983 INFO L225 Difference]: With dead ends: 181 [2024-11-14 04:35:55,983 INFO L226 Difference]: Without dead ends: 175 [2024-11-14 04:35:55,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-14 04:35:55,989 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 342 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:35:55,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 501 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 04:35:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-14 04:35:56,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 159. [2024-11-14 04:35:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 145 states have internal predecessors, (166), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-14 04:35:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 196 transitions. [2024-11-14 04:35:56,030 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 196 transitions. Word has length 18 [2024-11-14 04:35:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:35:56,030 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 196 transitions. [2024-11-14 04:35:56,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:35:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 196 transitions. [2024-11-14 04:35:56,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 04:35:56,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:35:56,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:35:56,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:35:56,032 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:56,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2081231252, now seen corresponding path program 1 times [2024-11-14 04:35:56,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:35:56,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80711199] [2024-11-14 04:35:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:56,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:57,238 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 04:35:57,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:35:57,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80711199] [2024-11-14 04:35:57,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80711199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:35:57,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:35:57,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 04:35:57,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966560273] [2024-11-14 04:35:57,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:35:57,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 04:35:57,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:35:57,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 04:35:57,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:35:57,241 INFO L87 Difference]: Start difference. First operand 159 states and 196 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:35:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:35:58,597 INFO L93 Difference]: Finished difference Result 253 states and 308 transitions. [2024-11-14 04:35:58,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 04:35:58,598 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-14 04:35:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:35:58,600 INFO L225 Difference]: With dead ends: 253 [2024-11-14 04:35:58,600 INFO L226 Difference]: Without dead ends: 250 [2024-11-14 04:35:58,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-14 04:35:58,601 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 296 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:35:58,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 152 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 04:35:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-14 04:35:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 234. [2024-11-14 04:35:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.2613065326633166) internal successors, (251), 214 states have internal predecessors, (251), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:35:58,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2024-11-14 04:35:58,663 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 21 [2024-11-14 04:35:58,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:35:58,664 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2024-11-14 04:35:58,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:35:58,664 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2024-11-14 04:35:58,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 04:35:58,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:35:58,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:35:58,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:35:58,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:58,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:58,666 INFO L85 PathProgramCache]: Analyzing trace with hash -58134989, now seen corresponding path program 1 times [2024-11-14 04:35:58,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:35:58,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230078372] [2024-11-14 04:35:58,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:58,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:59,508 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 04:35:59,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:35:59,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230078372] [2024-11-14 04:35:59,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230078372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:35:59,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:35:59,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 04:35:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388503309] [2024-11-14 04:35:59,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:35:59,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 04:35:59,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:35:59,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 04:35:59,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:35:59,510 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:36:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:36:00,883 INFO L93 Difference]: Finished difference Result 252 states and 306 transitions. [2024-11-14 04:36:00,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 04:36:00,884 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-14 04:36:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:36:00,885 INFO L225 Difference]: With dead ends: 252 [2024-11-14 04:36:00,886 INFO L226 Difference]: Without dead ends: 249 [2024-11-14 04:36:00,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-14 04:36:00,890 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 335 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:36:00,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 152 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 04:36:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-14 04:36:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 234. [2024-11-14 04:36:00,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.256281407035176) internal successors, (250), 214 states have internal predecessors, (250), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:36:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 289 transitions. [2024-11-14 04:36:00,950 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 289 transitions. Word has length 24 [2024-11-14 04:36:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:36:00,951 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 289 transitions. [2024-11-14 04:36:00,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:36:00,951 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 289 transitions. [2024-11-14 04:36:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 04:36:00,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:36:00,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:36:00,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:36:00,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:36:00,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:36:00,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1258040169, now seen corresponding path program 1 times [2024-11-14 04:36:00,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:36:00,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313552906] [2024-11-14 04:36:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:36:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:02,014 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 04:36:02,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:36:02,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313552906] [2024-11-14 04:36:02,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313552906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:36:02,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:36:02,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 04:36:02,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541196057] [2024-11-14 04:36:02,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:36:02,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 04:36:02,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:36:02,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 04:36:02,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-14 04:36:02,018 INFO L87 Difference]: Start difference. First operand 234 states and 289 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:36:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:36:03,504 INFO L93 Difference]: Finished difference Result 251 states and 304 transitions. [2024-11-14 04:36:03,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 04:36:03,505 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-14 04:36:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:36:03,507 INFO L225 Difference]: With dead ends: 251 [2024-11-14 04:36:03,507 INFO L226 Difference]: Without dead ends: 248 [2024-11-14 04:36:03,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-14 04:36:03,509 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 329 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:36:03,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 170 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 04:36:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-14 04:36:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 234. [2024-11-14 04:36:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.2512562814070352) internal successors, (249), 214 states have internal predecessors, (249), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:36:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 288 transitions. [2024-11-14 04:36:03,571 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 288 transitions. Word has length 27 [2024-11-14 04:36:03,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:36:03,571 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 288 transitions. [2024-11-14 04:36:03,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:36:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 288 transitions. [2024-11-14 04:36:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 04:36:03,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:36:03,573 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:36:03,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 04:36:03,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:36:03,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:36:03,574 INFO L85 PathProgramCache]: Analyzing trace with hash -594597425, now seen corresponding path program 1 times [2024-11-14 04:36:03,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:36:03,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793817869] [2024-11-14 04:36:03,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:03,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:36:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:36:05,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:36:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793817869] [2024-11-14 04:36:05,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793817869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:36:05,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167585537] [2024-11-14 04:36:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:05,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:36:05,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:36:05,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:36:05,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:36:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:05,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 04:36:05,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:36:05,365 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:36:05,366 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 16 treesize of output 15 [2024-11-14 04:36:05,407 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:36:05,408 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 16 treesize of output 15 [2024-11-14 04:36:05,453 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 04:36:05,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-14 04:36:05,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2024-11-14 04:36:05,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2024-11-14 04:36:05,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:05,960 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 14 [2024-11-14 04:36:05,967 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 0 case distinctions, treesize of input 22 treesize of output 22 [2024-11-14 04:36:06,099 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:36:06,099 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 28 treesize of output 23 [2024-11-14 04:36:06,126 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 04:36:06,127 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 11 treesize of output 11 [2024-11-14 04:36:06,244 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 94 treesize of output 82 [2024-11-14 04:36:06,261 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 99 treesize of output 87 [2024-11-14 04:36:06,633 INFO L349 Elim1Store]: treesize reduction 172, result has 15.7 percent of original size [2024-11-14 04:36:06,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 96 [2024-11-14 04:36:06,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:06,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:06,686 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-14 04:36:06,686 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 99 treesize of output 96 [2024-11-14 04:36:06,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2024-11-14 04:36:06,727 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 04:36:06,754 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 04:36:06,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:36:06,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 68 [2024-11-14 04:36:07,059 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-14 04:36:07,059 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 81 [2024-11-14 04:36:07,770 INFO L349 Elim1Store]: treesize reduction 78, result has 24.3 percent of original size [2024-11-14 04:36:07,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 87 treesize of output 52 [2024-11-14 04:36:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:36:07,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:36:08,262 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 104 treesize of output 92 [2024-11-14 04:36:08,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167585537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:36:08,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1732541934] [2024-11-14 04:36:08,498 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 04:36:08,499 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:36:08,502 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:36:08,508 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:36:08,508 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:36:15,190 INFO L197 IcfgInterpreter]: Interpreting procedure list_add with input of size 178 for LOIs [2024-11-14 04:36:15,254 INFO L197 IcfgInterpreter]: Interpreting procedure inspect with input of size 14 for LOIs [2024-11-14 04:36:15,304 INFO L197 IcfgInterpreter]: Interpreting procedure fail with input of size 26 for LOIs [2024-11-14 04:36:15,310 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:37:32,160 WARN L286 SmtUtils]: Spent 21.04s on a formula simplification that was a NOOP. DAG size: 347 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:37:42,349 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3789#(and (= (select (select |#memory_$Pointer$.base| 3) 4) 3) (<= 1 |#StackHeapBarrier|) (or (not (= (select (select |#memory_$Pointer$.base| 3) 0) 3)) (not (= (select (select |#memory_$Pointer$.offset| 3) 0) 0))) (= |~#gl_list~0.base| 3) (= (select (select |#memory_$Pointer$.offset| 3) 4) 0) (= |~#gl_list~0.offset| 0))' at error location [2024-11-14 04:37:42,349 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:37:42,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:37:42,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2024-11-14 04:37:42,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757117607] [2024-11-14 04:37:42,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:37:42,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 04:37:42,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:37:42,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 04:37:42,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2144, Unknown=28, NotChecked=0, Total=2352 [2024-11-14 04:37:42,353 INFO L87 Difference]: Start difference. First operand 234 states and 288 transitions. Second operand has 28 states, 20 states have (on average 2.2) internal successors, (44), 18 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 04:37:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:37:52,233 INFO L93 Difference]: Finished difference Result 358 states and 426 transitions. [2024-11-14 04:37:52,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-14 04:37:52,235 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 20 states have (on average 2.2) internal successors, (44), 18 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2024-11-14 04:37:52,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:37:52,238 INFO L225 Difference]: With dead ends: 358 [2024-11-14 04:37:52,239 INFO L226 Difference]: Without dead ends: 355 [2024-11-14 04:37:52,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 92.3s TimeCoverageRelationStatistics Valid=491, Invalid=4593, Unknown=28, NotChecked=0, Total=5112 [2024-11-14 04:37:52,243 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1749 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:37:52,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 292 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 2036 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-14 04:37:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-14 04:37:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 240. [2024-11-14 04:37:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 202 states have (on average 1.2425742574257426) internal successors, (251), 218 states have internal predecessors, (251), 29 states have call successors, (29), 10 states have call predecessors, (29), 8 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 04:37:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 292 transitions. [2024-11-14 04:37:52,311 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 292 transitions. Word has length 29 [2024-11-14 04:37:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:37:52,312 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 292 transitions. [2024-11-14 04:37:52,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 20 states have (on average 2.2) internal successors, (44), 18 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 04:37:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 292 transitions. [2024-11-14 04:37:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 04:37:52,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:37:52,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:37:52,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:37:52,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-14 04:37:52,515 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:37:52,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:37:52,516 INFO L85 PathProgramCache]: Analyzing trace with hash -606077280, now seen corresponding path program 1 times [2024-11-14 04:37:52,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:37:52,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889753540] [2024-11-14 04:37:52,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:37:52,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:37:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:37:53,981 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 04:37:53,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:37:53,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889753540] [2024-11-14 04:37:53,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889753540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:37:53,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:37:53,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 04:37:53,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396186819] [2024-11-14 04:37:53,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:37:53,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 04:37:53,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:37:53,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 04:37:53,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-14 04:37:53,983 INFO L87 Difference]: Start difference. First operand 240 states and 292 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:37:57,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:37:57,037 INFO L93 Difference]: Finished difference Result 255 states and 305 transitions. [2024-11-14 04:37:57,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 04:37:57,037 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-14 04:37:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:37:57,041 INFO L225 Difference]: With dead ends: 255 [2024-11-14 04:37:57,041 INFO L226 Difference]: Without dead ends: 252 [2024-11-14 04:37:57,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-14 04:37:57,042 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 322 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:37:57,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 167 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 04:37:57,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-14 04:37:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 240. [2024-11-14 04:37:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 202 states have (on average 1.2376237623762376) internal successors, (250), 218 states have internal predecessors, (250), 29 states have call successors, (29), 10 states have call predecessors, (29), 8 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 04:37:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions. [2024-11-14 04:37:57,119 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 30 [2024-11-14 04:37:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:37:57,119 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 291 transitions. [2024-11-14 04:37:57,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:37:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions. [2024-11-14 04:37:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 04:37:57,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:37:57,121 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:37:57,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 04:37:57,121 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:37:57,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:37:57,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1452551184, now seen corresponding path program 1 times [2024-11-14 04:37:57,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:37:57,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107948320] [2024-11-14 04:37:57,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:37:57,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:37:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:37:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:37:59,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:37:59,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107948320] [2024-11-14 04:37:59,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107948320] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:37:59,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009858444] [2024-11-14 04:37:59,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:37:59,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:37:59,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:37:59,280 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:37:59,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 04:37:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:37:59,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-14 04:37:59,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:37:59,581 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 04:37:59,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-14 04:37:59,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 04:37:59,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 04:38:00,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2024-11-14 04:38:00,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2024-11-14 04:38:00,490 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-11-14 04:38:00,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 [2024-11-14 04:38:00,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2024-11-14 04:38:00,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2024-11-14 04:38:00,615 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 0 case distinctions, treesize of input 43 treesize of output 24 [2024-11-14 04:38:00,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18 [2024-11-14 04:38:00,862 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 04:38:00,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 120 [2024-11-14 04:38:00,877 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 31 treesize of output 16 [2024-11-14 04:38:00,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2024-11-14 04:38:01,182 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 04:38:01,182 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 11 treesize of output 11 [2024-11-14 04:38:01,204 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 16 [2024-11-14 04:38:01,233 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 28 treesize of output 19 [2024-11-14 04:38:01,747 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2024-11-14 04:38:01,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 116 [2024-11-14 04:38:01,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:38:01,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:38:01,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:38:01,785 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 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-14 04:38:01,793 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 0 case distinctions, treesize of input 19 treesize of output 21 [2024-11-14 04:38:01,812 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 04:38:01,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:38:01,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:38:01,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:38:01,852 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 0 case distinctions, treesize of input 69 treesize of output 34 [2024-11-14 04:38:01,873 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 0 case distinctions, treesize of input 19 treesize of output 21 [2024-11-14 04:38:01,998 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 16 [2024-11-14 04:38:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:38:02,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:38:03,300 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_572 (Array Int Int))) (< 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_572) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4)))) is different from false [2024-11-14 04:38:03,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009858444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:38:03,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [30931523] [2024-11-14 04:38:03,699 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 04:38:03,699 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:38:03,700 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:38:03,700 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:38:03,700 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:38:09,614 INFO L197 IcfgInterpreter]: Interpreting procedure list_add with input of size 178 for LOIs [2024-11-14 04:38:09,658 INFO L197 IcfgInterpreter]: Interpreting procedure inspect with input of size 14 for LOIs [2024-11-14 04:38:09,709 INFO L197 IcfgInterpreter]: Interpreting procedure fail with input of size 26 for LOIs [2024-11-14 04:38:09,714 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:39:31,122 WARN L286 SmtUtils]: Spent 23.06s on a formula simplification that was a NOOP. DAG size: 347 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:39:43,342 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5688#(and (<= 1 |#StackHeapBarrier|) (or (not (= (select (select |#memory_$Pointer$.base| 3) 0) 3)) (not (= (select (select |#memory_$Pointer$.offset| 3) 0) 0))) (= |~#gl_list~0.base| 3) (= (select (select |#memory_$Pointer$.base| 3) 4) 0) (= (select (select |#memory_$Pointer$.offset| 3) 4) 0) (= |~#gl_list~0.offset| 0))' at error location [2024-11-14 04:39:43,342 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:39:43,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:39:43,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-14 04:39:43,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838835774] [2024-11-14 04:39:43,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:39:43,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 04:39:43,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:39:43,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 04:39:43,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2340, Unknown=9, NotChecked=98, Total=2652 [2024-11-14 04:39:43,345 INFO L87 Difference]: Start difference. First operand 240 states and 291 transitions. Second operand has 29 states, 21 states have (on average 2.380952380952381) internal successors, (50), 18 states have internal predecessors, (50), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 04:39:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:39:54,905 INFO L93 Difference]: Finished difference Result 434 states and 518 transitions. [2024-11-14 04:39:54,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-14 04:39:54,906 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 21 states have (on average 2.380952380952381) internal successors, (50), 18 states have internal predecessors, (50), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2024-11-14 04:39:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:39:54,909 INFO L225 Difference]: With dead ends: 434 [2024-11-14 04:39:54,909 INFO L226 Difference]: Without dead ends: 431 [2024-11-14 04:39:54,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1561 ImplicationChecksByTransitivity, 100.3s TimeCoverageRelationStatistics Valid=620, Invalid=5381, Unknown=9, NotChecked=152, Total=6162 [2024-11-14 04:39:54,911 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1729 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 276 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:39:54,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 348 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 2261 Invalid, 34 Unknown, 0 Unchecked, 7.7s Time] [2024-11-14 04:39:54,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-14 04:39:54,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 321. [2024-11-14 04:39:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 275 states have (on average 1.2363636363636363) internal successors, (340), 291 states have internal predecessors, (340), 34 states have call successors, (34), 13 states have call predecessors, (34), 11 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 04:39:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 390 transitions. [2024-11-14 04:39:54,977 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 390 transitions. Word has length 32 [2024-11-14 04:39:54,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:39:54,977 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 390 transitions. [2024-11-14 04:39:54,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 21 states have (on average 2.380952380952381) internal successors, (50), 18 states have internal predecessors, (50), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 04:39:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 390 transitions. [2024-11-14 04:39:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 04:39:54,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:39:54,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:39:55,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 04:39:55,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-14 04:39:55,181 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:39:55,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:39:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash 192553447, now seen corresponding path program 1 times [2024-11-14 04:39:55,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:39:55,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297653937] [2024-11-14 04:39:55,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:39:55,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:39:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:39:56,435 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 04:39:56,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:39:56,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297653937] [2024-11-14 04:39:56,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297653937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:39:56,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:39:56,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 04:39:56,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90801491] [2024-11-14 04:39:56,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:39:56,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 04:39:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:39:56,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 04:39:56,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-14 04:39:56,438 INFO L87 Difference]: Start difference. First operand 321 states and 390 transitions. Second operand has 12 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:39:59,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:39:59,780 INFO L93 Difference]: Finished difference Result 335 states and 402 transitions. [2024-11-14 04:39:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 04:39:59,781 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-11-14 04:39:59,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:39:59,783 INFO L225 Difference]: With dead ends: 335 [2024-11-14 04:39:59,783 INFO L226 Difference]: Without dead ends: 332 [2024-11-14 04:39:59,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-11-14 04:39:59,784 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 393 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:39:59,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 169 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 04:39:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-14 04:39:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 321. [2024-11-14 04:39:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 275 states have (on average 1.2327272727272727) internal successors, (339), 291 states have internal predecessors, (339), 34 states have call successors, (34), 13 states have call predecessors, (34), 11 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 04:39:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 389 transitions. [2024-11-14 04:39:59,887 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 389 transitions. Word has length 33 [2024-11-14 04:39:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:39:59,887 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 389 transitions. [2024-11-14 04:39:59,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:39:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 389 transitions. [2024-11-14 04:39:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 04:39:59,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:39:59,889 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:39:59,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 04:39:59,889 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:39:59,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:39:59,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1387218502, now seen corresponding path program 1 times [2024-11-14 04:39:59,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:39:59,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882815876] [2024-11-14 04:39:59,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:39:59,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:39:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:40:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:40:03,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:40:03,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882815876] [2024-11-14 04:40:03,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882815876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:40:03,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719500544] [2024-11-14 04:40:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:40:03,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:40:03,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:40:03,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:40:03,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 04:40:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:40:03,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-14 04:40:03,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:40:03,821 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:40:03,822 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 16 treesize of output 15 [2024-11-14 04:40:03,914 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 04:40:03,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 04:40:03,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 04:40:04,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-14 04:40:04,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2024-11-14 04:40:04,764 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 0 case distinctions, treesize of input 43 treesize of output 24 [2024-11-14 04:40:04,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 18 [2024-11-14 04:40:04,811 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 11 treesize of output 15 [2024-11-14 04:40:04,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2024-11-14 04:40:04,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2024-11-14 04:40:05,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:40:05,158 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 25 treesize of output 12 [2024-11-14 04:40:05,174 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 04:40:05,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 57 [2024-11-14 04:40:05,229 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 0 case distinctions, treesize of input 19 treesize of output 21 [2024-11-14 04:40:05,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:40:05,741 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 04:40:05,742 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 74 treesize of output 53 [2024-11-14 04:40:05,830 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2024-11-14 04:40:05,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 25 treesize of output 29 [2024-11-14 04:40:05,893 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 16 [2024-11-14 04:40:06,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 108 [2024-11-14 04:40:06,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:40:06,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2024-11-14 04:40:06,792 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-14 04:40:06,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 192 treesize of output 169 [2024-11-14 04:40:06,875 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2024-11-14 04:40:06,876 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 231 treesize of output 169 [2024-11-14 04:40:06,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 86 [2024-11-14 04:40:06,949 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-11-14 04:40:06,950 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 136 treesize of output 102 [2024-11-14 04:40:06,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 86 [2024-11-14 04:40:07,016 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 0 case distinctions, treesize of input 76 treesize of output 34 [2024-11-14 04:40:07,032 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 0 case distinctions, treesize of input 19 treesize of output 21 [2024-11-14 04:40:07,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-14 04:40:07,340 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-14 04:40:07,340 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 90 [2024-11-14 04:40:07,359 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 42 treesize of output 30 [2024-11-14 04:40:08,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-14 04:40:09,337 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-11-14 04:40:09,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 84 treesize of output 34 [2024-11-14 04:40:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:40:09,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:40:09,948 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_795)) (.cse2 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse1 (select (select .cse0 |c_~#gl_list~0.base|) .cse2))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_796) |c_~#gl_list~0.base|) .cse2)) .cse1))))) is different from false [2024-11-14 04:40:10,369 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (not (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse3 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 8)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse7 (+ .cse4 4))) (let ((.cse0 (store (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse9 |c_~#gl_list~0.base| (store (select (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse3 .cse6) .cse5 |c_~#gl_list~0.base|)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_795)) (.cse8 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse1 (select (select .cse0 |c_~#gl_list~0.base|) .cse8))) (= (select (select .cse0 .cse1) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse6 (store (select |c_#memory_$Pointer$.offset| .cse6) .cse7 .cse3)))) (store .cse2 |c_~#gl_list~0.base| (store (select (store .cse2 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse2 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse3 .cse4) .cse5 |c_~#gl_list~0.offset|)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse3))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_796) |c_~#gl_list~0.base|) .cse8)) .cse1))))))) is different from false [2024-11-14 04:40:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719500544] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:40:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [119344916] [2024-11-14 04:40:10,378 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-14 04:40:10,379 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:40:10,379 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:40:10,379 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:40:10,379 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:40:16,088 INFO L197 IcfgInterpreter]: Interpreting procedure list_add with input of size 178 for LOIs [2024-11-14 04:40:16,133 INFO L197 IcfgInterpreter]: Interpreting procedure inspect with input of size 14 for LOIs [2024-11-14 04:40:16,205 INFO L197 IcfgInterpreter]: Interpreting procedure fail with input of size 38 for LOIs [2024-11-14 04:40:16,211 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:40:23,797 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= 3 |c_~#gl_list~0.base|) (= |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 0) (let ((.cse3 (<= (+ |c_ULTIMATE.start_gl_insert_~node~1#1.base| 1) |c_#StackHeapBarrier|)) (.cse7 (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 0))) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 12))) (or (exists ((|v_#memory_$Pointer$.offset_109| (Array Int (Array Int Int))) (|v_#memory_int_17| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_110| (Array Int (Array Int Int))) (|v_#memory_int_174| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_int_17| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (and (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_109| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_$Pointer$.offset_109| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 12 12))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_110| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_$Pointer$.base_110| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 12 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (= |c_#memory_int| (store |v_#memory_int_17| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store .cse0 12 .cse1))) (= |v_#memory_int_17| (store |v_#memory_int_174| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_int_174| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 12 (select .cse0 12)))) (let ((.cse5 (exists ((|v_#memory_$Pointer$.offset_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_109| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_173| (Array Int (Array Int Int)))) (let ((.cse22 (select (select |v_#memory_$Pointer$.offset_108| 3) 0))) (let ((.cse15 (select |v_#memory_int_46| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse18 (select (select |v_#memory_$Pointer$.base_109| 3) 0)) (.cse19 (+ .cse22 4))) (and (= |v_#memory_int_46| (store |v_#memory_int_47| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_int_47| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 4 (select .cse15 4)))) (= (let ((.cse16 (let ((.cse17 (store |v_#memory_$Pointer$.base_109| .cse18 (store (select |v_#memory_$Pointer$.base_109| .cse18) .cse19 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse17 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse17 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 4 .cse18) 8 3))))) (store .cse16 3 (store (select .cse16 3) 0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) |v_#memory_$Pointer$.base_110|) (= (store |v_#memory_int_173| .cse18 (store (select |v_#memory_int_173| .cse18) .cse19 (select (select |v_#memory_int_47| .cse18) .cse19))) |v_#memory_int_47|) (= |v_#memory_int_45| (store |v_#memory_int_46| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store .cse15 8 (select (select |v_#memory_int_45| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 8)))) (= (let ((.cse20 (let ((.cse21 (store |v_#memory_$Pointer$.offset_108| .cse18 (store (select |v_#memory_$Pointer$.offset_108| .cse18) .cse19 4)))) (store .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 4 .cse22) 8 0))))) (store .cse20 3 (store (select .cse20 3) 0 4))) |v_#memory_$Pointer$.offset_109|) (= (store |v_#memory_int_45| 3 (store (select |v_#memory_int_45| 3) 0 (select (select |v_#memory_int_174| 3) 0))) |v_#memory_int_174|)))))) (.cse6 (exists ((|v_#length_20| (Array Int Int))) (and (= |c_#length| (store |v_#length_20| |c_ULTIMATE.start_gl_insert_~node~1#1.base| 20)) (= (select |v_#length_20| 3) 8) (= 2 (select |v_#length_20| 1)) (= 22 (select |v_#length_20| 2))))) (.cse10 (exists ((|v_#valid_28| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_28| |c_ULTIMATE.start_gl_insert_~node~1#1.base| 1)) (= (select |v_#valid_28| 3) 1) (= (select |v_#valid_28| 1) 1) (= (select |v_#valid_28| 2) 1) (= (select |v_#valid_28| 0) 0) (= (select |v_#valid_28| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))))) (or (and (exists ((|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_#memory_$Pointer$.offset_107| 3))) (and (= (select .cse2 0) 0) (= (store |v_#memory_$Pointer$.offset_107| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_$Pointer$.offset_107| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_19| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_19|) (= (select .cse2 4) 0)))) .cse3 (exists ((|v_#memory_$Pointer$.base_108| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_$Pointer$.base_108| 3))) (and (= 3 (select .cse4 4)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| (store |v_#memory_$Pointer$.base_108| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_$Pointer$.base_108| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0)))) (= 3 (select .cse4 0))))) .cse5 .cse6 .cse7 (exists ((|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_#memory_int_172| 1)) (.cse9 (select (select |v_old(#memory_int)_AFTER_CALL_19| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) (and (= (select .cse8 0) 48) (<= 0 (+ .cse9 2147483648)) (= (select .cse8 1) 0) (<= .cse9 2147483647) (= |v_old(#memory_int)_AFTER_CALL_19| (store |v_#memory_int_172| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_int_172| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 .cse9)))))) .cse10) (and (exists ((|v_#memory_int_172| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_172| 1)) (.cse11 (select (select |v_old(#memory_int)_AFTER_CALL_20| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) (and (<= 0 (+ .cse11 2147483648)) (= (select .cse12 0) 48) (<= .cse11 2147483647) (= (select .cse12 1) 0) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_172| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_int_172| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 .cse11)))))) (exists ((|v_#memory_$Pointer$.base_108| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse13 (select |v_#memory_$Pointer$.base_108| 3))) (and (= 3 (select .cse13 4)) (= 3 (select .cse13 0)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store |v_#memory_$Pointer$.base_108| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_$Pointer$.base_108| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))))))) .cse3 .cse5 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int)))) (let ((.cse14 (select |v_#memory_$Pointer$.offset_107| 3))) (and (= (store |v_#memory_$Pointer$.offset_107| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_$Pointer$.offset_107| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20|) (= (select .cse14 0) 0) (= (select .cse14 4) 0)))) .cse6 .cse7 .cse10)))))) (exists ((|v_#memory_int_17| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_114| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_113| (Array Int (Array Int Int)))) (let ((.cse23 (select |v_#memory_int_17| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (and (= (store |v_#memory_int_178| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_int_178| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 12 (select .cse23 12))) |v_#memory_int_17|) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_113| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_$Pointer$.offset_113| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 12 12))) (let ((.cse29 (exists ((|v_#memory_$Pointer$.offset_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_109| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_173| (Array Int (Array Int Int)))) (let ((.cse41 (select (select |v_#memory_$Pointer$.offset_108| 3) 0))) (let ((.cse34 (select |v_#memory_int_46| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse35 (select (select |v_#memory_$Pointer$.base_109| 3) 0)) (.cse36 (+ .cse41 4))) (and (= |v_#memory_int_46| (store |v_#memory_int_47| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_int_47| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 4 (select .cse34 4)))) (= (store |v_#memory_int_173| .cse35 (store (select |v_#memory_int_173| .cse35) .cse36 (select (select |v_#memory_int_47| .cse35) .cse36))) |v_#memory_int_47|) (= (store |v_#memory_int_45| 3 (store (select |v_#memory_int_45| 3) 0 (select (select |v_#memory_int_178| 3) 0))) |v_#memory_int_178|) (= (let ((.cse37 (let ((.cse38 (store |v_#memory_$Pointer$.base_109| .cse35 (store (select |v_#memory_$Pointer$.base_109| .cse35) .cse36 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse38 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse38 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 4 .cse35) 8 3))))) (store .cse37 3 (store (select .cse37 3) 0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) |v_#memory_$Pointer$.base_114|) (= |v_#memory_int_45| (store |v_#memory_int_46| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store .cse34 8 (select (select |v_#memory_int_45| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 8)))) (= (let ((.cse39 (let ((.cse40 (store |v_#memory_$Pointer$.offset_108| .cse35 (store (select |v_#memory_$Pointer$.offset_108| .cse35) .cse36 4)))) (store .cse40 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse40 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 4 .cse41) 8 0))))) (store .cse39 3 (store (select .cse39 3) 0 4))) |v_#memory_$Pointer$.offset_113|)))))) (.cse25 (exists ((|v_ULTIMATE.start_gl_read_#t~nondet51#1_24| Int)) (and (<= 0 (+ |v_ULTIMATE.start_gl_read_#t~nondet51#1_24| 2147483648)) (not (= |v_ULTIMATE.start_gl_read_#t~nondet51#1_24| 0)) (<= |v_ULTIMATE.start_gl_read_#t~nondet51#1_24| 2147483647))))) (or (and .cse3 (exists ((|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_24| (Array Int (Array Int Int))) (|v_#valid_30| (Array Int Int)) (|v_#memory_int_177| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_113| (Array Int (Array Int Int))) (|v_#length_22| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_24| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_112| (Array Int (Array Int Int)))) (let ((.cse24 (select (select |v_old(#memory_int)_AFTER_CALL_24| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) (and (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_24| (store |v_#memory_$Pointer$.offset_112| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_$Pointer$.offset_112| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_24| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_24| (store |v_#memory_$Pointer$.base_113| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_$Pointer$.base_113| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_24| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0)))) (<= .cse24 2147483647) (= |c_#valid| (store |v_#valid_30| |c_ULTIMATE.start_gl_insert_~node~1#1.base| 1)) (= |v_old(#memory_int)_AFTER_CALL_24| (store |v_#memory_int_177| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_int_177| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 .cse24))) (= |c_#length| (store |v_#length_22| |c_ULTIMATE.start_gl_insert_~node~1#1.base| 20)) (= (select |v_#valid_30| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0) (<= 0 (+ .cse24 2147483648)) (or .cse25 (let ((.cse26 (select |v_#memory_int_177| 1)) (.cse28 (select |v_#memory_$Pointer$.offset_112| 3)) (.cse27 (select |v_#memory_$Pointer$.base_113| 3))) (and (= (select |v_#valid_30| 2) 1) (= 48 (select .cse26 0)) (= 3 (select .cse27 0)) (= (select .cse26 1) 0) (= (select |v_#length_22| 1) 2) (= 22 (select |v_#length_22| 2)) (= (select .cse28 4) 0) (= (select |v_#valid_30| 0) 0) (= (select .cse28 0) 0) (= 3 (select .cse27 4)) (= (select |v_#valid_30| 1) 1) (= (select |v_#valid_30| 3) 1) (= (select |v_#length_22| 3) 8))))))) .cse7 .cse29) (and .cse3 .cse7 .cse29 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_47| (Array Int (Array Int Int))) (|v_#valid_30| (Array Int Int)) (|v_#memory_$Pointer$.base_BEFORE_CALL_49| (Array Int (Array Int Int))) (|v_#memory_int_177| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_113| (Array Int (Array Int Int))) (|v_#length_22| (Array Int Int)) (|v_#memory_$Pointer$.offset_112| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse30 (select (select |v_old(#memory_int)_AFTER_CALL_23| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) (and (= (store |v_#memory_$Pointer$.base_113| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_$Pointer$.base_113| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_49| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) |v_#memory_$Pointer$.base_BEFORE_CALL_49|) (= |v_#memory_$Pointer$.offset_BEFORE_CALL_47| (store |v_#memory_$Pointer$.offset_112| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_$Pointer$.offset_112| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_47| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0)))) (= |c_#valid| (store |v_#valid_30| |c_ULTIMATE.start_gl_insert_~node~1#1.base| 1)) (= |c_#length| (store |v_#length_22| |c_ULTIMATE.start_gl_insert_~node~1#1.base| 20)) (<= 0 (+ .cse30 2147483648)) (<= .cse30 2147483647) (= (select |v_#valid_30| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0) (= |v_old(#memory_int)_AFTER_CALL_23| (store |v_#memory_int_177| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_int_177| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 .cse30))) (or .cse25 (let ((.cse31 (select |v_#memory_int_177| 1)) (.cse33 (select |v_#memory_$Pointer$.offset_112| 3)) (.cse32 (select |v_#memory_$Pointer$.base_113| 3))) (and (= (select |v_#valid_30| 2) 1) (= 48 (select .cse31 0)) (= 3 (select .cse32 0)) (= (select .cse31 1) 0) (= (select |v_#length_22| 1) 2) (= 22 (select |v_#length_22| 2)) (= (select .cse33 4) 0) (= (select |v_#valid_30| 0) 0) (= (select .cse33 0) 0) (= 3 (select .cse32 4)) (= (select |v_#valid_30| 1) 1) (= (select |v_#valid_30| 3) 1) (= (select |v_#length_22| 3) 8)))))))))) (= (store |v_#memory_$Pointer$.base_114| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |v_#memory_$Pointer$.base_114| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 12 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) |c_#memory_$Pointer$.base|) (= |c_#memory_int| (store |v_#memory_int_17| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store .cse23 12 .cse1))))))))) is different from false [2024-11-14 04:40:26,941 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8077#(and (or (not (= (select (select |#memory_$Pointer$.offset| 3) 4) 0)) (not (= (select (select |#memory_$Pointer$.base| 3) 4) 0))) (<= 1 |#StackHeapBarrier|) (or (not (= (select (select |#memory_$Pointer$.base| 3) 0) 3)) (not (= (select (select |#memory_$Pointer$.offset| 3) 0) 0))) (= |~#gl_list~0.base| 3) (= (select (select |#memory_$Pointer$.base| 3) 4) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| 3) 4)) (select (select |#memory_$Pointer$.offset| 3) 4))) (= |~#gl_list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| 3) 4) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| 3) 4)) (select (select |#memory_$Pointer$.offset| 3) 4))))' at error location [2024-11-14 04:40:26,942 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:40:26,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:40:26,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2024-11-14 04:40:26,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289018405] [2024-11-14 04:40:26,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:40:26,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 04:40:26,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:40:26,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 04:40:26,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2450, Unknown=3, NotChecked=306, Total=2970 [2024-11-14 04:40:26,945 INFO L87 Difference]: Start difference. First operand 321 states and 389 transitions. Second operand has 32 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 22 states have internal predecessors, (56), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 04:40:29,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:40:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:40:46,257 INFO L93 Difference]: Finished difference Result 416 states and 497 transitions. [2024-11-14 04:40:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 04:40:46,259 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 22 states have internal predecessors, (56), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2024-11-14 04:40:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:40:46,269 INFO L225 Difference]: With dead ends: 416 [2024-11-14 04:40:46,269 INFO L226 Difference]: Without dead ends: 413 [2024-11-14 04:40:46,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=417, Invalid=4283, Unknown=4, NotChecked=408, Total=5112 [2024-11-14 04:40:46,271 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 742 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 4330 mSolverCounterSat, 86 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 4418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 4330 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:40:46,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 640 Invalid, 4418 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [86 Valid, 4330 Invalid, 2 Unknown, 0 Unchecked, 15.8s Time] [2024-11-14 04:40:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-14 04:40:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 390. [2024-11-14 04:40:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 338 states have (on average 1.2307692307692308) internal successors, (416), 355 states have internal predecessors, (416), 38 states have call successors, (38), 15 states have call predecessors, (38), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-14 04:40:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 473 transitions. [2024-11-14 04:40:46,415 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 473 transitions. Word has length 35 [2024-11-14 04:40:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:40:46,415 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 473 transitions. [2024-11-14 04:40:46,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 22 states have internal predecessors, (56), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 04:40:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 473 transitions. [2024-11-14 04:40:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 04:40:46,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:40:46,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:40:46,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 04:40:46,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-14 04:40:46,618 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:40:46,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:40:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1902889781, now seen corresponding path program 1 times [2024-11-14 04:40:46,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:40:46,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310334927] [2024-11-14 04:40:46,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:40:46,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:40:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:40:48,214 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 04:40:48,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:40:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310334927] [2024-11-14 04:40:48,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310334927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:40:48,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:40:48,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 04:40:48,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745554392] [2024-11-14 04:40:48,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:40:48,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 04:40:48,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:40:48,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 04:40:48,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-14 04:40:48,216 INFO L87 Difference]: Start difference. First operand 390 states and 473 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:40:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:40:52,456 INFO L93 Difference]: Finished difference Result 403 states and 484 transitions. [2024-11-14 04:40:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 04:40:52,457 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-14 04:40:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:40:52,459 INFO L225 Difference]: With dead ends: 403 [2024-11-14 04:40:52,459 INFO L226 Difference]: Without dead ends: 400 [2024-11-14 04:40:52,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-11-14 04:40:52,462 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 352 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:40:52,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 185 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-14 04:40:52,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-14 04:40:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 390. [2024-11-14 04:40:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 338 states have (on average 1.227810650887574) internal successors, (415), 355 states have internal predecessors, (415), 38 states have call successors, (38), 15 states have call predecessors, (38), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-14 04:40:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 472 transitions. [2024-11-14 04:40:52,569 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 472 transitions. Word has length 36 [2024-11-14 04:40:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:40:52,569 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 472 transitions. [2024-11-14 04:40:52,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 04:40:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 472 transitions. [2024-11-14 04:40:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 04:40:52,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:40:52,570 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:40:52,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 04:40:52,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:40:52,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:40:52,571 INFO L85 PathProgramCache]: Analyzing trace with hash -667098467, now seen corresponding path program 1 times [2024-11-14 04:40:52,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:40:52,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834404508] [2024-11-14 04:40:52,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:40:52,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:40:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:40:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:40:55,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:40:55,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834404508] [2024-11-14 04:40:55,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834404508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:40:55,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719067899] [2024-11-14 04:40:55,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:40:55,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:40:55,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:40:55,234 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:40:55,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 04:40:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:40:55,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-14 04:40:55,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:40:55,533 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:40:55,533 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 16 treesize of output 15 [2024-11-14 04:40:55,611 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:40:55,611 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 16 treesize of output 15 [2024-11-14 04:40:55,683 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 04:40:55,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 04:40:56,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2024-11-14 04:40:56,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2024-11-14 04:40:56,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2024-11-14 04:40:56,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 18 [2024-11-14 04:40:56,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:40:56,560 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 21 treesize of output 12 [2024-11-14 04:40:56,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:40:56,570 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 14 [2024-11-14 04:40:56,577 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 0 case distinctions, treesize of input 29 treesize of output 27 [2024-11-14 04:40:56,601 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 0 case distinctions, treesize of input 19 treesize of output 21 [2024-11-14 04:40:57,013 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:40:57,014 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 23 treesize of output 20 [2024-11-14 04:40:57,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:40:57,055 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 37 treesize of output 26 [2024-11-14 04:40:57,145 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2024-11-14 04:40:57,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 25 treesize of output 29 [2024-11-14 04:40:57,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 108 [2024-11-14 04:40:57,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:40:57,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:40:57,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:40:57,679 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 0 case distinctions, treesize of input 69 treesize of output 34 [2024-11-14 04:40:57,687 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 0 case distinctions, treesize of input 19 treesize of output 21 [2024-11-14 04:40:57,745 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 04:40:57,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 107 [2024-11-14 04:40:57,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:40:57,778 INFO L349 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2024-11-14 04:40:57,779 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 243 treesize of output 169 [2024-11-14 04:40:57,787 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 04:40:57,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 25 [2024-11-14 04:40:57,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2024-11-14 04:40:58,067 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-14 04:40:58,068 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 78 [2024-11-14 04:40:58,076 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 42 treesize of output 30 [2024-11-14 04:40:59,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-14 04:40:59,748 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 04:40:59,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 28 [2024-11-14 04:40:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:40:59,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:41:00,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1023 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1023)) (.cse2 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (= .cse0 (select (select .cse1 .cse0) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1024) |c_~#gl_list~0.base|) .cse2) 4))))))) is different from false [2024-11-14 04:41:00,914 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1023 (Array Int Int))) (not (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse3 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 8)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse7 (+ .cse4 4))) (let ((.cse0 (store (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse9 |c_~#gl_list~0.base| (store (select (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse3 .cse6) .cse5 |c_~#gl_list~0.base|)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1023)) (.cse8 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse1 (select (select .cse0 |c_~#gl_list~0.base|) .cse8))) (= (select (select .cse0 .cse1) (+ (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse6 (store (select |c_#memory_$Pointer$.offset| .cse6) .cse7 .cse3)))) (store .cse2 |c_~#gl_list~0.base| (store (select (store .cse2 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse2 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse3 .cse4) .cse5 |c_~#gl_list~0.offset|)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse3))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1024) |c_~#gl_list~0.base|) .cse8) 4)) .cse1))))))) is different from false [2024-11-14 04:41:00,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719067899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:41:00,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1665070715] [2024-11-14 04:41:00,922 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-14 04:41:00,922 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:41:00,922 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:41:00,923 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:41:00,923 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:41:06,322 INFO L197 IcfgInterpreter]: Interpreting procedure list_add with input of size 178 for LOIs [2024-11-14 04:41:06,355 INFO L197 IcfgInterpreter]: Interpreting procedure inspect with input of size 14 for LOIs [2024-11-14 04:41:06,445 INFO L197 IcfgInterpreter]: Interpreting procedure fail with input of size 46 for LOIs [2024-11-14 04:41:06,452 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:42:25,687 WARN L286 SmtUtils]: Spent 23.00s on a formula simplification that was a NOOP. DAG size: 347 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:42:44,782 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10716#(and (or (not (= (select (select |#memory_$Pointer$.offset| 3) 4) 0)) (not (= (select (select |#memory_$Pointer$.base| 3) 4) 0))) (<= 1 |#StackHeapBarrier|) (or (not (= (select (select |#memory_$Pointer$.base| 3) 0) 3)) (not (= (select (select |#memory_$Pointer$.offset| 3) 0) 0))) (or (not (= (select (select |#memory_$Pointer$.offset| 3) 4) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| 3) 4)) (select (select |#memory_$Pointer$.offset| 3) 4)))) (not (= (select (select |#memory_$Pointer$.base| 3) 4) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| 3) 4)) (select (select |#memory_$Pointer$.offset| 3) 4))))) (= (select (select |#memory_$Pointer$.offset| 3) 4) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| 3) 4)) (+ (select (select |#memory_$Pointer$.offset| 3) 4) 4))) (= |~#gl_list~0.base| 3) (= (select (select |#memory_$Pointer$.base| 3) 4) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| 3) 4)) (+ (select (select |#memory_$Pointer$.offset| 3) 4) 4))) (= |~#gl_list~0.offset| 0) (or (not (= (select (select |#memory_$Pointer$.base| 3) 4) 3)) (not (= (select (select |#memory_$Pointer$.offset| 3) 4) 0))))' at error location [2024-11-14 04:42:44,782 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:42:44,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:42:44,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2024-11-14 04:42:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888704370] [2024-11-14 04:42:44,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:42:44,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 04:42:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:42:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 04:42:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2631, Unknown=21, NotChecked=210, Total=3080 [2024-11-14 04:42:44,785 INFO L87 Difference]: Start difference. First operand 390 states and 472 transitions. Second operand has 28 states, 22 states have (on average 2.772727272727273) internal successors, (61), 18 states have internal predecessors, (61), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 04:42:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:42:57,635 INFO L93 Difference]: Finished difference Result 414 states and 493 transitions. [2024-11-14 04:42:57,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 04:42:57,637 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 2.772727272727273) internal successors, (61), 18 states have internal predecessors, (61), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-11-14 04:42:57,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:42:57,639 INFO L225 Difference]: With dead ends: 414 [2024-11-14 04:42:57,640 INFO L226 Difference]: Without dead ends: 411 [2024-11-14 04:42:57,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 105.8s TimeCoverageRelationStatistics Valid=342, Invalid=4064, Unknown=24, NotChecked=262, Total=4692 [2024-11-14 04:42:57,642 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 773 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 101 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 3015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:42:57,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 477 Invalid, 3015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2911 Invalid, 3 Unknown, 0 Unchecked, 8.5s Time] [2024-11-14 04:42:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-14 04:42:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 390. [2024-11-14 04:42:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 338 states have (on average 1.2248520710059172) internal successors, (414), 355 states have internal predecessors, (414), 38 states have call successors, (38), 15 states have call predecessors, (38), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-14 04:42:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 471 transitions. [2024-11-14 04:42:57,764 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 471 transitions. Word has length 38 [2024-11-14 04:42:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:42:57,764 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 471 transitions. [2024-11-14 04:42:57,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 2.772727272727273) internal successors, (61), 18 states have internal predecessors, (61), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 04:42:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 471 transitions. [2024-11-14 04:42:57,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 04:42:57,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:42:57,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:42:57,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 04:42:57,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 04:42:57,966 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:42:57,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:42:57,966 INFO L85 PathProgramCache]: Analyzing trace with hash 111927892, now seen corresponding path program 1 times [2024-11-14 04:42:57,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:42:57,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775658010] [2024-11-14 04:42:57,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:42:57,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:42:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:42:57,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:42:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:42:58,026 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:42:58,026 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:42:58,027 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 04:42:58,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 04:42:58,032 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:42:58,055 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:42:58,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:42:58 BoogieIcfgContainer [2024-11-14 04:42:58,057 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:42:58,058 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:42:58,058 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:42:58,058 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:42:58,059 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:35:52" (3/4) ... [2024-11-14 04:42:58,060 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 04:42:58,099 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 04:42:58,099 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:42:58,099 INFO L158 Benchmark]: Toolchain (without parser) took 427313.15ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 117.5MB in the beginning and 261.1MB in the end (delta: -143.6MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2024-11-14 04:42:58,100 INFO L158 Benchmark]: CDTParser took 1.01ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:42:58,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.09ms. Allocated memory is still 142.6MB. Free memory was 117.5MB in the beginning and 90.8MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 04:42:58,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.02ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:42:58,100 INFO L158 Benchmark]: Boogie Preprocessor took 35.08ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 86.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:42:58,101 INFO L158 Benchmark]: RCFGBuilder took 880.27ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 55.5MB in the end (delta: 30.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 04:42:58,101 INFO L158 Benchmark]: TraceAbstraction took 425584.44ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 54.8MB in the beginning and 261.2MB in the end (delta: -206.4MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-11-14 04:42:58,101 INFO L158 Benchmark]: Witness Printer took 40.82ms. Allocated memory is still 360.7MB. Free memory was 261.2MB in the beginning and 261.1MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:42:58,103 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.09ms. Allocated memory is still 142.6MB. Free memory was 117.5MB in the beginning and 90.8MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.02ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.08ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 86.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 880.27ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 55.5MB in the end (delta: 30.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 425584.44ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 54.8MB in the beginning and 261.2MB in the end (delta: -206.4MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Witness Printer took 40.82ms. Allocated memory is still 360.7MB. Free memory was 261.2MB in the beginning and 261.1MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 840]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L949] CALL gl_read() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) [L902] node->value = value VAL [gl_list={3:0}, node={5:0}] [L903] CALL list_add(&node->linkage, &gl_list) VAL [gl_list={3:0}] [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new [L890] RET __list_add(new, head, head->next) [L903] RET list_add(&node->linkage, &gl_list) VAL [gl_list={3:0}, node={5:0}] [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->next = (&node->nested) VAL [gl_list={3:0}, node={5:0}] [L909] RET gl_insert(__VERIFIER_nondet_int()) [L911] COND FALSE !(__VERIFIER_nondet_int()) [L949] RET gl_read() [L950] CALL inspect(&gl_list) VAL [\old(head)={3:0}, gl_list={3:0}] [L853] COND FALSE !(!(head)) VAL [\old(head)={3:0}, gl_list={3:0}, head={3:0}] [L854] EXPR head->next VAL [\old(head)={3:0}, gl_list={3:0}, head={3:0}] [L854] COND FALSE !(!(head->next != head)) [L855] EXPR head->prev VAL [\old(head)={3:0}, gl_list={3:0}, head={3:0}] [L855] COND FALSE !(!(head->prev != head)) [L856] EXPR head->prev [L856] head = head->prev [L857] COND FALSE !(!(head)) VAL [\old(head)={3:0}, gl_list={3:0}, head={5:4}] [L858] EXPR head->next VAL [\old(head)={3:0}, gl_list={3:0}, head={5:4}] [L858] COND FALSE !(!(head->next != head)) [L859] EXPR head->prev VAL [\old(head)={3:0}, gl_list={3:0}, head={5:4}] [L859] COND FALSE !(!(head->prev != head)) [L860] const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [\old(head)={3:0}, gl_list={3:0}, head={5:4}, node={5:0}] [L861] COND FALSE !(!(node)) VAL [\old(head)={3:0}, gl_list={3:0}, head={5:4}, node={5:0}] [L862] EXPR node->nested.next VAL [\old(head)={3:0}, gl_list={3:0}, head={5:4}, node={5:0}] [L862] COND FALSE !(!(node->nested.next == &node->nested)) [L863] EXPR node->nested.prev VAL [\old(head)={3:0}, gl_list={3:0}, head={5:4}, node={5:0}] [L863] COND TRUE !(node->nested.prev == &node->nested) [L863] CALL fail() VAL [gl_list={3:0}] [L840] reach_error() VAL [gl_list={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 425.5s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 70.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 mSolverCounterUnknown, 7566 SdHoareTripleChecker+Valid, 50.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7530 mSDsluCounter, 3571 SdHoareTripleChecker+Invalid, 47.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3038 mSDsCounter, 1085 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17955 IncrementalHoareTripleChecker+Invalid, 19079 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1085 mSolverCounterUnsat, 533 mSDtfsCounter, 17955 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 634 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 411 ConstructedPredicates, 6 IntricatePredicates, 4 DeprecatedPredicates, 5521 ImplicationChecksByTransitivity, 321.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=11, InterpolantAutomatonStates: 216, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 363 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 37.5s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 463 ConstructedInterpolants, 31 QuantifiedInterpolants, 15746 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1112 ConjunctsInSsa, 318 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 3/64 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-14 04:42:58,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f9065d-3afb-4557-9183-571aba4345da/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE