/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 13:54:11,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 13:54:11,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 13:54:11,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 13:54:11,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 13:54:11,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 13:54:11,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 13:54:11,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 13:54:11,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 13:54:11,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 13:54:11,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 13:54:11,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 13:54:11,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 13:54:11,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 13:54:11,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 13:54:11,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 13:54:11,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 13:54:11,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 13:54:11,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 13:54:11,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 13:54:11,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 13:54:11,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 13:54:11,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 13:54:11,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 13:54:11,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 13:54:11,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 13:54:11,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 13:54:11,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 13:54:11,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 13:54:11,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 13:54:11,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 13:54:11,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 13:54:11,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 13:54:11,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 13:54:11,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 13:54:11,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 13:54:11,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 13:54:11,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 13:54:11,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 13:54:11,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 13:54:11,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 13:54:11,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-02 13:54:11,149 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 13:54:11,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 13:54:11,150 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 13:54:11,150 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 13:54:11,150 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 13:54:11,150 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 13:54:11,150 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-02 13:54:11,151 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-02 13:54:11,151 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-02 13:54:11,151 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-02 13:54:11,151 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-02 13:54:11,151 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-02 13:54:11,151 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-02 13:54:11,151 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-02 13:54:11,151 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-02 13:54:11,151 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-02 13:54:11,151 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-02 13:54:11,151 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-02 13:54:11,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 13:54:11,152 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 13:54:11,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 13:54:11,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 13:54:11,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 13:54:11,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 13:54:11,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 13:54:11,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 13:54:11,152 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 13:54:11,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 13:54:11,153 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 13:54:11,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 13:54:11,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 13:54:11,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 13:54:11,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 13:54:11,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 13:54:11,153 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-02 13:54:11,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 13:54:11,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 13:54:11,153 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-02 13:54:11,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 13:54:11,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 13:54:11,154 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-02 13:54:11,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-02 13:54:11,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 13:54:11,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 13:54:11,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 13:54:11,348 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 13:54:11,349 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 13:54:11,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2023-04-02 13:54:12,371 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 13:54:12,479 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 13:54:12,479 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2023-04-02 13:54:12,483 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8969541/7e211dccc7664199ad25346470eaabd9/FLAG9abb5c235 [2023-04-02 13:54:12,495 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8969541/7e211dccc7664199ad25346470eaabd9 [2023-04-02 13:54:12,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 13:54:12,498 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 13:54:12,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 13:54:12,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 13:54:12,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 13:54:12,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:54:12" (1/1) ... [2023-04-02 13:54:12,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea10e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:54:12, skipping insertion in model container [2023-04-02 13:54:12,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:54:12" (1/1) ... [2023-04-02 13:54:12,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 13:54:12,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 13:54:12,602 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2023-04-02 13:54:12,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 13:54:12,622 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 13:54:12,629 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2023-04-02 13:54:12,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 13:54:12,645 INFO L208 MainTranslator]: Completed translation [2023-04-02 13:54:12,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:54:12 WrapperNode [2023-04-02 13:54:12,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 13:54:12,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 13:54:12,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 13:54:12,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 13:54:12,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:54:12" (1/1) ... [2023-04-02 13:54:12,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:54:12" (1/1) ... [2023-04-02 13:54:12,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:54:12" (1/1) ... [2023-04-02 13:54:12,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:54:12" (1/1) ... [2023-04-02 13:54:12,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:54:12" (1/1) ... [2023-04-02 13:54:12,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:54:12" (1/1) ... [2023-04-02 13:54:12,669 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:54:12" (1/1) ... [2023-04-02 13:54:12,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:54:12" (1/1) ... [2023-04-02 13:54:12,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 13:54:12,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 13:54:12,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 13:54:12,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 13:54:12,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:54:12" (1/1) ... [2023-04-02 13:54:12,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 13:54:12,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 13:54:12,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 13:54:12,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 13:54:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 13:54:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 13:54:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 13:54:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-02 13:54:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2023-04-02 13:54:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2023-04-02 13:54:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 13:54:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 13:54:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 13:54:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 13:54:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 13:54:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 13:54:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 13:54:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 13:54:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 13:54:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2023-04-02 13:54:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 13:54:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2023-04-02 13:54:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 13:54:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 13:54:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-02 13:54:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 13:54:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 13:54:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 13:54:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 13:54:12,804 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 13:54:12,806 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 13:54:13,077 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 13:54:13,129 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 13:54:13,129 INFO L302 CfgBuilder]: Removed 10 assume(true) statements. [2023-04-02 13:54:13,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:54:13 BoogieIcfgContainer [2023-04-02 13:54:13,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 13:54:13,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 13:54:13,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 13:54:13,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 13:54:13,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 01:54:12" (1/3) ... [2023-04-02 13:54:13,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6997122b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:54:13, skipping insertion in model container [2023-04-02 13:54:13,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:54:12" (2/3) ... [2023-04-02 13:54:13,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6997122b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:54:13, skipping insertion in model container [2023-04-02 13:54:13,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:54:13" (3/3) ... [2023-04-02 13:54:13,137 INFO L112 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2023-04-02 13:54:13,149 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 13:54:13,149 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 13:54:13,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 13:54:13,203 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@1587a407, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-02 13:54:13,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 13:54:13,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.5) internal successors, (42), 29 states have internal predecessors, (42), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 13:54:13,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-04-02 13:54:13,214 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 13:54:13,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 13:54:13,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 13:54:13,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 13:54:13,221 INFO L85 PathProgramCache]: Analyzing trace with hash -800208351, now seen corresponding path program 1 times [2023-04-02 13:54:13,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 13:54:13,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356199256] [2023-04-02 13:54:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 13:54:13,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 13:54:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 13:54:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 13:54:13,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 13:54:13,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356199256] [2023-04-02 13:54:13,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356199256] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 13:54:13,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 13:54:13,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-02 13:54:13,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129846054] [2023-04-02 13:54:13,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 13:54:13,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 13:54:13,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 13:54:13,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 13:54:13,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 13:54:13,428 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.5) internal successors, (42), 29 states have internal predecessors, (42), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 13:54:13,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 13:54:13,527 INFO L93 Difference]: Finished difference Result 100 states and 148 transitions. [2023-04-02 13:54:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 13:54:13,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 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 12 [2023-04-02 13:54:13,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 13:54:13,535 INFO L225 Difference]: With dead ends: 100 [2023-04-02 13:54:13,535 INFO L226 Difference]: Without dead ends: 60 [2023-04-02 13:54:13,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 13:54:13,539 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 13:54:13,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 60 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 13:54:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-04-02 13:54:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2023-04-02 13:54:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 13:54:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2023-04-02 13:54:13,591 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 12 [2023-04-02 13:54:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 13:54:13,591 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2023-04-02 13:54:13,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 13:54:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2023-04-02 13:54:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-02 13:54:13,593 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 13:54:13,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 13:54:13,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 13:54:13,594 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 13:54:13,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 13:54:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1057372745, now seen corresponding path program 1 times [2023-04-02 13:54:13,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 13:54:13,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557763404] [2023-04-02 13:54:13,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 13:54:13,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 13:54:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 13:54:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 13:54:13,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 13:54:13,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557763404] [2023-04-02 13:54:13,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557763404] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 13:54:13,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740952121] [2023-04-02 13:54:13,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 13:54:13,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 13:54:13,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 13:54:13,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 13:54:13,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-02 13:54:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 13:54:13,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-02 13:54:13,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 13:54:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 13:54:13,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 13:54:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 13:54:13,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740952121] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 13:54:13,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1100683972] [2023-04-02 13:54:13,864 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-04-02 13:54:13,864 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 13:54:13,873 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 13:54:13,878 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 13:54:13,881 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 13:54:13,953 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 18 for LOIs [2023-04-02 13:54:14,037 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 13:54:14,045 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 13:54:14,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1100683972] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 13:54:14,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-02 13:54:14,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 13 [2023-04-02 13:54:14,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360524270] [2023-04-02 13:54:14,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 13:54:14,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 13:54:14,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 13:54:14,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 13:54:14,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-04-02 13:54:14,152 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 8 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-04-02 13:54:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 13:54:14,579 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2023-04-02 13:54:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 13:54:14,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2023-04-02 13:54:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 13:54:14,583 INFO L225 Difference]: With dead ends: 94 [2023-04-02 13:54:14,583 INFO L226 Difference]: Without dead ends: 59 [2023-04-02 13:54:14,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-04-02 13:54:14,586 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 141 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 13:54:14,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 6 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 13:54:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-04-02 13:54:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2023-04-02 13:54:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 13:54:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2023-04-02 13:54:14,610 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 13 [2023-04-02 13:54:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 13:54:14,611 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2023-04-02 13:54:14,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-04-02 13:54:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2023-04-02 13:54:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-04-02 13:54:14,613 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 13:54:14,613 INFO L195 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] [2023-04-02 13:54:14,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 13:54:14,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 13:54:14,820 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 13:54:14,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 13:54:14,821 INFO L85 PathProgramCache]: Analyzing trace with hash -419351650, now seen corresponding path program 1 times [2023-04-02 13:54:14,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 13:54:14,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194249126] [2023-04-02 13:54:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 13:54:14,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 13:54:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 13:54:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 13:54:14,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 13:54:14,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194249126] [2023-04-02 13:54:14,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194249126] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 13:54:14,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988579858] [2023-04-02 13:54:14,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 13:54:14,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 13:54:14,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 13:54:14,902 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 13:54:14,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-02 13:54:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 13:54:14,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2023-04-02 13:54:14,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 13:54:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 13:54:14,963 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 13:54:14,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988579858] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 13:54:14,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 13:54:14,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-04-02 13:54:14,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042291210] [2023-04-02 13:54:14,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 13:54:14,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 13:54:14,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 13:54:14,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 13:54:14,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-04-02 13:54:14,964 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 13:54:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 13:54:14,993 INFO L93 Difference]: Finished difference Result 96 states and 126 transitions. [2023-04-02 13:54:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 13:54:14,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2023-04-02 13:54:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 13:54:14,994 INFO L225 Difference]: With dead ends: 96 [2023-04-02 13:54:14,995 INFO L226 Difference]: Without dead ends: 57 [2023-04-02 13:54:14,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-04-02 13:54:14,995 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 13:54:14,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 58 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 13:54:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-02 13:54:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2023-04-02 13:54:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 13:54:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2023-04-02 13:54:15,004 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 28 [2023-04-02 13:54:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 13:54:15,004 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2023-04-02 13:54:15,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 13:54:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2023-04-02 13:54:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-02 13:54:15,005 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 13:54:15,005 INFO L195 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] [2023-04-02 13:54:15,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-02 13:54:15,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-04-02 13:54:15,217 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 13:54:15,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 13:54:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash -778507274, now seen corresponding path program 1 times [2023-04-02 13:54:15,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 13:54:15,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228581289] [2023-04-02 13:54:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 13:54:15,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 13:54:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 13:54:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 13:54:15,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 13:54:15,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228581289] [2023-04-02 13:54:15,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228581289] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 13:54:15,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65122870] [2023-04-02 13:54:15,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 13:54:15,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 13:54:15,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 13:54:15,270 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 13:54:15,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 13:54:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 13:54:15,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-02 13:54:15,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 13:54:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 13:54:15,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 13:54:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 13:54:15,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65122870] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 13:54:15,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [346542298] [2023-04-02 13:54:15,365 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-02 13:54:15,365 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 13:54:15,365 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 13:54:15,365 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 13:54:15,365 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 13:54:15,396 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 18 for LOIs [2023-04-02 13:54:15,625 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 13:54:15,629 INFO L197 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 36 for LOIs [2023-04-02 13:54:15,653 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 13:54:16,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [346542298] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 13:54:16,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-02 13:54:16,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [4, 4, 4] total 20 [2023-04-02 13:54:16,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061218975] [2023-04-02 13:54:16,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 13:54:16,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-02 13:54:16,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 13:54:16,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-02 13:54:16,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-04-02 13:54:16,061 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 15 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 13:54:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 13:54:16,976 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2023-04-02 13:54:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-02 13:54:16,977 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2023-04-02 13:54:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 13:54:16,977 INFO L225 Difference]: With dead ends: 96 [2023-04-02 13:54:16,977 INFO L226 Difference]: Without dead ends: 62 [2023-04-02 13:54:16,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2023-04-02 13:54:16,979 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 139 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 13:54:16,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 5 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 13:54:16,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-04-02 13:54:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2023-04-02 13:54:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 13:54:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2023-04-02 13:54:16,993 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 29 [2023-04-02 13:54:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 13:54:16,994 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2023-04-02 13:54:16,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 13:54:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2023-04-02 13:54:16,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-02 13:54:16,996 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 13:54:16,996 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2023-04-02 13:54:17,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-02 13:54:17,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 13:54:17,201 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 13:54:17,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 13:54:17,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2131518482, now seen corresponding path program 1 times [2023-04-02 13:54:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 13:54:17,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645925324] [2023-04-02 13:54:17,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 13:54:17,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 13:54:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 13:54:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 13:54:17,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 13:54:17,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645925324] [2023-04-02 13:54:17,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645925324] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 13:54:17,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086636427] [2023-04-02 13:54:17,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 13:54:17,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 13:54:17,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 13:54:17,263 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 13:54:17,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-02 13:54:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 13:54:17,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-02 13:54:17,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 13:54:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 13:54:17,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 13:54:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 13:54:17,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086636427] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 13:54:17,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [172764136] [2023-04-02 13:54:17,355 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-02 13:54:17,355 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 13:54:17,355 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 13:54:17,355 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 13:54:17,355 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 13:54:17,371 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 18 for LOIs [2023-04-02 13:54:17,633 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 13:54:17,635 INFO L197 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 21 for LOIs [2023-04-02 13:54:17,641 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 13:54:17,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [172764136] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 13:54:17,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-02 13:54:17,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4, 4, 4] total 18 [2023-04-02 13:54:17,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421845774] [2023-04-02 13:54:17,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 13:54:17,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 13:54:17,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 13:54:17,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 13:54:17,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-04-02 13:54:17,912 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 13 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 13:54:18,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 13:54:18,458 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2023-04-02 13:54:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-02 13:54:18,459 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2023-04-02 13:54:18,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 13:54:18,459 INFO L225 Difference]: With dead ends: 67 [2023-04-02 13:54:18,459 INFO L226 Difference]: Without dead ends: 0 [2023-04-02 13:54:18,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2023-04-02 13:54:18,463 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 13:54:18,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 6 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 13:54:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-02 13:54:18,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-02 13:54:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-04-02 13:54:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-02 13:54:18,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2023-04-02 13:54:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 13:54:18,464 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-02 13:54:18,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 13:54:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-02 13:54:18,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-02 13:54:18,466 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 13:54:18,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-02 13:54:18,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 13:54:18,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-02 13:54:19,451 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2023-04-02 13:54:19,451 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 12) no Hoare annotation was computed. [2023-04-02 13:54:19,451 INFO L899 garLoopResultBuilder]: For program point elem_existsEXIT(lines 20 26) no Hoare annotation was computed. [2023-04-02 13:54:19,451 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2023-04-02 13:54:19,451 INFO L895 garLoopResultBuilder]: At program point L22-3(lines 22 24) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= |elem_exists_#in~size| 0)) (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (< |elem_exists_#in~set.base| (+ |#StackHeapBarrier| 1)) (not (= 2 (select |#length| 1))) (not (= |elem_exists_#in~set.offset| 0)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= (select |#valid| 1) 1)) (and (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~size 0) (= elem_exists_~set.offset 0) (= elem_exists_~value |elem_exists_#in~value|) (= elem_exists_~i~0 0)) (not (= |#NULL.base| 0)) (not (= (select |#valid| 2) 1)) (<= |#StackHeapBarrier| 0) (not (= 48 (select |#length| 2))))) [2023-04-02 13:54:19,451 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 20 26) the Hoare annotation is: true [2023-04-02 13:54:19,452 INFO L899 garLoopResultBuilder]: For program point elem_existsFINAL(lines 20 26) no Hoare annotation was computed. [2023-04-02 13:54:19,452 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 19) the Hoare annotation is: true [2023-04-02 13:54:19,452 INFO L899 garLoopResultBuilder]: For program point insertEXIT(lines 16 19) no Hoare annotation was computed. [2023-04-02 13:54:19,452 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 27 67) no Hoare annotation was computed. [2023-04-02 13:54:19,452 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) (= main_~x~0 0) (<= .cse1 |main_~#values~0.base|) (<= 0 main_~v~0) (= main_~n~0 0) (= 2 (select |#length| 1)) (= |main_~#values~0.offset| 0) (<= .cse1 |main_~#set~0.base|) (= |main_~#set~0.offset| 0) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse2 0) 48) (= (select .cse2 1) 0))) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 13:54:19,452 INFO L899 garLoopResultBuilder]: For program point L52-1(line 52) no Hoare annotation was computed. [2023-04-02 13:54:19,452 INFO L899 garLoopResultBuilder]: For program point L52-2(lines 52 54) no Hoare annotation was computed. [2023-04-02 13:54:19,452 INFO L899 garLoopResultBuilder]: For program point L52-4(lines 52 54) no Hoare annotation was computed. [2023-04-02 13:54:19,452 INFO L895 garLoopResultBuilder]: At program point L61-3(lines 61 65) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (and (= main_~x~0 0) (= main_~n~0 0) (<= (+ |#StackHeapBarrier| 1) |main_~#set~0.base|) (= |main_~#set~0.offset| 0)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 13:54:19,452 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 13:54:19,452 INFO L899 garLoopResultBuilder]: For program point L53-1(line 53) no Hoare annotation was computed. [2023-04-02 13:54:19,452 INFO L895 garLoopResultBuilder]: At program point L62-3(lines 62 64) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 13:54:19,452 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 27 67) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 13:54:19,452 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 13:54:19,453 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2023-04-02 13:54:19,453 INFO L895 garLoopResultBuilder]: At program point L55-3(lines 55 59) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) (= main_~x~0 0) (<= .cse1 |main_~#values~0.base|) (<= 0 main_~v~0) (= main_~n~0 0) (= 2 (select |#length| 1)) (= |main_~#values~0.offset| 0) (<= .cse1 |main_~#set~0.base|) (= |main_~#set~0.offset| 0) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse2 0) 48) (= (select .cse2 1) 0))) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 13:54:19,453 INFO L895 garLoopResultBuilder]: At program point L47-3(lines 47 50) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) (= main_~x~0 0) (<= .cse1 |main_~#values~0.base|) (<= 0 main_~v~0) (= main_~n~0 0) (= 2 (select |#length| 1)) (= |main_~#values~0.offset| 0) (<= .cse1 |main_~#set~0.base|) (= |main_~#set~0.offset| 0) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse2 0) 48) (= (select .cse2 1) 0))) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 13:54:19,453 INFO L895 garLoopResultBuilder]: At program point L39-3(lines 39 43) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (let ((.cse1 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) (= main_~x~0 0) (= main_~n~0 0) (= 2 (select |#length| 1)) (<= (+ |#StackHeapBarrier| 1) |main_~#set~0.base|) (= |main_~#set~0.offset| 0) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse1 0) 48) (= (select .cse1 1) 0))))) [2023-04-02 13:54:19,453 INFO L895 garLoopResultBuilder]: At program point L56-3(lines 56 58) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 13:54:19,453 INFO L895 garLoopResultBuilder]: At program point L40-3(lines 40 42) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 13:54:19,453 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 13:54:19,453 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2023-04-02 13:54:19,453 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 13:54:19,453 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2023-04-02 13:54:19,454 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 36) the Hoare annotation is: (let ((.cse1 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (let ((.cse0 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) (= main_~n~0 0) (= 2 (select |#length| 1)) (<= 0 main_~x~0) (<= (+ |#StackHeapBarrier| 1) |main_~#set~0.base|) (= |main_~#set~0.offset| 0) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= (select .cse0 1) 0))) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse1 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse1 1) 0)))) [2023-04-02 13:54:19,454 INFO L895 garLoopResultBuilder]: At program point L51-3(lines 51 60) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 48)) (not (= (select .cse0 0) 48)) (let ((.cse1 (+ |#StackHeapBarrier| 1)) (.cse2 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) (= main_~x~0 0) (<= .cse1 |main_~#values~0.base|) (<= 0 main_~v~0) (= main_~n~0 0) (= 2 (select |#length| 1)) (= |main_~#values~0.offset| 0) (<= .cse1 |main_~#set~0.base|) (= |main_~#set~0.offset| 0) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse2 0) 48) (= (select .cse2 1) 0))) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 13:54:19,454 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2023-04-02 13:54:19,454 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-02 13:54:19,454 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-02 13:54:19,454 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) (= 2 (select |#length| 1)) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2023-04-02 13:54:19,454 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-02 13:54:19,454 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-02 13:54:19,454 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2023-04-02 13:54:19,454 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2023-04-02 13:54:19,454 INFO L899 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2023-04-02 13:54:19,454 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed. [2023-04-02 13:54:19,454 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 13) the Hoare annotation is: true [2023-04-02 13:54:19,454 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-04-02 13:54:19,457 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-04-02 13:54:19,458 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 13:54:19,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 01:54:19 BoogieIcfgContainer [2023-04-02 13:54:19,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 13:54:19,475 INFO L158 Benchmark]: Toolchain (without parser) took 6977.00ms. Allocated memory was 307.2MB in the beginning and 369.1MB in the end (delta: 61.9MB). Free memory was 256.7MB in the beginning and 162.8MB in the end (delta: 93.8MB). Peak memory consumption was 200.3MB. Max. memory is 8.0GB. [2023-04-02 13:54:19,476 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 13:54:19,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.01ms. Allocated memory is still 307.2MB. Free memory was 256.7MB in the beginning and 245.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-02 13:54:19,476 INFO L158 Benchmark]: Boogie Preprocessor took 25.14ms. Allocated memory is still 307.2MB. Free memory was 245.7MB in the beginning and 243.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-02 13:54:19,476 INFO L158 Benchmark]: RCFGBuilder took 458.79ms. Allocated memory is still 307.2MB. Free memory was 243.6MB in the beginning and 223.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-04-02 13:54:19,476 INFO L158 Benchmark]: TraceAbstraction took 6342.53ms. Allocated memory was 307.2MB in the beginning and 369.1MB in the end (delta: 61.9MB). Free memory was 222.6MB in the beginning and 162.8MB in the end (delta: 59.8MB). Peak memory consumption was 166.7MB. Max. memory is 8.0GB. [2023-04-02 13:54:19,477 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 147.01ms. Allocated memory is still 307.2MB. Free memory was 256.7MB in the beginning and 245.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.14ms. Allocated memory is still 307.2MB. Free memory was 245.7MB in the beginning and 243.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 458.79ms. Allocated memory is still 307.2MB. Free memory was 243.6MB in the beginning and 223.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 6342.53ms. Allocated memory was 307.2MB in the beginning and 369.1MB in the end (delta: 61.9MB). Free memory was 222.6MB in the beginning and 162.8MB in the end (delta: 59.8MB). Peak memory consumption was 166.7MB. Max. memory is 8.0GB. * 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 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 338 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 580 IncrementalHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 69 mSDtfsCounter, 580 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=4, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 42 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 55 PreInvPairs, 68 NumberOfFragments, 1410 HoareAnnotationTreeSize, 55 FomulaSimplifications, 572 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1056 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 640 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 37/47 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: OVERALL_TIME: 0.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 11, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 49, DAG_INTERPRETER_EARLY_EXITS: 5, TOOLS_POST_APPLICATIONS: 61, TOOLS_POST_TIME: 0.2s, TOOLS_POST_CALL_APPLICATIONS: 24, TOOLS_POST_CALL_TIME: 0.1s, TOOLS_POST_RETURN_APPLICATIONS: 16, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 101, TOOLS_QUANTIFIERELIM_TIME: 0.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 179, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 15, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 6, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 12, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 49, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME: 0.3s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.3s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 12, CALL_SUMMARIZER_APPLICATIONS: 16, CALL_SUMMARIZER_CACHE_MISSES: 5, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 977, DAG_COMPRESSION_RETAINED_NODES: 203, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: (((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 48)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || (((x == 0 && n == 0) && unknown-#StackHeapBarrier-unknown + 1 <= set) && set == 0)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || ((((((((((48 == unknown-#length-unknown[2] && n == 0) && 2 == unknown-#length-unknown[1]) && 0 <= x) && unknown-#StackHeapBarrier-unknown + 1 <= set) && set == 0) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 48)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 48)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || ((((((((((48 == unknown-#length-unknown[2] && x == 0) && n == 0) && 2 == unknown-#length-unknown[1]) && unknown-#StackHeapBarrier-unknown + 1 <= set) && set == 0) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(size) == 0) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || set < unknown-#StackHeapBarrier-unknown + 1) || !(2 == unknown-#length-unknown[1])) || !(set == 0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(\valid[1] == 1)) || ((((set == set && size == 0) && set == 0) && value == \old(value)) && i == 0)) || !(#NULL == 0)) || !(\valid[2] == 1)) || unknown-#StackHeapBarrier-unknown <= 0) || !(48 == unknown-#length-unknown[2]) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 48)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || (((((((((((((48 == unknown-#length-unknown[2] && x == 0) && unknown-#StackHeapBarrier-unknown + 1 <= values) && 0 <= v) && n == 0) && 2 == unknown-#length-unknown[1]) && values == 0) && unknown-#StackHeapBarrier-unknown + 1 <= set) && set == 0) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 48)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 48)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || (((((((((((((48 == unknown-#length-unknown[2] && x == 0) && unknown-#StackHeapBarrier-unknown + 1 <= values) && 0 <= v) && n == 0) && 2 == unknown-#length-unknown[1]) && values == 0) && unknown-#StackHeapBarrier-unknown + 1 <= set) && set == 0) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 48)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 48)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || (((((((((((((48 == unknown-#length-unknown[2] && x == 0) && unknown-#StackHeapBarrier-unknown + 1 <= values) && 0 <= v) && n == 0) && 2 == unknown-#length-unknown[1]) && values == 0) && unknown-#StackHeapBarrier-unknown + 1 <= set) && set == 0) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 48)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) RESULT: Ultimate proved your program to be correct! [2023-04-02 13:54:19,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...