29.30/20.33 YES 29.30/20.33 29.30/20.33 Ultimate: Cannot open display: 29.30/20.33 This is Ultimate 0.1.24-8dc7c08-m 29.30/20.33 [2019-03-28 12:04:46,198 INFO L170 SettingsManager]: Resetting all preferences to default values... 29.30/20.33 [2019-03-28 12:04:46,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 29.30/20.33 [2019-03-28 12:04:46,212 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 29.30/20.33 [2019-03-28 12:04:46,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 29.30/20.33 [2019-03-28 12:04:46,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 29.30/20.33 [2019-03-28 12:04:46,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 29.30/20.33 [2019-03-28 12:04:46,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 29.30/20.33 [2019-03-28 12:04:46,217 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 29.30/20.33 [2019-03-28 12:04:46,218 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 29.30/20.33 [2019-03-28 12:04:46,219 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 29.30/20.33 [2019-03-28 12:04:46,219 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 29.30/20.33 [2019-03-28 12:04:46,220 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 29.30/20.33 [2019-03-28 12:04:46,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 29.30/20.33 [2019-03-28 12:04:46,222 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 29.30/20.33 [2019-03-28 12:04:46,223 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 29.30/20.33 [2019-03-28 12:04:46,224 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 29.30/20.33 [2019-03-28 12:04:46,225 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 29.30/20.33 [2019-03-28 12:04:46,228 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 29.30/20.33 [2019-03-28 12:04:46,229 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 29.30/20.33 [2019-03-28 12:04:46,230 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 29.30/20.33 [2019-03-28 12:04:46,231 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 29.30/20.33 [2019-03-28 12:04:46,233 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 29.30/20.33 [2019-03-28 12:04:46,234 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 29.30/20.33 [2019-03-28 12:04:46,234 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 29.30/20.33 [2019-03-28 12:04:46,235 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 29.30/20.33 [2019-03-28 12:04:46,235 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 29.30/20.33 [2019-03-28 12:04:46,236 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 29.30/20.33 [2019-03-28 12:04:46,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 29.30/20.33 [2019-03-28 12:04:46,237 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 29.30/20.33 [2019-03-28 12:04:46,237 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 29.30/20.33 [2019-03-28 12:04:46,238 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 29.30/20.33 [2019-03-28 12:04:46,239 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 29.30/20.33 [2019-03-28 12:04:46,239 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 29.30/20.33 [2019-03-28 12:04:46,240 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 29.30/20.33 [2019-03-28 12:04:46,240 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 29.30/20.33 [2019-03-28 12:04:46,240 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 29.30/20.33 [2019-03-28 12:04:46,241 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 29.30/20.33 [2019-03-28 12:04:46,242 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 29.30/20.33 [2019-03-28 12:04:46,242 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 29.30/20.33 [2019-03-28 12:04:46,257 INFO L110 SettingsManager]: Loading preferences was successful 29.30/20.33 [2019-03-28 12:04:46,257 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 29.30/20.33 [2019-03-28 12:04:46,258 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 29.30/20.33 [2019-03-28 12:04:46,258 INFO L133 SettingsManager]: * Rewrite not-equals=true 29.30/20.33 [2019-03-28 12:04:46,258 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 29.30/20.33 [2019-03-28 12:04:46,258 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 29.30/20.33 [2019-03-28 12:04:46,259 INFO L133 SettingsManager]: * Use SBE=true 29.30/20.33 [2019-03-28 12:04:46,259 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 29.30/20.33 [2019-03-28 12:04:46,259 INFO L133 SettingsManager]: * Use old map elimination=false 29.30/20.33 [2019-03-28 12:04:46,259 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 29.30/20.33 [2019-03-28 12:04:46,259 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 29.30/20.33 [2019-03-28 12:04:46,260 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 29.30/20.33 [2019-03-28 12:04:46,260 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 29.30/20.33 [2019-03-28 12:04:46,260 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 29.30/20.33 [2019-03-28 12:04:46,260 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:46,260 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 29.30/20.33 [2019-03-28 12:04:46,260 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 29.30/20.33 [2019-03-28 12:04:46,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE 29.30/20.33 [2019-03-28 12:04:46,261 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 29.30/20.33 [2019-03-28 12:04:46,261 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 29.30/20.33 [2019-03-28 12:04:46,261 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 29.30/20.33 [2019-03-28 12:04:46,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 29.30/20.33 [2019-03-28 12:04:46,261 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 29.30/20.33 [2019-03-28 12:04:46,262 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 29.30/20.33 [2019-03-28 12:04:46,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 29.30/20.33 [2019-03-28 12:04:46,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 29.30/20.33 [2019-03-28 12:04:46,262 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 29.30/20.33 [2019-03-28 12:04:46,262 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 29.30/20.33 [2019-03-28 12:04:46,263 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 29.30/20.33 [2019-03-28 12:04:46,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 29.30/20.33 [2019-03-28 12:04:46,302 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 29.30/20.33 [2019-03-28 12:04:46,306 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 29.30/20.33 [2019-03-28 12:04:46,307 INFO L271 PluginConnector]: Initializing CDTParser... 29.30/20.33 [2019-03-28 12:04:46,308 INFO L276 PluginConnector]: CDTParser initialized 29.30/20.33 [2019-03-28 12:04:46,308 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 29.30/20.33 [2019-03-28 12:04:46,366 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/ad53b4839ed94b00b51dd9d0b2d6637e/FLAGfcf779707 29.30/20.33 [2019-03-28 12:04:46,720 INFO L307 CDTParser]: Found 1 translation units. 29.30/20.33 [2019-03-28 12:04:46,721 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 29.30/20.33 [2019-03-28 12:04:46,727 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/ad53b4839ed94b00b51dd9d0b2d6637e/FLAGfcf779707 29.30/20.33 [2019-03-28 12:04:47,136 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/ad53b4839ed94b00b51dd9d0b2d6637e 29.30/20.33 [2019-03-28 12:04:47,148 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 29.30/20.33 [2019-03-28 12:04:47,149 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 29.30/20.33 [2019-03-28 12:04:47,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 29.30/20.33 [2019-03-28 12:04:47,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 29.30/20.33 [2019-03-28 12:04:47,154 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 29.30/20.33 [2019-03-28 12:04:47,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:04:47" (1/1) ... 29.30/20.33 [2019-03-28 12:04:47,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a7ee90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:47, skipping insertion in model container 29.30/20.33 [2019-03-28 12:04:47,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:04:47" (1/1) ... 29.30/20.33 [2019-03-28 12:04:47,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 29.30/20.33 [2019-03-28 12:04:47,184 INFO L176 MainTranslator]: Built tables and reachable declarations 29.30/20.33 [2019-03-28 12:04:47,343 INFO L206 PostProcessor]: Analyzing one entry point: main 29.30/20.33 [2019-03-28 12:04:47,347 INFO L191 MainTranslator]: Completed pre-run 29.30/20.33 [2019-03-28 12:04:47,365 INFO L206 PostProcessor]: Analyzing one entry point: main 29.30/20.33 [2019-03-28 12:04:47,379 INFO L195 MainTranslator]: Completed translation 29.30/20.33 [2019-03-28 12:04:47,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:47 WrapperNode 29.30/20.33 [2019-03-28 12:04:47,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 29.30/20.33 [2019-03-28 12:04:47,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 29.30/20.33 [2019-03-28 12:04:47,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 29.30/20.33 [2019-03-28 12:04:47,381 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 29.30/20.33 [2019-03-28 12:04:47,444 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:04:47" (1/1) ... 29.30/20.33 [2019-03-28 12:04:47,450 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:04:47" (1/1) ... 29.30/20.33 [2019-03-28 12:04:47,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 29.30/20.33 [2019-03-28 12:04:47,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 29.30/20.33 [2019-03-28 12:04:47,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 29.30/20.33 [2019-03-28 12:04:47,473 INFO L276 PluginConnector]: Boogie Preprocessor initialized 29.30/20.33 [2019-03-28 12:04:47,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:47" (1/1) ... 29.30/20.33 [2019-03-28 12:04:47,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:47" (1/1) ... 29.30/20.33 [2019-03-28 12:04:47,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:47" (1/1) ... 29.30/20.33 [2019-03-28 12:04:47,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:47" (1/1) ... 29.30/20.33 [2019-03-28 12:04:47,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:47" (1/1) ... 29.30/20.33 [2019-03-28 12:04:47,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:47" (1/1) ... 29.30/20.33 [2019-03-28 12:04:47,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:47" (1/1) ... 29.30/20.33 [2019-03-28 12:04:47,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 29.30/20.33 [2019-03-28 12:04:47,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 29.30/20.33 [2019-03-28 12:04:47,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... 29.30/20.33 [2019-03-28 12:04:47,493 INFO L276 PluginConnector]: RCFGBuilder initialized 29.30/20.33 [2019-03-28 12:04:47,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:47" (1/1) ... 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 29.30/20.33 [2019-03-28 12:04:47,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 29.30/20.33 [2019-03-28 12:04:47,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 29.30/20.33 [2019-03-28 12:04:47,701 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 29.30/20.33 [2019-03-28 12:04:47,702 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 29.30/20.33 [2019-03-28 12:04:47,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:04:47 BoogieIcfgContainer 29.30/20.33 [2019-03-28 12:04:47,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 29.30/20.33 [2019-03-28 12:04:47,704 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 29.30/20.33 [2019-03-28 12:04:47,704 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 29.30/20.33 [2019-03-28 12:04:47,706 INFO L276 PluginConnector]: BlockEncodingV2 initialized 29.30/20.33 [2019-03-28 12:04:47,706 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:04:47" (1/1) ... 29.30/20.33 [2019-03-28 12:04:47,721 INFO L313 BlockEncoder]: Initial Icfg 11 locations, 16 edges 29.30/20.33 [2019-03-28 12:04:47,722 INFO L258 BlockEncoder]: Using Remove infeasible edges 29.30/20.33 [2019-03-28 12:04:47,723 INFO L263 BlockEncoder]: Using Maximize final states 29.30/20.33 [2019-03-28 12:04:47,724 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 29.30/20.33 [2019-03-28 12:04:47,724 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 29.30/20.33 [2019-03-28 12:04:47,726 INFO L296 BlockEncoder]: Using Remove sink states 29.30/20.33 [2019-03-28 12:04:47,727 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 29.30/20.33 [2019-03-28 12:04:47,727 INFO L179 BlockEncoder]: Using Rewrite not-equals 29.30/20.33 [2019-03-28 12:04:47,743 INFO L185 BlockEncoder]: Using Use SBE 29.30/20.33 [2019-03-28 12:04:47,759 INFO L200 BlockEncoder]: SBE split 1 edges 29.30/20.33 [2019-03-28 12:04:47,764 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 29.30/20.33 [2019-03-28 12:04:47,766 INFO L71 MaximizeFinalStates]: 0 new accepting states 29.30/20.33 [2019-03-28 12:04:47,776 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 29.30/20.33 [2019-03-28 12:04:47,778 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 29.30/20.33 [2019-03-28 12:04:47,780 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 29.30/20.33 [2019-03-28 12:04:47,780 INFO L71 MaximizeFinalStates]: 0 new accepting states 29.30/20.33 [2019-03-28 12:04:47,780 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 29.30/20.33 [2019-03-28 12:04:47,781 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 29.30/20.33 [2019-03-28 12:04:47,781 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 9 edges 29.30/20.33 [2019-03-28 12:04:47,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:04:47 BasicIcfg 29.30/20.33 [2019-03-28 12:04:47,782 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 29.30/20.33 [2019-03-28 12:04:47,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 29.30/20.33 [2019-03-28 12:04:47,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... 29.30/20.33 [2019-03-28 12:04:47,786 INFO L276 PluginConnector]: TraceAbstraction initialized 29.30/20.33 [2019-03-28 12:04:47,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:04:47" (1/4) ... 29.30/20.33 [2019-03-28 12:04:47,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d3ee79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:04:47, skipping insertion in model container 29.30/20.33 [2019-03-28 12:04:47,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:47" (2/4) ... 29.30/20.33 [2019-03-28 12:04:47,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d3ee79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:04:47, skipping insertion in model container 29.30/20.33 [2019-03-28 12:04:47,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:04:47" (3/4) ... 29.30/20.33 [2019-03-28 12:04:47,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d3ee79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:04:47, skipping insertion in model container 29.30/20.33 [2019-03-28 12:04:47,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:04:47" (4/4) ... 29.30/20.33 [2019-03-28 12:04:47,791 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 29.30/20.33 [2019-03-28 12:04:47,800 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 29.30/20.33 [2019-03-28 12:04:47,809 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 29.30/20.33 [2019-03-28 12:04:47,826 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 29.30/20.33 [2019-03-28 12:04:47,854 INFO L133 ementStrategyFactory]: Using default assertion order modulation 29.30/20.33 [2019-03-28 12:04:47,855 INFO L382 AbstractCegarLoop]: Interprodecural is true 29.30/20.33 [2019-03-28 12:04:47,855 INFO L383 AbstractCegarLoop]: Hoare is true 29.30/20.33 [2019-03-28 12:04:47,855 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 29.30/20.33 [2019-03-28 12:04:47,855 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 29.30/20.33 [2019-03-28 12:04:47,855 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 29.30/20.33 [2019-03-28 12:04:47,855 INFO L387 AbstractCegarLoop]: Difference is false 29.30/20.33 [2019-03-28 12:04:47,856 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 29.30/20.33 [2019-03-28 12:04:47,856 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 29.30/20.33 [2019-03-28 12:04:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. 29.30/20.33 [2019-03-28 12:04:47,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 29.30/20.33 [2019-03-28 12:04:47,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. 29.30/20.33 [2019-03-28 12:04:47,927 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 29.30/20.33 [2019-03-28 12:04:47,928 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 4 20) no Hoare annotation was computed. 29.30/20.33 [2019-03-28 12:04:47,928 INFO L448 ceAbstractionStarter]: For program point L9(lines 9 12) no Hoare annotation was computed. 29.30/20.33 [2019-03-28 12:04:47,928 INFO L448 ceAbstractionStarter]: For program point L9-2(lines 4 20) no Hoare annotation was computed. 29.30/20.33 [2019-03-28 12:04:47,928 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. 29.30/20.33 [2019-03-28 12:04:47,928 INFO L451 ceAbstractionStarter]: At program point L4-2(lines 4 20) the Hoare annotation is: true 29.30/20.33 [2019-03-28 12:04:47,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:04:47 BasicIcfg 29.30/20.33 [2019-03-28 12:04:47,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 29.30/20.33 [2019-03-28 12:04:47,937 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 29.30/20.33 [2019-03-28 12:04:47,938 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 29.30/20.33 [2019-03-28 12:04:47,941 INFO L276 PluginConnector]: BuchiAutomizer initialized 29.30/20.33 [2019-03-28 12:04:47,942 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 29.30/20.33 [2019-03-28 12:04:47,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:04:47" (1/5) ... 29.30/20.33 [2019-03-28 12:04:47,943 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5481d482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:04:47, skipping insertion in model container 29.30/20.33 [2019-03-28 12:04:47,943 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 29.30/20.33 [2019-03-28 12:04:47,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:47" (2/5) ... 29.30/20.33 [2019-03-28 12:04:47,943 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5481d482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:04:47, skipping insertion in model container 29.30/20.33 [2019-03-28 12:04:47,943 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 29.30/20.33 [2019-03-28 12:04:47,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:04:47" (3/5) ... 29.30/20.33 [2019-03-28 12:04:47,944 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5481d482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:04:47, skipping insertion in model container 29.30/20.33 [2019-03-28 12:04:47,944 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 29.30/20.33 [2019-03-28 12:04:47,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:04:47" (4/5) ... 29.30/20.33 [2019-03-28 12:04:47,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5481d482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:04:47, skipping insertion in model container 29.30/20.33 [2019-03-28 12:04:47,945 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 29.30/20.33 [2019-03-28 12:04:47,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:04:47" (5/5) ... 29.30/20.33 [2019-03-28 12:04:47,946 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 29.30/20.33 [2019-03-28 12:04:47,974 INFO L133 ementStrategyFactory]: Using default assertion order modulation 29.30/20.33 [2019-03-28 12:04:47,975 INFO L374 BuchiCegarLoop]: Interprodecural is true 29.30/20.33 [2019-03-28 12:04:47,975 INFO L375 BuchiCegarLoop]: Hoare is true 29.30/20.33 [2019-03-28 12:04:47,975 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 29.30/20.33 [2019-03-28 12:04:47,975 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 29.30/20.33 [2019-03-28 12:04:47,975 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 29.30/20.33 [2019-03-28 12:04:47,975 INFO L379 BuchiCegarLoop]: Difference is false 29.30/20.33 [2019-03-28 12:04:47,975 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 29.30/20.33 [2019-03-28 12:04:47,976 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 29.30/20.33 [2019-03-28 12:04:47,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 29.30/20.33 [2019-03-28 12:04:47,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 29.30/20.33 [2019-03-28 12:04:47,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 29.30/20.33 [2019-03-28 12:04:47,999 INFO L119 BuchiIsEmpty]: Starting construction of run 29.30/20.33 [2019-03-28 12:04:48,004 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 29.30/20.33 [2019-03-28 12:04:48,004 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 29.30/20.33 [2019-03-28 12:04:48,005 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 29.30/20.33 [2019-03-28 12:04:48,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 29.30/20.33 [2019-03-28 12:04:48,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 29.30/20.33 [2019-03-28 12:04:48,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 29.30/20.33 [2019-03-28 12:04:48,006 INFO L119 BuchiIsEmpty]: Starting construction of run 29.30/20.33 [2019-03-28 12:04:48,006 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 29.30/20.33 [2019-03-28 12:04:48,006 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 29.30/20.33 [2019-03-28 12:04:48,011 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [45] ULTIMATE.startENTRY-->L4-2: Formula: (and (= v_ULTIMATE.start_fermat_~a~0_1 1) (= v_ULTIMATE.start_fermat_~c~0_2 1) (= v_ULTIMATE.start_fermat_~MAX~0_2 1000) (= v_ULTIMATE.start_fermat_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_2, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_2, ULTIMATE.start_fermat_#res=|v_ULTIMATE.start_fermat_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_1|, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_1, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_1, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_1|, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_#res, ULTIMATE.start_main_#res, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post0, ULTIMATE.start_fermat_#t~post1, ULTIMATE.start_main_#t~ret3] 7#L4-2true 29.30/20.33 [2019-03-28 12:04:48,012 INFO L796 eck$LassoCheckResult]: Loop: 7#L4-2true [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3#L5true [62] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (> (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 8#L9true [55] L9-->L9-2: Formula: (and (= (+ v_ULTIMATE.start_fermat_~b~0_7 1) v_ULTIMATE.start_fermat_~b~0_6) (= v_ULTIMATE.start_fermat_~a~0_7 1) (< v_ULTIMATE.start_fermat_~MAX~0_5 v_ULTIMATE.start_fermat_~a~0_8)) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_7, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_5} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_7, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_6, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_2|, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_5} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post1] 6#L9-2true [49] L9-2-->L13-1: Formula: (and (< v_ULTIMATE.start_fermat_~MAX~0_7 v_ULTIMATE.start_fermat_~b~0_9) (= (+ v_ULTIMATE.start_fermat_~c~0_8 1) v_ULTIMATE.start_fermat_~c~0_7) (= v_ULTIMATE.start_fermat_~b~0_8 1)) InVars {ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_9, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_8, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_7} OutVars{ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_2|, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_8, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_7, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_7} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~b~0] 5#L13-1true [61] L13-1-->L4-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_1 v_ULTIMATE.start_fermat_~c~0_1) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} AuxVars[] AssignedVars[] 7#L4-2true 29.30/20.33 [2019-03-28 12:04:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:48,018 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times 29.30/20.33 [2019-03-28 12:04:48,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.30/20.33 [2019-03-28 12:04:48,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.30/20.33 [2019-03-28 12:04:48,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:48,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:48,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:48,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:48,092 INFO L82 PathProgramCache]: Analyzing trace with hash 79477241, now seen corresponding path program 1 times 29.30/20.33 [2019-03-28 12:04:48,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.30/20.33 [2019-03-28 12:04:48,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.30/20.33 [2019-03-28 12:04:48,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:48,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:48,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:48,097 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 29.30/20.33 [2019-03-28 12:04:48,097 INFO L258 seRefinementStrategy]: Advancing trace checker 29.30/20.33 [2019-03-28 12:04:48,097 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 29.30/20.33 [2019-03-28 12:04:48,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:48,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:48,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2068303730, now seen corresponding path program 1 times 29.30/20.33 [2019-03-28 12:04:48,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.30/20.33 [2019-03-28 12:04:48,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.30/20.33 [2019-03-28 12:04:48,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:48,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:48,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:48,174 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 29.30/20.33 [2019-03-28 12:04:48,174 INFO L258 seRefinementStrategy]: Advancing trace checker 29.30/20.33 [2019-03-28 12:04:48,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 29.30/20.33 [2019-03-28 12:04:48,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:48,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:48,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 29.30/20.33 [2019-03-28 12:04:48,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 29.30/20.33 [2019-03-28 12:04:48,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 29.30/20.33 [2019-03-28 12:04:49,883 WARN L188 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 30 29.30/20.33 [2019-03-28 12:04:51,001 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 26 29.30/20.33 [2019-03-28 12:04:51,013 INFO L216 LassoAnalysis]: Preferences: 29.30/20.33 [2019-03-28 12:04:51,014 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.30/20.33 [2019-03-28 12:04:51,014 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.30/20.33 [2019-03-28 12:04:51,014 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.30/20.33 [2019-03-28 12:04:51,015 INFO L127 ssoRankerPreferences]: Use exernal solver: true 29.30/20.33 [2019-03-28 12:04:51,015 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:51,015 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.30/20.33 [2019-03-28 12:04:51,015 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.30/20.33 [2019-03-28 12:04:51,015 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 29.30/20.33 [2019-03-28 12:04:51,015 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.30/20.33 [2019-03-28 12:04:51,016 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.30/20.33 [2019-03-28 12:04:51,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:51,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:51,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:51,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:51,657 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 29 29.30/20.33 [2019-03-28 12:04:51,724 INFO L300 LassoAnalysis]: Preprocessing complete. 29.30/20.33 [2019-03-28 12:04:51,725 INFO L412 LassoAnalysis]: Checking for nontermination... 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:51,732 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.30/20.33 [2019-03-28 12:04:51,732 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.30/20.33 [2019-03-28 12:04:51,740 INFO L445 LassoAnalysis]: Proved nontermination for one component. 29.30/20.33 [2019-03-28 12:04:51,740 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_fermat_#t~post2=0} Honda state: {ULTIMATE.start_fermat_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:51,768 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.30/20.33 [2019-03-28 12:04:51,769 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.30/20.33 [2019-03-28 12:04:51,772 INFO L445 LassoAnalysis]: Proved nontermination for one component. 29.30/20.33 [2019-03-28 12:04:51,772 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_fermat_#t~post1=0} Honda state: {ULTIMATE.start_fermat_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:51,801 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.30/20.33 [2019-03-28 12:04:51,801 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:51,835 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 29.30/20.33 [2019-03-28 12:04:51,836 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.30/20.33 [2019-03-28 12:04:51,847 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 29.30/20.33 [2019-03-28 12:04:51,873 INFO L216 LassoAnalysis]: Preferences: 29.30/20.33 [2019-03-28 12:04:51,873 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.30/20.33 [2019-03-28 12:04:51,873 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.30/20.33 [2019-03-28 12:04:51,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.30/20.33 [2019-03-28 12:04:51,873 INFO L127 ssoRankerPreferences]: Use exernal solver: false 29.30/20.33 [2019-03-28 12:04:51,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:51,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.30/20.33 [2019-03-28 12:04:51,874 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.30/20.33 [2019-03-28 12:04:51,874 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 29.30/20.33 [2019-03-28 12:04:51,874 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.30/20.33 [2019-03-28 12:04:51,874 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.30/20.33 [2019-03-28 12:04:51,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:51,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:51,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:53,378 WARN L188 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 26 29.30/20.33 [2019-03-28 12:04:53,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:54,000 WARN L188 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 29 29.30/20.33 [2019-03-28 12:04:54,003 INFO L300 LassoAnalysis]: Preprocessing complete. 29.30/20.33 [2019-03-28 12:04:54,009 INFO L497 LassoAnalysis]: Using template 'affine'. 29.30/20.33 [2019-03-28 12:04:54,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.30/20.33 Termination analysis: LINEAR_WITH_GUESSES 29.30/20.33 Number of strict supporting invariants: 0 29.30/20.33 Number of non-strict supporting invariants: 1 29.30/20.33 Consider only non-deceasing supporting invariants: true 29.30/20.33 Simplify termination arguments: true 29.30/20.33 Simplify supporting invariants: trueOverapproximate stem: false 29.30/20.33 [2019-03-28 12:04:54,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.30/20.33 [2019-03-28 12:04:54,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.30/20.33 [2019-03-28 12:04:54,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.30/20.33 [2019-03-28 12:04:54,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.30/20.33 [2019-03-28 12:04:54,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.30/20.33 [2019-03-28 12:04:54,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.30/20.33 [2019-03-28 12:04:54,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.30/20.33 [2019-03-28 12:04:54,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 29.30/20.33 [2019-03-28 12:04:54,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.30/20.33 Termination analysis: LINEAR_WITH_GUESSES 29.30/20.33 Number of strict supporting invariants: 0 29.30/20.33 Number of non-strict supporting invariants: 1 29.30/20.33 Consider only non-deceasing supporting invariants: true 29.30/20.33 Simplify termination arguments: true 29.30/20.33 Simplify supporting invariants: trueOverapproximate stem: false 29.30/20.33 [2019-03-28 12:04:54,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.30/20.33 [2019-03-28 12:04:54,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.30/20.33 [2019-03-28 12:04:54,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.30/20.33 [2019-03-28 12:04:54,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.30/20.33 [2019-03-28 12:04:54,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.30/20.33 [2019-03-28 12:04:54,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.30/20.33 [2019-03-28 12:04:54,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.30/20.33 [2019-03-28 12:04:54,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 29.30/20.33 [2019-03-28 12:04:54,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.30/20.33 Termination analysis: LINEAR_WITH_GUESSES 29.30/20.33 Number of strict supporting invariants: 0 29.30/20.33 Number of non-strict supporting invariants: 1 29.30/20.33 Consider only non-deceasing supporting invariants: true 29.30/20.33 Simplify termination arguments: true 29.30/20.33 Simplify supporting invariants: trueOverapproximate stem: false 29.30/20.33 [2019-03-28 12:04:54,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.30/20.33 [2019-03-28 12:04:54,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.30/20.33 [2019-03-28 12:04:54,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.30/20.33 [2019-03-28 12:04:54,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.30/20.33 [2019-03-28 12:04:54,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.30/20.33 [2019-03-28 12:04:54,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.30/20.33 [2019-03-28 12:04:54,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.30/20.33 [2019-03-28 12:04:54,044 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 29.30/20.33 [2019-03-28 12:04:54,061 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 29.30/20.33 [2019-03-28 12:04:54,062 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 29.30/20.33 [2019-03-28 12:04:54,064 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 29.30/20.33 [2019-03-28 12:04:54,064 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 29.30/20.33 [2019-03-28 12:04:54,064 INFO L518 LassoAnalysis]: Proved termination. 29.30/20.33 [2019-03-28 12:04:54,065 INFO L520 LassoAnalysis]: Termination argument consisting of: 29.30/20.33 Ranking function f(ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_~c~0) = 1*ULTIMATE.start_fermat_~MAX~0 - 1*ULTIMATE.start_fermat_~c~0 29.30/20.33 Supporting invariants [] 29.30/20.33 [2019-03-28 12:04:54,066 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 29.30/20.33 [2019-03-28 12:04:54,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:54,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:54,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:54,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:54,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 29.30/20.33 [2019-03-28 12:04:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:54,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:54,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:54,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:54,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:54,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:54,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:54,205 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 29.30/20.33 [2019-03-28 12:04:54,210 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 29.30/20.33 [2019-03-28 12:04:54,212 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states. Second operand 4 states. 29.30/20.33 [2019-03-28 12:04:54,295 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states.. Second operand 4 states. Result 15 states and 23 transitions. Complement of second has 5 states. 29.30/20.33 [2019-03-28 12:04:54,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states 29.30/20.33 [2019-03-28 12:04:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 29.30/20.33 [2019-03-28 12:04:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. 29.30/20.33 [2019-03-28 12:04:54,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 1 letters. Loop has 5 letters. 29.30/20.33 [2019-03-28 12:04:54,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.30/20.33 [2019-03-28 12:04:54,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 5 letters. 29.30/20.33 [2019-03-28 12:04:54,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.30/20.33 [2019-03-28 12:04:54,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 1 letters. Loop has 10 letters. 29.30/20.33 [2019-03-28 12:04:54,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.30/20.33 [2019-03-28 12:04:54,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. 29.30/20.33 [2019-03-28 12:04:54,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 29.30/20.33 [2019-03-28 12:04:54,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 23 transitions. 29.30/20.33 [2019-03-28 12:04:54,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 29.30/20.33 [2019-03-28 12:04:54,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 29.30/20.33 [2019-03-28 12:04:54,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 23 transitions. 29.30/20.33 [2019-03-28 12:04:54,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 29.30/20.33 [2019-03-28 12:04:54,322 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 23 transitions. 29.30/20.33 [2019-03-28 12:04:54,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 23 transitions. 29.30/20.33 [2019-03-28 12:04:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. 29.30/20.33 [2019-03-28 12:04:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 29.30/20.33 [2019-03-28 12:04:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. 29.30/20.33 [2019-03-28 12:04:54,356 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. 29.30/20.33 [2019-03-28 12:04:54,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 29.30/20.33 [2019-03-28 12:04:54,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 29.30/20.33 [2019-03-28 12:04:54,360 INFO L87 Difference]: Start difference. First operand 13 states and 20 transitions. Second operand 4 states. 29.30/20.33 [2019-03-28 12:04:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 29.30/20.33 [2019-03-28 12:04:54,398 INFO L93 Difference]: Finished difference Result 26 states and 39 transitions. 29.30/20.33 [2019-03-28 12:04:54,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 29.30/20.33 [2019-03-28 12:04:54,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 39 transitions. 29.30/20.33 [2019-03-28 12:04:54,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 29.30/20.33 [2019-03-28 12:04:54,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 39 transitions. 29.30/20.33 [2019-03-28 12:04:54,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 29.30/20.33 [2019-03-28 12:04:54,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 29.30/20.33 [2019-03-28 12:04:54,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 39 transitions. 29.30/20.33 [2019-03-28 12:04:54,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 29.30/20.33 [2019-03-28 12:04:54,405 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 39 transitions. 29.30/20.33 [2019-03-28 12:04:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 39 transitions. 29.30/20.33 [2019-03-28 12:04:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. 29.30/20.33 [2019-03-28 12:04:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 29.30/20.33 [2019-03-28 12:04:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. 29.30/20.33 [2019-03-28 12:04:54,407 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. 29.30/20.33 [2019-03-28 12:04:54,407 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. 29.30/20.33 [2019-03-28 12:04:54,408 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 29.30/20.33 [2019-03-28 12:04:54,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. 29.30/20.33 [2019-03-28 12:04:54,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 29.30/20.33 [2019-03-28 12:04:54,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 29.30/20.33 [2019-03-28 12:04:54,409 INFO L119 BuchiIsEmpty]: Starting construction of run 29.30/20.33 [2019-03-28 12:04:54,410 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 29.30/20.33 [2019-03-28 12:04:54,410 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 29.30/20.33 [2019-03-28 12:04:54,410 INFO L794 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L4-2: Formula: (and (= v_ULTIMATE.start_fermat_~a~0_1 1) (= v_ULTIMATE.start_fermat_~c~0_2 1) (= v_ULTIMATE.start_fermat_~MAX~0_2 1000) (= v_ULTIMATE.start_fermat_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_2, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_2, ULTIMATE.start_fermat_#res=|v_ULTIMATE.start_fermat_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_1|, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_1, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_1, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_1|, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_#res, ULTIMATE.start_main_#res, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post0, ULTIMATE.start_fermat_#t~post1, ULTIMATE.start_main_#t~ret3] 166#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 177#L5 [63] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (< (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 174#L9 [59] L9-->L9-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_6 v_ULTIMATE.start_fermat_~a~0_9) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} AuxVars[] AssignedVars[] 171#L9-2 29.30/20.33 [2019-03-28 12:04:54,411 INFO L796 eck$LassoCheckResult]: Loop: 171#L9-2 [60] L9-2-->L13-1: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_8 v_ULTIMATE.start_fermat_~b~0_10) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} AuxVars[] AssignedVars[] 167#L13-1 [61] L13-1-->L4-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_1 v_ULTIMATE.start_fermat_~c~0_1) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} AuxVars[] AssignedVars[] 168#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 161#L5 [62] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (> (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 162#L9 [55] L9-->L9-2: Formula: (and (= (+ v_ULTIMATE.start_fermat_~b~0_7 1) v_ULTIMATE.start_fermat_~b~0_6) (= v_ULTIMATE.start_fermat_~a~0_7 1) (< v_ULTIMATE.start_fermat_~MAX~0_5 v_ULTIMATE.start_fermat_~a~0_8)) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_7, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_5} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_7, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_6, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_2|, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_5} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post1] 171#L9-2 29.30/20.33 [2019-03-28 12:04:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:54,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2317061, now seen corresponding path program 1 times 29.30/20.33 [2019-03-28 12:04:54,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.30/20.33 [2019-03-28 12:04:54,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.30/20.33 [2019-03-28 12:04:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:54,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:54,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:54,415 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 29.30/20.33 [2019-03-28 12:04:54,415 INFO L258 seRefinementStrategy]: Advancing trace checker 29.30/20.33 [2019-03-28 12:04:54,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 29.30/20.33 [2019-03-28 12:04:54,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:54,469 INFO L82 PathProgramCache]: Analyzing trace with hash 85910572, now seen corresponding path program 1 times 29.30/20.33 [2019-03-28 12:04:54,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.30/20.33 [2019-03-28 12:04:54,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.30/20.33 [2019-03-28 12:04:54,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:54,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:54,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:54,472 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 29.30/20.33 [2019-03-28 12:04:54,472 INFO L258 seRefinementStrategy]: Advancing trace checker 29.30/20.33 [2019-03-28 12:04:54,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 29.30/20.33 [2019-03-28 12:04:54,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:54,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:54,529 INFO L82 PathProgramCache]: Analyzing trace with hash -223360088, now seen corresponding path program 1 times 29.30/20.33 [2019-03-28 12:04:54,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.30/20.33 [2019-03-28 12:04:54,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.30/20.33 [2019-03-28 12:04:54,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:54,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:54,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:54,533 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 29.30/20.33 [2019-03-28 12:04:54,534 INFO L258 seRefinementStrategy]: Advancing trace checker 29.30/20.33 [2019-03-28 12:04:54,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 29.30/20.33 [2019-03-28 12:04:54,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:54,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:54,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 29.30/20.33 [2019-03-28 12:04:54,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. 29.30/20.33 [2019-03-28 12:04:54,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 29.30/20.33 [2019-03-28 12:04:54,695 INFO L216 LassoAnalysis]: Preferences: 29.30/20.33 [2019-03-28 12:04:54,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.30/20.33 [2019-03-28 12:04:54,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.30/20.33 [2019-03-28 12:04:54,696 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.30/20.33 [2019-03-28 12:04:54,696 INFO L127 ssoRankerPreferences]: Use exernal solver: true 29.30/20.33 [2019-03-28 12:04:54,696 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:54,696 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.30/20.33 [2019-03-28 12:04:54,697 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.30/20.33 [2019-03-28 12:04:54,697 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 29.30/20.33 [2019-03-28 12:04:54,697 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.30/20.33 [2019-03-28 12:04:54,697 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.30/20.33 [2019-03-28 12:04:54,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:54,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:54,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:54,812 INFO L300 LassoAnalysis]: Preprocessing complete. 29.30/20.33 [2019-03-28 12:04:54,813 INFO L412 LassoAnalysis]: Checking for nontermination... 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:54,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.30/20.33 [2019-03-28 12:04:54,819 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:54,851 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 29.30/20.33 [2019-03-28 12:04:54,852 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.30/20.33 [2019-03-28 12:04:54,860 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 29.30/20.33 [2019-03-28 12:04:54,884 INFO L216 LassoAnalysis]: Preferences: 29.30/20.33 [2019-03-28 12:04:54,884 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.30/20.33 [2019-03-28 12:04:54,893 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.30/20.33 [2019-03-28 12:04:54,893 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.30/20.33 [2019-03-28 12:04:54,893 INFO L127 ssoRankerPreferences]: Use exernal solver: false 29.30/20.33 [2019-03-28 12:04:54,893 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:54,894 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.30/20.33 [2019-03-28 12:04:54,894 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.30/20.33 [2019-03-28 12:04:54,894 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 29.30/20.33 [2019-03-28 12:04:54,894 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.30/20.33 [2019-03-28 12:04:54,895 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.30/20.33 [2019-03-28 12:04:54,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:54,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:54,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:54,994 INFO L300 LassoAnalysis]: Preprocessing complete. 29.30/20.33 [2019-03-28 12:04:54,994 INFO L497 LassoAnalysis]: Using template 'affine'. 29.30/20.33 [2019-03-28 12:04:54,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.30/20.33 Termination analysis: LINEAR_WITH_GUESSES 29.30/20.33 Number of strict supporting invariants: 0 29.30/20.33 Number of non-strict supporting invariants: 1 29.30/20.33 Consider only non-deceasing supporting invariants: true 29.30/20.33 Simplify termination arguments: true 29.30/20.33 Simplify supporting invariants: trueOverapproximate stem: false 29.30/20.33 [2019-03-28 12:04:54,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.30/20.33 [2019-03-28 12:04:54,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.30/20.33 [2019-03-28 12:04:54,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.30/20.33 [2019-03-28 12:04:54,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.30/20.33 [2019-03-28 12:04:54,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.30/20.33 [2019-03-28 12:04:54,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.30/20.33 [2019-03-28 12:04:54,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.30/20.33 [2019-03-28 12:04:55,008 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 29.30/20.33 [2019-03-28 12:04:55,014 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 29.30/20.33 [2019-03-28 12:04:55,014 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. 29.30/20.33 [2019-03-28 12:04:55,014 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 29.30/20.33 [2019-03-28 12:04:55,015 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 29.30/20.33 [2019-03-28 12:04:55,015 INFO L518 LassoAnalysis]: Proved termination. 29.30/20.33 [2019-03-28 12:04:55,015 INFO L520 LassoAnalysis]: Termination argument consisting of: 29.30/20.33 Ranking function f(ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_~b~0) = 2*ULTIMATE.start_fermat_~MAX~0 - 2*ULTIMATE.start_fermat_~b~0 + 1 29.30/20.33 Supporting invariants [] 29.30/20.33 [2019-03-28 12:04:55,016 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 29.30/20.33 [2019-03-28 12:04:55,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:55,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:55,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:55,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:55,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 29.30/20.33 [2019-03-28 12:04:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:55,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:55,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:55,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:55,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:55,158 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 29.30/20.33 [2019-03-28 12:04:55,158 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 29.30/20.33 [2019-03-28 12:04:55,159 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 26 transitions. cyclomatic complexity: 11 Second operand 3 states. 29.30/20.33 [2019-03-28 12:04:55,206 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 26 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 74 states and 110 transitions. Complement of second has 12 states. 29.30/20.33 [2019-03-28 12:04:55,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states 29.30/20.33 [2019-03-28 12:04:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 29.30/20.33 [2019-03-28 12:04:55,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. 29.30/20.33 [2019-03-28 12:04:55,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 4 letters. Loop has 5 letters. 29.30/20.33 [2019-03-28 12:04:55,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.30/20.33 [2019-03-28 12:04:55,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 5 letters. 29.30/20.33 [2019-03-28 12:04:55,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.30/20.33 [2019-03-28 12:04:55,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 4 letters. Loop has 10 letters. 29.30/20.33 [2019-03-28 12:04:55,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.30/20.33 [2019-03-28 12:04:55,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 110 transitions. 29.30/20.33 [2019-03-28 12:04:55,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 29.30/20.33 [2019-03-28 12:04:55,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 35 states and 52 transitions. 29.30/20.33 [2019-03-28 12:04:55,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 29.30/20.33 [2019-03-28 12:04:55,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 29.30/20.33 [2019-03-28 12:04:55,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 52 transitions. 29.30/20.33 [2019-03-28 12:04:55,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 29.30/20.33 [2019-03-28 12:04:55,216 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. 29.30/20.33 [2019-03-28 12:04:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 52 transitions. 29.30/20.33 [2019-03-28 12:04:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. 29.30/20.33 [2019-03-28 12:04:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 29.30/20.33 [2019-03-28 12:04:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. 29.30/20.33 [2019-03-28 12:04:55,220 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. 29.30/20.33 [2019-03-28 12:04:55,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 29.30/20.33 [2019-03-28 12:04:55,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 29.30/20.33 [2019-03-28 12:04:55,221 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 5 states. 29.30/20.33 [2019-03-28 12:04:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 29.30/20.33 [2019-03-28 12:04:55,261 INFO L93 Difference]: Finished difference Result 75 states and 108 transitions. 29.30/20.33 [2019-03-28 12:04:55,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 29.30/20.33 [2019-03-28 12:04:55,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 108 transitions. 29.30/20.33 [2019-03-28 12:04:55,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 29.30/20.33 [2019-03-28 12:04:55,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 108 transitions. 29.30/20.33 [2019-03-28 12:04:55,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 29.30/20.33 [2019-03-28 12:04:55,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 29.30/20.33 [2019-03-28 12:04:55,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 108 transitions. 29.30/20.33 [2019-03-28 12:04:55,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 29.30/20.33 [2019-03-28 12:04:55,285 INFO L706 BuchiCegarLoop]: Abstraction has 75 states and 108 transitions. 29.30/20.33 [2019-03-28 12:04:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 108 transitions. 29.30/20.33 [2019-03-28 12:04:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. 29.30/20.33 [2019-03-28 12:04:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. 29.30/20.33 [2019-03-28 12:04:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. 29.30/20.33 [2019-03-28 12:04:55,291 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 76 transitions. 29.30/20.33 [2019-03-28 12:04:55,291 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 76 transitions. 29.30/20.33 [2019-03-28 12:04:55,291 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 29.30/20.33 [2019-03-28 12:04:55,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 76 transitions. 29.30/20.33 [2019-03-28 12:04:55,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 29.30/20.33 [2019-03-28 12:04:55,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 29.30/20.33 [2019-03-28 12:04:55,293 INFO L119 BuchiIsEmpty]: Starting construction of run 29.30/20.33 [2019-03-28 12:04:55,294 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 29.30/20.33 [2019-03-28 12:04:55,294 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 29.30/20.33 [2019-03-28 12:04:55,294 INFO L794 eck$LassoCheckResult]: Stem: 475#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L4-2: Formula: (and (= v_ULTIMATE.start_fermat_~a~0_1 1) (= v_ULTIMATE.start_fermat_~c~0_2 1) (= v_ULTIMATE.start_fermat_~MAX~0_2 1000) (= v_ULTIMATE.start_fermat_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_2, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_2, ULTIMATE.start_fermat_#res=|v_ULTIMATE.start_fermat_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_1|, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_1, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_1, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_1|, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_#res, ULTIMATE.start_main_#res, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post0, ULTIMATE.start_fermat_#t~post1, ULTIMATE.start_main_#t~ret3] 476#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 501#L5 [63] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (< (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 500#L9 [59] L9-->L9-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_6 v_ULTIMATE.start_fermat_~a~0_9) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} AuxVars[] AssignedVars[] 499#L9-2 [60] L9-2-->L13-1: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_8 v_ULTIMATE.start_fermat_~b~0_10) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} AuxVars[] AssignedVars[] 482#L13-1 29.30/20.33 [2019-03-28 12:04:55,295 INFO L796 eck$LassoCheckResult]: Loop: 482#L13-1 [61] L13-1-->L4-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_1 v_ULTIMATE.start_fermat_~c~0_1) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} AuxVars[] AssignedVars[] 513#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 505#L5 [62] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (> (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 485#L9 [59] L9-->L9-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_6 v_ULTIMATE.start_fermat_~a~0_9) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} AuxVars[] AssignedVars[] 481#L9-2 [60] L9-2-->L13-1: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_8 v_ULTIMATE.start_fermat_~b~0_10) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} AuxVars[] AssignedVars[] 482#L13-1 29.30/20.33 [2019-03-28 12:04:55,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:55,295 INFO L82 PathProgramCache]: Analyzing trace with hash 71828951, now seen corresponding path program 1 times 29.30/20.33 [2019-03-28 12:04:55,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.30/20.33 [2019-03-28 12:04:55,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.30/20.33 [2019-03-28 12:04:55,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:55,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:55,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:55,299 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 29.30/20.33 [2019-03-28 12:04:55,299 INFO L258 seRefinementStrategy]: Advancing trace checker 29.30/20.33 [2019-03-28 12:04:55,299 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 29.30/20.33 [2019-03-28 12:04:55,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:55,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:55,351 INFO L82 PathProgramCache]: Analyzing trace with hash 86604326, now seen corresponding path program 1 times 29.30/20.33 [2019-03-28 12:04:55,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.30/20.33 [2019-03-28 12:04:55,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.30/20.33 [2019-03-28 12:04:55,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:55,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:55,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:55,354 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 29.30/20.33 [2019-03-28 12:04:55,355 INFO L258 seRefinementStrategy]: Advancing trace checker 29.30/20.33 [2019-03-28 12:04:55,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 29.30/20.33 [2019-03-28 12:04:55,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1665772048, now seen corresponding path program 1 times 29.30/20.33 [2019-03-28 12:04:55,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.30/20.33 [2019-03-28 12:04:55,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.30/20.33 [2019-03-28 12:04:55,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:55,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:55,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:55,409 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 29.30/20.33 [2019-03-28 12:04:55,409 INFO L258 seRefinementStrategy]: Advancing trace checker 29.30/20.33 [2019-03-28 12:04:55,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 29.30/20.33 [2019-03-28 12:04:55,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:55,538 INFO L216 LassoAnalysis]: Preferences: 29.30/20.33 [2019-03-28 12:04:55,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.30/20.33 [2019-03-28 12:04:55,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.30/20.33 [2019-03-28 12:04:55,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.30/20.33 [2019-03-28 12:04:55,538 INFO L127 ssoRankerPreferences]: Use exernal solver: true 29.30/20.33 [2019-03-28 12:04:55,538 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:55,539 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.30/20.33 [2019-03-28 12:04:55,539 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.30/20.33 [2019-03-28 12:04:55,539 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 29.30/20.33 [2019-03-28 12:04:55,539 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.30/20.33 [2019-03-28 12:04:55,539 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.30/20.33 [2019-03-28 12:04:55,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:55,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:55,677 INFO L300 LassoAnalysis]: Preprocessing complete. 29.30/20.33 [2019-03-28 12:04:55,678 INFO L412 LassoAnalysis]: Checking for nontermination... 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:55,682 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.30/20.33 [2019-03-28 12:04:55,682 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.30/20.33 [2019-03-28 12:04:55,686 INFO L445 LassoAnalysis]: Proved nontermination for one component. 29.30/20.33 [2019-03-28 12:04:55,686 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_fermat_#t~post0=0} Honda state: {ULTIMATE.start_fermat_#t~post0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:55,714 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.30/20.33 [2019-03-28 12:04:55,714 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:55,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 29.30/20.33 [2019-03-28 12:04:55,746 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.30/20.33 [2019-03-28 12:04:55,753 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 29.30/20.33 [2019-03-28 12:04:55,777 INFO L216 LassoAnalysis]: Preferences: 29.30/20.33 [2019-03-28 12:04:55,777 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.30/20.33 [2019-03-28 12:04:55,777 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.30/20.33 [2019-03-28 12:04:55,777 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.30/20.33 [2019-03-28 12:04:55,777 INFO L127 ssoRankerPreferences]: Use exernal solver: false 29.30/20.33 [2019-03-28 12:04:55,777 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:55,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.30/20.33 [2019-03-28 12:04:55,778 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.30/20.33 [2019-03-28 12:04:55,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 29.30/20.33 [2019-03-28 12:04:55,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.30/20.33 [2019-03-28 12:04:55,778 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.30/20.33 [2019-03-28 12:04:55,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:55,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:55,985 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 21 29.30/20.33 [2019-03-28 12:04:56,031 INFO L300 LassoAnalysis]: Preprocessing complete. 29.30/20.33 [2019-03-28 12:04:56,032 INFO L497 LassoAnalysis]: Using template 'affine'. 29.30/20.33 [2019-03-28 12:04:56,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.30/20.33 Termination analysis: LINEAR_WITH_GUESSES 29.30/20.33 Number of strict supporting invariants: 0 29.30/20.33 Number of non-strict supporting invariants: 1 29.30/20.33 Consider only non-deceasing supporting invariants: true 29.30/20.33 Simplify termination arguments: true 29.30/20.33 Simplify supporting invariants: trueOverapproximate stem: false 29.30/20.33 [2019-03-28 12:04:56,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.30/20.33 [2019-03-28 12:04:56,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.30/20.33 [2019-03-28 12:04:56,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.30/20.33 [2019-03-28 12:04:56,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.30/20.33 [2019-03-28 12:04:56,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.30/20.33 [2019-03-28 12:04:56,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.30/20.33 [2019-03-28 12:04:56,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.30/20.33 [2019-03-28 12:04:56,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 29.30/20.33 [2019-03-28 12:04:56,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.30/20.33 Termination analysis: LINEAR_WITH_GUESSES 29.30/20.33 Number of strict supporting invariants: 0 29.30/20.33 Number of non-strict supporting invariants: 1 29.30/20.33 Consider only non-deceasing supporting invariants: true 29.30/20.33 Simplify termination arguments: true 29.30/20.33 Simplify supporting invariants: trueOverapproximate stem: false 29.30/20.33 [2019-03-28 12:04:56,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.30/20.33 [2019-03-28 12:04:56,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.30/20.33 [2019-03-28 12:04:56,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.30/20.33 [2019-03-28 12:04:56,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.30/20.33 [2019-03-28 12:04:56,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.30/20.33 [2019-03-28 12:04:56,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.30/20.33 [2019-03-28 12:04:56,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.30/20.33 [2019-03-28 12:04:56,044 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 29.30/20.33 [2019-03-28 12:04:56,050 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 29.30/20.33 [2019-03-28 12:04:56,050 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 29.30/20.33 [2019-03-28 12:04:56,050 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 29.30/20.33 [2019-03-28 12:04:56,050 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 29.30/20.33 [2019-03-28 12:04:56,051 INFO L518 LassoAnalysis]: Proved termination. 29.30/20.33 [2019-03-28 12:04:56,051 INFO L520 LassoAnalysis]: Termination argument consisting of: 29.30/20.33 Ranking function f(ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_~a~0) = 1*ULTIMATE.start_fermat_~MAX~0 - 1*ULTIMATE.start_fermat_~a~0 29.30/20.33 Supporting invariants [] 29.30/20.33 [2019-03-28 12:04:56,051 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 29.30/20.33 [2019-03-28 12:04:56,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:56,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:56,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:56,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:56,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 29.30/20.33 [2019-03-28 12:04:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:56,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:56,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:56,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:56,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:56,139 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 29.30/20.33 [2019-03-28 12:04:56,139 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 29.30/20.33 [2019-03-28 12:04:56,140 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 52 states and 76 transitions. cyclomatic complexity: 28 Second operand 5 states. 29.30/20.33 [2019-03-28 12:04:56,222 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 52 states and 76 transitions. cyclomatic complexity: 28. Second operand 5 states. Result 156 states and 227 transitions. Complement of second has 20 states. 29.30/20.33 [2019-03-28 12:04:56,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 29.30/20.33 [2019-03-28 12:04:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 29.30/20.33 [2019-03-28 12:04:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. 29.30/20.33 [2019-03-28 12:04:56,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 5 letters. 29.30/20.33 [2019-03-28 12:04:56,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.30/20.33 [2019-03-28 12:04:56,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 10 letters. Loop has 5 letters. 29.30/20.33 [2019-03-28 12:04:56,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.30/20.33 [2019-03-28 12:04:56,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 10 letters. 29.30/20.33 [2019-03-28 12:04:56,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.30/20.33 [2019-03-28 12:04:56,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 227 transitions. 29.30/20.33 [2019-03-28 12:04:56,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 29.30/20.33 [2019-03-28 12:04:56,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 60 states and 86 transitions. 29.30/20.33 [2019-03-28 12:04:56,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 29.30/20.33 [2019-03-28 12:04:56,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 29.30/20.33 [2019-03-28 12:04:56,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 86 transitions. 29.30/20.33 [2019-03-28 12:04:56,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 29.30/20.33 [2019-03-28 12:04:56,233 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 86 transitions. 29.30/20.33 [2019-03-28 12:04:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 86 transitions. 29.30/20.33 [2019-03-28 12:04:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 33. 29.30/20.33 [2019-03-28 12:04:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 29.30/20.33 [2019-03-28 12:04:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. 29.30/20.33 [2019-03-28 12:04:56,236 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 47 transitions. 29.30/20.33 [2019-03-28 12:04:56,236 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 47 transitions. 29.30/20.33 [2019-03-28 12:04:56,236 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 29.30/20.33 [2019-03-28 12:04:56,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 47 transitions. 29.30/20.33 [2019-03-28 12:04:56,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 29.30/20.33 [2019-03-28 12:04:56,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 29.30/20.33 [2019-03-28 12:04:56,238 INFO L119 BuchiIsEmpty]: Starting construction of run 29.30/20.33 [2019-03-28 12:04:56,238 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1] 29.30/20.33 [2019-03-28 12:04:56,238 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 29.30/20.33 [2019-03-28 12:04:56,239 INFO L794 eck$LassoCheckResult]: Stem: 781#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L4-2: Formula: (and (= v_ULTIMATE.start_fermat_~a~0_1 1) (= v_ULTIMATE.start_fermat_~c~0_2 1) (= v_ULTIMATE.start_fermat_~MAX~0_2 1000) (= v_ULTIMATE.start_fermat_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_2, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_2, ULTIMATE.start_fermat_#res=|v_ULTIMATE.start_fermat_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_1|, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_1, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_1, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_1|, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_#res, ULTIMATE.start_main_#res, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post0, ULTIMATE.start_fermat_#t~post1, ULTIMATE.start_main_#t~ret3] 782#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 790#L5 [63] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (< (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 796#L9 [59] L9-->L9-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_6 v_ULTIMATE.start_fermat_~a~0_9) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} AuxVars[] AssignedVars[] 794#L9-2 [49] L9-2-->L13-1: Formula: (and (< v_ULTIMATE.start_fermat_~MAX~0_7 v_ULTIMATE.start_fermat_~b~0_9) (= (+ v_ULTIMATE.start_fermat_~c~0_8 1) v_ULTIMATE.start_fermat_~c~0_7) (= v_ULTIMATE.start_fermat_~b~0_8 1)) InVars {ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_9, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_8, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_7} OutVars{ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_2|, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_8, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_7, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_7} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~b~0] 785#L13-1 [61] L13-1-->L4-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_1 v_ULTIMATE.start_fermat_~c~0_1) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} AuxVars[] AssignedVars[] 786#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 779#L5 [63] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (< (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 780#L9 [59] L9-->L9-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_6 v_ULTIMATE.start_fermat_~a~0_9) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} AuxVars[] AssignedVars[] 791#L9-2 [49] L9-2-->L13-1: Formula: (and (< v_ULTIMATE.start_fermat_~MAX~0_7 v_ULTIMATE.start_fermat_~b~0_9) (= (+ v_ULTIMATE.start_fermat_~c~0_8 1) v_ULTIMATE.start_fermat_~c~0_7) (= v_ULTIMATE.start_fermat_~b~0_8 1)) InVars {ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_9, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_8, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_7} OutVars{ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_2|, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_8, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_7, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_7} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~b~0] 792#L13-1 [61] L13-1-->L4-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_1 v_ULTIMATE.start_fermat_~c~0_1) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} AuxVars[] AssignedVars[] 784#L4-2 29.30/20.33 [2019-03-28 12:04:56,239 INFO L796 eck$LassoCheckResult]: Loop: 784#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 777#L5 [62] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (> (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 778#L9 [55] L9-->L9-2: Formula: (and (= (+ v_ULTIMATE.start_fermat_~b~0_7 1) v_ULTIMATE.start_fermat_~b~0_6) (= v_ULTIMATE.start_fermat_~a~0_7 1) (< v_ULTIMATE.start_fermat_~MAX~0_5 v_ULTIMATE.start_fermat_~a~0_8)) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_7, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_5} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_7, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_6, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_2|, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_5} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post1] 787#L9-2 [60] L9-2-->L13-1: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_8 v_ULTIMATE.start_fermat_~b~0_10) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} AuxVars[] AssignedVars[] 783#L13-1 [61] L13-1-->L4-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_1 v_ULTIMATE.start_fermat_~c~0_1) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} AuxVars[] AssignedVars[] 784#L4-2 29.30/20.33 [2019-03-28 12:04:56,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:56,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1073250452, now seen corresponding path program 1 times 29.30/20.33 [2019-03-28 12:04:56,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.30/20.33 [2019-03-28 12:04:56,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.30/20.33 [2019-03-28 12:04:56,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:56,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:56,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:56,243 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 29.30/20.33 [2019-03-28 12:04:56,243 INFO L258 seRefinementStrategy]: Advancing trace checker 29.30/20.33 [2019-03-28 12:04:56,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 29.30/20.33 [2019-03-28 12:04:56,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:04:56,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:04:56,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:04:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 29.30/20.33 [2019-03-28 12:04:56,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 29.30/20.33 [2019-03-28 12:04:56,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 29.30/20.33 [2019-03-28 12:04:56,302 INFO L799 eck$LassoCheckResult]: stem already infeasible 29.30/20.33 [2019-03-28 12:04:56,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:04:56,302 INFO L82 PathProgramCache]: Analyzing trace with hash 79477582, now seen corresponding path program 2 times 29.30/20.33 [2019-03-28 12:04:56,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.30/20.33 [2019-03-28 12:04:56,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.30/20.33 [2019-03-28 12:04:56,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:56,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:56,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.30/20.33 [2019-03-28 12:04:56,305 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 29.30/20.33 [2019-03-28 12:04:56,305 INFO L258 seRefinementStrategy]: Advancing trace checker 29.30/20.33 [2019-03-28 12:04:56,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 29.30/20.33 [2019-03-28 12:04:56,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 29.30/20.33 [2019-03-28 12:04:56,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) 29.30/20.33 [2019-03-28 12:04:56,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.30/20.33 [2019-03-28 12:04:56,887 WARN L188 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 25 29.30/20.33 [2019-03-28 12:04:56,921 INFO L216 LassoAnalysis]: Preferences: 29.30/20.33 [2019-03-28 12:04:56,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.30/20.33 [2019-03-28 12:04:56,922 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.30/20.33 [2019-03-28 12:04:56,922 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.30/20.33 [2019-03-28 12:04:56,922 INFO L127 ssoRankerPreferences]: Use exernal solver: true 29.30/20.33 [2019-03-28 12:04:56,922 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:56,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.30/20.33 [2019-03-28 12:04:56,923 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.30/20.33 [2019-03-28 12:04:56,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 29.30/20.33 [2019-03-28 12:04:56,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.30/20.33 [2019-03-28 12:04:56,923 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.30/20.33 [2019-03-28 12:04:56,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:56,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:56,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:04:57,049 INFO L300 LassoAnalysis]: Preprocessing complete. 29.30/20.33 [2019-03-28 12:04:57,050 INFO L412 LassoAnalysis]: Checking for nontermination... 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:57,055 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.30/20.33 [2019-03-28 12:04:57,056 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.30/20.33 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.30/20.33 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.30/20.33 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:57,087 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 29.30/20.33 [2019-03-28 12:04:57,087 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.30/20.33 [2019-03-28 12:04:57,095 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 29.30/20.33 [2019-03-28 12:04:57,119 INFO L216 LassoAnalysis]: Preferences: 29.30/20.33 [2019-03-28 12:04:57,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.30/20.33 [2019-03-28 12:04:57,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.30/20.33 [2019-03-28 12:04:57,119 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.30/20.33 [2019-03-28 12:04:57,120 INFO L127 ssoRankerPreferences]: Use exernal solver: false 29.30/20.33 [2019-03-28 12:04:57,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 29.30/20.33 [2019-03-28 12:04:57,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.30/20.33 [2019-03-28 12:04:57,120 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.30/20.33 [2019-03-28 12:04:57,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 29.30/20.33 [2019-03-28 12:04:57,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.30/20.33 [2019-03-28 12:04:57,120 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.30/20.33 [2019-03-28 12:04:57,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:05:02,220 WARN L188 SmtUtils]: Spent 5.09 s on a formula simplification that was a NOOP. DAG size: 23 29.30/20.33 [2019-03-28 12:05:02,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:05:02,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.30/20.33 [2019-03-28 12:05:02,447 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 25 29.30/20.33 [2019-03-28 12:05:02,618 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 25 29.30/20.33 [2019-03-28 12:05:02,621 INFO L300 LassoAnalysis]: Preprocessing complete. 29.30/20.33 [2019-03-28 12:05:02,621 INFO L497 LassoAnalysis]: Using template 'affine'. 29.30/20.33 [2019-03-28 12:05:02,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.30/20.33 Termination analysis: LINEAR_WITH_GUESSES 29.30/20.33 Number of strict supporting invariants: 0 29.30/20.33 Number of non-strict supporting invariants: 1 29.30/20.33 Consider only non-deceasing supporting invariants: true 29.30/20.33 Simplify termination arguments: true 29.30/20.33 Simplify supporting invariants: trueOverapproximate stem: false 29.30/20.33 [2019-03-28 12:05:02,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.30/20.33 [2019-03-28 12:05:02,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.30/20.33 [2019-03-28 12:05:02,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.30/20.33 [2019-03-28 12:05:02,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.30/20.33 [2019-03-28 12:05:02,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.30/20.33 [2019-03-28 12:05:02,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.30/20.33 [2019-03-28 12:05:02,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.30/20.33 [2019-03-28 12:05:02,630 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 29.30/20.33 [2019-03-28 12:05:02,636 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 29.30/20.33 [2019-03-28 12:05:02,636 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 29.30/20.33 [2019-03-28 12:05:02,636 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 29.30/20.33 [2019-03-28 12:05:02,637 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 29.30/20.33 [2019-03-28 12:05:02,637 INFO L518 LassoAnalysis]: Proved termination. 29.30/20.33 [2019-03-28 12:05:02,637 INFO L520 LassoAnalysis]: Termination argument consisting of: 29.30/20.33 Ranking function f(ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_~MAX~0) = -1*ULTIMATE.start_fermat_~b~0 + 1*ULTIMATE.start_fermat_~MAX~0 29.30/20.33 Supporting invariants [] 29.30/20.33 [2019-03-28 12:05:02,637 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 29.30/20.33 [2019-03-28 12:05:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.30/20.33 [2019-03-28 12:05:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:05:02,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:05:02,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:05:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.33 [2019-03-28 12:05:02,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.33 [2019-03-28 12:05:02,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.33 [2019-03-28 12:05:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 29.30/20.34 [2019-03-28 12:05:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.34 [2019-03-28 12:05:02,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.34 [2019-03-28 12:05:02,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.34 [2019-03-28 12:05:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.34 [2019-03-28 12:05:02,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.34 [2019-03-28 12:05:02,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.34 [2019-03-28 12:05:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.30/20.34 [2019-03-28 12:05:02,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core 29.30/20.34 [2019-03-28 12:05:02,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.30/20.34 [2019-03-28 12:05:02,734 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 29.30/20.34 [2019-03-28 12:05:02,734 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 29.30/20.34 [2019-03-28 12:05:02,734 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 33 states and 47 transitions. cyclomatic complexity: 16 Second operand 5 states. 29.30/20.34 [2019-03-28 12:05:02,808 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 33 states and 47 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 206 states and 303 transitions. Complement of second has 39 states. 29.30/20.34 [2019-03-28 12:05:02,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 3 non-accepting loop states 2 accepting loop states 29.30/20.34 [2019-03-28 12:05:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 29.30/20.34 [2019-03-28 12:05:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. 29.30/20.34 [2019-03-28 12:05:02,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 11 letters. Loop has 5 letters. 29.30/20.34 [2019-03-28 12:05:02,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.30/20.34 [2019-03-28 12:05:02,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 16 letters. Loop has 5 letters. 29.30/20.34 [2019-03-28 12:05:02,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.30/20.34 [2019-03-28 12:05:02,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 11 letters. Loop has 10 letters. 29.30/20.34 [2019-03-28 12:05:02,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.30/20.34 [2019-03-28 12:05:02,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 303 transitions. 29.30/20.34 [2019-03-28 12:05:02,817 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 29.30/20.34 [2019-03-28 12:05:02,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 0 states and 0 transitions. 29.30/20.34 [2019-03-28 12:05:02,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 29.30/20.34 [2019-03-28 12:05:02,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 29.30/20.34 [2019-03-28 12:05:02,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 29.30/20.34 [2019-03-28 12:05:02,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 29.30/20.34 [2019-03-28 12:05:02,818 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 29.30/20.34 [2019-03-28 12:05:02,818 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 29.30/20.34 [2019-03-28 12:05:02,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 29.30/20.34 [2019-03-28 12:05:02,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 29.30/20.34 [2019-03-28 12:05:02,818 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. 29.30/20.34 [2019-03-28 12:05:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 29.30/20.34 [2019-03-28 12:05:02,818 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. 29.30/20.34 [2019-03-28 12:05:02,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 29.30/20.34 [2019-03-28 12:05:02,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. 29.30/20.34 [2019-03-28 12:05:02,820 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 29.30/20.34 [2019-03-28 12:05:02,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. 29.30/20.34 [2019-03-28 12:05:02,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 29.30/20.34 [2019-03-28 12:05:02,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 29.30/20.34 [2019-03-28 12:05:02,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 29.30/20.34 [2019-03-28 12:05:02,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 29.30/20.34 [2019-03-28 12:05:02,821 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 29.30/20.34 [2019-03-28 12:05:02,821 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 29.30/20.34 [2019-03-28 12:05:02,821 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 29.30/20.34 [2019-03-28 12:05:02,821 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 29.30/20.34 [2019-03-28 12:05:02,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 29.30/20.34 [2019-03-28 12:05:02,821 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 29.30/20.34 [2019-03-28 12:05:02,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 29.30/20.34 [2019-03-28 12:05:02,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:05:02 BasicIcfg 29.30/20.34 [2019-03-28 12:05:02,827 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 29.30/20.34 [2019-03-28 12:05:02,828 INFO L168 Benchmark]: Toolchain (without parser) took 15679.62 ms. Allocated memory was 649.6 MB in the beginning and 745.5 MB in the end (delta: 95.9 MB). Free memory was 564.9 MB in the beginning and 514.7 MB in the end (delta: 50.2 MB). Peak memory consumption was 146.1 MB. Max. memory is 50.3 GB. 29.30/20.34 [2019-03-28 12:05:02,829 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 29.30/20.34 [2019-03-28 12:05:02,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.49 ms. Allocated memory is still 649.6 MB. Free memory was 564.9 MB in the beginning and 555.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 29.30/20.34 [2019-03-28 12:05:02,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.77 ms. Allocated memory is still 649.6 MB. Free memory was 555.4 MB in the beginning and 614.0 MB in the end (delta: -58.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 50.3 GB. 29.30/20.34 [2019-03-28 12:05:02,830 INFO L168 Benchmark]: Boogie Preprocessor took 20.03 ms. Allocated memory is still 649.6 MB. Free memory is still 614.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 29.30/20.34 [2019-03-28 12:05:02,831 INFO L168 Benchmark]: RCFGBuilder took 210.51 ms. Allocated memory is still 649.6 MB. Free memory was 612.7 MB in the beginning and 599.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. 29.30/20.34 [2019-03-28 12:05:02,831 INFO L168 Benchmark]: BlockEncodingV2 took 78.19 ms. Allocated memory is still 649.6 MB. Free memory was 599.6 MB in the beginning and 593.1 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 29.30/20.34 [2019-03-28 12:05:02,832 INFO L168 Benchmark]: TraceAbstraction took 154.29 ms. Allocated memory is still 649.6 MB. Free memory was 591.8 MB in the beginning and 583.6 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. 29.30/20.34 [2019-03-28 12:05:02,832 INFO L168 Benchmark]: BuchiAutomizer took 14890.06 ms. Allocated memory was 649.6 MB in the beginning and 745.5 MB in the end (delta: 95.9 MB). Free memory was 583.6 MB in the beginning and 514.7 MB in the end (delta: 69.0 MB). Peak memory consumption was 164.9 MB. Max. memory is 50.3 GB. 29.30/20.34 [2019-03-28 12:05:02,836 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 29.30/20.34 --- Results --- 29.30/20.34 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 29.30/20.34 - StatisticsResult: Initial Icfg 29.30/20.34 11 locations, 16 edges 29.30/20.34 - StatisticsResult: Encoded RCFG 29.30/20.34 6 locations, 9 edges 29.30/20.34 * Results from de.uni_freiburg.informatik.ultimate.core: 29.30/20.34 - StatisticsResult: Toolchain Benchmarks 29.30/20.34 Benchmark results are: 29.30/20.34 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 29.30/20.34 * CACSL2BoogieTranslator took 229.49 ms. Allocated memory is still 649.6 MB. Free memory was 564.9 MB in the beginning and 555.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 29.30/20.34 * Boogie Procedure Inliner took 91.77 ms. Allocated memory is still 649.6 MB. Free memory was 555.4 MB in the beginning and 614.0 MB in the end (delta: -58.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 50.3 GB. 29.30/20.34 * Boogie Preprocessor took 20.03 ms. Allocated memory is still 649.6 MB. Free memory is still 614.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 29.30/20.34 * RCFGBuilder took 210.51 ms. Allocated memory is still 649.6 MB. Free memory was 612.7 MB in the beginning and 599.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. 29.30/20.34 * BlockEncodingV2 took 78.19 ms. Allocated memory is still 649.6 MB. Free memory was 599.6 MB in the beginning and 593.1 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 29.30/20.34 * TraceAbstraction took 154.29 ms. Allocated memory is still 649.6 MB. Free memory was 591.8 MB in the beginning and 583.6 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. 29.30/20.34 * BuchiAutomizer took 14890.06 ms. Allocated memory was 649.6 MB in the beginning and 745.5 MB in the end (delta: 95.9 MB). Free memory was 583.6 MB in the beginning and 514.7 MB in the end (delta: 69.0 MB). Peak memory consumption was 164.9 MB. Max. memory is 50.3 GB. 29.30/20.34 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 29.30/20.34 - AllSpecificationsHoldResult: All specifications hold 29.30/20.34 We were not able to verify any specifiation because the program does not contain any specification. 29.30/20.34 - InvariantResult [Line: 4]: Loop Invariant 29.30/20.34 Derived loop invariant: 1 29.30/20.34 - StatisticsResult: Ultimate Automizer benchmark data 29.30/20.34 CFG has 1 procedures, 6 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=6occurred 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 29.30/20.34 - StatisticsResult: Constructed decomposition of program 29.30/20.34 Your program was decomposed into 7 terminating modules (3 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function MAX + -1 * c and consists of 4 locations. One nondeterministic module has affine ranking function 2 * MAX + -2 * b + 1 and consists of 4 locations. One nondeterministic module has affine ranking function MAX + -1 * a and consists of 6 locations. One nondeterministic module has affine ranking function -1 * b + MAX and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. 29.30/20.34 - StatisticsResult: Timing statistics 29.30/20.34 BüchiAutomizer plugin needed 14.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 13.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 61 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 2. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 97 SDslu, 19 SDs, 0 SdLazy, 191 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq125 hnf95 smp100 dnf100 smp100 tf104 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s 29.30/20.34 - TerminationAnalysisResult: Termination proven 29.30/20.34 Buchi Automizer proved that your program is terminating 29.30/20.34 RESULT: Ultimate proved your program to be correct! 29.30/20.34 !SESSION 2019-03-28 12:04:43.824 ----------------------------------------------- 29.30/20.34 eclipse.buildId=unknown 29.30/20.34 java.version=1.8.0_181 29.30/20.34 java.vendor=Oracle Corporation 29.30/20.34 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 29.30/20.34 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 29.30/20.34 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 29.30/20.34 29.30/20.34 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:05:03.069 29.30/20.34 !MESSAGE The workspace will exit with unsaved changes in this session. 29.30/20.34 Received shutdown request... 29.30/20.34 Ultimate: 29.30/20.34 GTK+ Version Check 29.30/20.34 EOF