YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:34:09,972 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:34:09,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:34:09,985 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:34:09,986 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:34:09,987 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:34:09,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:34:09,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:34:09,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:34:09,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:34:09,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:34:09,993 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:34:09,994 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:34:09,995 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:34:09,996 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:34:09,996 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:34:09,997 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:34:09,999 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:34:10,001 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:34:10,002 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:34:10,003 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:34:10,004 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:34:10,006 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:34:10,006 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:34:10,006 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:34:10,007 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:34:10,007 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:34:10,008 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:34:10,008 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:34:10,009 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:34:10,010 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:34:10,010 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:34:10,011 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:34:10,012 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:34:10,012 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:34:10,012 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:34:10,013 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:34:10,013 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:34:10,014 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:34:10,014 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:34:10,029 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:34:10,029 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:34:10,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:34:10,030 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:34:10,031 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:34:10,031 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:34:10,031 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:34:10,031 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:34:10,031 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:34:10,031 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:34:10,032 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:34:10,032 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:34:10,032 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:34:10,032 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:34:10,032 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:34:10,032 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:34:10,032 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:34:10,033 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:34:10,033 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:34:10,033 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:34:10,033 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:34:10,033 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:34:10,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:34:10,034 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:34:10,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:34:10,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:34:10,034 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:34:10,034 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:34:10,034 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:34:10,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:34:10,072 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:34:10,075 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:34:10,077 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:34:10,077 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:34:10,078 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:34:10,142 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/76fdc2ba0515457688ef1e7346b8ffc2/FLAG5f383500f [2020-06-22 09:34:10,475 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:34:10,476 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:34:10,476 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:34:10,483 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/76fdc2ba0515457688ef1e7346b8ffc2/FLAG5f383500f [2020-06-22 09:34:10,872 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/76fdc2ba0515457688ef1e7346b8ffc2 [2020-06-22 09:34:10,883 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:34:10,885 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:34:10,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:34:10,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:34:10,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:34:10,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:34:10" (1/1) ... [2020-06-22 09:34:10,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39230a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:10, skipping insertion in model container [2020-06-22 09:34:10,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:34:10" (1/1) ... [2020-06-22 09:34:10,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:34:10,919 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:34:11,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:34:11,162 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:34:11,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:34:11,197 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:34:11,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:11 WrapperNode [2020-06-22 09:34:11,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:34:11,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:34:11,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:34:11,199 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:34:11,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:11" (1/1) ... [2020-06-22 09:34:11,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:11" (1/1) ... [2020-06-22 09:34:11,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:34:11,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:34:11,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:34:11,242 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:34:11,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:11" (1/1) ... [2020-06-22 09:34:11,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:11" (1/1) ... [2020-06-22 09:34:11,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:11" (1/1) ... [2020-06-22 09:34:11,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:11" (1/1) ... [2020-06-22 09:34:11,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:11" (1/1) ... [2020-06-22 09:34:11,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:11" (1/1) ... [2020-06-22 09:34:11,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:11" (1/1) ... [2020-06-22 09:34:11,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:34:11,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:34:11,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:34:11,268 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:34:11,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:11" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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 09:34:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:34:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:34:11,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:34:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:34:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:34:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:34:11,577 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:34:11,578 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 09:34:11,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:34:11 BoogieIcfgContainer [2020-06-22 09:34:11,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:34:11,580 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:34:11,580 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:34:11,582 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:34:11,583 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:34:11" (1/1) ... [2020-06-22 09:34:11,599 INFO L313 BlockEncoder]: Initial Icfg 23 locations, 27 edges [2020-06-22 09:34:11,600 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:34:11,601 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:34:11,602 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:34:11,602 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:34:11,604 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:34:11,605 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:34:11,605 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:34:11,631 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:34:11,654 INFO L200 BlockEncoder]: SBE split 7 edges [2020-06-22 09:34:11,658 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 09:34:11,660 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:34:11,693 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-06-22 09:34:11,695 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 09:34:11,697 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:34:11,697 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:34:11,697 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:34:11,698 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:34:11,698 INFO L313 BlockEncoder]: Encoded RCFG 14 locations, 23 edges [2020-06-22 09:34:11,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:34:11 BasicIcfg [2020-06-22 09:34:11,699 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:34:11,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:34:11,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:34:11,703 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:34:11,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:34:10" (1/4) ... [2020-06-22 09:34:11,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca692a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:34:11, skipping insertion in model container [2020-06-22 09:34:11,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:11" (2/4) ... [2020-06-22 09:34:11,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca692a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:34:11, skipping insertion in model container [2020-06-22 09:34:11,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:34:11" (3/4) ... [2020-06-22 09:34:11,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca692a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:34:11, skipping insertion in model container [2020-06-22 09:34:11,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:34:11" (4/4) ... [2020-06-22 09:34:11,707 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:34:11,719 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:34:11,727 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-06-22 09:34:11,744 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-06-22 09:34:11,773 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:34:11,774 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:34:11,774 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:34:11,774 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:34:11,774 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:34:11,774 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:34:11,774 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:34:11,774 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:34:11,775 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:34:11,789 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2020-06-22 09:34:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:34:11,795 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:11,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:34:11,796 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:34:11,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:11,801 INFO L82 PathProgramCache]: Analyzing trace with hash 125029910, now seen corresponding path program 1 times [2020-06-22 09:34:11,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:11,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:11,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:11,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:11,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:11,977 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 09:34:11,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:11,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:34:11,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:34:11,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:34:11,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:34:12,001 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 4 states. [2020-06-22 09:34:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:12,088 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. [2020-06-22 09:34:12,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:34:12,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 09:34:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:12,102 INFO L225 Difference]: With dead ends: 15 [2020-06-22 09:34:12,102 INFO L226 Difference]: Without dead ends: 12 [2020-06-22 09:34:12,105 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 09:34:12,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-06-22 09:34:12,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-06-22 09:34:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 09:34:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-06-22 09:34:12,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 5 [2020-06-22 09:34:12,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:12,142 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 09:34:12,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:34:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-06-22 09:34:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:34:12,143 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:12,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:34:12,144 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:34:12,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:12,144 INFO L82 PathProgramCache]: Analyzing trace with hash 125029912, now seen corresponding path program 1 times [2020-06-22 09:34:12,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:12,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:12,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:12,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:12,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:12,195 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 09:34:12,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:12,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:34:12,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:34:12,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:34:12,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:34:12,198 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 4 states. [2020-06-22 09:34:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:12,244 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-06-22 09:34:12,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:34:12,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 09:34:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:12,245 INFO L225 Difference]: With dead ends: 15 [2020-06-22 09:34:12,245 INFO L226 Difference]: Without dead ends: 12 [2020-06-22 09:34:12,246 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 09:34:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-06-22 09:34:12,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-06-22 09:34:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 09:34:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-06-22 09:34:12,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 5 [2020-06-22 09:34:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:12,250 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-06-22 09:34:12,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:34:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-06-22 09:34:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:34:12,251 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:12,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:34:12,251 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:34:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:12,251 INFO L82 PathProgramCache]: Analyzing trace with hash 125029913, now seen corresponding path program 1 times [2020-06-22 09:34:12,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:12,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:12,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:12,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:12,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:12,297 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 09:34:12,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:12,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:34:12,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:34:12,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:34:12,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:34:12,299 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2020-06-22 09:34:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:12,358 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-06-22 09:34:12,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:34:12,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 09:34:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:12,359 INFO L225 Difference]: With dead ends: 20 [2020-06-22 09:34:12,359 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 09:34:12,360 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 09:34:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 09:34:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-06-22 09:34:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 09:34:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-06-22 09:34:12,365 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 5 [2020-06-22 09:34:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:12,365 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-06-22 09:34:12,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:34:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-06-22 09:34:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:34:12,366 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:12,366 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:12,367 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:34:12,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:12,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1028701617, now seen corresponding path program 1 times [2020-06-22 09:34:12,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:12,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:12,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:12,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:12,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:12,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:34:12,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:34:12,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:12,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 09:34:12,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:12,518 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 09:34:12,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 09:34:12,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2020-06-22 09:34:12,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 09:34:12,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 09:34:12,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:34:12,546 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 9 states. [2020-06-22 09:34:12,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:12,761 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2020-06-22 09:34:12,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 09:34:12,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2020-06-22 09:34:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:12,763 INFO L225 Difference]: With dead ends: 29 [2020-06-22 09:34:12,763 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:34:12,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-06-22 09:34:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:34:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:34:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:34:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:34:12,764 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2020-06-22 09:34:12,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:12,765 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:34:12,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 09:34:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:34:12,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:34:12,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:34:12,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:34:12,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:34:12,949 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2020-06-22 09:34:13,015 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:34:13,016 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2020-06-22 09:34:13,016 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:34:13,016 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 23 25) no Hoare annotation was computed. [2020-06-22 09:34:13,016 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:34:13,017 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:34:13,017 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:34:13,017 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:34:13,017 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:34:13,017 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 09:34:13,017 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-06-22 09:34:13,017 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 16) no Hoare annotation was computed. [2020-06-22 09:34:13,018 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 16) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_sumOfThirdBytes_~p~0.offset (+ |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset| (* 4 ULTIMATE.start_sumOfThirdBytes_~i~0) 2))) (.cse1 (<= (* 4 ULTIMATE.start_sumOfThirdBytes_~array_size) (select |#length| |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|))) (.cse2 (<= (+ ULTIMATE.start_sumOfThirdBytes_~p~0.offset 2) (select |#length| ULTIMATE.start_sumOfThirdBytes_~p~0.base))) (.cse3 (= 1 (select |#valid| |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|))) (.cse4 (= 0 |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset|)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_sumOfThirdBytes_~p~0.base)))) (or (and (<= 4 ULTIMATE.start_sumOfThirdBytes_~p~0.offset) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ULTIMATE.start_sumOfThirdBytes_~p~0.offset) .cse5 (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0)))) [2020-06-22 09:34:13,018 INFO L444 ceAbstractionStarter]: At program point L10-3(lines 10 17) the Hoare annotation is: (let ((.cse1 (<= (* 4 ULTIMATE.start_sumOfThirdBytes_~array_size) (select |#length| |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|))) (.cse2 (= 1 (select |#valid| |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|))) (.cse3 (= 0 |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset|))) (or (let ((.cse0 (* 4 ULTIMATE.start_sumOfThirdBytes_~i~0))) (and (<= ULTIMATE.start_sumOfThirdBytes_~p~0.offset (+ |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset| .cse0 2)) .cse1 .cse2 .cse3 (<= 2 (+ |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset| .cse0)))) (and .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0)))) [2020-06-22 09:34:13,019 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:34:13,030 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:13,031 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:13,031 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:13,031 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:13,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:13,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:13,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:13,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:13,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:13,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:13,043 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:13,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:13,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:34:13 BasicIcfg [2020-06-22 09:34:13,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:34:13,046 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:34:13,046 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:34:13,050 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:34:13,051 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:34:13,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:34:10" (1/5) ... [2020-06-22 09:34:13,051 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@595cd936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:34:13, skipping insertion in model container [2020-06-22 09:34:13,052 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:34:13,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:11" (2/5) ... [2020-06-22 09:34:13,052 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@595cd936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:34:13, skipping insertion in model container [2020-06-22 09:34:13,052 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:34:13,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:34:11" (3/5) ... [2020-06-22 09:34:13,053 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@595cd936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:34:13, skipping insertion in model container [2020-06-22 09:34:13,053 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:34:13,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:34:11" (4/5) ... [2020-06-22 09:34:13,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@595cd936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:34:13, skipping insertion in model container [2020-06-22 09:34:13,054 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:34:13,054 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:34:13" (5/5) ... [2020-06-22 09:34:13,055 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:34:13,077 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:34:13,077 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:34:13,077 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:34:13,077 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:34:13,078 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:34:13,078 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:34:13,078 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:34:13,078 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:34:13,078 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:34:13,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-06-22 09:34:13,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 09:34:13,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:34:13,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:34:13,092 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:34:13,092 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:34:13,093 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:34:13,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-06-22 09:34:13,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 09:34:13,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:34:13,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:34:13,094 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:34:13,095 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:34:13,100 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue [102] ULTIMATE.startENTRY-->L23: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, 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_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_13|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ret7, #NULL.base] 13#L23true [78] L23-->L23-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[] 10#L23-2true [89] L23-2-->L10-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1 0) (= v_ULTIMATE.start_sumOfThirdBytes_~i~0_1 0) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_sumOfThirdBytes_~array_size_1 |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_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_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_1, ULTIMATE.start_sumOfThirdBytes_#in~array_size=|v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_1, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_1, ULTIMATE.start_sumOfThirdBytes_#t~mem3=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_1|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_1, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, 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_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|, ULTIMATE.start_sumOfThirdBytes_#res=|v_ULTIMATE.start_sumOfThirdBytes_#res_1|, ULTIMATE.start_sumOfThirdBytes_#t~post2=|v_ULTIMATE.start_sumOfThirdBytes_#t~post2_1|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1, ULTIMATE.start_sumOfThirdBytes_#t~post4=|v_ULTIMATE.start_sumOfThirdBytes_#t~post4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset, ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_#in~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_~p~0.base, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_#t~mem3, ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~#numbers.base, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base, ULTIMATE.start_sumOfThirdBytes_#res, ULTIMATE.start_sumOfThirdBytes_#t~post2, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset, ULTIMATE.start_sumOfThirdBytes_~sum~0, ULTIMATE.start_sumOfThirdBytes_#t~post4] 7#L10-3true [2020-06-22 09:34:13,100 INFO L796 eck$LassoCheckResult]: Loop: 7#L10-3true [58] L10-3-->L13-3: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3 |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|) (< v_ULTIMATE.start_sumOfThirdBytes_~i~0_5 v_ULTIMATE.start_sumOfThirdBytes_~array_size_4) (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3 (+ |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3| (* 4 v_ULTIMATE.start_sumOfThirdBytes_~i~0_5) 2))) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base] 9#L13-3true [63] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5 1) (select |v_#length_3| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5)) (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5) (= (select |v_#valid_5| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5) 1)) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_#t~mem1] 12#L13-1true [105] L13-1-->L10-3: Formula: (and (<= |v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_8| 0) (= (+ v_ULTIMATE.start_sumOfThirdBytes_~i~0_11 1) v_ULTIMATE.start_sumOfThirdBytes_~i~0_10)) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_11, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_8|} OutVars{ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_10, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_4|, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_7|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#t~mem1] 7#L10-3true [2020-06-22 09:34:13,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:13,101 INFO L82 PathProgramCache]: Analyzing trace with hash 130320, now seen corresponding path program 1 times [2020-06-22 09:34:13,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:13,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:13,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:13,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:13,132 INFO L82 PathProgramCache]: Analyzing trace with hash 87587, now seen corresponding path program 1 times [2020-06-22 09:34:13,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:13,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:13,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:13,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:13,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:13,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:13,144 INFO L82 PathProgramCache]: Analyzing trace with hash -412546380, now seen corresponding path program 1 times [2020-06-22 09:34:13,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:13,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:13,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:13,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:13,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:13,336 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:34:13,337 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:34:13,337 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:34:13,337 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:34:13,337 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:34:13,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:34:13,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:34:13,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:34:13,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 09:34:13,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:34:13,338 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:34:13,357 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 09:34:13,363 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 09:34:13,368 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 09:34:13,372 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 09:34:13,376 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 09:34:13,378 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 09:34:13,380 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 09:34:13,383 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 09:34:13,465 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 09:34:13,468 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 09:34:13,469 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 09:34:13,471 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 09:34:13,473 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 09:34:13,709 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:34:13,714 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:34:13,717 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 09:34:13,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:13,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:13,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:13,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:13,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:13,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:13,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:13,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:13,723 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 09:34:13,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:13,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:13,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:13,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:13,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:13,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:13,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:13,731 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 09:34:13,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:13,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:13,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:13,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:13,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:13,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:13,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:13,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:13,734 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 09:34:13,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:13,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:13,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:13,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:13,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:13,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:13,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:13,740 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 09:34:13,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:13,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:13,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:13,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:13,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:13,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:13,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:13,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:13,743 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 09:34:13,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:13,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:13,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:13,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:13,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:13,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:13,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:13,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:13,745 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 09:34:13,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:13,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:13,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:13,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:13,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:13,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:13,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:13,751 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 09:34:13,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:13,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:13,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:13,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:13,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:13,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:13,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:13,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:13,754 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 09:34:13,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:13,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:13,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:13,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:13,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:13,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:13,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:13,772 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 09:34:13,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:13,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:13,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:13,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:13,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:13,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:13,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:13,778 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 09:34:13,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:13,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:13,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:13,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:13,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:13,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:13,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:13,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:13,782 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 09:34:13,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:13,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:13,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:13,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:13,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:13,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:13,817 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:34:13,840 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:34:13,840 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:34:13,843 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:34:13,844 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:34:13,844 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:34:13,845 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2020-06-22 09:34:13,849 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-06-22 09:34:13,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:13,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:34:13,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:13,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:34:13,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:13,911 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 09:34:13,926 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 09:34:13,929 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 2 loop predicates [2020-06-22 09:34:13,930 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states. Second operand 3 states. [2020-06-22 09:34:13,993 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states.. Second operand 3 states. Result 37 states and 65 transitions. Complement of second has 4 states. [2020-06-22 09:34:13,993 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 09:34:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 09:34:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-06-22 09:34:13,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 09:34:13,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:34:13,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 09:34:13,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:34:13,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 09:34:13,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:34:14,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 65 transitions. [2020-06-22 09:34:14,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 09:34:14,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 19 states and 25 transitions. [2020-06-22 09:34:14,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 09:34:14,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 09:34:14,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2020-06-22 09:34:14,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:34:14,010 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-06-22 09:34:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2020-06-22 09:34:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-06-22 09:34:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:34:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-06-22 09:34:14,013 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-06-22 09:34:14,013 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-06-22 09:34:14,013 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:34:14,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2020-06-22 09:34:14,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 09:34:14,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:34:14,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:34:14,015 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:34:14,015 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:34:14,015 INFO L794 eck$LassoCheckResult]: Stem: 108#ULTIMATE.startENTRY [102] ULTIMATE.startENTRY-->L23: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, 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_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_13|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ret7, #NULL.base] 109#L23 [78] L23-->L23-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[] 105#L23-2 [88] L23-2-->L10-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1 0) (= v_ULTIMATE.start_sumOfThirdBytes_~i~0_1 0) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_sumOfThirdBytes_~array_size_1 |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_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_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_1, ULTIMATE.start_sumOfThirdBytes_#in~array_size=|v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_1, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_1, ULTIMATE.start_sumOfThirdBytes_#t~mem3=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_1|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_1, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, 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_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|, ULTIMATE.start_sumOfThirdBytes_#res=|v_ULTIMATE.start_sumOfThirdBytes_#res_1|, ULTIMATE.start_sumOfThirdBytes_#t~post2=|v_ULTIMATE.start_sumOfThirdBytes_#t~post2_1|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1, ULTIMATE.start_sumOfThirdBytes_#t~post4=|v_ULTIMATE.start_sumOfThirdBytes_#t~post4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset, ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_#in~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_~p~0.base, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_#t~mem3, ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~#numbers.base, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base, ULTIMATE.start_sumOfThirdBytes_#res, ULTIMATE.start_sumOfThirdBytes_#t~post2, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset, ULTIMATE.start_sumOfThirdBytes_~sum~0, ULTIMATE.start_sumOfThirdBytes_#t~post4] 106#L10-3 [2020-06-22 09:34:14,016 INFO L796 eck$LassoCheckResult]: Loop: 106#L10-3 [58] L10-3-->L13-3: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3 |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|) (< v_ULTIMATE.start_sumOfThirdBytes_~i~0_5 v_ULTIMATE.start_sumOfThirdBytes_~array_size_4) (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3 (+ |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3| (* 4 v_ULTIMATE.start_sumOfThirdBytes_~i~0_5) 2))) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base] 111#L13-3 [63] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5 1) (select |v_#length_3| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5)) (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5) (= (select |v_#valid_5| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5) 1)) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_#t~mem1] 112#L13-1 [105] L13-1-->L10-3: Formula: (and (<= |v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_8| 0) (= (+ v_ULTIMATE.start_sumOfThirdBytes_~i~0_11 1) v_ULTIMATE.start_sumOfThirdBytes_~i~0_10)) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_11, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_8|} OutVars{ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_10, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_4|, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_7|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#t~mem1] 106#L10-3 [2020-06-22 09:34:14,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:14,016 INFO L82 PathProgramCache]: Analyzing trace with hash 130319, now seen corresponding path program 1 times [2020-06-22 09:34:14,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:14,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:14,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:14,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:14,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:14,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:14,029 INFO L82 PathProgramCache]: Analyzing trace with hash 87587, now seen corresponding path program 2 times [2020-06-22 09:34:14,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:14,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:14,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:14,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:14,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash -412576171, now seen corresponding path program 1 times [2020-06-22 09:34:14,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:14,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:14,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:34:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:14,221 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:34:14,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:34:14,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:34:14,221 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:34:14,221 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:34:14,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:34:14,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:34:14,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:34:14,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 09:34:14,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:34:14,222 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:34:14,225 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 09:34:14,229 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 09:34:14,232 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 09:34:14,235 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 09:34:14,318 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 09:34:14,320 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 09:34:14,323 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 09:34:14,325 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 09:34:14,326 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 09:34:14,328 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 09:34:14,329 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 09:34:14,331 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 09:34:14,333 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 09:34:14,533 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:34:14,533 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:34:14,534 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 09:34:14,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:14,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:14,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:14,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:14,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:14,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:14,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:14,539 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 09:34:14,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:14,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:14,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:14,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:14,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:14,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:14,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:14,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:14,541 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 09:34:14,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:14,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:14,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:14,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:14,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:14,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:14,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:14,546 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 09:34:14,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:14,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:14,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:14,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:14,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:14,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:14,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:14,558 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 09:34:14,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:14,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:14,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:14,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:14,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:14,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:14,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:14,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:14,561 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 09:34:14,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:14,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:14,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:14,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:14,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:14,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:14,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:14,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:14,563 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 09:34:14,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:14,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:14,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:14,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:14,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:14,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:14,591 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:34:14,609 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:34:14,609 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 09:34:14,610 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:34:14,610 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:34:14,611 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:34:14,611 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2020-06-22 09:34:14,614 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-06-22 09:34:14,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:14,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:34:14,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:14,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:34:14,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:14,664 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 09:34:14,680 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 09:34:14,680 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 2 loop predicates [2020-06-22 09:34:14,680 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-06-22 09:34:14,708 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 24 states and 32 transitions. Complement of second has 4 states. [2020-06-22 09:34:14,709 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 09:34:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 09:34:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-06-22 09:34:14,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 09:34:14,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:34:14,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 09:34:14,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:34:14,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 09:34:14,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:34:14,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 32 transitions. [2020-06-22 09:34:14,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 09:34:14,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 32 transitions. [2020-06-22 09:34:14,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 09:34:14,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 09:34:14,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2020-06-22 09:34:14,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:34:14,717 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-06-22 09:34:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2020-06-22 09:34:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 13. [2020-06-22 09:34:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 09:34:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-06-22 09:34:14,718 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 09:34:14,719 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 09:34:14,719 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:34:14,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-06-22 09:34:14,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:34:14,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:34:14,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:34:14,720 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 09:34:14,720 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:34:14,720 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY [102] ULTIMATE.startENTRY-->L23: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, 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_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_13|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ret7, #NULL.base] 193#L23 [78] L23-->L23-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[] 190#L23-2 [89] L23-2-->L10-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1 0) (= v_ULTIMATE.start_sumOfThirdBytes_~i~0_1 0) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_sumOfThirdBytes_~array_size_1 |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_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_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_1, ULTIMATE.start_sumOfThirdBytes_#in~array_size=|v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_1, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_1, ULTIMATE.start_sumOfThirdBytes_#t~mem3=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_1|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_1, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, 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_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|, ULTIMATE.start_sumOfThirdBytes_#res=|v_ULTIMATE.start_sumOfThirdBytes_#res_1|, ULTIMATE.start_sumOfThirdBytes_#t~post2=|v_ULTIMATE.start_sumOfThirdBytes_#t~post2_1|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1, ULTIMATE.start_sumOfThirdBytes_#t~post4=|v_ULTIMATE.start_sumOfThirdBytes_#t~post4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset, ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_#in~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_~p~0.base, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_#t~mem3, ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~#numbers.base, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base, ULTIMATE.start_sumOfThirdBytes_#res, ULTIMATE.start_sumOfThirdBytes_#t~post2, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset, ULTIMATE.start_sumOfThirdBytes_~sum~0, ULTIMATE.start_sumOfThirdBytes_#t~post4] 191#L10-3 [58] L10-3-->L13-3: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3 |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|) (< v_ULTIMATE.start_sumOfThirdBytes_~i~0_5 v_ULTIMATE.start_sumOfThirdBytes_~array_size_4) (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3 (+ |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3| (* 4 v_ULTIMATE.start_sumOfThirdBytes_~i~0_5) 2))) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base] 186#L13-3 [2020-06-22 09:34:14,721 INFO L796 eck$LassoCheckResult]: Loop: 186#L13-3 [63] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5 1) (select |v_#length_3| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5)) (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5) (= (select |v_#valid_5| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5) 1)) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_#t~mem1] 187#L13-1 [69] L13-1-->L15: Formula: (and (= (+ v_ULTIMATE.start_sumOfThirdBytes_~sum~0_5 1) v_ULTIMATE.start_sumOfThirdBytes_~sum~0_4) (< 0 |v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_6|)) InVars {ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_6|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_5} OutVars{ULTIMATE.start_sumOfThirdBytes_#t~post2=|v_ULTIMATE.start_sumOfThirdBytes_#t~post2_2|, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_5|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_4} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_#t~post2, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~sum~0] 182#L15 [107] L15-->L15-2: Formula: (and (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_11) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_11 1) (select |v_#length_9| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_14)) (= |v_ULTIMATE.start_sumOfThirdBytes_#t~post4_5| |v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_5|) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_14) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_11) |v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_5|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_14))) InVars {ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_11, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_14} OutVars{ULTIMATE.start_sumOfThirdBytes_#t~mem3=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_5|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_11, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_14, ULTIMATE.start_sumOfThirdBytes_#t~post4=|v_ULTIMATE.start_sumOfThirdBytes_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_#t~mem3, ULTIMATE.start_sumOfThirdBytes_#t~post4] 183#L15-2 [109] L15-2-->L13-3: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_15) 1) (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_12) (= (store |v_#memory_int_7| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_15 (store (select |v_#memory_int_7| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_15) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_12 (+ |v_ULTIMATE.start_sumOfThirdBytes_#t~post4_7| (- 1)))) |v_#memory_int_6|) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_12 1) (select |v_#length_10| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_15))) InVars {ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_12, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_15, ULTIMATE.start_sumOfThirdBytes_#t~post4=|v_ULTIMATE.start_sumOfThirdBytes_#t~post4_7|} OutVars{ULTIMATE.start_sumOfThirdBytes_#t~mem3=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_6|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_12, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_15, ULTIMATE.start_sumOfThirdBytes_#t~post4=|v_ULTIMATE.start_sumOfThirdBytes_#t~post4_6|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_#t~mem3, #memory_int, ULTIMATE.start_sumOfThirdBytes_#t~post4] 186#L13-3 [2020-06-22 09:34:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:14,721 INFO L82 PathProgramCache]: Analyzing trace with hash 4039978, now seen corresponding path program 1 times [2020-06-22 09:34:14,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:14,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:14,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:14,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2870089, now seen corresponding path program 1 times [2020-06-22 09:34:14,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:14,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:14,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:14,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:14,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1320111118, now seen corresponding path program 1 times [2020-06-22 09:34:14,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:14,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:14,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:14,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:14,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:14,930 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-06-22 09:34:14,994 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:34:14,994 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:34:14,994 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:34:14,995 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:34:14,995 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:34:14,995 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:34:14,995 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:34:14,995 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:34:14,995 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 09:34:14,995 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:34:14,995 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:34:14,998 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 09:34:15,124 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 09:34:15,127 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 09:34:15,130 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 09:34:15,131 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 09:34:15,133 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 09:34:15,136 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 09:34:15,138 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 09:34:15,139 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 09:34:15,141 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 09:34:15,143 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 09:34:15,144 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 09:34:15,146 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 09:34:15,384 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:34:15,384 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:34:15,385 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 09:34:15,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:15,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:15,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:15,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:15,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:15,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:15,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:15,393 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 09:34:15,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:15,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:15,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:15,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:15,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:15,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:15,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:15,403 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 09:34:15,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:15,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:15,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:15,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:15,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:15,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:15,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:15,406 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:34:15,407 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:34:15,407 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:34:15,407 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:34:15,407 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 09:34:15,408 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:34:15,408 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3 Supporting invariants [] [2020-06-22 09:34:15,415 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 09:34:15,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:15,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:34:15,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:15,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 09:34:15,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:15,531 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 09:34:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:15,575 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:34:15,575 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 09:34:15,575 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 4 loop predicates [2020-06-22 09:34:15,575 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-06-22 09:34:15,609 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 21 states and 27 transitions. Complement of second has 10 states. [2020-06-22 09:34:15,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 09:34:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 09:34:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2020-06-22 09:34:15,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 09:34:15,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:34:15,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 8 letters. Loop has 4 letters. [2020-06-22 09:34:15,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:34:15,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 09:34:15,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:34:15,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2020-06-22 09:34:15,614 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:34:15,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2020-06-22 09:34:15,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:34:15,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:34:15,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:34:15,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:34:15,615 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:34:15,615 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:34:15,615 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:34:15,615 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:34:15,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:34:15,615 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:34:15,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:34:15,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:34:15 BasicIcfg [2020-06-22 09:34:15,621 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:34:15,622 INFO L168 Benchmark]: Toolchain (without parser) took 4738.04 ms. Allocated memory was 649.6 MB in the beginning and 777.5 MB in the end (delta: 127.9 MB). Free memory was 558.8 MB in the beginning and 714.1 MB in the end (delta: -155.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:34:15,623 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:34:15,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.48 ms. Allocated memory was 649.6 MB in the beginning and 699.4 MB in the end (delta: 49.8 MB). Free memory was 558.8 MB in the beginning and 663.0 MB in the end (delta: -104.2 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-06-22 09:34:15,624 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.15 ms. Allocated memory is still 699.4 MB. Free memory was 663.0 MB in the beginning and 660.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:34:15,624 INFO L168 Benchmark]: Boogie Preprocessor took 25.04 ms. Allocated memory is still 699.4 MB. Free memory was 660.3 MB in the beginning and 659.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:34:15,625 INFO L168 Benchmark]: RCFGBuilder took 311.92 ms. Allocated memory is still 699.4 MB. Free memory was 659.0 MB in the beginning and 640.7 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:34:15,626 INFO L168 Benchmark]: BlockEncodingV2 took 119.18 ms. Allocated memory is still 699.4 MB. Free memory was 640.7 MB in the beginning and 632.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 09:34:15,626 INFO L168 Benchmark]: TraceAbstraction took 1345.83 ms. Allocated memory is still 699.4 MB. Free memory was 631.2 MB in the beginning and 502.2 MB in the end (delta: 129.0 MB). Peak memory consumption was 129.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:34:15,627 INFO L168 Benchmark]: BuchiAutomizer took 2575.19 ms. Allocated memory was 699.4 MB in the beginning and 777.5 MB in the end (delta: 78.1 MB). Free memory was 502.2 MB in the beginning and 714.1 MB in the end (delta: -211.9 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:34:15,632 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 23 locations, 27 edges - StatisticsResult: Encoded RCFG 14 locations, 23 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 312.48 ms. Allocated memory was 649.6 MB in the beginning and 699.4 MB in the end (delta: 49.8 MB). Free memory was 558.8 MB in the beginning and 663.0 MB in the end (delta: -104.2 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.15 ms. Allocated memory is still 699.4 MB. Free memory was 663.0 MB in the beginning and 660.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.04 ms. Allocated memory is still 699.4 MB. Free memory was 660.3 MB in the beginning and 659.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 311.92 ms. Allocated memory is still 699.4 MB. Free memory was 659.0 MB in the beginning and 640.7 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 119.18 ms. Allocated memory is still 699.4 MB. Free memory was 640.7 MB in the beginning and 632.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1345.83 ms. Allocated memory is still 699.4 MB. Free memory was 631.2 MB in the beginning and 502.2 MB in the end (delta: 129.0 MB). Peak memory consumption was 129.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2575.19 ms. Allocated memory was 699.4 MB in the beginning and 777.5 MB in the end (delta: 78.1 MB). Free memory was 502.2 MB in the beginning and 714.1 MB in the end (delta: -211.9 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 - 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 #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: 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: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2020-06-22 09:34:15,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:15,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:15,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:15,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:15,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:15,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:15,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:15,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((4 <= p && p <= numbers + 4 * i + 2) && 4 * array_size <= unknown-#length-unknown[numbers]) && p + 2 <= unknown-#length-unknown[p]) && 1 == \valid[numbers]) && 0 == numbers) && 1 == \valid[p]) || (((((((p <= numbers + 4 * i + 2 && 4 * array_size <= unknown-#length-unknown[numbers]) && p + 2 <= unknown-#length-unknown[p]) && 1 == \valid[numbers]) && 0 == numbers) && 2 <= p) && 1 == \valid[p]) && 0 == i) - InvariantResult [Line: 10]: Loop Invariant [2020-06-22 09:34:15,644 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:15,644 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:15,645 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:15,645 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((p <= numbers + 4 * i + 2 && 4 * array_size <= unknown-#length-unknown[numbers]) && 1 == \valid[numbers]) && 0 == numbers) && 2 <= numbers + 4 * i) || (((4 * array_size <= unknown-#length-unknown[numbers] && 1 == \valid[numbers]) && 0 == numbers) && 0 == i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 6 error locations. SAFE Result, 1.2s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 16 SDtfs, 83 SDslu, 48 SDs, 0 SdLazy, 137 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 10 NumberOfFragments, 133 HoareAnnotationTreeSize, 2 FomulaSimplifications, 587 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 610 SizeOfPredicates, 4 NumberOfNonLiveVariables, 58 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 3/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 90 SDslu, 20 SDs, 0 SdLazy, 83 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital120 mio100 ax100 hnf100 lsp91 ukn81 mio100 lsp61 div100 bol100 ite100 ukn100 eq191 hnf90 smp100 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 09:34:07.675 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:34:15.874 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check