21.33/11.59 YES 21.33/11.59 21.33/11.59 Ultimate: Cannot open display: 21.33/11.59 This is Ultimate 0.1.24-8dc7c08-m 21.33/11.59 [2019-03-28 12:02:00,725 INFO L170 SettingsManager]: Resetting all preferences to default values... 21.33/11.59 [2019-03-28 12:02:00,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 21.33/11.59 [2019-03-28 12:02:00,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 21.33/11.59 [2019-03-28 12:02:00,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 21.33/11.59 [2019-03-28 12:02:00,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 21.33/11.59 [2019-03-28 12:02:00,741 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 21.33/11.59 [2019-03-28 12:02:00,743 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 21.33/11.59 [2019-03-28 12:02:00,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 21.33/11.59 [2019-03-28 12:02:00,745 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 21.33/11.59 [2019-03-28 12:02:00,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 21.33/11.59 [2019-03-28 12:02:00,746 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 21.33/11.59 [2019-03-28 12:02:00,747 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 21.33/11.59 [2019-03-28 12:02:00,748 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 21.33/11.59 [2019-03-28 12:02:00,749 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 21.33/11.59 [2019-03-28 12:02:00,750 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 21.33/11.59 [2019-03-28 12:02:00,751 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 21.33/11.59 [2019-03-28 12:02:00,753 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 21.33/11.59 [2019-03-28 12:02:00,755 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 21.33/11.59 [2019-03-28 12:02:00,756 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 21.33/11.59 [2019-03-28 12:02:00,757 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 21.33/11.59 [2019-03-28 12:02:00,759 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 21.33/11.59 [2019-03-28 12:02:00,761 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 21.33/11.59 [2019-03-28 12:02:00,761 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 21.33/11.59 [2019-03-28 12:02:00,762 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 21.33/11.59 [2019-03-28 12:02:00,762 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 21.33/11.59 [2019-03-28 12:02:00,763 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 21.33/11.59 [2019-03-28 12:02:00,764 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 21.33/11.59 [2019-03-28 12:02:00,764 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 21.33/11.59 [2019-03-28 12:02:00,765 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 21.33/11.59 [2019-03-28 12:02:00,766 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 21.33/11.59 [2019-03-28 12:02:00,767 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 21.33/11.59 [2019-03-28 12:02:00,768 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 21.33/11.59 [2019-03-28 12:02:00,768 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 21.33/11.59 [2019-03-28 12:02:00,769 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 21.33/11.59 [2019-03-28 12:02:00,769 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 21.33/11.59 [2019-03-28 12:02:00,769 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 21.33/11.59 [2019-03-28 12:02:00,770 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 21.33/11.59 [2019-03-28 12:02:00,771 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 21.33/11.59 [2019-03-28 12:02:00,771 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 21.33/11.59 [2019-03-28 12:02:00,786 INFO L110 SettingsManager]: Loading preferences was successful 21.33/11.59 [2019-03-28 12:02:00,787 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 21.33/11.59 [2019-03-28 12:02:00,788 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 21.33/11.59 [2019-03-28 12:02:00,788 INFO L133 SettingsManager]: * Rewrite not-equals=true 21.33/11.59 [2019-03-28 12:02:00,788 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 21.33/11.59 [2019-03-28 12:02:00,788 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 21.33/11.59 [2019-03-28 12:02:00,788 INFO L133 SettingsManager]: * Use SBE=true 21.33/11.59 [2019-03-28 12:02:00,789 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 21.33/11.59 [2019-03-28 12:02:00,789 INFO L133 SettingsManager]: * Use old map elimination=false 21.33/11.59 [2019-03-28 12:02:00,789 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 21.33/11.59 [2019-03-28 12:02:00,789 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 21.33/11.59 [2019-03-28 12:02:00,789 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 21.33/11.59 [2019-03-28 12:02:00,789 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 21.33/11.59 [2019-03-28 12:02:00,790 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 21.33/11.59 [2019-03-28 12:02:00,790 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.33/11.59 [2019-03-28 12:02:00,790 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 21.33/11.59 [2019-03-28 12:02:00,790 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 21.33/11.59 [2019-03-28 12:02:00,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE 21.33/11.59 [2019-03-28 12:02:00,791 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 21.33/11.59 [2019-03-28 12:02:00,791 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 21.33/11.59 [2019-03-28 12:02:00,791 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 21.33/11.59 [2019-03-28 12:02:00,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 21.33/11.59 [2019-03-28 12:02:00,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 21.33/11.59 [2019-03-28 12:02:00,791 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 21.33/11.59 [2019-03-28 12:02:00,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 21.33/11.59 [2019-03-28 12:02:00,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 21.33/11.59 [2019-03-28 12:02:00,792 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 21.33/11.59 [2019-03-28 12:02:00,792 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 21.33/11.59 [2019-03-28 12:02:00,792 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 21.33/11.59 [2019-03-28 12:02:00,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 21.33/11.59 [2019-03-28 12:02:00,831 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 21.33/11.59 [2019-03-28 12:02:00,835 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 21.33/11.59 [2019-03-28 12:02:00,836 INFO L271 PluginConnector]: Initializing CDTParser... 21.33/11.59 [2019-03-28 12:02:00,836 INFO L276 PluginConnector]: CDTParser initialized 21.33/11.59 [2019-03-28 12:02:00,837 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 21.33/11.59 [2019-03-28 12:02:00,905 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/7b68bfe3a69740aa9426c3d81fc8f6cb/FLAG5883e649e 21.33/11.59 [2019-03-28 12:02:01,235 INFO L307 CDTParser]: Found 1 translation units. 21.33/11.59 [2019-03-28 12:02:01,236 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 21.33/11.59 [2019-03-28 12:02:01,243 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/7b68bfe3a69740aa9426c3d81fc8f6cb/FLAG5883e649e 21.33/11.59 [2019-03-28 12:02:01,645 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/7b68bfe3a69740aa9426c3d81fc8f6cb 21.33/11.59 [2019-03-28 12:02:01,656 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 21.33/11.59 [2019-03-28 12:02:01,658 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 21.33/11.59 [2019-03-28 12:02:01,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 21.33/11.59 [2019-03-28 12:02:01,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 21.33/11.59 [2019-03-28 12:02:01,663 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 21.33/11.59 [2019-03-28 12:02:01,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:02:01" (1/1) ... 21.33/11.59 [2019-03-28 12:02:01,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b7edcc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01, skipping insertion in model container 21.33/11.59 [2019-03-28 12:02:01,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:02:01" (1/1) ... 21.33/11.59 [2019-03-28 12:02:01,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 21.33/11.59 [2019-03-28 12:02:01,691 INFO L176 MainTranslator]: Built tables and reachable declarations 21.33/11.59 [2019-03-28 12:02:01,848 INFO L206 PostProcessor]: Analyzing one entry point: main 21.33/11.59 [2019-03-28 12:02:01,853 INFO L191 MainTranslator]: Completed pre-run 21.33/11.59 [2019-03-28 12:02:01,869 INFO L206 PostProcessor]: Analyzing one entry point: main 21.33/11.59 [2019-03-28 12:02:01,885 INFO L195 MainTranslator]: Completed translation 21.33/11.59 [2019-03-28 12:02:01,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01 WrapperNode 21.33/11.59 [2019-03-28 12:02:01,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 21.33/11.59 [2019-03-28 12:02:01,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 21.33/11.59 [2019-03-28 12:02:01,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 21.33/11.59 [2019-03-28 12:02:01,886 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 21.33/11.59 [2019-03-28 12:02:01,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01" (1/1) ... 21.33/11.59 [2019-03-28 12:02:01,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01" (1/1) ... 21.33/11.59 [2019-03-28 12:02:01,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 21.33/11.59 [2019-03-28 12:02:01,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 21.33/11.59 [2019-03-28 12:02:01,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 21.33/11.59 [2019-03-28 12:02:01,983 INFO L276 PluginConnector]: Boogie Preprocessor initialized 21.33/11.59 [2019-03-28 12:02:01,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01" (1/1) ... 21.33/11.59 [2019-03-28 12:02:01,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01" (1/1) ... 21.33/11.59 [2019-03-28 12:02:01,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01" (1/1) ... 21.33/11.59 [2019-03-28 12:02:01,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01" (1/1) ... 21.33/11.59 [2019-03-28 12:02:01,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01" (1/1) ... 21.33/11.59 [2019-03-28 12:02:02,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01" (1/1) ... 21.33/11.59 [2019-03-28 12:02:02,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01" (1/1) ... 21.33/11.59 [2019-03-28 12:02:02,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 21.33/11.59 [2019-03-28 12:02:02,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 21.33/11.59 [2019-03-28 12:02:02,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... 21.33/11.59 [2019-03-28 12:02:02,004 INFO L276 PluginConnector]: RCFGBuilder initialized 21.33/11.59 [2019-03-28 12:02:02,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01" (1/1) ... 21.33/11.59 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.33/11.59 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 21.33/11.59 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 21.33/11.59 [2019-03-28 12:02:02,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 21.33/11.59 [2019-03-28 12:02:02,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 21.33/11.59 [2019-03-28 12:02:02,214 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 21.33/11.59 [2019-03-28 12:02:02,214 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 21.33/11.59 [2019-03-28 12:02:02,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:02 BoogieIcfgContainer 21.33/11.59 [2019-03-28 12:02:02,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 21.33/11.59 [2019-03-28 12:02:02,216 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 21.33/11.59 [2019-03-28 12:02:02,217 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 21.33/11.59 [2019-03-28 12:02:02,219 INFO L276 PluginConnector]: BlockEncodingV2 initialized 21.33/11.59 [2019-03-28 12:02:02,220 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:02" (1/1) ... 21.33/11.59 [2019-03-28 12:02:02,236 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges 21.33/11.59 [2019-03-28 12:02:02,238 INFO L258 BlockEncoder]: Using Remove infeasible edges 21.33/11.59 [2019-03-28 12:02:02,239 INFO L263 BlockEncoder]: Using Maximize final states 21.33/11.59 [2019-03-28 12:02:02,239 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 21.33/11.59 [2019-03-28 12:02:02,240 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 21.33/11.59 [2019-03-28 12:02:02,242 INFO L296 BlockEncoder]: Using Remove sink states 21.33/11.59 [2019-03-28 12:02:02,242 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 21.33/11.59 [2019-03-28 12:02:02,243 INFO L179 BlockEncoder]: Using Rewrite not-equals 21.33/11.59 [2019-03-28 12:02:02,260 INFO L185 BlockEncoder]: Using Use SBE 21.33/11.59 [2019-03-28 12:02:02,285 INFO L200 BlockEncoder]: SBE split 3 edges 21.33/11.59 [2019-03-28 12:02:02,290 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 21.33/11.59 [2019-03-28 12:02:02,292 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.33/11.59 [2019-03-28 12:02:02,303 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 21.33/11.59 [2019-03-28 12:02:02,305 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 21.33/11.59 [2019-03-28 12:02:02,307 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 21.33/11.59 [2019-03-28 12:02:02,307 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.33/11.59 [2019-03-28 12:02:02,307 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 21.33/11.59 [2019-03-28 12:02:02,308 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 21.33/11.59 [2019-03-28 12:02:02,308 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 24 edges 21.33/11.59 [2019-03-28 12:02:02,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:02 BasicIcfg 21.33/11.59 [2019-03-28 12:02:02,309 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 21.33/11.59 [2019-03-28 12:02:02,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 21.33/11.59 [2019-03-28 12:02:02,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... 21.33/11.59 [2019-03-28 12:02:02,314 INFO L276 PluginConnector]: TraceAbstraction initialized 21.33/11.59 [2019-03-28 12:02:02,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:02:01" (1/4) ... 21.33/11.59 [2019-03-28 12:02:02,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f39f4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:02:02, skipping insertion in model container 21.33/11.59 [2019-03-28 12:02:02,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01" (2/4) ... 21.33/11.59 [2019-03-28 12:02:02,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f39f4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:02:02, skipping insertion in model container 21.33/11.59 [2019-03-28 12:02:02,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:02" (3/4) ... 21.33/11.59 [2019-03-28 12:02:02,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f39f4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:02, skipping insertion in model container 21.33/11.59 [2019-03-28 12:02:02,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:02" (4/4) ... 21.33/11.59 [2019-03-28 12:02:02,319 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 21.33/11.59 [2019-03-28 12:02:02,329 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 21.33/11.59 [2019-03-28 12:02:02,337 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 21.33/11.59 [2019-03-28 12:02:02,354 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 21.33/11.59 [2019-03-28 12:02:02,382 INFO L133 ementStrategyFactory]: Using default assertion order modulation 21.33/11.59 [2019-03-28 12:02:02,383 INFO L382 AbstractCegarLoop]: Interprodecural is true 21.33/11.59 [2019-03-28 12:02:02,383 INFO L383 AbstractCegarLoop]: Hoare is true 21.33/11.59 [2019-03-28 12:02:02,384 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 21.33/11.59 [2019-03-28 12:02:02,384 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 21.33/11.59 [2019-03-28 12:02:02,384 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 21.33/11.59 [2019-03-28 12:02:02,384 INFO L387 AbstractCegarLoop]: Difference is false 21.33/11.59 [2019-03-28 12:02:02,384 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 21.33/11.59 [2019-03-28 12:02:02,384 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 21.33/11.59 [2019-03-28 12:02:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. 21.33/11.59 [2019-03-28 12:02:02,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 21.33/11.59 [2019-03-28 12:02:02,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. 21.33/11.59 [2019-03-28 12:02:02,456 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 17 26) no Hoare annotation was computed. 21.33/11.59 [2019-03-28 12:02:02,457 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 21.33/11.59 [2019-03-28 12:02:02,457 INFO L451 ceAbstractionStarter]: At program point L23-1(lines 17 26) the Hoare annotation is: true 21.33/11.59 [2019-03-28 12:02:02,457 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 22) no Hoare annotation was computed. 21.33/11.59 [2019-03-28 12:02:02,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:02 BasicIcfg 21.33/11.59 [2019-03-28 12:02:02,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 21.33/11.59 [2019-03-28 12:02:02,466 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 21.33/11.59 [2019-03-28 12:02:02,467 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 21.33/11.59 [2019-03-28 12:02:02,470 INFO L276 PluginConnector]: BuchiAutomizer initialized 21.33/11.59 [2019-03-28 12:02:02,471 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.33/11.59 [2019-03-28 12:02:02,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:02:01" (1/5) ... 21.33/11.59 [2019-03-28 12:02:02,471 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73d7c3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:02:02, skipping insertion in model container 21.33/11.59 [2019-03-28 12:02:02,472 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.33/11.59 [2019-03-28 12:02:02,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:01" (2/5) ... 21.33/11.59 [2019-03-28 12:02:02,472 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73d7c3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:02:02, skipping insertion in model container 21.33/11.59 [2019-03-28 12:02:02,472 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.33/11.59 [2019-03-28 12:02:02,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:02" (3/5) ... 21.33/11.59 [2019-03-28 12:02:02,473 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73d7c3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:02, skipping insertion in model container 21.33/11.59 [2019-03-28 12:02:02,473 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.33/11.59 [2019-03-28 12:02:02,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:02" (4/5) ... 21.33/11.59 [2019-03-28 12:02:02,473 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73d7c3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:02, skipping insertion in model container 21.33/11.59 [2019-03-28 12:02:02,473 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.33/11.59 [2019-03-28 12:02:02,474 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:02" (5/5) ... 21.33/11.59 [2019-03-28 12:02:02,475 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 21.33/11.59 [2019-03-28 12:02:02,501 INFO L133 ementStrategyFactory]: Using default assertion order modulation 21.33/11.59 [2019-03-28 12:02:02,502 INFO L374 BuchiCegarLoop]: Interprodecural is true 21.33/11.59 [2019-03-28 12:02:02,502 INFO L375 BuchiCegarLoop]: Hoare is true 21.33/11.59 [2019-03-28 12:02:02,502 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 21.33/11.59 [2019-03-28 12:02:02,502 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 21.33/11.59 [2019-03-28 12:02:02,502 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 21.33/11.59 [2019-03-28 12:02:02,502 INFO L379 BuchiCegarLoop]: Difference is false 21.33/11.59 [2019-03-28 12:02:02,503 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 21.33/11.59 [2019-03-28 12:02:02,503 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 21.33/11.59 [2019-03-28 12:02:02,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 21.33/11.59 [2019-03-28 12:02:02,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 21.33/11.59 [2019-03-28 12:02:02,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.33/11.59 [2019-03-28 12:02:02,526 INFO L119 BuchiIsEmpty]: Starting construction of run 21.33/11.59 [2019-03-28 12:02:02,534 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 21.33/11.59 [2019-03-28 12:02:02,534 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.33/11.59 [2019-03-28 12:02:02,534 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 21.33/11.59 [2019-03-28 12:02:02,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 21.33/11.59 [2019-03-28 12:02:02,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 21.33/11.59 [2019-03-28 12:02:02,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.33/11.59 [2019-03-28 12:02:02,535 INFO L119 BuchiIsEmpty]: Starting construction of run 21.33/11.59 [2019-03-28 12:02:02,536 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 21.33/11.59 [2019-03-28 12:02:02,536 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.33/11.59 [2019-03-28 12:02:02,541 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [31] ULTIMATE.startENTRY-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~debug~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~debug~0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 5#L23-1true 21.33/11.59 [2019-03-28 12:02:02,542 INFO L796 eck$LassoCheckResult]: Loop: 5#L23-1true [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 6#L18true [45] L18-->L18-2: Formula: (let ((.cse0 (mod v_ULTIMATE.start_main_~x~0_8 2))) (and (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (< v_ULTIMATE.start_main_~x~0_8 0) (> (+ .cse0 (- 2)) 0) (> 0 .cse0))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 4#L18-2true [64] L18-2-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_4 0) (< 0 v_ULTIMATE.start_main_~debug~0_4)) InVars {ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_4} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 5#L23-1true 21.33/11.59 [2019-03-28 12:02:02,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.59 [2019-03-28 12:02:02,548 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times 21.33/11.59 [2019-03-28 12:02:02,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.59 [2019-03-28 12:02:02,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.59 [2019-03-28 12:02:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:02,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.59 [2019-03-28 12:02:02,619 INFO L82 PathProgramCache]: Analyzing trace with hash 66807, now seen corresponding path program 1 times 21.33/11.59 [2019-03-28 12:02:02,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.59 [2019-03-28 12:02:02,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.59 [2019-03-28 12:02:02,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.33/11.59 [2019-03-28 12:02:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.33/11.59 [2019-03-28 12:02:02,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.33/11.59 [2019-03-28 12:02:02,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 21.33/11.59 [2019-03-28 12:02:02,667 INFO L811 eck$LassoCheckResult]: loop already infeasible 21.33/11.59 [2019-03-28 12:02:02,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. 21.33/11.59 [2019-03-28 12:02:02,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 21.33/11.59 [2019-03-28 12:02:02,683 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 2 states. 21.33/11.59 [2019-03-28 12:02:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.33/11.59 [2019-03-28 12:02:02,732 INFO L93 Difference]: Finished difference Result 4 states and 9 transitions. 21.33/11.59 [2019-03-28 12:02:02,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 21.33/11.59 [2019-03-28 12:02:02,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4 states and 9 transitions. 21.33/11.59 [2019-03-28 12:02:02,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 21.33/11.59 [2019-03-28 12:02:02,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4 states to 4 states and 9 transitions. 21.33/11.59 [2019-03-28 12:02:02,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 21.33/11.59 [2019-03-28 12:02:02,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 21.33/11.59 [2019-03-28 12:02:02,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 9 transitions. 21.33/11.59 [2019-03-28 12:02:02,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 21.33/11.59 [2019-03-28 12:02:02,745 INFO L706 BuchiCegarLoop]: Abstraction has 4 states and 9 transitions. 21.33/11.59 [2019-03-28 12:02:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states and 9 transitions. 21.33/11.59 [2019-03-28 12:02:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. 21.33/11.59 [2019-03-28 12:02:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 21.33/11.59 [2019-03-28 12:02:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. 21.33/11.59 [2019-03-28 12:02:02,775 INFO L729 BuchiCegarLoop]: Abstraction has 4 states and 9 transitions. 21.33/11.59 [2019-03-28 12:02:02,775 INFO L609 BuchiCegarLoop]: Abstraction has 4 states and 9 transitions. 21.33/11.59 [2019-03-28 12:02:02,775 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 21.33/11.59 [2019-03-28 12:02:02,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 9 transitions. 21.33/11.59 [2019-03-28 12:02:02,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 21.33/11.59 [2019-03-28 12:02:02,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.33/11.59 [2019-03-28 12:02:02,776 INFO L119 BuchiIsEmpty]: Starting construction of run 21.33/11.59 [2019-03-28 12:02:02,777 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 21.33/11.59 [2019-03-28 12:02:02,777 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.33/11.59 [2019-03-28 12:02:02,777 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~debug~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~debug~0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 17#L23-1 21.33/11.59 [2019-03-28 12:02:02,778 INFO L796 eck$LassoCheckResult]: Loop: 17#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 19#L18 [55] L18-->L18-2: Formula: (let ((.cse0 (mod v_ULTIMATE.start_main_~x~0_8 2))) (and (< (+ .cse0 (- 2)) 0) (< 0 .cse0) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (< v_ULTIMATE.start_main_~x~0_8 0))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 18#L18-2 [64] L18-2-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_4 0) (< 0 v_ULTIMATE.start_main_~debug~0_4)) InVars {ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_4} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 17#L23-1 21.33/11.59 [2019-03-28 12:02:02,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.59 [2019-03-28 12:02:02,778 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 2 times 21.33/11.59 [2019-03-28 12:02:02,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.59 [2019-03-28 12:02:02,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.59 [2019-03-28 12:02:02,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.59 [2019-03-28 12:02:02,784 INFO L82 PathProgramCache]: Analyzing trace with hash 67117, now seen corresponding path program 1 times 21.33/11.59 [2019-03-28 12:02:02,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.59 [2019-03-28 12:02:02,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.59 [2019-03-28 12:02:02,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:02,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.59 [2019-03-28 12:02:02,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1884368, now seen corresponding path program 1 times 21.33/11.59 [2019-03-28 12:02:02,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.59 [2019-03-28 12:02:02,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.59 [2019-03-28 12:02:02,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.33/11.59 [2019-03-28 12:02:02,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.33/11.59 [2019-03-28 12:02:02,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.33/11.59 [2019-03-28 12:02:02,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 21.33/11.59 [2019-03-28 12:02:02,892 INFO L216 LassoAnalysis]: Preferences: 21.33/11.59 [2019-03-28 12:02:02,893 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.33/11.59 [2019-03-28 12:02:02,893 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.33/11.59 [2019-03-28 12:02:02,893 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.33/11.59 [2019-03-28 12:02:02,893 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.33/11.59 [2019-03-28 12:02:02,894 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.33/11.59 [2019-03-28 12:02:02,894 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.33/11.59 [2019-03-28 12:02:02,894 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.33/11.59 [2019-03-28 12:02:02,894 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 21.33/11.59 [2019-03-28 12:02:02,894 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.33/11.59 [2019-03-28 12:02:02,895 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.33/11.59 [2019-03-28 12:02:02,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.59 [2019-03-28 12:02:02,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.59 [2019-03-28 12:02:02,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.59 [2019-03-28 12:02:03,031 INFO L300 LassoAnalysis]: Preprocessing complete. 21.33/11.59 [2019-03-28 12:02:03,032 INFO L412 LassoAnalysis]: Checking for nontermination... 21.33/11.59 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.33/11.59 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.33/11.59 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.33/11.59 [2019-03-28 12:02:03,039 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.33/11.59 [2019-03-28 12:02:03,039 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.33/11.59 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.33/11.59 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.33/11.59 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.33/11.59 [2019-03-28 12:02:03,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.33/11.59 [2019-03-28 12:02:03,082 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.33/11.59 [2019-03-28 12:02:03,126 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.33/11.59 [2019-03-28 12:02:03,128 INFO L216 LassoAnalysis]: Preferences: 21.33/11.59 [2019-03-28 12:02:03,128 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.33/11.59 [2019-03-28 12:02:03,129 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.33/11.59 [2019-03-28 12:02:03,129 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.33/11.59 [2019-03-28 12:02:03,129 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.33/11.59 [2019-03-28 12:02:03,129 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.33/11.59 [2019-03-28 12:02:03,129 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.33/11.59 [2019-03-28 12:02:03,129 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.33/11.59 [2019-03-28 12:02:03,129 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 21.33/11.59 [2019-03-28 12:02:03,130 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.33/11.59 [2019-03-28 12:02:03,130 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.33/11.59 [2019-03-28 12:02:03,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.59 [2019-03-28 12:02:03,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.59 [2019-03-28 12:02:03,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.59 [2019-03-28 12:02:03,198 INFO L300 LassoAnalysis]: Preprocessing complete. 21.33/11.59 [2019-03-28 12:02:03,204 INFO L497 LassoAnalysis]: Using template 'affine'. 21.33/11.59 [2019-03-28 12:02:03,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.59 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.59 Number of strict supporting invariants: 0 21.33/11.59 Number of non-strict supporting invariants: 1 21.33/11.59 Consider only non-deceasing supporting invariants: true 21.33/11.59 Simplify termination arguments: true 21.33/11.59 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.59 [2019-03-28 12:02:03,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.59 [2019-03-28 12:02:03,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.59 [2019-03-28 12:02:03,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.59 [2019-03-28 12:02:03,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.59 [2019-03-28 12:02:03,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.33/11.59 [2019-03-28 12:02:03,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.33/11.59 [2019-03-28 12:02:03,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.59 [2019-03-28 12:02:03,220 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.33/11.59 [2019-03-28 12:02:03,227 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 21.33/11.59 [2019-03-28 12:02:03,227 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 21.33/11.59 [2019-03-28 12:02:03,229 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.33/11.59 [2019-03-28 12:02:03,230 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 21.33/11.59 [2019-03-28 12:02:03,231 INFO L518 LassoAnalysis]: Proved termination. 21.33/11.59 [2019-03-28 12:02:03,231 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.33/11.59 Ranking function f(ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~x~0 21.33/11.59 Supporting invariants [] 21.33/11.59 [2019-03-28 12:02:03,232 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 21.33/11.59 [2019-03-28 12:02:03,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.59 [2019-03-28 12:02:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.33/11.59 [2019-03-28 12:02:03,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 21.33/11.59 [2019-03-28 12:02:03,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.33/11.59 [2019-03-28 12:02:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.33/11.59 [2019-03-28 12:02:03,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 21.33/11.59 [2019-03-28 12:02:03,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.33/11.59 [2019-03-28 12:02:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.33/11.59 [2019-03-28 12:02:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.33/11.59 [2019-03-28 12:02:03,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core 21.33/11.59 [2019-03-28 12:02:03,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.33/11.59 [2019-03-28 12:02:03,314 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 21.33/11.59 [2019-03-28 12:02:03,317 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 21.33/11.59 [2019-03-28 12:02:03,318 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states and 9 transitions. cyclomatic complexity: 6 Second operand 4 states. 21.33/11.59 [2019-03-28 12:02:03,494 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states and 9 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 38 states and 94 transitions. Complement of second has 12 states. 21.33/11.59 [2019-03-28 12:02:03,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 4 non-accepting loop states 2 accepting loop states 21.33/11.59 [2019-03-28 12:02:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 21.33/11.59 [2019-03-28 12:02:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. 21.33/11.59 [2019-03-28 12:02:03,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 54 transitions. Stem has 1 letters. Loop has 3 letters. 21.33/11.59 [2019-03-28 12:02:03,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.33/11.59 [2019-03-28 12:02:03,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. 21.33/11.59 [2019-03-28 12:02:03,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.33/11.59 [2019-03-28 12:02:03,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 54 transitions. Stem has 1 letters. Loop has 6 letters. 21.33/11.59 [2019-03-28 12:02:03,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.33/11.59 [2019-03-28 12:02:03,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 94 transitions. 21.33/11.59 [2019-03-28 12:02:03,509 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 21.33/11.59 [2019-03-28 12:02:03,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 63 transitions. 21.33/11.59 [2019-03-28 12:02:03,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 21.33/11.59 [2019-03-28 12:02:03,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 21.33/11.59 [2019-03-28 12:02:03,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 63 transitions. 21.33/11.59 [2019-03-28 12:02:03,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.33/11.59 [2019-03-28 12:02:03,512 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 63 transitions. 21.33/11.59 [2019-03-28 12:02:03,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 63 transitions. 21.33/11.59 [2019-03-28 12:02:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. 21.33/11.59 [2019-03-28 12:02:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 21.33/11.59 [2019-03-28 12:02:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 43 transitions. 21.33/11.59 [2019-03-28 12:02:03,516 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 43 transitions. 21.33/11.59 [2019-03-28 12:02:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 21.33/11.59 [2019-03-28 12:02:03,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 21.33/11.59 [2019-03-28 12:02:03,517 INFO L87 Difference]: Start difference. First operand 20 states and 43 transitions. Second operand 3 states. 21.33/11.59 [2019-03-28 12:02:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.33/11.59 [2019-03-28 12:02:03,528 INFO L93 Difference]: Finished difference Result 20 states and 39 transitions. 21.33/11.59 [2019-03-28 12:02:03,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 21.33/11.59 [2019-03-28 12:02:03,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 39 transitions. 21.33/11.59 [2019-03-28 12:02:03,535 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 21.33/11.59 [2019-03-28 12:02:03,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 39 transitions. 21.33/11.59 [2019-03-28 12:02:03,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 21.33/11.59 [2019-03-28 12:02:03,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 21.33/11.59 [2019-03-28 12:02:03,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 39 transitions. 21.33/11.59 [2019-03-28 12:02:03,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.33/11.59 [2019-03-28 12:02:03,537 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 39 transitions. 21.33/11.59 [2019-03-28 12:02:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 39 transitions. 21.33/11.59 [2019-03-28 12:02:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 21.33/11.59 [2019-03-28 12:02:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 21.33/11.59 [2019-03-28 12:02:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 39 transitions. 21.33/11.59 [2019-03-28 12:02:03,541 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 39 transitions. 21.33/11.59 [2019-03-28 12:02:03,541 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 39 transitions. 21.33/11.59 [2019-03-28 12:02:03,541 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 21.33/11.59 [2019-03-28 12:02:03,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 39 transitions. 21.33/11.59 [2019-03-28 12:02:03,542 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 21.33/11.59 [2019-03-28 12:02:03,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.33/11.59 [2019-03-28 12:02:03,542 INFO L119 BuchiIsEmpty]: Starting construction of run 21.33/11.59 [2019-03-28 12:02:03,543 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 21.33/11.59 [2019-03-28 12:02:03,543 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.33/11.59 [2019-03-28 12:02:03,543 INFO L794 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~debug~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~debug~0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 155#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 168#L18 21.33/11.59 [2019-03-28 12:02:03,543 INFO L796 eck$LassoCheckResult]: Loop: 168#L18 [61] L18-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 2)) (= 0 (mod v_ULTIMATE.start_main_~x~0_10 2))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 171#L18-2 [33] L18-2-->L23-1: Formula: (= 0 v_ULTIMATE.start_main_~debug~0_5) InVars {ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_5} OutVars{ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_5} AuxVars[] AssignedVars[] 173#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 168#L18 21.33/11.59 [2019-03-28 12:02:03,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.59 [2019-03-28 12:02:03,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1959, now seen corresponding path program 1 times 21.33/11.59 [2019-03-28 12:02:03,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.59 [2019-03-28 12:02:03,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.59 [2019-03-28 12:02:03,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:03,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:03,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:03,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.59 [2019-03-28 12:02:03,550 INFO L82 PathProgramCache]: Analyzing trace with hash 89472, now seen corresponding path program 1 times 21.33/11.59 [2019-03-28 12:02:03,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.59 [2019-03-28 12:02:03,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.59 [2019-03-28 12:02:03,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:03,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:03,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.59 [2019-03-28 12:02:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash 58420250, now seen corresponding path program 1 times 21.33/11.59 [2019-03-28 12:02:03,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.59 [2019-03-28 12:02:03,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.59 [2019-03-28 12:02:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:03,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:03,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:03,593 INFO L216 LassoAnalysis]: Preferences: 21.33/11.59 [2019-03-28 12:02:03,593 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.33/11.59 [2019-03-28 12:02:03,594 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.33/11.59 [2019-03-28 12:02:03,594 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.33/11.59 [2019-03-28 12:02:03,594 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.33/11.59 [2019-03-28 12:02:03,594 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.33/11.59 [2019-03-28 12:02:03,594 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.33/11.59 [2019-03-28 12:02:03,594 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.33/11.59 [2019-03-28 12:02:03,594 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 21.33/11.59 [2019-03-28 12:02:03,594 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.33/11.59 [2019-03-28 12:02:03,595 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.33/11.59 [2019-03-28 12:02:03,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.59 [2019-03-28 12:02:03,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.59 [2019-03-28 12:02:03,672 INFO L300 LassoAnalysis]: Preprocessing complete. 21.33/11.59 [2019-03-28 12:02:03,672 INFO L412 LassoAnalysis]: Checking for nontermination... 21.33/11.59 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.33/11.59 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.33/11.59 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.33/11.59 [2019-03-28 12:02:03,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.33/11.59 [2019-03-28 12:02:03,681 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.33/11.59 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.33/11.59 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.33/11.59 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.33/11.59 [2019-03-28 12:02:03,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.33/11.59 [2019-03-28 12:02:03,719 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.33/11.59 [2019-03-28 12:02:07,728 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.33/11.59 [2019-03-28 12:02:07,731 INFO L216 LassoAnalysis]: Preferences: 21.33/11.59 [2019-03-28 12:02:07,732 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.33/11.59 [2019-03-28 12:02:07,732 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.33/11.59 [2019-03-28 12:02:07,732 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.33/11.59 [2019-03-28 12:02:07,732 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.33/11.59 [2019-03-28 12:02:07,732 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.33/11.59 [2019-03-28 12:02:07,732 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.33/11.59 [2019-03-28 12:02:07,732 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.33/11.59 [2019-03-28 12:02:07,733 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 21.33/11.59 [2019-03-28 12:02:07,733 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.33/11.59 [2019-03-28 12:02:07,733 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.33/11.59 [2019-03-28 12:02:07,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.59 [2019-03-28 12:02:07,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.59 [2019-03-28 12:02:07,806 INFO L300 LassoAnalysis]: Preprocessing complete. 21.33/11.59 [2019-03-28 12:02:07,806 INFO L497 LassoAnalysis]: Using template 'affine'. 21.33/11.59 [2019-03-28 12:02:07,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.59 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.59 Number of strict supporting invariants: 0 21.33/11.59 Number of non-strict supporting invariants: 1 21.33/11.59 Consider only non-deceasing supporting invariants: true 21.33/11.59 Simplify termination arguments: true 21.33/11.59 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.59 [2019-03-28 12:02:07,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.59 [2019-03-28 12:02:07,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.59 [2019-03-28 12:02:07,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.59 [2019-03-28 12:02:07,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.59 [2019-03-28 12:02:07,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.33/11.59 [2019-03-28 12:02:07,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.33/11.59 [2019-03-28 12:02:07,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.59 [2019-03-28 12:02:07,816 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.33/11.59 [2019-03-28 12:02:07,822 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 21.33/11.59 [2019-03-28 12:02:07,822 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 21.33/11.59 [2019-03-28 12:02:07,822 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.33/11.59 [2019-03-28 12:02:07,822 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 21.33/11.59 [2019-03-28 12:02:07,823 INFO L518 LassoAnalysis]: Proved termination. 21.33/11.59 [2019-03-28 12:02:07,823 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.33/11.59 Ranking function f(ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~x~0 + 253 21.33/11.59 Supporting invariants [] 21.33/11.59 [2019-03-28 12:02:07,823 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 21.33/11.59 [2019-03-28 12:02:07,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.59 [2019-03-28 12:02:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.33/11.59 [2019-03-28 12:02:07,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core 21.33/11.59 [2019-03-28 12:02:07,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.33/11.59 [2019-03-28 12:02:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.33/11.59 [2019-03-28 12:02:07,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 21.33/11.59 [2019-03-28 12:02:07,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.33/11.59 [2019-03-28 12:02:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.33/11.59 [2019-03-28 12:02:07,859 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 21.33/11.59 [2019-03-28 12:02:07,860 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 21.33/11.59 [2019-03-28 12:02:07,860 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 39 transitions. cyclomatic complexity: 25 Second operand 3 states. 21.33/11.59 [2019-03-28 12:02:07,901 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 39 transitions. cyclomatic complexity: 25. Second operand 3 states. Result 45 states and 82 transitions. Complement of second has 4 states. 21.33/11.59 [2019-03-28 12:02:07,901 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 21.33/11.59 [2019-03-28 12:02:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 21.33/11.59 [2019-03-28 12:02:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. 21.33/11.59 [2019-03-28 12:02:07,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 2 letters. Loop has 3 letters. 21.33/11.59 [2019-03-28 12:02:07,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.33/11.59 [2019-03-28 12:02:07,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. 21.33/11.59 [2019-03-28 12:02:07,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.33/11.59 [2019-03-28 12:02:07,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 2 letters. Loop has 6 letters. 21.33/11.59 [2019-03-28 12:02:07,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.33/11.59 [2019-03-28 12:02:07,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 82 transitions. 21.33/11.59 [2019-03-28 12:02:07,908 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 21.33/11.59 [2019-03-28 12:02:07,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 73 transitions. 21.33/11.59 [2019-03-28 12:02:07,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 21.33/11.59 [2019-03-28 12:02:07,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 21.33/11.59 [2019-03-28 12:02:07,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 73 transitions. 21.33/11.59 [2019-03-28 12:02:07,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.33/11.59 [2019-03-28 12:02:07,910 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 73 transitions. 21.33/11.59 [2019-03-28 12:02:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 73 transitions. 21.33/11.59 [2019-03-28 12:02:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. 21.33/11.59 [2019-03-28 12:02:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 21.33/11.59 [2019-03-28 12:02:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 68 transitions. 21.33/11.59 [2019-03-28 12:02:07,914 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 68 transitions. 21.33/11.59 [2019-03-28 12:02:07,914 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 68 transitions. 21.33/11.59 [2019-03-28 12:02:07,914 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 21.33/11.59 [2019-03-28 12:02:07,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 68 transitions. 21.33/11.59 [2019-03-28 12:02:07,916 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 21.33/11.59 [2019-03-28 12:02:07,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.33/11.59 [2019-03-28 12:02:07,916 INFO L119 BuchiIsEmpty]: Starting construction of run 21.33/11.59 [2019-03-28 12:02:07,917 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 21.33/11.59 [2019-03-28 12:02:07,917 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.33/11.59 [2019-03-28 12:02:07,917 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~debug~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~debug~0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 255#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 277#L18 [55] L18-->L18-2: Formula: (let ((.cse0 (mod v_ULTIMATE.start_main_~x~0_8 2))) (and (< (+ .cse0 (- 2)) 0) (< 0 .cse0) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (< v_ULTIMATE.start_main_~x~0_8 0))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 263#L18-2 21.33/11.59 [2019-03-28 12:02:07,917 INFO L796 eck$LassoCheckResult]: Loop: 263#L18-2 [33] L18-2-->L23-1: Formula: (= 0 v_ULTIMATE.start_main_~debug~0_5) InVars {ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_5} OutVars{ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_5} AuxVars[] AssignedVars[] 268#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 262#L18 [55] L18-->L18-2: Formula: (let ((.cse0 (mod v_ULTIMATE.start_main_~x~0_8 2))) (and (< (+ .cse0 (- 2)) 0) (< 0 .cse0) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (< v_ULTIMATE.start_main_~x~0_8 0))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 263#L18-2 21.33/11.59 [2019-03-28 12:02:07,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.59 [2019-03-28 12:02:07,918 INFO L82 PathProgramCache]: Analyzing trace with hash 60784, now seen corresponding path program 1 times 21.33/11.59 [2019-03-28 12:02:07,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.59 [2019-03-28 12:02:07,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.59 [2019-03-28 12:02:07,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:07,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:07,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:07,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.59 [2019-03-28 12:02:07,927 INFO L82 PathProgramCache]: Analyzing trace with hash 62706, now seen corresponding path program 1 times 21.33/11.59 [2019-03-28 12:02:07,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.59 [2019-03-28 12:02:07,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.59 [2019-03-28 12:02:07,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:07,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:07,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.59 [2019-03-28 12:02:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.59 [2019-03-28 12:02:07,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.59 [2019-03-28 12:02:07,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1810849059, now seen corresponding path program 1 times 21.33/11.60 [2019-03-28 12:02:07,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.60 [2019-03-28 12:02:07,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.60 [2019-03-28 12:02:07,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.60 [2019-03-28 12:02:07,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.33/11.60 [2019-03-28 12:02:07,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.60 [2019-03-28 12:02:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.33/11.60 [2019-03-28 12:02:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.33/11.60 [2019-03-28 12:02:07,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.33/11.60 [2019-03-28 12:02:07,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 21.33/11.60 [2019-03-28 12:02:07,996 INFO L216 LassoAnalysis]: Preferences: 21.33/11.60 [2019-03-28 12:02:07,997 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.33/11.60 [2019-03-28 12:02:07,997 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.33/11.60 [2019-03-28 12:02:07,997 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.33/11.60 [2019-03-28 12:02:07,997 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.33/11.60 [2019-03-28 12:02:07,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.33/11.60 [2019-03-28 12:02:07,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.33/11.60 [2019-03-28 12:02:07,997 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.33/11.60 [2019-03-28 12:02:07,998 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 21.33/11.60 [2019-03-28 12:02:07,998 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.33/11.60 [2019-03-28 12:02:07,998 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.33/11.60 [2019-03-28 12:02:07,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.60 [2019-03-28 12:02:08,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.60 [2019-03-28 12:02:08,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.60 [2019-03-28 12:02:08,070 INFO L300 LassoAnalysis]: Preprocessing complete. 21.33/11.60 [2019-03-28 12:02:08,070 INFO L412 LassoAnalysis]: Checking for nontermination... 21.33/11.60 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.33/11.60 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.33/11.60 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.33/11.60 [2019-03-28 12:02:08,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.33/11.60 [2019-03-28 12:02:08,074 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.33/11.60 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.33/11.60 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.33/11.60 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.33/11.60 [2019-03-28 12:02:08,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.33/11.60 [2019-03-28 12:02:08,104 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.33/11.60 [2019-03-28 12:02:08,152 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.33/11.60 [2019-03-28 12:02:08,154 INFO L216 LassoAnalysis]: Preferences: 21.33/11.60 [2019-03-28 12:02:08,154 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.33/11.60 [2019-03-28 12:02:08,154 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.33/11.60 [2019-03-28 12:02:08,155 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.33/11.60 [2019-03-28 12:02:08,155 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.33/11.60 [2019-03-28 12:02:08,155 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.33/11.60 [2019-03-28 12:02:08,155 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.33/11.60 [2019-03-28 12:02:08,155 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.33/11.60 [2019-03-28 12:02:08,155 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 21.33/11.60 [2019-03-28 12:02:08,155 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.33/11.60 [2019-03-28 12:02:08,155 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.33/11.60 [2019-03-28 12:02:08,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.60 [2019-03-28 12:02:08,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.60 [2019-03-28 12:02:08,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.33/11.60 [2019-03-28 12:02:08,222 INFO L300 LassoAnalysis]: Preprocessing complete. 21.33/11.60 [2019-03-28 12:02:08,222 INFO L497 LassoAnalysis]: Using template 'affine'. 21.33/11.60 [2019-03-28 12:02:08,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.60 [2019-03-28 12:02:08,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.60 [2019-03-28 12:02:08,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.60 [2019-03-28 12:02:08,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,239 INFO L497 LassoAnalysis]: Using template '2-nested'. 21.33/11.60 [2019-03-28 12:02:08,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.60 [2019-03-28 12:02:08,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,241 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,242 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.60 [2019-03-28 12:02:08,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,251 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,251 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.60 [2019-03-28 12:02:08,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,254 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,255 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,256 INFO L497 LassoAnalysis]: Using template '3-nested'. 21.33/11.60 [2019-03-28 12:02:08,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.60 [2019-03-28 12:02:08,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,258 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,259 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.60 [2019-03-28 12:02:08,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,270 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,270 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.60 [2019-03-28 12:02:08,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,273 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,274 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,275 INFO L497 LassoAnalysis]: Using template '4-nested'. 21.33/11.60 [2019-03-28 12:02:08,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.60 [2019-03-28 12:02:08,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,277 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,278 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.60 [2019-03-28 12:02:08,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,291 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,291 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.33/11.60 [2019-03-28 12:02:08,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,294 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,295 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,296 INFO L497 LassoAnalysis]: Using template '2-phase'. 21.33/11.60 [2019-03-28 12:02:08,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,298 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,298 INFO L339 nArgumentSynthesizer]: Template has degree 1. 21.33/11.60 [2019-03-28 12:02:08,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,298 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,300 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,328 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,328 INFO L339 nArgumentSynthesizer]: Template has degree 1. 21.33/11.60 [2019-03-28 12:02:08,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,328 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,329 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,332 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,332 INFO L339 nArgumentSynthesizer]: Template has degree 1. 21.33/11.60 [2019-03-28 12:02:08,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,333 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,334 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,335 INFO L497 LassoAnalysis]: Using template '3-phase'. 21.33/11.60 [2019-03-28 12:02:08,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,336 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,336 INFO L339 nArgumentSynthesizer]: Template has degree 2. 21.33/11.60 [2019-03-28 12:02:08,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,337 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,340 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,376 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,377 INFO L339 nArgumentSynthesizer]: Template has degree 2. 21.33/11.60 [2019-03-28 12:02:08,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,377 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,379 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,382 INFO L339 nArgumentSynthesizer]: Template has degree 2. 21.33/11.60 [2019-03-28 12:02:08,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,405 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,406 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,410 INFO L497 LassoAnalysis]: Using template '4-phase'. 21.33/11.60 [2019-03-28 12:02:08,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,411 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,411 INFO L339 nArgumentSynthesizer]: Template has degree 3. 21.33/11.60 [2019-03-28 12:02:08,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,412 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,417 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,465 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,465 INFO L339 nArgumentSynthesizer]: Template has degree 3. 21.33/11.60 [2019-03-28 12:02:08,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,466 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,468 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,470 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,471 INFO L339 nArgumentSynthesizer]: Template has degree 3. 21.33/11.60 [2019-03-28 12:02:08,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,471 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,473 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,474 INFO L497 LassoAnalysis]: Using template '2-lex'. 21.33/11.60 [2019-03-28 12:02:08,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,475 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,475 INFO L339 nArgumentSynthesizer]: Template has degree 1. 21.33/11.60 [2019-03-28 12:02:08,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,476 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,477 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,487 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,487 INFO L339 nArgumentSynthesizer]: Template has degree 1. 21.33/11.60 [2019-03-28 12:02:08,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,488 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,489 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,492 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,493 INFO L339 nArgumentSynthesizer]: Template has degree 1. 21.33/11.60 [2019-03-28 12:02:08,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,493 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,494 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,497 INFO L497 LassoAnalysis]: Using template '3-lex'. 21.33/11.60 [2019-03-28 12:02:08,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,498 INFO L339 nArgumentSynthesizer]: Template has degree 3. 21.33/11.60 [2019-03-28 12:02:08,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,499 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,524 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,524 INFO L339 nArgumentSynthesizer]: Template has degree 3. 21.33/11.60 [2019-03-28 12:02:08,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,524 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.33/11.60 Termination analysis: LINEAR_WITH_GUESSES 21.33/11.60 Number of strict supporting invariants: 0 21.33/11.60 Number of non-strict supporting invariants: 1 21.33/11.60 Consider only non-deceasing supporting invariants: true 21.33/11.60 Simplify termination arguments: true 21.33/11.60 Simplify supporting invariants: trueOverapproximate stem: false 21.33/11.60 [2019-03-28 12:02:08,531 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 21.33/11.60 [2019-03-28 12:02:08,531 INFO L339 nArgumentSynthesizer]: Template has degree 3. 21.33/11.60 [2019-03-28 12:02:08,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.33/11.60 [2019-03-28 12:02:08,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.33/11.60 [2019-03-28 12:02:08,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.33/11.60 [2019-03-28 12:02:08,532 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 21.33/11.60 [2019-03-28 12:02:08,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.33/11.60 [2019-03-28 12:02:08,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.33/11.60 [2019-03-28 12:02:08,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.33/11.60 [2019-03-28 12:02:08,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 21.33/11.60 [2019-03-28 12:02:08,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 21.33/11.60 [2019-03-28 12:02:08,538 INFO L87 Difference]: Start difference. First operand 33 states and 68 transitions. cyclomatic complexity: 41 Second operand 3 states. 21.33/11.60 [2019-03-28 12:02:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.33/11.60 [2019-03-28 12:02:08,571 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. 21.33/11.60 [2019-03-28 12:02:08,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 21.33/11.60 [2019-03-28 12:02:08,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. 21.33/11.60 [2019-03-28 12:02:08,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 21.33/11.60 [2019-03-28 12:02:08,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 25 states and 38 transitions. 21.33/11.60 [2019-03-28 12:02:08,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 21.33/11.60 [2019-03-28 12:02:08,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 21.33/11.60 [2019-03-28 12:02:08,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 38 transitions. 21.33/11.60 [2019-03-28 12:02:08,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.33/11.60 [2019-03-28 12:02:08,576 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 38 transitions. 21.33/11.60 [2019-03-28 12:02:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 38 transitions. 21.33/11.60 [2019-03-28 12:02:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 12. 21.33/11.60 [2019-03-28 12:02:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 21.33/11.60 [2019-03-28 12:02:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. 21.33/11.60 [2019-03-28 12:02:08,578 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 20 transitions. 21.33/11.60 [2019-03-28 12:02:08,578 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 20 transitions. 21.33/11.60 [2019-03-28 12:02:08,578 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 21.33/11.60 [2019-03-28 12:02:08,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 20 transitions. 21.33/11.60 [2019-03-28 12:02:08,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 21.33/11.60 [2019-03-28 12:02:08,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.33/11.60 [2019-03-28 12:02:08,579 INFO L119 BuchiIsEmpty]: Starting construction of run 21.33/11.60 [2019-03-28 12:02:08,579 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 21.33/11.60 [2019-03-28 12:02:08,580 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.33/11.60 [2019-03-28 12:02:08,580 INFO L794 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~debug~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~debug~0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 334#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 340#L18 [61] L18-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 2)) (= 0 (mod v_ULTIMATE.start_main_~x~0_10 2))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 329#L18-2 21.33/11.60 [2019-03-28 12:02:08,580 INFO L796 eck$LassoCheckResult]: Loop: 329#L18-2 [65] L18-2-->L23-1: Formula: (and (> 0 v_ULTIMATE.start_main_~debug~0_4) (= v_ULTIMATE.start_main_~x~0_4 0)) InVars {ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_4} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 330#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 335#L18 [61] L18-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 2)) (= 0 (mod v_ULTIMATE.start_main_~x~0_10 2))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 329#L18-2 21.33/11.60 [2019-03-28 12:02:08,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.60 [2019-03-28 12:02:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash 60790, now seen corresponding path program 1 times 21.33/11.60 [2019-03-28 12:02:08,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.60 [2019-03-28 12:02:08,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.60 [2019-03-28 12:02:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.60 [2019-03-28 12:02:08,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.33/11.60 [2019-03-28 12:02:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.60 [2019-03-28 12:02:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.60 [2019-03-28 12:02:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.60 [2019-03-28 12:02:08,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.60 [2019-03-28 12:02:08,587 INFO L82 PathProgramCache]: Analyzing trace with hash 93464, now seen corresponding path program 1 times 21.33/11.60 [2019-03-28 12:02:08,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.60 [2019-03-28 12:02:08,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.60 [2019-03-28 12:02:08,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.60 [2019-03-28 12:02:08,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.33/11.60 [2019-03-28 12:02:08,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.60 [2019-03-28 12:02:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.60 [2019-03-28 12:02:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.33/11.60 [2019-03-28 12:02:08,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.33/11.60 [2019-03-28 12:02:08,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1811058563, now seen corresponding path program 1 times 21.33/11.60 [2019-03-28 12:02:08,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.33/11.60 [2019-03-28 12:02:08,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.33/11.60 [2019-03-28 12:02:08,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.60 [2019-03-28 12:02:08,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.33/11.60 [2019-03-28 12:02:08,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.33/11.60 [2019-03-28 12:02:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.33/11.60 [2019-03-28 12:02:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.33/11.60 [2019-03-28 12:02:08,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.33/11.60 [2019-03-28 12:02:08,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 21.33/11.60 [2019-03-28 12:02:08,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 21.33/11.60 [2019-03-28 12:02:08,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 21.33/11.60 [2019-03-28 12:02:08,629 INFO L87 Difference]: Start difference. First operand 12 states and 20 transitions. cyclomatic complexity: 9 Second operand 3 states. 21.33/11.60 [2019-03-28 12:02:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.33/11.60 [2019-03-28 12:02:08,673 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. 21.33/11.60 [2019-03-28 12:02:08,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 21.33/11.60 [2019-03-28 12:02:08,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. 21.33/11.60 [2019-03-28 12:02:08,676 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 21.33/11.60 [2019-03-28 12:02:08,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. 21.33/11.60 [2019-03-28 12:02:08,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 21.33/11.60 [2019-03-28 12:02:08,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 21.33/11.60 [2019-03-28 12:02:08,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 21.33/11.60 [2019-03-28 12:02:08,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 21.33/11.60 [2019-03-28 12:02:08,677 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 21.33/11.60 [2019-03-28 12:02:08,677 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 21.33/11.60 [2019-03-28 12:02:08,677 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 21.33/11.60 [2019-03-28 12:02:08,677 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 21.33/11.60 [2019-03-28 12:02:08,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 21.33/11.60 [2019-03-28 12:02:08,678 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 21.33/11.60 [2019-03-28 12:02:08,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 21.33/11.60 [2019-03-28 12:02:08,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:08 BasicIcfg 21.33/11.60 [2019-03-28 12:02:08,684 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 21.33/11.60 [2019-03-28 12:02:08,685 INFO L168 Benchmark]: Toolchain (without parser) took 7027.94 ms. Allocated memory was 649.6 MB in the beginning and 744.5 MB in the end (delta: 94.9 MB). Free memory was 558.4 MB in the beginning and 650.9 MB in the end (delta: -92.6 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. 21.33/11.60 [2019-03-28 12:02:08,687 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 21.33/11.60 [2019-03-28 12:02:08,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.61 ms. Allocated memory is still 649.6 MB. Free memory was 558.4 MB in the beginning and 548.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 21.33/11.60 [2019-03-28 12:02:08,688 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.90 ms. Allocated memory was 649.6 MB in the beginning and 667.9 MB in the end (delta: 18.4 MB). Free memory was 548.6 MB in the beginning and 634.7 MB in the end (delta: -86.1 MB). Peak memory consumption was 21.4 MB. Max. memory is 50.3 GB. 21.33/11.60 [2019-03-28 12:02:08,688 INFO L168 Benchmark]: Boogie Preprocessor took 20.02 ms. Allocated memory is still 667.9 MB. Free memory was 634.7 MB in the beginning and 631.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 21.33/11.60 [2019-03-28 12:02:08,689 INFO L168 Benchmark]: RCFGBuilder took 212.38 ms. Allocated memory is still 667.9 MB. Free memory was 631.9 MB in the beginning and 619.5 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 50.3 GB. 21.33/11.60 [2019-03-28 12:02:08,690 INFO L168 Benchmark]: BlockEncodingV2 took 92.53 ms. Allocated memory is still 667.9 MB. Free memory was 618.4 MB in the beginning and 612.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 21.33/11.60 [2019-03-28 12:02:08,690 INFO L168 Benchmark]: TraceAbstraction took 155.99 ms. Allocated memory is still 667.9 MB. Free memory was 612.0 MB in the beginning and 603.3 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 21.33/11.60 [2019-03-28 12:02:08,691 INFO L168 Benchmark]: BuchiAutomizer took 6218.01 ms. Allocated memory was 667.9 MB in the beginning and 744.5 MB in the end (delta: 76.5 MB). Free memory was 602.2 MB in the beginning and 650.9 MB in the end (delta: -48.7 MB). Peak memory consumption was 27.8 MB. Max. memory is 50.3 GB. 21.33/11.60 [2019-03-28 12:02:08,696 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 21.33/11.60 --- Results --- 21.33/11.60 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 21.33/11.60 - StatisticsResult: Initial Icfg 21.33/11.60 8 locations, 11 edges 21.33/11.60 - StatisticsResult: Encoded RCFG 21.33/11.60 4 locations, 24 edges 21.33/11.60 * Results from de.uni_freiburg.informatik.ultimate.core: 21.33/11.60 - StatisticsResult: Toolchain Benchmarks 21.33/11.60 Benchmark results are: 21.33/11.60 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 21.33/11.60 * CACSL2BoogieTranslator took 226.61 ms. Allocated memory is still 649.6 MB. Free memory was 558.4 MB in the beginning and 548.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 21.33/11.60 * Boogie Procedure Inliner took 96.90 ms. Allocated memory was 649.6 MB in the beginning and 667.9 MB in the end (delta: 18.4 MB). Free memory was 548.6 MB in the beginning and 634.7 MB in the end (delta: -86.1 MB). Peak memory consumption was 21.4 MB. Max. memory is 50.3 GB. 21.33/11.60 * Boogie Preprocessor took 20.02 ms. Allocated memory is still 667.9 MB. Free memory was 634.7 MB in the beginning and 631.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 21.33/11.60 * RCFGBuilder took 212.38 ms. Allocated memory is still 667.9 MB. Free memory was 631.9 MB in the beginning and 619.5 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 50.3 GB. 21.33/11.60 * BlockEncodingV2 took 92.53 ms. Allocated memory is still 667.9 MB. Free memory was 618.4 MB in the beginning and 612.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 21.33/11.60 * TraceAbstraction took 155.99 ms. Allocated memory is still 667.9 MB. Free memory was 612.0 MB in the beginning and 603.3 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 21.33/11.60 * BuchiAutomizer took 6218.01 ms. Allocated memory was 667.9 MB in the beginning and 744.5 MB in the end (delta: 76.5 MB). Free memory was 602.2 MB in the beginning and 650.9 MB in the end (delta: -48.7 MB). Peak memory consumption was 27.8 MB. Max. memory is 50.3 GB. 21.33/11.60 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 21.33/11.60 - AllSpecificationsHoldResult: All specifications hold 21.33/11.60 We were not able to verify any specifiation because the program does not contain any specification. 21.33/11.60 - InvariantResult [Line: 17]: Loop Invariant 21.33/11.60 Derived loop invariant: 1 21.33/11.60 - StatisticsResult: Ultimate Automizer benchmark data 21.33/11.60 CFG has 1 procedures, 4 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 21.33/11.60 - StatisticsResult: Constructed decomposition of program 21.33/11.60 Your program was decomposed into 6 terminating modules (4 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -1 * x and consists of 8 locations. One nondeterministic module has affine ranking function -1 * x + 253 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 3 locations. 21.33/11.60 - StatisticsResult: Timing statistics 21.33/11.60 BüchiAutomizer plugin needed 6.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 37 SDslu, 18 SDs, 0 SdLazy, 136 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp82 ukn100 mio100 lsp100 div373 bol100 ite100 ukn100 eq142 hnf48 smp91 dnf100 smp100 tf105 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 24ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.2s 21.33/11.60 - TerminationAnalysisResult: Termination proven 21.33/11.60 Buchi Automizer proved that your program is terminating 21.33/11.60 RESULT: Ultimate proved your program to be correct! 21.33/11.60 !SESSION 2019-03-28 12:01:58.356 ----------------------------------------------- 21.33/11.60 eclipse.buildId=unknown 21.33/11.60 java.version=1.8.0_181 21.33/11.60 java.vendor=Oracle Corporation 21.33/11.60 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 21.33/11.60 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 21.33/11.60 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 21.33/11.60 21.33/11.60 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:02:08.930 21.33/11.60 !MESSAGE The workspace will exit with unsaved changes in this session. 21.33/11.60 Received shutdown request... 21.33/11.60 Ultimate: 21.33/11.60 GTK+ Version Check 21.33/11.60 EOF