YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:48:07,885 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:48:07,887 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:48:07,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:48:07,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:48:07,899 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:48:07,900 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:48:07,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:48:07,903 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:48:07,904 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:48:07,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:48:07,905 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:48:07,906 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:48:07,907 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:48:07,908 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:48:07,908 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:48:07,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:48:07,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:48:07,913 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:48:07,914 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:48:07,915 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:48:07,916 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:48:07,918 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:48:07,918 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:48:07,919 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:48:07,919 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:48:07,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:48:07,921 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:48:07,921 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:48:07,922 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:48:07,922 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:48:07,923 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:48:07,924 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:48:07,924 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:48:07,925 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:48:07,925 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:48:07,925 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:48:07,926 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:48:07,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:48:07,927 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:48:07,941 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:48:07,941 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:48:07,942 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:48:07,942 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:48:07,943 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:48:07,943 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:48:07,943 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:48:07,943 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:48:07,943 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:48:07,943 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:48:07,944 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:48:07,944 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:48:07,944 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:48:07,944 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:48:07,944 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:48:07,944 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:48:07,945 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:48:07,945 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:48:07,945 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:48:07,945 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:48:07,945 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:48:07,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:48:07,946 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:48:07,946 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:48:07,946 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:48:07,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:48:07,946 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:48:07,946 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:48:07,947 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:48:07,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:48:07,984 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:48:07,987 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:48:07,988 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:48:07,989 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:48:07,989 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:48:08,097 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/8bc7d6da70b7456eb766b00fff4ea2d7/FLAG493fbf6c0 [2020-06-22 10:48:08,443 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:48:08,443 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:48:08,444 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:48:08,450 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/8bc7d6da70b7456eb766b00fff4ea2d7/FLAG493fbf6c0 [2020-06-22 10:48:08,856 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/8bc7d6da70b7456eb766b00fff4ea2d7 [2020-06-22 10:48:08,867 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:48:08,868 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:48:08,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:48:08,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:48:08,873 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:48:08,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:48:08" (1/1) ... [2020-06-22 10:48:08,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e04b47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:08, skipping insertion in model container [2020-06-22 10:48:08,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:48:08" (1/1) ... [2020-06-22 10:48:08,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:48:08,902 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:48:09,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:48:09,130 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:48:09,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:48:09,166 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:48:09,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:09 WrapperNode [2020-06-22 10:48:09,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:48:09,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:48:09,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:48:09,168 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:48:09,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:09" (1/1) ... [2020-06-22 10:48:09,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:09" (1/1) ... [2020-06-22 10:48:09,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:48:09,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:48:09,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:48:09,208 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:48:09,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:09" (1/1) ... [2020-06-22 10:48:09,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:09" (1/1) ... [2020-06-22 10:48:09,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:09" (1/1) ... [2020-06-22 10:48:09,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:09" (1/1) ... [2020-06-22 10:48:09,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:09" (1/1) ... [2020-06-22 10:48:09,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:09" (1/1) ... [2020-06-22 10:48:09,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:09" (1/1) ... [2020-06-22 10:48:09,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:48:09,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:48:09,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:48:09,234 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:48:09,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:09" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:48:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:48:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:48:09,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:48:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:48:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:48:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:48:09,548 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:48:09,549 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 10:48:09,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:09 BoogieIcfgContainer [2020-06-22 10:48:09,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:48:09,551 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:48:09,551 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:48:09,554 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:48:09,554 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:09" (1/1) ... [2020-06-22 10:48:09,575 INFO L313 BlockEncoder]: Initial Icfg 33 locations, 38 edges [2020-06-22 10:48:09,577 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:48:09,577 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:48:09,578 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:48:09,578 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:48:09,580 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:48:09,581 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:48:09,581 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:48:09,605 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:48:09,630 INFO L200 BlockEncoder]: SBE split 13 edges [2020-06-22 10:48:09,635 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 10:48:09,637 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:48:09,663 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 10:48:09,665 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:48:09,667 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:48:09,667 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:48:09,668 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:48:09,668 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:48:09,669 INFO L313 BlockEncoder]: Encoded RCFG 25 locations, 41 edges [2020-06-22 10:48:09,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:48:09 BasicIcfg [2020-06-22 10:48:09,669 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:48:09,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:48:09,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:48:09,674 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:48:09,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:48:08" (1/4) ... [2020-06-22 10:48:09,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a88cea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:48:09, skipping insertion in model container [2020-06-22 10:48:09,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:09" (2/4) ... [2020-06-22 10:48:09,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a88cea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:48:09, skipping insertion in model container [2020-06-22 10:48:09,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:09" (3/4) ... [2020-06-22 10:48:09,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a88cea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:48:09, skipping insertion in model container [2020-06-22 10:48:09,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:48:09" (4/4) ... [2020-06-22 10:48:09,678 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:48:09,688 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:48:09,696 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2020-06-22 10:48:09,713 INFO L257 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-06-22 10:48:09,742 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:48:09,742 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:48:09,743 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:48:09,743 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:48:09,743 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:48:09,743 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:48:09,743 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:48:09,743 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:48:09,744 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:48:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-06-22 10:48:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:48:09,765 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:48:09,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:48:09,766 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 10:48:09,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:09,771 INFO L82 PathProgramCache]: Analyzing trace with hash 823111807, now seen corresponding path program 1 times [2020-06-22 10:48:09,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:09,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:09,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:09,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:09,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:09,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:48:09,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:48:09,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:48:09,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:48:09,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:09,963 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-06-22 10:48:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:48:10,058 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. [2020-06-22 10:48:10,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:48:10,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:48:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:48:10,072 INFO L225 Difference]: With dead ends: 25 [2020-06-22 10:48:10,072 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 10:48:10,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 10:48:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 10:48:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 10:48:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2020-06-22 10:48:10,112 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 6 [2020-06-22 10:48:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:48:10,112 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-06-22 10:48:10,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:48:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. [2020-06-22 10:48:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:48:10,113 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:48:10,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:48:10,113 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 10:48:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:10,114 INFO L82 PathProgramCache]: Analyzing trace with hash 823111809, now seen corresponding path program 1 times [2020-06-22 10:48:10,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:10,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:10,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:10,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:10,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:48:10,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:48:10,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:48:10,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:48:10,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:48:10,153 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand 4 states. [2020-06-22 10:48:10,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:48:10,235 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. [2020-06-22 10:48:10,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:48:10,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 10:48:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:48:10,236 INFO L225 Difference]: With dead ends: 37 [2020-06-22 10:48:10,237 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 10:48:10,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:48:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 10:48:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 10:48:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 10:48:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2020-06-22 10:48:10,241 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 6 [2020-06-22 10:48:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:48:10,242 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 28 transitions. [2020-06-22 10:48:10,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:48:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2020-06-22 10:48:10,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:48:10,242 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:48:10,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:48:10,243 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 10:48:10,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:10,243 INFO L82 PathProgramCache]: Analyzing trace with hash 841582229, now seen corresponding path program 1 times [2020-06-22 10:48:10,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:10,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:10,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:10,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:10,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:48:10,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:48:10,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:48:10,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:48:10,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:48:10,281 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. Second operand 4 states. [2020-06-22 10:48:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:48:10,377 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2020-06-22 10:48:10,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:48:10,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 10:48:10,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:48:10,378 INFO L225 Difference]: With dead ends: 41 [2020-06-22 10:48:10,378 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 10:48:10,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:48:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 10:48:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2020-06-22 10:48:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:48:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 44 transitions. [2020-06-22 10:48:10,385 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 44 transitions. Word has length 6 [2020-06-22 10:48:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:48:10,386 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 44 transitions. [2020-06-22 10:48:10,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:48:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 44 transitions. [2020-06-22 10:48:10,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:48:10,386 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:48:10,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:48:10,387 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 10:48:10,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:10,387 INFO L82 PathProgramCache]: Analyzing trace with hash 841582230, now seen corresponding path program 1 times [2020-06-22 10:48:10,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:10,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:10,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:10,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:10,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:48:10,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:48:10,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:48:10,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:48:10,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:48:10,445 INFO L87 Difference]: Start difference. First operand 27 states and 44 transitions. Second operand 4 states. [2020-06-22 10:48:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:48:10,533 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2020-06-22 10:48:10,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:48:10,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 10:48:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:48:10,537 INFO L225 Difference]: With dead ends: 34 [2020-06-22 10:48:10,537 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 10:48:10,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:48:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 10:48:10,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-06-22 10:48:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:48:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2020-06-22 10:48:10,543 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 6 [2020-06-22 10:48:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:48:10,543 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2020-06-22 10:48:10,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:48:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-06-22 10:48:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:48:10,544 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:48:10,544 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:48:10,545 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 10:48:10,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:10,545 INFO L82 PathProgramCache]: Analyzing trace with hash 894708749, now seen corresponding path program 1 times [2020-06-22 10:48:10,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:10,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:10,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:10,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:10,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:48:10,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:48:10,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:48:10,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:48:10,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:48:10,583 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 4 states. [2020-06-22 10:48:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:48:10,660 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-06-22 10:48:10,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:48:10,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-06-22 10:48:10,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:48:10,661 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:48:10,661 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:48:10,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:48:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:48:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:48:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:48:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:48:10,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2020-06-22 10:48:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:48:10,663 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:48:10,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:48:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:48:10,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:48:10,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:48:10,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:48:10,763 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,764 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,764 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,764 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,764 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,764 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,764 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,764 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-06-22 10:48:10,764 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 21) no Hoare annotation was computed. [2020-06-22 10:48:10,765 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,765 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:48:10,765 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,765 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-06-22 10:48:10,765 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,765 INFO L448 ceAbstractionStarter]: For program point L11-2(lines 11 14) no Hoare annotation was computed. [2020-06-22 10:48:10,765 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,765 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:48:10,766 INFO L448 ceAbstractionStarter]: For program point L13-5(line 13) no Hoare annotation was computed. [2020-06-22 10:48:10,766 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:48:10,766 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:48:10,766 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:48:10,766 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:48:10,766 INFO L448 ceAbstractionStarter]: For program point L10-2(lines 10 14) no Hoare annotation was computed. [2020-06-22 10:48:10,767 INFO L444 ceAbstractionStarter]: At program point L10-3(lines 10 14) the Hoare annotation is: (let ((.cse4 (select |#length| ULTIMATE.start_sort_~x.base))) (let ((.cse0 (= 1 (select |#valid| ULTIMATE.start_sort_~x.base))) (.cse1 (= ULTIMATE.start_sort_~x.offset 0)) (.cse2 (<= (+ (* 4 ULTIMATE.start_sort_~n) 4) (+ .cse4 (* 4 ULTIMATE.start_sort_~pass~0)))) (.cse3 (* 4 ULTIMATE.start_sort_~i~0))) (or (and .cse0 .cse1 .cse2 (<= 4 (+ ULTIMATE.start_sort_~x.offset .cse3))) (and .cse0 (= ULTIMATE.start_sort_~i~0 0) .cse1 .cse2 (<= (+ .cse3 8) .cse4))))) [2020-06-22 10:48:10,767 INFO L444 ceAbstractionStarter]: At program point L8-3(lines 8 14) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| ULTIMATE.start_sort_~x.base)))) (or (and .cse0 (= ULTIMATE.start_sort_~x.offset 0) (<= (+ (* 4 ULTIMATE.start_sort_~n) 4) (+ (select |#length| ULTIMATE.start_sort_~x.base) (* 4 ULTIMATE.start_sort_~pass~0)))) (and .cse0 (<= ULTIMATE.start_sort_~n ULTIMATE.start_sort_~pass~0) (<= ULTIMATE.start_main_~array_size~0 1)))) [2020-06-22 10:48:10,768 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:48:10,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:10,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:48:10 BasicIcfg [2020-06-22 10:48:10,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:48:10,808 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:48:10,808 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:48:10,811 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:48:10,813 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:10,813 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:48:08" (1/5) ... [2020-06-22 10:48:10,814 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2853af72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:48:10, skipping insertion in model container [2020-06-22 10:48:10,814 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:10,814 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:09" (2/5) ... [2020-06-22 10:48:10,814 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2853af72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:48:10, skipping insertion in model container [2020-06-22 10:48:10,814 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:10,815 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:09" (3/5) ... [2020-06-22 10:48:10,815 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2853af72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:48:10, skipping insertion in model container [2020-06-22 10:48:10,815 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:10,815 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:48:09" (4/5) ... [2020-06-22 10:48:10,815 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2853af72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:48:10, skipping insertion in model container [2020-06-22 10:48:10,815 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:10,816 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:48:10" (5/5) ... [2020-06-22 10:48:10,818 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:48:10,846 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:48:10,847 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:48:10,847 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:48:10,847 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:48:10,847 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:48:10,847 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:48:10,847 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:48:10,847 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:48:10,848 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:48:10,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-06-22 10:48:10,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 10:48:10,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:48:10,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:48:10,862 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:48:10,862 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:48:10,862 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:48:10,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-06-22 10:48:10,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 10:48:10,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:48:10,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:48:10,865 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:48:10,865 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:48:10,870 INFO L794 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue [145] ULTIMATE.startENTRY-->L19: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 13#L19true [102] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 9#L19-2true [120] L19-2-->L8-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_sort_~x.base_1 |v_ULTIMATE.start_sort_#in~x.base_1|) (= |v_ULTIMATE.start_sort_#in~x.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_sort_#in~x.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_sort_~n_1 |v_ULTIMATE.start_sort_#in~n_1|) (= |v_ULTIMATE.start_sort_#in~n_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_sort_~x.offset_1 |v_ULTIMATE.start_sort_#in~x.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_sort_~pass~0_1 1)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_1, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_1, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_1, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_1|, ULTIMATE.start_sort_#in~x.base=|v_ULTIMATE.start_sort_#in~x.base_1|, ULTIMATE.start_sort_#in~n=|v_ULTIMATE.start_sort_#in~n_1|, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_1, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_sort_~temp~0=v_ULTIMATE.start_sort_~temp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_sort_#t~mem5=|v_ULTIMATE.start_sort_#t~mem5_1|, ULTIMATE.start_sort_#t~mem4=|v_ULTIMATE.start_sort_#t~mem4_1|, #length=|v_#length_1|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_1|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_1|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_1, ULTIMATE.start_sort_#in~x.offset=|v_ULTIMATE.start_sort_#in~x.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post1, ULTIMATE.start_sort_#in~x.base, ULTIMATE.start_sort_#in~n, ULTIMATE.start_sort_~n, ULTIMATE.start_sort_#t~post0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_sort_~temp~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_sort_#t~mem5, ULTIMATE.start_sort_#t~mem4, #length, ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2, ULTIMATE.start_sort_~x.base, ULTIMATE.start_sort_#in~x.offset] 8#L8-3true [2020-06-22 10:48:10,870 INFO L796 eck$LassoCheckResult]: Loop: 8#L8-3true [75] L8-3-->L10-3: Formula: (and (= v_ULTIMATE.start_sort_~i~0_3 0) (< v_ULTIMATE.start_sort_~pass~0_5 v_ULTIMATE.start_sort_~n_4)) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0] 11#L10-3true [147] L10-3-->L8-3: Formula: (and (<= v_ULTIMATE.start_sort_~n_8 (+ v_ULTIMATE.start_sort_~pass~0_12 v_ULTIMATE.start_sort_~i~0_20)) (= (+ v_ULTIMATE.start_sort_~pass~0_12 1) v_ULTIMATE.start_sort_~pass~0_11)) InVars {ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_12, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8} OutVars{ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_11, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post0] 8#L8-3true [2020-06-22 10:48:10,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:10,871 INFO L82 PathProgramCache]: Analyzing trace with hash 172418, now seen corresponding path program 1 times [2020-06-22 10:48:10,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:10,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:10,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:10,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:10,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:10,907 INFO L82 PathProgramCache]: Analyzing trace with hash 3433, now seen corresponding path program 1 times [2020-06-22 10:48:10,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:10,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:10,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:10,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:48:10,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 10:48:10,920 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:48:10,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:48:10,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:10,922 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-06-22 10:48:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:48:10,982 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-06-22 10:48:10,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:48:10,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 42 transitions. [2020-06-22 10:48:10,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 10:48:10,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 14 states and 18 transitions. [2020-06-22 10:48:10,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 10:48:10,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 10:48:10,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2020-06-22 10:48:10,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:48:10,989 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-06-22 10:48:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2020-06-22 10:48:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 10:48:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:48:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-06-22 10:48:10,992 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-06-22 10:48:10,992 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-06-22 10:48:10,992 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:48:10,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2020-06-22 10:48:10,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 10:48:10,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:48:10,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:48:10,993 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:48:10,993 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:48:10,994 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L19: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 67#L19 [102] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 62#L19-2 [120] L19-2-->L8-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_sort_~x.base_1 |v_ULTIMATE.start_sort_#in~x.base_1|) (= |v_ULTIMATE.start_sort_#in~x.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_sort_#in~x.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_sort_~n_1 |v_ULTIMATE.start_sort_#in~n_1|) (= |v_ULTIMATE.start_sort_#in~n_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_sort_~x.offset_1 |v_ULTIMATE.start_sort_#in~x.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_sort_~pass~0_1 1)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_1, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_1, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_1, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_1|, ULTIMATE.start_sort_#in~x.base=|v_ULTIMATE.start_sort_#in~x.base_1|, ULTIMATE.start_sort_#in~n=|v_ULTIMATE.start_sort_#in~n_1|, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_1, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_sort_~temp~0=v_ULTIMATE.start_sort_~temp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_sort_#t~mem5=|v_ULTIMATE.start_sort_#t~mem5_1|, ULTIMATE.start_sort_#t~mem4=|v_ULTIMATE.start_sort_#t~mem4_1|, #length=|v_#length_1|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_1|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_1|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_1, ULTIMATE.start_sort_#in~x.offset=|v_ULTIMATE.start_sort_#in~x.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post1, ULTIMATE.start_sort_#in~x.base, ULTIMATE.start_sort_#in~n, ULTIMATE.start_sort_~n, ULTIMATE.start_sort_#t~post0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_sort_~temp~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_sort_#t~mem5, ULTIMATE.start_sort_#t~mem4, #length, ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2, ULTIMATE.start_sort_~x.base, ULTIMATE.start_sort_#in~x.offset] 60#L8-3 [2020-06-22 10:48:10,994 INFO L796 eck$LassoCheckResult]: Loop: 60#L8-3 [75] L8-3-->L10-3: Formula: (and (= v_ULTIMATE.start_sort_~i~0_3 0) (< v_ULTIMATE.start_sort_~pass~0_5 v_ULTIMATE.start_sort_~n_4)) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0] 61#L10-3 [80] L10-3-->L11: Formula: (< (+ v_ULTIMATE.start_sort_~pass~0_7 v_ULTIMATE.start_sort_~i~0_5) v_ULTIMATE.start_sort_~n_6) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_7, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_6, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_5} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_7, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_6, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_5} AuxVars[] AssignedVars[] 63#L11 [91] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_sort_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_sort_~x.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_sort_~x.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_sort_~x.base_3)) (= |v_ULTIMATE.start_sort_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_sort_~x.base_3) .cse0)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_sort_~x.base_3))))) InVars {ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_3, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_3} OutVars{ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_3, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_2|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem2] 70#L11-1 [84] L11-1-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_sort_~i~0_8))) (let ((.cse1 (+ v_ULTIMATE.start_sort_~x.offset_5 .cse0 4))) (and (<= (+ v_ULTIMATE.start_sort_~x.offset_5 .cse0 8) (select |v_#length_5| v_ULTIMATE.start_sort_~x.base_6)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_sort_~x.base_6)) (<= 0 .cse1) (= |v_ULTIMATE.start_sort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_sort_~x.base_6) .cse1))))) InVars {ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_5, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_6} OutVars{ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_5, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_2|, #length=|v_#length_5|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_6} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem3] 68#L11-2 [110] L11-2-->L10-2: Formula: (>= |v_ULTIMATE.start_sort_#t~mem3_6| |v_ULTIMATE.start_sort_#t~mem2_6|) InVars {ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_6|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_6|} OutVars{ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_5|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2] 64#L10-2 [81] L10-2-->L10-3: Formula: (= v_ULTIMATE.start_sort_~i~0_18 (+ v_ULTIMATE.start_sort_~i~0_19 1)) InVars {ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_19} OutVars{ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_18, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_#t~post1] 65#L10-3 [147] L10-3-->L8-3: Formula: (and (<= v_ULTIMATE.start_sort_~n_8 (+ v_ULTIMATE.start_sort_~pass~0_12 v_ULTIMATE.start_sort_~i~0_20)) (= (+ v_ULTIMATE.start_sort_~pass~0_12 1) v_ULTIMATE.start_sort_~pass~0_11)) InVars {ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_12, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8} OutVars{ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_11, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post0] 60#L8-3 [2020-06-22 10:48:10,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:10,995 INFO L82 PathProgramCache]: Analyzing trace with hash 172418, now seen corresponding path program 2 times [2020-06-22 10:48:10,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:10,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:10,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:10,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:10,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:11,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:11,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1963092977, now seen corresponding path program 1 times [2020-06-22 10:48:11,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:11,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:11,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:11,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:48:11,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:11,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:11,026 INFO L82 PathProgramCache]: Analyzing trace with hash -999274672, now seen corresponding path program 1 times [2020-06-22 10:48:11,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:11,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:11,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:11,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:11,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:11,268 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:48:11,269 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:48:11,269 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:48:11,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:48:11,270 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:48:11,270 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:48:11,270 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:48:11,270 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:48:11,270 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 10:48:11,270 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:48:11,271 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:48:11,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:11,688 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:48:11,693 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:48:11,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:11,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:11,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:11,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:11,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:11,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:11,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:11,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:11,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:11,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:11,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:11,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:11,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:11,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:11,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:11,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:11,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:11,787 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:48:11,825 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 10:48:11,825 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:48:11,828 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:48:11,829 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:48:11,830 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:48:11,830 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2020-06-22 10:48:11,851 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 10:48:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:11,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:48:11,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:11,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:48:11,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:48:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:11,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:48:11,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:11,975 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:48:11,979 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:48:11,980 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-06-22 10:48:12,012 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 18 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 36 states and 45 transitions. Complement of second has 4 states. [2020-06-22 10:48:12,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:48:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:48:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2020-06-22 10:48:12,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 7 letters. [2020-06-22 10:48:12,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:12,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 10 letters. Loop has 7 letters. [2020-06-22 10:48:12,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:12,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 14 letters. [2020-06-22 10:48:12,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:12,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2020-06-22 10:48:12,025 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 10:48:12,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 45 transitions. [2020-06-22 10:48:12,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-06-22 10:48:12,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-06-22 10:48:12,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2020-06-22 10:48:12,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:48:12,026 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2020-06-22 10:48:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2020-06-22 10:48:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-06-22 10:48:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 10:48:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2020-06-22 10:48:12,029 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-06-22 10:48:12,029 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-06-22 10:48:12,029 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:48:12,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2020-06-22 10:48:12,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 10:48:12,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:48:12,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:48:12,031 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:48:12,031 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:48:12,032 INFO L794 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L19: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 211#L19 [102] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 202#L19-2 [119] L19-2-->L8-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_sort_~x.base_1 |v_ULTIMATE.start_sort_#in~x.base_1|) (= |v_ULTIMATE.start_sort_#in~x.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_sort_#in~x.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_sort_~n_1 |v_ULTIMATE.start_sort_#in~n_1|) (= |v_ULTIMATE.start_sort_#in~n_1| v_ULTIMATE.start_main_~array_size~0_7) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_sort_~x.offset_1 |v_ULTIMATE.start_sort_#in~x.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_sort_~pass~0_1 1)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_1, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_1, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_1, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_1|, ULTIMATE.start_sort_#in~x.base=|v_ULTIMATE.start_sort_#in~x.base_1|, ULTIMATE.start_sort_#in~n=|v_ULTIMATE.start_sort_#in~n_1|, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_1, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_sort_~temp~0=v_ULTIMATE.start_sort_~temp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_sort_#t~mem5=|v_ULTIMATE.start_sort_#t~mem5_1|, ULTIMATE.start_sort_#t~mem4=|v_ULTIMATE.start_sort_#t~mem4_1|, #length=|v_#length_1|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_1|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_1|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_1, ULTIMATE.start_sort_#in~x.offset=|v_ULTIMATE.start_sort_#in~x.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post1, ULTIMATE.start_sort_#in~x.base, ULTIMATE.start_sort_#in~n, ULTIMATE.start_sort_~n, ULTIMATE.start_sort_#t~post0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_sort_~temp~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_sort_#t~mem5, ULTIMATE.start_sort_#t~mem4, #length, ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2, ULTIMATE.start_sort_~x.base, ULTIMATE.start_sort_#in~x.offset] 197#L8-3 [2020-06-22 10:48:12,032 INFO L796 eck$LassoCheckResult]: Loop: 197#L8-3 [75] L8-3-->L10-3: Formula: (and (= v_ULTIMATE.start_sort_~i~0_3 0) (< v_ULTIMATE.start_sort_~pass~0_5 v_ULTIMATE.start_sort_~n_4)) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0] 198#L10-3 [80] L10-3-->L11: Formula: (< (+ v_ULTIMATE.start_sort_~pass~0_7 v_ULTIMATE.start_sort_~i~0_5) v_ULTIMATE.start_sort_~n_6) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_7, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_6, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_5} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_7, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_6, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_5} AuxVars[] AssignedVars[] 224#L11 [91] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_sort_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_sort_~x.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_sort_~x.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_sort_~x.base_3)) (= |v_ULTIMATE.start_sort_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_sort_~x.base_3) .cse0)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_sort_~x.base_3))))) InVars {ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_3, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_3} OutVars{ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_3, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_2|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem2] 229#L11-1 [84] L11-1-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_sort_~i~0_8))) (let ((.cse1 (+ v_ULTIMATE.start_sort_~x.offset_5 .cse0 4))) (and (<= (+ v_ULTIMATE.start_sort_~x.offset_5 .cse0 8) (select |v_#length_5| v_ULTIMATE.start_sort_~x.base_6)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_sort_~x.base_6)) (<= 0 .cse1) (= |v_ULTIMATE.start_sort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_sort_~x.base_6) .cse1))))) InVars {ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_5, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_6} OutVars{ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_5, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_2|, #length=|v_#length_5|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_6} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem3] 227#L11-2 [110] L11-2-->L10-2: Formula: (>= |v_ULTIMATE.start_sort_#t~mem3_6| |v_ULTIMATE.start_sort_#t~mem2_6|) InVars {ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_6|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_6|} OutVars{ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_5|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2] 225#L10-2 [81] L10-2-->L10-3: Formula: (= v_ULTIMATE.start_sort_~i~0_18 (+ v_ULTIMATE.start_sort_~i~0_19 1)) InVars {ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_19} OutVars{ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_18, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_#t~post1] 223#L10-3 [147] L10-3-->L8-3: Formula: (and (<= v_ULTIMATE.start_sort_~n_8 (+ v_ULTIMATE.start_sort_~pass~0_12 v_ULTIMATE.start_sort_~i~0_20)) (= (+ v_ULTIMATE.start_sort_~pass~0_12 1) v_ULTIMATE.start_sort_~pass~0_11)) InVars {ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_12, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8} OutVars{ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_11, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post0] 197#L8-3 [2020-06-22 10:48:12,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:12,032 INFO L82 PathProgramCache]: Analyzing trace with hash 172417, now seen corresponding path program 1 times [2020-06-22 10:48:12,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:12,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:12,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:12,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:12,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:12,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1963092977, now seen corresponding path program 2 times [2020-06-22 10:48:12,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:12,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:12,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:12,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:12,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:12,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:12,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1552882289, now seen corresponding path program 1 times [2020-06-22 10:48:12,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:12,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:12,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:12,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:48:12,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:12,260 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:48:12,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:48:12,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:48:12,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:48:12,260 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:48:12,261 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:48:12,261 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:48:12,261 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:48:12,261 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:48:12,261 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:48:12,261 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:48:12,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:12,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:12,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:12,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:12,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:12,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:12,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:12,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:12,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:12,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:12,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:12,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:12,633 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:48:12,634 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:48:12,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:12,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:12,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:12,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:12,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:12,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:12,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:12,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:12,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:12,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:12,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:12,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:12,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:12,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:12,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:12,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:12,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:12,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:12,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:12,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:12,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:12,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:12,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:12,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:12,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:12,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:12,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:12,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:12,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:12,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:12,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:12,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:12,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:12,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:12,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:12,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:12,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:12,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:12,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:12,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:12,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:12,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:12,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:12,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:12,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:12,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:12,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:12,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:12,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:12,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:12,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:12,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:12,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:12,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:12,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:12,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:12,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:12,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:12,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:12,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:12,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:12,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:12,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:12,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:12,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:12,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:12,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:12,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:12,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:12,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:12,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:12,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:12,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:12,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:12,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:12,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:12,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:12,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:12,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:12,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:12,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:12,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:12,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:12,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:12,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:12,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:12,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:12,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:12,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:12,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:12,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:12,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:12,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:12,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:12,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:12,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:12,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:12,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:12,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:12,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:12,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:12,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:12,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:12,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:12,689 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:48:12,729 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:48:12,729 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:48:12,729 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:48:12,730 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:48:12,731 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:48:12,731 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2020-06-22 10:48:12,740 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 10:48:12,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:12,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:48:12,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:12,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:48:12,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:48:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:12,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:48:12,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:12,870 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:48:12,870 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:48:12,870 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states and 44 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-06-22 10:48:12,896 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states and 44 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 4 states. [2020-06-22 10:48:12,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:48:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:48:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2020-06-22 10:48:12,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 7 letters. [2020-06-22 10:48:12,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:12,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 10 letters. Loop has 7 letters. [2020-06-22 10:48:12,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:12,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 14 letters. [2020-06-22 10:48:12,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:12,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2020-06-22 10:48:12,902 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2020-06-22 10:48:12,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2020-06-22 10:48:12,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-06-22 10:48:12,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-22 10:48:12,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2020-06-22 10:48:12,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:48:12,904 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2020-06-22 10:48:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2020-06-22 10:48:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2020-06-22 10:48:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:48:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-06-22 10:48:12,907 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-06-22 10:48:12,907 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-06-22 10:48:12,907 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:48:12,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2020-06-22 10:48:12,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 10:48:12,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:48:12,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:48:12,909 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:48:12,909 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:48:12,909 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L19: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 377#L19 [102] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 369#L19-2 [120] L19-2-->L8-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_sort_~x.base_1 |v_ULTIMATE.start_sort_#in~x.base_1|) (= |v_ULTIMATE.start_sort_#in~x.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_sort_#in~x.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_sort_~n_1 |v_ULTIMATE.start_sort_#in~n_1|) (= |v_ULTIMATE.start_sort_#in~n_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_sort_~x.offset_1 |v_ULTIMATE.start_sort_#in~x.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_sort_~pass~0_1 1)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_1, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_1, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_1, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_1|, ULTIMATE.start_sort_#in~x.base=|v_ULTIMATE.start_sort_#in~x.base_1|, ULTIMATE.start_sort_#in~n=|v_ULTIMATE.start_sort_#in~n_1|, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_1, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_sort_~temp~0=v_ULTIMATE.start_sort_~temp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_sort_#t~mem5=|v_ULTIMATE.start_sort_#t~mem5_1|, ULTIMATE.start_sort_#t~mem4=|v_ULTIMATE.start_sort_#t~mem4_1|, #length=|v_#length_1|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_1|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_1|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_1, ULTIMATE.start_sort_#in~x.offset=|v_ULTIMATE.start_sort_#in~x.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post1, ULTIMATE.start_sort_#in~x.base, ULTIMATE.start_sort_#in~n, ULTIMATE.start_sort_~n, ULTIMATE.start_sort_#t~post0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_sort_~temp~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_sort_#t~mem5, ULTIMATE.start_sort_#t~mem4, #length, ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2, ULTIMATE.start_sort_~x.base, ULTIMATE.start_sort_#in~x.offset] 365#L8-3 [75] L8-3-->L10-3: Formula: (and (= v_ULTIMATE.start_sort_~i~0_3 0) (< v_ULTIMATE.start_sort_~pass~0_5 v_ULTIMATE.start_sort_~n_4)) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0] 367#L10-3 [2020-06-22 10:48:12,910 INFO L796 eck$LassoCheckResult]: Loop: 367#L10-3 [80] L10-3-->L11: Formula: (< (+ v_ULTIMATE.start_sort_~pass~0_7 v_ULTIMATE.start_sort_~i~0_5) v_ULTIMATE.start_sort_~n_6) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_7, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_6, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_5} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_7, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_6, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_5} AuxVars[] AssignedVars[] 370#L11 [91] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_sort_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_sort_~x.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_sort_~x.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_sort_~x.base_3)) (= |v_ULTIMATE.start_sort_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_sort_~x.base_3) .cse0)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_sort_~x.base_3))))) InVars {ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_3, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_3} OutVars{ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_3, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_2|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem2] 382#L11-1 [84] L11-1-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_sort_~i~0_8))) (let ((.cse1 (+ v_ULTIMATE.start_sort_~x.offset_5 .cse0 4))) (and (<= (+ v_ULTIMATE.start_sort_~x.offset_5 .cse0 8) (select |v_#length_5| v_ULTIMATE.start_sort_~x.base_6)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_sort_~x.base_6)) (<= 0 .cse1) (= |v_ULTIMATE.start_sort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_sort_~x.base_6) .cse1))))) InVars {ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_5, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_6} OutVars{ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_5, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_2|, #length=|v_#length_5|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_6} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem3] 378#L11-2 [110] L11-2-->L10-2: Formula: (>= |v_ULTIMATE.start_sort_#t~mem3_6| |v_ULTIMATE.start_sort_#t~mem2_6|) InVars {ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_6|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_6|} OutVars{ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_5|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2] 372#L10-2 [81] L10-2-->L10-3: Formula: (= v_ULTIMATE.start_sort_~i~0_18 (+ v_ULTIMATE.start_sort_~i~0_19 1)) InVars {ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_19} OutVars{ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_18, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_#t~post1] 367#L10-3 [2020-06-22 10:48:12,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:12,910 INFO L82 PathProgramCache]: Analyzing trace with hash 5345033, now seen corresponding path program 1 times [2020-06-22 10:48:12,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:12,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:12,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:12,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:12,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:12,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:12,920 INFO L82 PathProgramCache]: Analyzing trace with hash 105306027, now seen corresponding path program 1 times [2020-06-22 10:48:12,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:12,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:12,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:12,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:12,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:12,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1556255325, now seen corresponding path program 1 times [2020-06-22 10:48:12,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:12,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:12,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:12,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:12,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:13,107 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-06-22 10:48:13,152 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:48:13,152 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:48:13,152 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:48:13,152 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:48:13,152 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:48:13,152 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:48:13,152 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:48:13,153 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:48:13,153 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 10:48:13,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:48:13,153 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:48:13,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:13,524 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:48:13,524 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:48:13,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:13,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:13,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:13,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:13,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:13,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:13,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:13,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:13,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:13,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:13,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:13,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:13,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:13,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:13,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:13,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:13,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:13,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:13,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:13,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:13,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:13,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:13,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:13,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:13,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:13,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:13,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:13,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:13,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:13,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:13,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:13,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:13,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:13,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:13,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:13,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:13,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:13,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:13,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:13,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:13,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:13,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:13,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:13,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:13,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:13,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:13,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:13,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:13,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:13,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:13,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:13,557 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:48:13,574 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:48:13,575 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:48:13,575 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:48:13,576 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:48:13,576 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:48:13,576 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2020-06-22 10:48:13,586 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 10:48:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:13,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:48:13,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:13,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:48:13,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:13,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:48:13,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:13,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:48:13,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:13,710 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:48:13,710 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:48:13,710 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 31 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-06-22 10:48:13,847 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 31 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 110 states and 129 transitions. Complement of second has 13 states. [2020-06-22 10:48:13,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 10:48:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:48:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-06-22 10:48:13,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 40 transitions. Stem has 4 letters. Loop has 5 letters. [2020-06-22 10:48:13,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:13,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 40 transitions. Stem has 9 letters. Loop has 5 letters. [2020-06-22 10:48:13,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:13,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 40 transitions. Stem has 4 letters. Loop has 10 letters. [2020-06-22 10:48:13,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:13,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 129 transitions. [2020-06-22 10:48:13,856 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:48:13,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 0 states and 0 transitions. [2020-06-22 10:48:13,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:48:13,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:48:13,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:48:13,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:48:13,856 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:48:13,857 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:48:13,857 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:48:13,857 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:48:13,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:48:13,857 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:48:13,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:48:13,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:48:13 BasicIcfg [2020-06-22 10:48:13,864 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:48:13,864 INFO L168 Benchmark]: Toolchain (without parser) took 4996.69 ms. Allocated memory was 514.9 MB in the beginning and 642.8 MB in the end (delta: 127.9 MB). Free memory was 439.6 MB in the beginning and 601.3 MB in the end (delta: -161.7 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:48:13,865 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 514.9 MB. Free memory is still 460.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:48:13,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.53 ms. Allocated memory was 514.9 MB in the beginning and 558.4 MB in the end (delta: 43.5 MB). Free memory was 438.9 MB in the beginning and 526.5 MB in the end (delta: -87.5 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:13,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.01 ms. Allocated memory is still 558.4 MB. Free memory was 526.5 MB in the beginning and 524.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:13,867 INFO L168 Benchmark]: Boogie Preprocessor took 26.13 ms. Allocated memory is still 558.4 MB. Free memory was 524.4 MB in the beginning and 523.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:13,867 INFO L168 Benchmark]: RCFGBuilder took 316.76 ms. Allocated memory is still 558.4 MB. Free memory was 523.1 MB in the beginning and 503.7 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:13,868 INFO L168 Benchmark]: BlockEncodingV2 took 118.13 ms. Allocated memory is still 558.4 MB. Free memory was 503.7 MB in the beginning and 495.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:13,868 INFO L168 Benchmark]: TraceAbstraction took 1136.78 ms. Allocated memory was 558.4 MB in the beginning and 592.4 MB in the end (delta: 34.1 MB). Free memory was 494.9 MB in the beginning and 548.5 MB in the end (delta: -53.6 MB). Peak memory consumption was 108.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:13,869 INFO L168 Benchmark]: BuchiAutomizer took 3056.21 ms. Allocated memory was 592.4 MB in the beginning and 642.8 MB in the end (delta: 50.3 MB). Free memory was 548.5 MB in the beginning and 601.3 MB in the end (delta: -52.8 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:48:13,873 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 33 locations, 38 edges - StatisticsResult: Encoded RCFG 25 locations, 41 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 514.9 MB. Free memory is still 460.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 297.53 ms. Allocated memory was 514.9 MB in the beginning and 558.4 MB in the end (delta: 43.5 MB). Free memory was 438.9 MB in the beginning and 526.5 MB in the end (delta: -87.5 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.01 ms. Allocated memory is still 558.4 MB. Free memory was 526.5 MB in the beginning and 524.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.13 ms. Allocated memory is still 558.4 MB. Free memory was 524.4 MB in the beginning and 523.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. * RCFGBuilder took 316.76 ms. Allocated memory is still 558.4 MB. Free memory was 523.1 MB in the beginning and 503.7 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 118.13 ms. Allocated memory is still 558.4 MB. Free memory was 503.7 MB in the beginning and 495.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1136.78 ms. Allocated memory was 558.4 MB in the beginning and 592.4 MB in the end (delta: 34.1 MB). Free memory was 494.9 MB in the beginning and 548.5 MB in the end (delta: -53.6 MB). Peak memory consumption was 108.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 3056.21 ms. Allocated memory was 592.4 MB in the beginning and 642.8 MB in the end (delta: 50.3 MB). Free memory was 548.5 MB in the beginning and 601.3 MB in the end (delta: -52.8 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-06-22 10:48:13,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:13,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((1 == \valid[x] && x == 0) && 4 * n + 4 <= unknown-#length-unknown[x] + 4 * pass) || ((1 == \valid[x] && n <= pass) && array_size <= 1) - InvariantResult [Line: 10]: Loop Invariant [2020-06-22 10:48:13,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:13,884 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:13,884 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:13,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:13,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:48:13,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((1 == \valid[x] && x == 0) && 4 * n + 4 <= unknown-#length-unknown[x] + 4 * pass) && 4 <= x + 4 * i) || ((((1 == \valid[x] && i == 0) && x == 0) && 4 * n + 4 <= unknown-#length-unknown[x] + 4 * pass) && 4 * i + 8 <= unknown-#length-unknown[x]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 12 error locations. SAFE Result, 1.0s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 34 SDtfs, 124 SDslu, 64 SDs, 0 SdLazy, 194 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 99 HoareAnnotationTreeSize, 2 FomulaSimplifications, 160 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function -1 * pass + n and consists of 3 locations. One nondeterministic module has affine ranking function -1 * pass + n and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 61 SDtfs, 154 SDslu, 45 SDs, 0 SdLazy, 121 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital119 mio100 ax100 hnf100 lsp94 ukn90 mio100 lsp64 div100 bol100 ite100 ukn100 eq184 hnf88 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:48:05.324 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:48:14.118 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check