48.44/25.93 YES 48.44/25.93 48.44/25.93 Ultimate: Cannot open display: 48.44/25.93 This is Ultimate 0.1.24-8dc7c08-m 48.44/25.93 [2019-03-28 12:06:30,916 INFO L170 SettingsManager]: Resetting all preferences to default values... 48.44/25.93 [2019-03-28 12:06:30,918 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 48.44/25.93 [2019-03-28 12:06:30,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 48.44/25.93 [2019-03-28 12:06:30,930 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 48.44/25.93 [2019-03-28 12:06:30,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 48.44/25.93 [2019-03-28 12:06:30,932 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 48.44/25.93 [2019-03-28 12:06:30,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 48.44/25.93 [2019-03-28 12:06:30,935 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 48.44/25.93 [2019-03-28 12:06:30,936 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 48.44/25.93 [2019-03-28 12:06:30,937 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 48.44/25.93 [2019-03-28 12:06:30,937 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 48.44/25.93 [2019-03-28 12:06:30,938 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 48.44/25.93 [2019-03-28 12:06:30,939 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 48.44/25.93 [2019-03-28 12:06:30,940 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 48.44/25.93 [2019-03-28 12:06:30,940 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 48.44/25.93 [2019-03-28 12:06:30,941 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 48.44/25.93 [2019-03-28 12:06:30,943 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 48.44/25.93 [2019-03-28 12:06:30,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 48.44/25.93 [2019-03-28 12:06:30,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 48.44/25.93 [2019-03-28 12:06:30,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 48.44/25.93 [2019-03-28 12:06:30,948 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 48.44/25.93 [2019-03-28 12:06:30,950 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 48.44/25.93 [2019-03-28 12:06:30,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 48.44/25.93 [2019-03-28 12:06:30,951 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 48.44/25.93 [2019-03-28 12:06:30,951 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 48.44/25.93 [2019-03-28 12:06:30,952 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 48.44/25.93 [2019-03-28 12:06:30,953 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 48.44/25.93 [2019-03-28 12:06:30,953 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 48.44/25.93 [2019-03-28 12:06:30,953 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 48.44/25.93 [2019-03-28 12:06:30,954 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 48.44/25.93 [2019-03-28 12:06:30,955 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 48.44/25.93 [2019-03-28 12:06:30,956 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 48.44/25.93 [2019-03-28 12:06:30,956 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 48.44/25.93 [2019-03-28 12:06:30,957 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 48.44/25.93 [2019-03-28 12:06:30,957 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 48.44/25.93 [2019-03-28 12:06:30,957 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 48.44/25.93 [2019-03-28 12:06:30,958 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 48.44/25.93 [2019-03-28 12:06:30,959 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 48.44/25.93 [2019-03-28 12:06:30,959 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 48.44/25.93 [2019-03-28 12:06:30,973 INFO L110 SettingsManager]: Loading preferences was successful 48.44/25.93 [2019-03-28 12:06:30,974 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 48.44/25.93 [2019-03-28 12:06:30,975 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 48.44/25.93 [2019-03-28 12:06:30,975 INFO L133 SettingsManager]: * Rewrite not-equals=true 48.44/25.93 [2019-03-28 12:06:30,975 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 48.44/25.93 [2019-03-28 12:06:30,975 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 48.44/25.93 [2019-03-28 12:06:30,975 INFO L133 SettingsManager]: * Use SBE=true 48.44/25.93 [2019-03-28 12:06:30,976 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 48.44/25.93 [2019-03-28 12:06:30,976 INFO L133 SettingsManager]: * Use old map elimination=false 48.44/25.93 [2019-03-28 12:06:30,976 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 48.44/25.93 [2019-03-28 12:06:30,976 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 48.44/25.93 [2019-03-28 12:06:30,976 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 48.44/25.93 [2019-03-28 12:06:30,976 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 48.44/25.93 [2019-03-28 12:06:30,977 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 48.44/25.93 [2019-03-28 12:06:30,977 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.93 [2019-03-28 12:06:30,977 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 48.44/25.93 [2019-03-28 12:06:30,977 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 48.44/25.93 [2019-03-28 12:06:30,977 INFO L133 SettingsManager]: * Check division by zero=IGNORE 48.44/25.93 [2019-03-28 12:06:30,977 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 48.44/25.93 [2019-03-28 12:06:30,978 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 48.44/25.93 [2019-03-28 12:06:30,978 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 48.44/25.93 [2019-03-28 12:06:30,978 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 48.44/25.93 [2019-03-28 12:06:30,978 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 48.44/25.93 [2019-03-28 12:06:30,978 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 48.44/25.93 [2019-03-28 12:06:30,978 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 48.44/25.93 [2019-03-28 12:06:30,979 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 48.44/25.93 [2019-03-28 12:06:30,979 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 48.44/25.93 [2019-03-28 12:06:30,979 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 48.44/25.93 [2019-03-28 12:06:30,979 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 48.44/25.93 [2019-03-28 12:06:31,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 48.44/25.93 [2019-03-28 12:06:31,018 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 48.44/25.93 [2019-03-28 12:06:31,021 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 48.44/25.93 [2019-03-28 12:06:31,023 INFO L271 PluginConnector]: Initializing CDTParser... 48.44/25.93 [2019-03-28 12:06:31,023 INFO L276 PluginConnector]: CDTParser initialized 48.44/25.93 [2019-03-28 12:06:31,024 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 48.44/25.93 [2019-03-28 12:06:31,128 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/65b6b7ac9dd04ff1b92ea9e267ce51a7/FLAG9d0a587f9 48.44/25.93 [2019-03-28 12:06:31,466 INFO L307 CDTParser]: Found 1 translation units. 48.44/25.93 [2019-03-28 12:06:31,467 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 48.44/25.93 [2019-03-28 12:06:31,473 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/65b6b7ac9dd04ff1b92ea9e267ce51a7/FLAG9d0a587f9 48.44/25.93 [2019-03-28 12:06:31,876 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/65b6b7ac9dd04ff1b92ea9e267ce51a7 48.44/25.93 [2019-03-28 12:06:31,887 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 48.44/25.93 [2019-03-28 12:06:31,889 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 48.44/25.93 [2019-03-28 12:06:31,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 48.44/25.93 [2019-03-28 12:06:31,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 48.44/25.93 [2019-03-28 12:06:31,894 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 48.44/25.93 [2019-03-28 12:06:31,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:06:31" (1/1) ... 48.44/25.93 [2019-03-28 12:06:31,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b6b5b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31, skipping insertion in model container 48.44/25.93 [2019-03-28 12:06:31,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:06:31" (1/1) ... 48.44/25.93 [2019-03-28 12:06:31,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 48.44/25.93 [2019-03-28 12:06:31,922 INFO L176 MainTranslator]: Built tables and reachable declarations 48.44/25.93 [2019-03-28 12:06:32,070 INFO L206 PostProcessor]: Analyzing one entry point: main 48.44/25.93 [2019-03-28 12:06:32,074 INFO L191 MainTranslator]: Completed pre-run 48.44/25.93 [2019-03-28 12:06:32,088 INFO L206 PostProcessor]: Analyzing one entry point: main 48.44/25.93 [2019-03-28 12:06:32,157 INFO L195 MainTranslator]: Completed translation 48.44/25.93 [2019-03-28 12:06:32,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:32 WrapperNode 48.44/25.93 [2019-03-28 12:06:32,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 48.44/25.93 [2019-03-28 12:06:32,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 48.44/25.93 [2019-03-28 12:06:32,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 48.44/25.93 [2019-03-28 12:06:32,159 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 48.44/25.93 [2019-03-28 12:06:32,169 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:06:32" (1/1) ... 48.44/25.93 [2019-03-28 12:06:32,175 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:06:32" (1/1) ... 48.44/25.93 [2019-03-28 12:06:32,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 48.44/25.93 [2019-03-28 12:06:32,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 48.44/25.93 [2019-03-28 12:06:32,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 48.44/25.93 [2019-03-28 12:06:32,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized 48.44/25.93 [2019-03-28 12:06:32,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:32" (1/1) ... 48.44/25.93 [2019-03-28 12:06:32,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:32" (1/1) ... 48.44/25.93 [2019-03-28 12:06:32,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:32" (1/1) ... 48.44/25.93 [2019-03-28 12:06:32,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:32" (1/1) ... 48.44/25.93 [2019-03-28 12:06:32,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:32" (1/1) ... 48.44/25.93 [2019-03-28 12:06:32,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:32" (1/1) ... 48.44/25.93 [2019-03-28 12:06:32,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:32" (1/1) ... 48.44/25.93 [2019-03-28 12:06:32,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 48.44/25.93 [2019-03-28 12:06:32,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 48.44/25.93 [2019-03-28 12:06:32,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... 48.44/25.93 [2019-03-28 12:06:32,211 INFO L276 PluginConnector]: RCFGBuilder initialized 48.44/25.93 [2019-03-28 12:06:32,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:32" (1/1) ... 48.44/25.93 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.93 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 48.44/25.93 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 48.44/25.93 [2019-03-28 12:06:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 48.44/25.93 [2019-03-28 12:06:32,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 48.44/25.93 [2019-03-28 12:06:32,279 INFO L130 BoogieDeclarations]: Found specification of procedure mc91 48.44/25.93 [2019-03-28 12:06:32,279 INFO L138 BoogieDeclarations]: Found implementation of procedure mc91 48.44/25.93 [2019-03-28 12:06:32,406 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 48.44/25.93 [2019-03-28 12:06:32,406 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 48.44/25.93 [2019-03-28 12:06:32,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:32 BoogieIcfgContainer 48.44/25.93 [2019-03-28 12:06:32,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 48.44/25.93 [2019-03-28 12:06:32,408 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 48.44/25.93 [2019-03-28 12:06:32,408 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 48.44/25.93 [2019-03-28 12:06:32,411 INFO L276 PluginConnector]: BlockEncodingV2 initialized 48.44/25.93 [2019-03-28 12:06:32,411 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:32" (1/1) ... 48.44/25.93 [2019-03-28 12:06:32,428 INFO L313 BlockEncoder]: Initial Icfg 13 locations, 15 edges 48.44/25.93 [2019-03-28 12:06:32,430 INFO L258 BlockEncoder]: Using Remove infeasible edges 48.44/25.93 [2019-03-28 12:06:32,431 INFO L263 BlockEncoder]: Using Maximize final states 48.44/25.93 [2019-03-28 12:06:32,431 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 48.44/25.93 [2019-03-28 12:06:32,431 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 48.44/25.93 [2019-03-28 12:06:32,433 INFO L296 BlockEncoder]: Using Remove sink states 48.44/25.93 [2019-03-28 12:06:32,434 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 48.44/25.93 [2019-03-28 12:06:32,434 INFO L179 BlockEncoder]: Using Rewrite not-equals 48.44/25.93 [2019-03-28 12:06:32,449 INFO L185 BlockEncoder]: Using Use SBE 48.44/25.93 [2019-03-28 12:06:32,457 INFO L200 BlockEncoder]: SBE split 0 edges 48.44/25.93 [2019-03-28 12:06:32,462 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 48.44/25.93 [2019-03-28 12:06:32,464 INFO L71 MaximizeFinalStates]: 0 new accepting states 48.44/25.93 [2019-03-28 12:06:32,475 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 48.44/25.93 [2019-03-28 12:06:32,478 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states 48.44/25.93 [2019-03-28 12:06:32,479 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 48.44/25.93 [2019-03-28 12:06:32,480 INFO L71 MaximizeFinalStates]: 0 new accepting states 48.44/25.93 [2019-03-28 12:06:32,480 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 48.44/25.93 [2019-03-28 12:06:32,480 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 48.44/25.93 [2019-03-28 12:06:32,481 INFO L313 BlockEncoder]: Encoded RCFG 9 locations, 11 edges 48.44/25.93 [2019-03-28 12:06:32,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:06:32 BasicIcfg 48.44/25.93 [2019-03-28 12:06:32,481 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 48.44/25.93 [2019-03-28 12:06:32,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 48.44/25.93 [2019-03-28 12:06:32,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... 48.44/25.93 [2019-03-28 12:06:32,486 INFO L276 PluginConnector]: TraceAbstraction initialized 48.44/25.93 [2019-03-28 12:06:32,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:06:31" (1/4) ... 48.44/25.93 [2019-03-28 12:06:32,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615f849e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:06:32, skipping insertion in model container 48.44/25.93 [2019-03-28 12:06:32,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:32" (2/4) ... 48.44/25.93 [2019-03-28 12:06:32,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615f849e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:06:32, skipping insertion in model container 48.44/25.93 [2019-03-28 12:06:32,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:32" (3/4) ... 48.44/25.93 [2019-03-28 12:06:32,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615f849e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:06:32, skipping insertion in model container 48.44/25.93 [2019-03-28 12:06:32,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:06:32" (4/4) ... 48.44/25.93 [2019-03-28 12:06:32,490 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 48.44/25.93 [2019-03-28 12:06:32,501 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 48.44/25.93 [2019-03-28 12:06:32,508 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 48.44/25.93 [2019-03-28 12:06:32,528 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 48.44/25.93 [2019-03-28 12:06:32,558 INFO L133 ementStrategyFactory]: Using default assertion order modulation 48.44/25.93 [2019-03-28 12:06:32,559 INFO L382 AbstractCegarLoop]: Interprodecural is true 48.44/25.93 [2019-03-28 12:06:32,559 INFO L383 AbstractCegarLoop]: Hoare is true 48.44/25.93 [2019-03-28 12:06:32,559 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 48.44/25.93 [2019-03-28 12:06:32,559 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 48.44/25.93 [2019-03-28 12:06:32,559 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 48.44/25.93 [2019-03-28 12:06:32,559 INFO L387 AbstractCegarLoop]: Difference is false 48.44/25.93 [2019-03-28 12:06:32,560 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 48.44/25.93 [2019-03-28 12:06:32,560 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 48.44/25.93 [2019-03-28 12:06:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. 48.44/25.93 [2019-03-28 12:06:32,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 48.44/25.93 [2019-03-28 12:06:32,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. 48.44/25.93 [2019-03-28 12:06:32,652 INFO L451 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: true 48.44/25.93 [2019-03-28 12:06:32,652 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 48.44/25.93 [2019-03-28 12:06:32,653 INFO L448 ceAbstractionStarter]: For program point mc91FINAL(lines 8 12) no Hoare annotation was computed. 48.44/25.93 [2019-03-28 12:06:32,653 INFO L451 ceAbstractionStarter]: At program point L11(line 11) the Hoare annotation is: true 48.44/25.93 [2019-03-28 12:06:32,653 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 11) no Hoare annotation was computed. 48.44/25.93 [2019-03-28 12:06:32,653 INFO L451 ceAbstractionStarter]: At program point L11-1(line 11) the Hoare annotation is: true 48.44/25.93 [2019-03-28 12:06:32,653 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. 48.44/25.93 [2019-03-28 12:06:32,654 INFO L451 ceAbstractionStarter]: At program point mc91ENTRY(lines 8 12) the Hoare annotation is: true 48.44/25.93 [2019-03-28 12:06:32,654 INFO L448 ceAbstractionStarter]: For program point mc91EXIT(lines 8 12) no Hoare annotation was computed. 48.44/25.93 [2019-03-28 12:06:32,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:06:32 BasicIcfg 48.44/25.93 [2019-03-28 12:06:32,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 48.44/25.93 [2019-03-28 12:06:32,659 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 48.44/25.93 [2019-03-28 12:06:32,659 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 48.44/25.93 [2019-03-28 12:06:32,663 INFO L276 PluginConnector]: BuchiAutomizer initialized 48.44/25.93 [2019-03-28 12:06:32,664 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.44/25.93 [2019-03-28 12:06:32,664 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:06:31" (1/5) ... 48.44/25.93 [2019-03-28 12:06:32,665 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8b534ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:06:32, skipping insertion in model container 48.44/25.93 [2019-03-28 12:06:32,665 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.44/25.93 [2019-03-28 12:06:32,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:32" (2/5) ... 48.44/25.93 [2019-03-28 12:06:32,666 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8b534ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:06:32, skipping insertion in model container 48.44/25.93 [2019-03-28 12:06:32,666 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.44/25.93 [2019-03-28 12:06:32,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:32" (3/5) ... 48.44/25.93 [2019-03-28 12:06:32,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8b534ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:06:32, skipping insertion in model container 48.44/25.93 [2019-03-28 12:06:32,667 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.44/25.93 [2019-03-28 12:06:32,667 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:06:32" (4/5) ... 48.44/25.93 [2019-03-28 12:06:32,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8b534ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:06:32, skipping insertion in model container 48.44/25.93 [2019-03-28 12:06:32,667 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.44/25.93 [2019-03-28 12:06:32,671 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:06:32" (5/5) ... 48.44/25.93 [2019-03-28 12:06:32,672 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 48.44/25.93 [2019-03-28 12:06:32,703 INFO L133 ementStrategyFactory]: Using default assertion order modulation 48.44/25.93 [2019-03-28 12:06:32,704 INFO L374 BuchiCegarLoop]: Interprodecural is true 48.44/25.93 [2019-03-28 12:06:32,704 INFO L375 BuchiCegarLoop]: Hoare is true 48.44/25.93 [2019-03-28 12:06:32,704 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 48.44/25.93 [2019-03-28 12:06:32,704 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 48.44/25.93 [2019-03-28 12:06:32,704 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 48.44/25.93 [2019-03-28 12:06:32,704 INFO L379 BuchiCegarLoop]: Difference is false 48.44/25.93 [2019-03-28 12:06:32,704 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 48.44/25.93 [2019-03-28 12:06:32,705 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 48.44/25.93 [2019-03-28 12:06:32,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. 48.44/25.93 [2019-03-28 12:06:32,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 48.44/25.93 [2019-03-28 12:06:32,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.44/25.93 [2019-03-28 12:06:32,732 INFO L119 BuchiIsEmpty]: Starting construction of run 48.44/25.93 [2019-03-28 12:06:32,739 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 48.44/25.93 [2019-03-28 12:06:32,739 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 48.44/25.93 [2019-03-28 12:06:32,739 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 48.44/25.93 [2019-03-28 12:06:32,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. 48.44/25.93 [2019-03-28 12:06:32,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 48.44/25.93 [2019-03-28 12:06:32,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.44/25.93 [2019-03-28 12:06:32,741 INFO L119 BuchiIsEmpty]: Starting construction of run 48.44/25.93 [2019-03-28 12:06:32,742 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 48.44/25.93 [2019-03-28 12:06:32,742 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 48.44/25.93 [2019-03-28 12:06:32,747 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [26] ULTIMATE.startENTRY-->L16: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 5#L16true [23] L16-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_1|} AuxVars[] AssignedVars[mc91_#in~n]< 10#mc91ENTRYtrue 48.44/25.93 [2019-03-28 12:06:32,748 INFO L796 eck$LassoCheckResult]: Loop: 10#mc91ENTRYtrue [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 7#L10true [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 9#L11true [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 10#mc91ENTRYtrue 48.44/25.93 [2019-03-28 12:06:32,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.93 [2019-03-28 12:06:32,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1790, now seen corresponding path program 1 times 48.44/25.93 [2019-03-28 12:06:32,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.93 [2019-03-28 12:06:32,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.93 [2019-03-28 12:06:32,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.93 [2019-03-28 12:06:32,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.44/25.93 [2019-03-28 12:06:32,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.93 [2019-03-28 12:06:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.93 [2019-03-28 12:06:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.93 [2019-03-28 12:06:32,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.93 [2019-03-28 12:06:32,825 INFO L82 PathProgramCache]: Analyzing trace with hash 54032, now seen corresponding path program 1 times 48.44/25.93 [2019-03-28 12:06:32,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.93 [2019-03-28 12:06:32,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.93 [2019-03-28 12:06:32,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.93 [2019-03-28 12:06:32,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.44/25.93 [2019-03-28 12:06:32,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.93 [2019-03-28 12:06:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.93 [2019-03-28 12:06:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.93 [2019-03-28 12:06:32,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.93 [2019-03-28 12:06:32,845 INFO L82 PathProgramCache]: Analyzing trace with hash 53350131, now seen corresponding path program 1 times 48.44/25.93 [2019-03-28 12:06:32,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.93 [2019-03-28 12:06:32,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.93 [2019-03-28 12:06:32,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.93 [2019-03-28 12:06:32,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.44/25.93 [2019-03-28 12:06:32,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.93 [2019-03-28 12:06:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.93 [2019-03-28 12:06:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.93 [2019-03-28 12:06:32,919 INFO L216 LassoAnalysis]: Preferences: 48.44/25.93 [2019-03-28 12:06:32,921 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.44/25.93 [2019-03-28 12:06:32,921 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.44/25.93 [2019-03-28 12:06:32,921 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.44/25.93 [2019-03-28 12:06:32,921 INFO L127 ssoRankerPreferences]: Use exernal solver: true 48.44/25.93 [2019-03-28 12:06:32,921 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.93 [2019-03-28 12:06:32,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.44/25.93 [2019-03-28 12:06:32,922 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.44/25.93 [2019-03-28 12:06:32,922 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 48.44/25.93 [2019-03-28 12:06:32,922 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.44/25.93 [2019-03-28 12:06:32,922 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.44/25.93 [2019-03-28 12:06:32,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.93 [2019-03-28 12:06:32,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.93 [2019-03-28 12:06:32,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.93 [2019-03-28 12:06:32,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.93 [2019-03-28 12:06:32,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.93 [2019-03-28 12:06:33,015 INFO L300 LassoAnalysis]: Preprocessing complete. 48.44/25.93 [2019-03-28 12:06:33,016 INFO L412 LassoAnalysis]: Checking for nontermination... 48.44/25.93 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.93 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.93 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.93 [2019-03-28 12:06:33,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 48.44/25.93 [2019-03-28 12:06:33,024 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.93 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.93 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.93 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.93 [2019-03-28 12:06:33,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 48.44/25.93 [2019-03-28 12:06:33,058 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.93 [2019-03-28 12:06:33,090 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 48.44/25.93 [2019-03-28 12:06:33,092 INFO L216 LassoAnalysis]: Preferences: 48.44/25.93 [2019-03-28 12:06:33,093 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.44/25.93 [2019-03-28 12:06:33,093 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.44/25.93 [2019-03-28 12:06:33,093 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.44/25.93 [2019-03-28 12:06:33,093 INFO L127 ssoRankerPreferences]: Use exernal solver: false 48.44/25.93 [2019-03-28 12:06:33,093 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 48.44/25.93 [2019-03-28 12:06:33,093 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.44/25.93 [2019-03-28 12:06:33,094 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.44/25.93 [2019-03-28 12:06:33,094 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 48.44/25.93 [2019-03-28 12:06:33,094 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.44/25.93 [2019-03-28 12:06:33,094 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.44/25.93 [2019-03-28 12:06:33,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.93 [2019-03-28 12:06:33,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.93 [2019-03-28 12:06:33,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.93 [2019-03-28 12:06:33,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.93 [2019-03-28 12:06:33,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.93 [2019-03-28 12:06:33,152 INFO L300 LassoAnalysis]: Preprocessing complete. 48.44/25.93 [2019-03-28 12:06:33,157 INFO L497 LassoAnalysis]: Using template 'affine'. 48.44/25.93 [2019-03-28 12:06:33,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.44/25.93 Termination analysis: LINEAR_WITH_GUESSES 48.44/25.93 Number of strict supporting invariants: 0 48.44/25.93 Number of non-strict supporting invariants: 1 48.44/25.93 Consider only non-deceasing supporting invariants: true 48.44/25.93 Simplify termination arguments: true 48.44/25.93 Simplify supporting invariants: trueOverapproximate stem: false 48.44/25.93 [2019-03-28 12:06:33,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.44/25.93 [2019-03-28 12:06:33,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.44/25.93 [2019-03-28 12:06:33,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.44/25.93 [2019-03-28 12:06:33,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.44/25.93 [2019-03-28 12:06:33,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.44/25.93 [2019-03-28 12:06:33,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.44/25.93 [2019-03-28 12:06:33,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.44/25.93 [2019-03-28 12:06:33,174 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 48.44/25.93 [2019-03-28 12:06:33,181 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 48.44/25.93 [2019-03-28 12:06:33,181 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 48.44/25.93 [2019-03-28 12:06:33,183 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 48.44/25.93 [2019-03-28 12:06:33,183 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 48.44/25.93 [2019-03-28 12:06:33,184 INFO L518 LassoAnalysis]: Proved termination. 48.44/25.93 [2019-03-28 12:06:33,184 INFO L520 LassoAnalysis]: Termination argument consisting of: 48.44/25.93 Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 211 48.44/25.93 Supporting invariants [] 48.44/25.93 [2019-03-28 12:06:33,186 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 48.44/25.93 [2019-03-28 12:06:33,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:33,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core 48.44/25.94 [2019-03-28 12:06:33,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.44/25.94 [2019-03-28 12:06:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:33,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 48.44/25.94 [2019-03-28 12:06:33,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.44/25.94 [2019-03-28 12:06:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.44/25.94 [2019-03-28 12:06:33,353 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 48.44/25.94 [2019-03-28 12:06:33,358 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 48.44/25.94 [2019-03-28 12:06:33,359 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states. Second operand 4 states. 48.44/25.94 [2019-03-28 12:06:33,472 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states.. Second operand 4 states. Result 31 states and 39 transitions. Complement of second has 16 states. 48.44/25.94 [2019-03-28 12:06:33,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 48.44/25.94 [2019-03-28 12:06:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 48.44/25.94 [2019-03-28 12:06:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. 48.44/25.94 [2019-03-28 12:06:33,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 3 letters. 48.44/25.94 [2019-03-28 12:06:33,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:33,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 3 letters. 48.44/25.94 [2019-03-28 12:06:33,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:33,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. 48.44/25.94 [2019-03-28 12:06:33,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:33,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. 48.44/25.94 [2019-03-28 12:06:33,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 48.44/25.94 [2019-03-28 12:06:33,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 27 transitions. 48.44/25.94 [2019-03-28 12:06:33,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 48.44/25.94 [2019-03-28 12:06:33,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 48.44/25.94 [2019-03-28 12:06:33,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. 48.44/25.94 [2019-03-28 12:06:33,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 48.44/25.94 [2019-03-28 12:06:33,520 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. 48.44/25.94 [2019-03-28 12:06:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. 48.44/25.94 [2019-03-28 12:06:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. 48.44/25.94 [2019-03-28 12:06:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 48.44/25.94 [2019-03-28 12:06:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. 48.44/25.94 [2019-03-28 12:06:33,557 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. 48.44/25.94 [2019-03-28 12:06:33,557 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. 48.44/25.94 [2019-03-28 12:06:33,557 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 48.44/25.94 [2019-03-28 12:06:33,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. 48.44/25.94 [2019-03-28 12:06:33,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 48.44/25.94 [2019-03-28 12:06:33,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.44/25.94 [2019-03-28 12:06:33,559 INFO L119 BuchiIsEmpty]: Starting construction of run 48.44/25.94 [2019-03-28 12:06:33,560 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 48.44/25.94 [2019-03-28 12:06:33,560 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 48.44/25.94 [2019-03-28 12:06:33,560 INFO L794 eck$LassoCheckResult]: Stem: 104#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L16: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 101#L16 [23] L16-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_1|} AuxVars[] AssignedVars[mc91_#in~n]< 105#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 112#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 100#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 111#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 107#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 108#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 106#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 97#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 110#mc91ENTRY 48.44/25.94 [2019-03-28 12:06:33,561 INFO L796 eck$LassoCheckResult]: Loop: 110#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 114#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 98#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 110#mc91ENTRY 48.44/25.94 [2019-03-28 12:06:33,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1299401541, now seen corresponding path program 1 times 48.44/25.94 [2019-03-28 12:06:33,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.94 [2019-03-28 12:06:33,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.94 [2019-03-28 12:06:33,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:33,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:33,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:33,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:33,576 INFO L82 PathProgramCache]: Analyzing trace with hash 54032, now seen corresponding path program 2 times 48.44/25.94 [2019-03-28 12:06:33,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.94 [2019-03-28 12:06:33,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.94 [2019-03-28 12:06:33,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:33,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:33,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:33,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:33,582 INFO L82 PathProgramCache]: Analyzing trace with hash -68906676, now seen corresponding path program 2 times 48.44/25.94 [2019-03-28 12:06:33,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.94 [2019-03-28 12:06:33,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.94 [2019-03-28 12:06:33,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:33,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:33,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:33,625 INFO L216 LassoAnalysis]: Preferences: 48.44/25.94 [2019-03-28 12:06:33,625 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.44/25.94 [2019-03-28 12:06:33,625 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.44/25.94 [2019-03-28 12:06:33,625 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.44/25.94 [2019-03-28 12:06:33,626 INFO L127 ssoRankerPreferences]: Use exernal solver: true 48.44/25.94 [2019-03-28 12:06:33,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:33,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.44/25.94 [2019-03-28 12:06:33,626 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.44/25.94 [2019-03-28 12:06:33,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 48.44/25.94 [2019-03-28 12:06:33,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.44/25.94 [2019-03-28 12:06:33,626 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.44/25.94 [2019-03-28 12:06:33,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:33,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:33,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:33,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:33,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:33,663 INFO L300 LassoAnalysis]: Preprocessing complete. 48.44/25.94 [2019-03-28 12:06:33,664 INFO L412 LassoAnalysis]: Checking for nontermination... 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:33,668 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:33,668 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 [2019-03-28 12:06:33,674 INFO L445 LassoAnalysis]: Proved nontermination for one component. 48.44/25.94 [2019-03-28 12:06:33,674 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_~n=0} Honda state: {mc91_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:33,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:33,706 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 [2019-03-28 12:06:33,710 INFO L445 LassoAnalysis]: Proved nontermination for one component. 48.44/25.94 [2019-03-28 12:06:33,710 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:33,739 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:33,740 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 [2019-03-28 12:06:33,743 INFO L445 LassoAnalysis]: Proved nontermination for one component. 48.44/25.94 [2019-03-28 12:06:33,743 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:33,773 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:33,773 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:33,808 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:33,808 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 [2019-03-28 12:06:33,842 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 48.44/25.94 [2019-03-28 12:06:33,844 INFO L216 LassoAnalysis]: Preferences: 48.44/25.94 [2019-03-28 12:06:33,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.44/25.94 [2019-03-28 12:06:33,845 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.44/25.94 [2019-03-28 12:06:33,845 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.44/25.94 [2019-03-28 12:06:33,845 INFO L127 ssoRankerPreferences]: Use exernal solver: false 48.44/25.94 [2019-03-28 12:06:33,845 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:33,845 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.44/25.94 [2019-03-28 12:06:33,846 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.44/25.94 [2019-03-28 12:06:33,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 48.44/25.94 [2019-03-28 12:06:33,846 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.44/25.94 [2019-03-28 12:06:33,846 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.44/25.94 [2019-03-28 12:06:33,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:33,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:33,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:33,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:33,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:33,931 INFO L300 LassoAnalysis]: Preprocessing complete. 48.44/25.94 [2019-03-28 12:06:33,931 INFO L497 LassoAnalysis]: Using template 'affine'. 48.44/25.94 [2019-03-28 12:06:33,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.44/25.94 Termination analysis: LINEAR_WITH_GUESSES 48.44/25.94 Number of strict supporting invariants: 0 48.44/25.94 Number of non-strict supporting invariants: 1 48.44/25.94 Consider only non-deceasing supporting invariants: true 48.44/25.94 Simplify termination arguments: true 48.44/25.94 Simplify supporting invariants: trueOverapproximate stem: false 48.44/25.94 [2019-03-28 12:06:33,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.44/25.94 [2019-03-28 12:06:33,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.44/25.94 [2019-03-28 12:06:33,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.44/25.94 [2019-03-28 12:06:33,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.44/25.94 [2019-03-28 12:06:33,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.44/25.94 [2019-03-28 12:06:33,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.44/25.94 [2019-03-28 12:06:33,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.44/25.94 [2019-03-28 12:06:33,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.44/25.94 [2019-03-28 12:06:33,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.44/25.94 Termination analysis: LINEAR_WITH_GUESSES 48.44/25.94 Number of strict supporting invariants: 0 48.44/25.94 Number of non-strict supporting invariants: 1 48.44/25.94 Consider only non-deceasing supporting invariants: true 48.44/25.94 Simplify termination arguments: true 48.44/25.94 Simplify supporting invariants: trueOverapproximate stem: false 48.44/25.94 [2019-03-28 12:06:33,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.44/25.94 [2019-03-28 12:06:33,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.44/25.94 [2019-03-28 12:06:33,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.44/25.94 [2019-03-28 12:06:33,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.44/25.94 [2019-03-28 12:06:33,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.44/25.94 [2019-03-28 12:06:33,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.44/25.94 [2019-03-28 12:06:33,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.44/25.94 [2019-03-28 12:06:33,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.44/25.94 [2019-03-28 12:06:33,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.44/25.94 Termination analysis: LINEAR_WITH_GUESSES 48.44/25.94 Number of strict supporting invariants: 0 48.44/25.94 Number of non-strict supporting invariants: 1 48.44/25.94 Consider only non-deceasing supporting invariants: true 48.44/25.94 Simplify termination arguments: true 48.44/25.94 Simplify supporting invariants: trueOverapproximate stem: false 48.44/25.94 [2019-03-28 12:06:33,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.44/25.94 [2019-03-28 12:06:33,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.44/25.94 [2019-03-28 12:06:33,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.44/25.94 [2019-03-28 12:06:33,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.44/25.94 [2019-03-28 12:06:33,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.44/25.94 [2019-03-28 12:06:33,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.44/25.94 [2019-03-28 12:06:33,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.44/25.94 [2019-03-28 12:06:33,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.44/25.94 [2019-03-28 12:06:33,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.44/25.94 Termination analysis: LINEAR_WITH_GUESSES 48.44/25.94 Number of strict supporting invariants: 0 48.44/25.94 Number of non-strict supporting invariants: 1 48.44/25.94 Consider only non-deceasing supporting invariants: true 48.44/25.94 Simplify termination arguments: true 48.44/25.94 Simplify supporting invariants: trueOverapproximate stem: false 48.44/25.94 [2019-03-28 12:06:33,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.44/25.94 [2019-03-28 12:06:33,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.44/25.94 [2019-03-28 12:06:33,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.44/25.94 [2019-03-28 12:06:33,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.44/25.94 [2019-03-28 12:06:33,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.44/25.94 [2019-03-28 12:06:33,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.44/25.94 [2019-03-28 12:06:33,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.44/25.94 [2019-03-28 12:06:33,952 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 48.44/25.94 [2019-03-28 12:06:33,956 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 48.44/25.94 [2019-03-28 12:06:33,956 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 48.44/25.94 [2019-03-28 12:06:33,957 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 48.44/25.94 [2019-03-28 12:06:33,957 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 48.44/25.94 [2019-03-28 12:06:33,957 INFO L518 LassoAnalysis]: Proved termination. 48.44/25.94 [2019-03-28 12:06:33,957 INFO L520 LassoAnalysis]: Termination argument consisting of: 48.44/25.94 Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 211 48.44/25.94 Supporting invariants [] 48.44/25.94 [2019-03-28 12:06:33,958 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 48.44/25.94 [2019-03-28 12:06:33,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:34,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core 48.44/25.94 [2019-03-28 12:06:34,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.44/25.94 [2019-03-28 12:06:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:34,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 48.44/25.94 [2019-03-28 12:06:34,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.44/25.94 [2019-03-28 12:06:34,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.44/25.94 [2019-03-28 12:06:34,138 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 48.44/25.94 [2019-03-28 12:06:34,139 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates 48.44/25.94 [2019-03-28 12:06:34,139 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. 48.44/25.94 [2019-03-28 12:06:34,298 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states and 25 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 42 states and 56 transitions. Complement of second has 17 states. 48.44/25.94 [2019-03-28 12:06:34,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states 48.44/25.94 [2019-03-28 12:06:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 48.44/25.94 [2019-03-28 12:06:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. 48.44/25.94 [2019-03-28 12:06:34,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. 48.44/25.94 [2019-03-28 12:06:34,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:34,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 13 letters. Loop has 3 letters. 48.44/25.94 [2019-03-28 12:06:34,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:34,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 10 letters. Loop has 6 letters. 48.44/25.94 [2019-03-28 12:06:34,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:34,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. 48.44/25.94 [2019-03-28 12:06:34,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 48.44/25.94 [2019-03-28 12:06:34,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 31 states and 44 transitions. 48.44/25.94 [2019-03-28 12:06:34,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 48.44/25.94 [2019-03-28 12:06:34,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 48.44/25.94 [2019-03-28 12:06:34,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 44 transitions. 48.44/25.94 [2019-03-28 12:06:34,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 48.44/25.94 [2019-03-28 12:06:34,310 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. 48.44/25.94 [2019-03-28 12:06:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 44 transitions. 48.44/25.94 [2019-03-28 12:06:34,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. 48.44/25.94 [2019-03-28 12:06:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 48.44/25.94 [2019-03-28 12:06:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. 48.44/25.94 [2019-03-28 12:06:34,316 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. 48.44/25.94 [2019-03-28 12:06:34,316 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. 48.44/25.94 [2019-03-28 12:06:34,316 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 48.44/25.94 [2019-03-28 12:06:34,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. 48.44/25.94 [2019-03-28 12:06:34,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 48.44/25.94 [2019-03-28 12:06:34,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.44/25.94 [2019-03-28 12:06:34,318 INFO L119 BuchiIsEmpty]: Starting construction of run 48.44/25.94 [2019-03-28 12:06:34,319 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 48.44/25.94 [2019-03-28 12:06:34,319 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] 48.44/25.94 [2019-03-28 12:06:34,320 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L16: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 250#L16 [23] L16-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_1|} AuxVars[] AssignedVars[mc91_#in~n]< 251#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 257#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 243#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 256#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 258#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 260#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 261#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 246#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 255#mc91ENTRY 48.44/25.94 [2019-03-28 12:06:34,320 INFO L796 eck$LassoCheckResult]: Loop: 255#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 254#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 244#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 265#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 254#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 244#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 265#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 266#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 264#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 248#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 242#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 255#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 252#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 253#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 262#mc91EXIT >[36] mc91EXIT-->L11-2: AOR: Formula: (= |v_mc91_#t~ret1_4| |v_mc91_#resOutParam_3|) InVars {mc91_#res=|v_mc91_#resOutParam_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_4|} AuxVars[] AssignedVars[mc91_#t~ret1] LVA: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n] 241#L11-2 [25] L11-2-->mc91FINAL: Formula: (= |v_mc91_#res_2| |v_mc91_#t~ret1_3|) InVars {mc91_#t~ret1=|v_mc91_#t~ret1_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_2|, mc91_#t~ret0=|v_mc91_#t~ret0_3|, mc91_#res=|v_mc91_#res_2|} AuxVars[] AssignedVars[mc91_#t~ret1, mc91_#t~ret0, mc91_#res] 247#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 263#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 242#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 255#mc91ENTRY 48.44/25.94 [2019-03-28 12:06:34,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:34,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1299401541, now seen corresponding path program 3 times 48.44/25.94 [2019-03-28 12:06:34,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.94 [2019-03-28 12:06:34,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.94 [2019-03-28 12:06:34,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:34,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:34,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:34,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:34,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1040176321, now seen corresponding path program 1 times 48.44/25.94 [2019-03-28 12:06:34,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.94 [2019-03-28 12:06:34,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.94 [2019-03-28 12:06:34,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:34,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:34,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:34,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:34,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1837633157, now seen corresponding path program 1 times 48.44/25.94 [2019-03-28 12:06:34,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.94 [2019-03-28 12:06:34,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.94 [2019-03-28 12:06:34,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:34,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:34,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. 48.44/25.94 [2019-03-28 12:06:34,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 48.44/25.94 [2019-03-28 12:06:34,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 48.44/25.94 [2019-03-28 12:06:34,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:34,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core 48.44/25.94 [2019-03-28 12:06:34,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.44/25.94 [2019-03-28 12:06:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. 48.44/25.94 [2019-03-28 12:06:34,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 48.44/25.94 [2019-03-28 12:06:34,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 48.44/25.94 [2019-03-28 12:06:34,752 INFO L216 LassoAnalysis]: Preferences: 48.44/25.94 [2019-03-28 12:06:34,752 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.44/25.94 [2019-03-28 12:06:34,752 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.44/25.94 [2019-03-28 12:06:34,752 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.44/25.94 [2019-03-28 12:06:34,752 INFO L127 ssoRankerPreferences]: Use exernal solver: true 48.44/25.94 [2019-03-28 12:06:34,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:34,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.44/25.94 [2019-03-28 12:06:34,753 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.44/25.94 [2019-03-28 12:06:34,753 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 48.44/25.94 [2019-03-28 12:06:34,753 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.44/25.94 [2019-03-28 12:06:34,753 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.44/25.94 [2019-03-28 12:06:34,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:34,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:34,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:34,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:34,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:34,790 INFO L300 LassoAnalysis]: Preprocessing complete. 48.44/25.94 [2019-03-28 12:06:34,790 INFO L412 LassoAnalysis]: Checking for nontermination... 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:34,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:34,795 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:34,826 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:34,826 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 [2019-03-28 12:06:34,832 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 48.44/25.94 [2019-03-28 12:06:34,857 INFO L216 LassoAnalysis]: Preferences: 48.44/25.94 [2019-03-28 12:06:34,857 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.44/25.94 [2019-03-28 12:06:34,857 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.44/25.94 [2019-03-28 12:06:34,857 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.44/25.94 [2019-03-28 12:06:34,857 INFO L127 ssoRankerPreferences]: Use exernal solver: false 48.44/25.94 [2019-03-28 12:06:34,857 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:34,858 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.44/25.94 [2019-03-28 12:06:34,858 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.44/25.94 [2019-03-28 12:06:34,858 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 48.44/25.94 [2019-03-28 12:06:34,858 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.44/25.94 [2019-03-28 12:06:34,858 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.44/25.94 [2019-03-28 12:06:34,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:34,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:34,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:34,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:34,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:34,893 INFO L300 LassoAnalysis]: Preprocessing complete. 48.44/25.94 [2019-03-28 12:06:34,893 INFO L497 LassoAnalysis]: Using template 'affine'. 48.44/25.94 [2019-03-28 12:06:34,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.44/25.94 Termination analysis: LINEAR_WITH_GUESSES 48.44/25.94 Number of strict supporting invariants: 0 48.44/25.94 Number of non-strict supporting invariants: 1 48.44/25.94 Consider only non-deceasing supporting invariants: true 48.44/25.94 Simplify termination arguments: true 48.44/25.94 Simplify supporting invariants: trueOverapproximate stem: false 48.44/25.94 [2019-03-28 12:06:34,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.44/25.94 [2019-03-28 12:06:34,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.44/25.94 [2019-03-28 12:06:34,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.44/25.94 [2019-03-28 12:06:34,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.44/25.94 [2019-03-28 12:06:34,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.44/25.94 [2019-03-28 12:06:34,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.44/25.94 [2019-03-28 12:06:34,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.44/25.94 [2019-03-28 12:06:34,900 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 48.44/25.94 [2019-03-28 12:06:34,903 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 48.44/25.94 [2019-03-28 12:06:34,903 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 48.44/25.94 [2019-03-28 12:06:34,903 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 48.44/25.94 [2019-03-28 12:06:34,904 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 48.44/25.94 [2019-03-28 12:06:34,904 INFO L518 LassoAnalysis]: Proved termination. 48.44/25.94 [2019-03-28 12:06:34,904 INFO L520 LassoAnalysis]: Termination argument consisting of: 48.44/25.94 Ranking function f(mc91_#in~n) = -1*mc91_#in~n + 90 48.44/25.94 Supporting invariants [] 48.44/25.94 [2019-03-28 12:06:34,904 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 48.44/25.94 [2019-03-28 12:06:34,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:34,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core 48.44/25.94 [2019-03-28 12:06:34,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.44/25.94 [2019-03-28 12:06:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:34,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core 48.44/25.94 [2019-03-28 12:06:34,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.44/25.94 [2019-03-28 12:06:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. 48.44/25.94 [2019-03-28 12:06:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:35,314 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.44/25.94 [2019-03-28 12:06:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:35,344 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.44/25.94 [2019-03-28 12:06:35,344 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 12 predicates after loop cannibalization 48.44/25.94 [2019-03-28 12:06:35,344 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 12 loop predicates 48.44/25.94 [2019-03-28 12:06:35,345 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 12 states. 48.44/25.94 [2019-03-28 12:06:37,398 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9. Second operand 12 states. Result 5965 states and 8865 transitions. Complement of second has 4264 states. 48.44/25.94 [2019-03-28 12:06:37,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 28 states 2 stem states 25 non-accepting loop states 1 accepting loop states 48.44/25.94 [2019-03-28 12:06:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 48.44/25.94 [2019-03-28 12:06:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 65 transitions. 48.44/25.94 [2019-03-28 12:06:37,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 65 transitions. Stem has 10 letters. Loop has 19 letters. 48.44/25.94 [2019-03-28 12:06:37,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:37,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 65 transitions. Stem has 29 letters. Loop has 19 letters. 48.44/25.94 [2019-03-28 12:06:37,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:37,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 65 transitions. Stem has 10 letters. Loop has 38 letters. 48.44/25.94 [2019-03-28 12:06:37,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:37,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5965 states and 8865 transitions. 48.44/25.94 [2019-03-28 12:06:37,531 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 48.44/25.94 [2019-03-28 12:06:37,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5965 states to 812 states and 1262 transitions. 48.44/25.94 [2019-03-28 12:06:37,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 48.44/25.94 [2019-03-28 12:06:37,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 48.44/25.94 [2019-03-28 12:06:37,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 812 states and 1262 transitions. 48.44/25.94 [2019-03-28 12:06:37,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 48.44/25.94 [2019-03-28 12:06:37,559 INFO L706 BuchiCegarLoop]: Abstraction has 812 states and 1262 transitions. 48.44/25.94 [2019-03-28 12:06:37,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states and 1262 transitions. 48.44/25.94 [2019-03-28 12:06:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 691. 48.44/25.94 [2019-03-28 12:06:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. 48.44/25.94 [2019-03-28 12:06:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 981 transitions. 48.44/25.94 [2019-03-28 12:06:37,628 INFO L729 BuchiCegarLoop]: Abstraction has 691 states and 981 transitions. 48.44/25.94 [2019-03-28 12:06:37,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 48.44/25.94 [2019-03-28 12:06:37,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 48.44/25.94 [2019-03-28 12:06:37,633 INFO L87 Difference]: Start difference. First operand 691 states and 981 transitions. Second operand 8 states. 48.44/25.94 [2019-03-28 12:06:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.44/25.94 [2019-03-28 12:06:37,879 INFO L93 Difference]: Finished difference Result 700 states and 939 transitions. 48.44/25.94 [2019-03-28 12:06:37,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 48.44/25.94 [2019-03-28 12:06:37,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 700 states and 939 transitions. 48.44/25.94 [2019-03-28 12:06:37,894 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 71 48.44/25.94 [2019-03-28 12:06:37,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 700 states to 550 states and 744 transitions. 48.44/25.94 [2019-03-28 12:06:37,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 48.44/25.94 [2019-03-28 12:06:37,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 48.44/25.94 [2019-03-28 12:06:37,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 550 states and 744 transitions. 48.44/25.94 [2019-03-28 12:06:37,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 48.44/25.94 [2019-03-28 12:06:37,905 INFO L706 BuchiCegarLoop]: Abstraction has 550 states and 744 transitions. 48.44/25.94 [2019-03-28 12:06:37,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states and 744 transitions. 48.44/25.94 [2019-03-28 12:06:37,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 468. 48.44/25.94 [2019-03-28 12:06:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. 48.44/25.94 [2019-03-28 12:06:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 612 transitions. 48.44/25.94 [2019-03-28 12:06:37,925 INFO L729 BuchiCegarLoop]: Abstraction has 468 states and 612 transitions. 48.44/25.94 [2019-03-28 12:06:37,925 INFO L609 BuchiCegarLoop]: Abstraction has 468 states and 612 transitions. 48.44/25.94 [2019-03-28 12:06:37,925 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 48.44/25.94 [2019-03-28 12:06:37,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 468 states and 612 transitions. 48.44/25.94 [2019-03-28 12:06:37,931 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 71 48.44/25.94 [2019-03-28 12:06:37,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.44/25.94 [2019-03-28 12:06:37,932 INFO L119 BuchiIsEmpty]: Starting construction of run 48.44/25.94 [2019-03-28 12:06:37,933 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1, 1, 1, 1] 48.44/25.94 [2019-03-28 12:06:37,934 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 48.44/25.94 [2019-03-28 12:06:37,934 INFO L794 eck$LassoCheckResult]: Stem: 12173#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L16: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 12174#L16 [23] L16-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_1|} AuxVars[] AssignedVars[mc91_#in~n]< 12175#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 12254#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 12249#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 12250#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 12253#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 12330#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12329#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 12189#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 12190#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 12565#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 12222#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 12245#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 12243#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 12218#L11 48.44/25.94 [2019-03-28 12:06:37,934 INFO L796 eck$LassoCheckResult]: Loop: 12218#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 12247#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 12243#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 12218#L11 48.44/25.94 [2019-03-28 12:06:37,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:37,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1794805415, now seen corresponding path program 4 times 48.44/25.94 [2019-03-28 12:06:37,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.94 [2019-03-28 12:06:37,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.94 [2019-03-28 12:06:37,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:37,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 48.44/25.94 [2019-03-28 12:06:37,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.44/25.94 [2019-03-28 12:06:37,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 48.44/25.94 [2019-03-28 12:06:37,989 INFO L799 eck$LassoCheckResult]: stem already infeasible 48.44/25.94 [2019-03-28 12:06:37,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:37,989 INFO L82 PathProgramCache]: Analyzing trace with hash 59402, now seen corresponding path program 3 times 48.44/25.94 [2019-03-28 12:06:37,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.94 [2019-03-28 12:06:37,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.94 [2019-03-28 12:06:37,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:37,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:37,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:38,026 INFO L216 LassoAnalysis]: Preferences: 48.44/25.94 [2019-03-28 12:06:38,027 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.44/25.94 [2019-03-28 12:06:38,027 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.44/25.94 [2019-03-28 12:06:38,027 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.44/25.94 [2019-03-28 12:06:38,027 INFO L127 ssoRankerPreferences]: Use exernal solver: true 48.44/25.94 [2019-03-28 12:06:38,027 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:38,027 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.44/25.94 [2019-03-28 12:06:38,028 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.44/25.94 [2019-03-28 12:06:38,028 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 48.44/25.94 [2019-03-28 12:06:38,028 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.44/25.94 [2019-03-28 12:06:38,028 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.44/25.94 [2019-03-28 12:06:38,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:38,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:38,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:38,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:38,073 INFO L300 LassoAnalysis]: Preprocessing complete. 48.44/25.94 [2019-03-28 12:06:38,073 INFO L412 LassoAnalysis]: Checking for nontermination... 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:38,081 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:38,082 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 [2019-03-28 12:06:38,097 INFO L445 LassoAnalysis]: Proved nontermination for one component. 48.44/25.94 [2019-03-28 12:06:38,097 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret0=0} Honda state: {mc91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:38,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:38,129 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:38,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:38,168 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 [2019-03-28 12:06:50,224 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. 48.44/25.94 [2019-03-28 12:06:50,229 INFO L216 LassoAnalysis]: Preferences: 48.44/25.94 [2019-03-28 12:06:50,229 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.44/25.94 [2019-03-28 12:06:50,229 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.44/25.94 [2019-03-28 12:06:50,229 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.44/25.94 [2019-03-28 12:06:50,230 INFO L127 ssoRankerPreferences]: Use exernal solver: false 48.44/25.94 [2019-03-28 12:06:50,230 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:50,230 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.44/25.94 [2019-03-28 12:06:50,230 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.44/25.94 [2019-03-28 12:06:50,230 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 48.44/25.94 [2019-03-28 12:06:50,230 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.44/25.94 [2019-03-28 12:06:50,230 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.44/25.94 [2019-03-28 12:06:50,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:50,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:50,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:50,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:50,269 INFO L300 LassoAnalysis]: Preprocessing complete. 48.44/25.94 [2019-03-28 12:06:50,269 INFO L497 LassoAnalysis]: Using template 'affine'. 48.44/25.94 [2019-03-28 12:06:50,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.44/25.94 Termination analysis: LINEAR_WITH_GUESSES 48.44/25.94 Number of strict supporting invariants: 0 48.44/25.94 Number of non-strict supporting invariants: 1 48.44/25.94 Consider only non-deceasing supporting invariants: true 48.44/25.94 Simplify termination arguments: true 48.44/25.94 Simplify supporting invariants: trueOverapproximate stem: false 48.44/25.94 [2019-03-28 12:06:50,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.44/25.94 [2019-03-28 12:06:50,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.44/25.94 [2019-03-28 12:06:50,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.44/25.94 [2019-03-28 12:06:50,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.44/25.94 [2019-03-28 12:06:50,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.44/25.94 [2019-03-28 12:06:50,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.44/25.94 [2019-03-28 12:06:50,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.44/25.94 [2019-03-28 12:06:50,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.44/25.94 [2019-03-28 12:06:50,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.44/25.94 Termination analysis: LINEAR_WITH_GUESSES 48.44/25.94 Number of strict supporting invariants: 0 48.44/25.94 Number of non-strict supporting invariants: 1 48.44/25.94 Consider only non-deceasing supporting invariants: true 48.44/25.94 Simplify termination arguments: true 48.44/25.94 Simplify supporting invariants: trueOverapproximate stem: false 48.44/25.94 [2019-03-28 12:06:50,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.44/25.94 [2019-03-28 12:06:50,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.44/25.94 [2019-03-28 12:06:50,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.44/25.94 [2019-03-28 12:06:50,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.44/25.94 [2019-03-28 12:06:50,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.44/25.94 [2019-03-28 12:06:50,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.44/25.94 [2019-03-28 12:06:50,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.44/25.94 [2019-03-28 12:06:50,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.44/25.94 [2019-03-28 12:06:50,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.44/25.94 Termination analysis: LINEAR_WITH_GUESSES 48.44/25.94 Number of strict supporting invariants: 0 48.44/25.94 Number of non-strict supporting invariants: 1 48.44/25.94 Consider only non-deceasing supporting invariants: true 48.44/25.94 Simplify termination arguments: true 48.44/25.94 Simplify supporting invariants: trueOverapproximate stem: false 48.44/25.94 [2019-03-28 12:06:50,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.44/25.94 [2019-03-28 12:06:50,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.44/25.94 [2019-03-28 12:06:50,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.44/25.94 [2019-03-28 12:06:50,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.44/25.94 [2019-03-28 12:06:50,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.44/25.94 [2019-03-28 12:06:50,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.44/25.94 [2019-03-28 12:06:50,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.44/25.94 [2019-03-28 12:06:50,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.44/25.94 [2019-03-28 12:06:50,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.44/25.94 Termination analysis: LINEAR_WITH_GUESSES 48.44/25.94 Number of strict supporting invariants: 0 48.44/25.94 Number of non-strict supporting invariants: 1 48.44/25.94 Consider only non-deceasing supporting invariants: true 48.44/25.94 Simplify termination arguments: true 48.44/25.94 Simplify supporting invariants: trueOverapproximate stem: false 48.44/25.94 [2019-03-28 12:06:50,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.44/25.94 [2019-03-28 12:06:50,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.44/25.94 [2019-03-28 12:06:50,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.44/25.94 [2019-03-28 12:06:50,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.44/25.94 [2019-03-28 12:06:50,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.44/25.94 [2019-03-28 12:06:50,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.44/25.94 [2019-03-28 12:06:50,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.44/25.94 [2019-03-28 12:06:50,284 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 48.44/25.94 [2019-03-28 12:06:50,287 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 48.44/25.94 [2019-03-28 12:06:50,288 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 48.44/25.94 [2019-03-28 12:06:50,288 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 48.44/25.94 [2019-03-28 12:06:50,288 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 48.44/25.94 [2019-03-28 12:06:50,288 INFO L518 LassoAnalysis]: Proved termination. 48.44/25.94 [2019-03-28 12:06:50,289 INFO L520 LassoAnalysis]: Termination argument consisting of: 48.44/25.94 Ranking function f(mc91_~n) = -2*mc91_~n + 189 48.44/25.94 Supporting invariants [] 48.44/25.94 [2019-03-28 12:06:50,289 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 48.44/25.94 [2019-03-28 12:06:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:50,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjunts are in the unsatisfiable core 48.44/25.94 [2019-03-28 12:06:50,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.44/25.94 [2019-03-28 12:06:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:50,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 48.44/25.94 [2019-03-28 12:06:50,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.44/25.94 [2019-03-28 12:06:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.44/25.94 [2019-03-28 12:06:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:50,444 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.44/25.94 [2019-03-28 12:06:50,444 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 48.44/25.94 [2019-03-28 12:06:50,444 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates 48.44/25.94 [2019-03-28 12:06:50,445 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 468 states and 612 transitions. cyclomatic complexity: 154 Second operand 5 states. 48.44/25.94 [2019-03-28 12:06:50,596 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 468 states and 612 transitions. cyclomatic complexity: 154. Second operand 5 states. Result 726 states and 923 transitions. Complement of second has 31 states. 48.44/25.94 [2019-03-28 12:06:50,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states 48.44/25.94 [2019-03-28 12:06:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 48.44/25.94 [2019-03-28 12:06:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. 48.44/25.94 [2019-03-28 12:06:50,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. 48.44/25.94 [2019-03-28 12:06:50,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:50,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 18 letters. Loop has 3 letters. 48.44/25.94 [2019-03-28 12:06:50,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:50,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 6 letters. 48.44/25.94 [2019-03-28 12:06:50,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:50,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 726 states and 923 transitions. 48.44/25.94 [2019-03-28 12:06:50,612 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 77 48.44/25.94 [2019-03-28 12:06:50,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 726 states to 494 states and 663 transitions. 48.44/25.94 [2019-03-28 12:06:50,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 48.44/25.94 [2019-03-28 12:06:50,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 48.44/25.94 [2019-03-28 12:06:50,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 494 states and 663 transitions. 48.44/25.94 [2019-03-28 12:06:50,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 48.44/25.94 [2019-03-28 12:06:50,620 INFO L706 BuchiCegarLoop]: Abstraction has 494 states and 663 transitions. 48.44/25.94 [2019-03-28 12:06:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states and 663 transitions. 48.44/25.94 [2019-03-28 12:06:50,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 479. 48.44/25.94 [2019-03-28 12:06:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. 48.44/25.94 [2019-03-28 12:06:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 640 transitions. 48.44/25.94 [2019-03-28 12:06:50,636 INFO L729 BuchiCegarLoop]: Abstraction has 479 states and 640 transitions. 48.44/25.94 [2019-03-28 12:06:50,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 48.44/25.94 [2019-03-28 12:06:50,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 48.44/25.94 [2019-03-28 12:06:50,637 INFO L87 Difference]: Start difference. First operand 479 states and 640 transitions. Second operand 8 states. 48.44/25.94 [2019-03-28 12:06:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.44/25.94 [2019-03-28 12:06:50,767 INFO L93 Difference]: Finished difference Result 551 states and 758 transitions. 48.44/25.94 [2019-03-28 12:06:50,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 48.44/25.94 [2019-03-28 12:06:50,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 551 states and 758 transitions. 48.44/25.94 [2019-03-28 12:06:50,776 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 48.44/25.94 [2019-03-28 12:06:50,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 551 states to 547 states and 749 transitions. 48.44/25.94 [2019-03-28 12:06:50,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 227 48.44/25.94 [2019-03-28 12:06:50,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 48.44/25.94 [2019-03-28 12:06:50,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 749 transitions. 48.44/25.94 [2019-03-28 12:06:50,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 48.44/25.94 [2019-03-28 12:06:50,784 INFO L706 BuchiCegarLoop]: Abstraction has 547 states and 749 transitions. 48.44/25.94 [2019-03-28 12:06:50,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 749 transitions. 48.44/25.94 [2019-03-28 12:06:50,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 479. 48.44/25.94 [2019-03-28 12:06:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. 48.44/25.94 [2019-03-28 12:06:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 633 transitions. 48.44/25.94 [2019-03-28 12:06:50,800 INFO L729 BuchiCegarLoop]: Abstraction has 479 states and 633 transitions. 48.44/25.94 [2019-03-28 12:06:50,800 INFO L609 BuchiCegarLoop]: Abstraction has 479 states and 633 transitions. 48.44/25.94 [2019-03-28 12:06:50,800 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 48.44/25.94 [2019-03-28 12:06:50,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 479 states and 633 transitions. 48.44/25.94 [2019-03-28 12:06:50,810 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 48.44/25.94 [2019-03-28 12:06:50,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.44/25.94 [2019-03-28 12:06:50,811 INFO L119 BuchiIsEmpty]: Starting construction of run 48.44/25.94 [2019-03-28 12:06:50,812 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 3, 3, 3, 3, 3, 3, 1, 1] 48.44/25.94 [2019-03-28 12:06:50,812 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] 48.44/25.94 [2019-03-28 12:06:50,813 INFO L794 eck$LassoCheckResult]: Stem: 14539#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L16: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 14540#L16 [23] L16-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_1|} AuxVars[] AssignedVars[mc91_#in~n]< 14541#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14589#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 14658#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 14664#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14876#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 14874#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14872#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 14668#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 14671#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14868#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 14870#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 14871#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14875#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 14873#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14869#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 14686#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 14714#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14932#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 14934#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 14554#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14937#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 14936#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14933#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 14928#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 14931#mc91ENTRY 48.44/25.94 [2019-03-28 12:06:50,813 INFO L796 eck$LassoCheckResult]: Loop: 14931#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14953#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 14935#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 14554#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14937#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 14936#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14933#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 14929#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 14931#mc91ENTRY 48.44/25.94 [2019-03-28 12:06:50,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:50,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1239756499, now seen corresponding path program 5 times 48.44/25.94 [2019-03-28 12:06:50,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.94 [2019-03-28 12:06:50,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.94 [2019-03-28 12:06:50,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:50,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:50,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:50,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:50,833 INFO L82 PathProgramCache]: Analyzing trace with hash 725061960, now seen corresponding path program 1 times 48.44/25.94 [2019-03-28 12:06:50,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.94 [2019-03-28 12:06:50,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.94 [2019-03-28 12:06:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:50,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:50,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:50,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1406022118, now seen corresponding path program 6 times 48.44/25.94 [2019-03-28 12:06:50,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.94 [2019-03-28 12:06:50,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.94 [2019-03-28 12:06:50,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:50,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:50,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:50,955 INFO L216 LassoAnalysis]: Preferences: 48.44/25.94 [2019-03-28 12:06:50,955 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.44/25.94 [2019-03-28 12:06:50,955 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.44/25.94 [2019-03-28 12:06:50,955 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.44/25.94 [2019-03-28 12:06:50,955 INFO L127 ssoRankerPreferences]: Use exernal solver: true 48.44/25.94 [2019-03-28 12:06:50,956 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:50,956 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.44/25.94 [2019-03-28 12:06:50,956 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.44/25.94 [2019-03-28 12:06:50,956 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 48.44/25.94 [2019-03-28 12:06:50,956 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.44/25.94 [2019-03-28 12:06:50,956 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.44/25.94 [2019-03-28 12:06:50,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:50,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:50,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:50,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:50,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:51,001 INFO L300 LassoAnalysis]: Preprocessing complete. 48.44/25.94 [2019-03-28 12:06:51,001 INFO L412 LassoAnalysis]: Checking for nontermination... 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:51,014 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:51,014 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 [2019-03-28 12:06:51,019 INFO L445 LassoAnalysis]: Proved nontermination for one component. 48.44/25.94 [2019-03-28 12:06:51,020 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:51,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:51,094 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 [2019-03-28 12:06:51,097 INFO L445 LassoAnalysis]: Proved nontermination for one component. 48.44/25.94 [2019-03-28 12:06:51,097 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:51,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:51,127 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.44/25.94 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 48.44/25.94 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:51,162 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 48.44/25.94 [2019-03-28 12:06:51,162 INFO L163 nArgumentSynthesizer]: Using integer mode. 48.44/25.94 [2019-03-28 12:06:51,167 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 48.44/25.94 [2019-03-28 12:06:51,192 INFO L216 LassoAnalysis]: Preferences: 48.44/25.94 [2019-03-28 12:06:51,192 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.44/25.94 [2019-03-28 12:06:51,193 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.44/25.94 [2019-03-28 12:06:51,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.44/25.94 [2019-03-28 12:06:51,193 INFO L127 ssoRankerPreferences]: Use exernal solver: false 48.44/25.94 [2019-03-28 12:06:51,193 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 48.44/25.94 [2019-03-28 12:06:51,193 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.44/25.94 [2019-03-28 12:06:51,193 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.44/25.94 [2019-03-28 12:06:51,193 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 48.44/25.94 [2019-03-28 12:06:51,193 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.44/25.94 [2019-03-28 12:06:51,193 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.44/25.94 [2019-03-28 12:06:51,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:51,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:51,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:51,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:51,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.44/25.94 [2019-03-28 12:06:51,239 INFO L300 LassoAnalysis]: Preprocessing complete. 48.44/25.94 [2019-03-28 12:06:51,239 INFO L497 LassoAnalysis]: Using template 'affine'. 48.44/25.94 [2019-03-28 12:06:51,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.44/25.94 Termination analysis: LINEAR_WITH_GUESSES 48.44/25.94 Number of strict supporting invariants: 0 48.44/25.94 Number of non-strict supporting invariants: 1 48.44/25.94 Consider only non-deceasing supporting invariants: true 48.44/25.94 Simplify termination arguments: true 48.44/25.94 Simplify supporting invariants: trueOverapproximate stem: false 48.44/25.94 [2019-03-28 12:06:51,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.44/25.94 [2019-03-28 12:06:51,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.44/25.94 [2019-03-28 12:06:51,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.44/25.94 [2019-03-28 12:06:51,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.44/25.94 [2019-03-28 12:06:51,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.44/25.94 [2019-03-28 12:06:51,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.44/25.94 [2019-03-28 12:06:51,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.44/25.94 [2019-03-28 12:06:51,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.44/25.94 [2019-03-28 12:06:51,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.44/25.94 Termination analysis: LINEAR_WITH_GUESSES 48.44/25.94 Number of strict supporting invariants: 0 48.44/25.94 Number of non-strict supporting invariants: 1 48.44/25.94 Consider only non-deceasing supporting invariants: true 48.44/25.94 Simplify termination arguments: true 48.44/25.94 Simplify supporting invariants: trueOverapproximate stem: false 48.44/25.94 [2019-03-28 12:06:51,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.44/25.94 [2019-03-28 12:06:51,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.44/25.94 [2019-03-28 12:06:51,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.44/25.94 [2019-03-28 12:06:51,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.44/25.94 [2019-03-28 12:06:51,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.44/25.94 [2019-03-28 12:06:51,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.44/25.94 [2019-03-28 12:06:51,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.44/25.94 [2019-03-28 12:06:51,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.44/25.94 [2019-03-28 12:06:51,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.44/25.94 Termination analysis: LINEAR_WITH_GUESSES 48.44/25.94 Number of strict supporting invariants: 0 48.44/25.94 Number of non-strict supporting invariants: 1 48.44/25.94 Consider only non-deceasing supporting invariants: true 48.44/25.94 Simplify termination arguments: true 48.44/25.94 Simplify supporting invariants: trueOverapproximate stem: false 48.44/25.94 [2019-03-28 12:06:51,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.44/25.94 [2019-03-28 12:06:51,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.44/25.94 [2019-03-28 12:06:51,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.44/25.94 [2019-03-28 12:06:51,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.44/25.94 [2019-03-28 12:06:51,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.44/25.94 [2019-03-28 12:06:51,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.44/25.94 [2019-03-28 12:06:51,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.44/25.94 [2019-03-28 12:06:51,250 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 48.44/25.94 [2019-03-28 12:06:51,252 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 48.44/25.94 [2019-03-28 12:06:51,252 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 48.44/25.94 [2019-03-28 12:06:51,252 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 48.44/25.94 [2019-03-28 12:06:51,252 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 48.44/25.94 [2019-03-28 12:06:51,253 INFO L518 LassoAnalysis]: Proved termination. 48.44/25.94 [2019-03-28 12:06:51,253 INFO L520 LassoAnalysis]: Termination argument consisting of: 48.44/25.94 Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 201 48.44/25.94 Supporting invariants [] 48.44/25.94 [2019-03-28 12:06:51,253 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 48.44/25.94 [2019-03-28 12:06:51,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:51,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core 48.44/25.94 [2019-03-28 12:06:51,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.44/25.94 [2019-03-28 12:06:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:51,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core 48.44/25.94 [2019-03-28 12:06:51,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.44/25.94 [2019-03-28 12:06:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.44/25.94 [2019-03-28 12:06:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:51,586 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.44/25.94 [2019-03-28 12:06:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.44/25.94 [2019-03-28 12:06:51,601 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.44/25.94 [2019-03-28 12:06:51,602 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 48.44/25.94 [2019-03-28 12:06:51,602 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 7 loop predicates 48.44/25.94 [2019-03-28 12:06:51,602 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 479 states and 633 transitions. cyclomatic complexity: 166 Second operand 9 states. 48.44/25.94 [2019-03-28 12:06:52,283 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 479 states and 633 transitions. cyclomatic complexity: 166. Second operand 9 states. Result 7295 states and 10236 transitions. Complement of second has 174 states. 48.44/25.94 [2019-03-28 12:06:52,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states 48.44/25.94 [2019-03-28 12:06:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 48.44/25.94 [2019-03-28 12:06:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. 48.44/25.94 [2019-03-28 12:06:52,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 36 transitions. Stem has 26 letters. Loop has 8 letters. 48.44/25.94 [2019-03-28 12:06:52,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:52,286 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted 48.44/25.94 [2019-03-28 12:06:52,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:52,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core 48.44/25.94 [2019-03-28 12:06:52,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.44/25.94 [2019-03-28 12:06:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:52,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core 48.44/25.94 [2019-03-28 12:06:52,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.44/25.94 [2019-03-28 12:06:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.44/25.94 [2019-03-28 12:06:52,503 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates 48.44/25.94 [2019-03-28 12:06:52,503 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 479 states and 633 transitions. cyclomatic complexity: 166 Second operand 9 states. 48.44/25.94 [2019-03-28 12:06:53,016 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 479 states and 633 transitions. cyclomatic complexity: 166. Second operand 9 states. Result 1403 states and 1718 transitions. Complement of second has 95 states. 48.44/25.94 [2019-03-28 12:06:53,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states 48.44/25.94 [2019-03-28 12:06:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 48.44/25.94 [2019-03-28 12:06:53,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. 48.44/25.94 [2019-03-28 12:06:53,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 26 letters. Loop has 8 letters. 48.44/25.94 [2019-03-28 12:06:53,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:53,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 34 letters. Loop has 8 letters. 48.44/25.94 [2019-03-28 12:06:53,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:53,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 26 letters. Loop has 16 letters. 48.44/25.94 [2019-03-28 12:06:53,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.44/25.94 [2019-03-28 12:06:53,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1403 states and 1718 transitions. 48.44/25.94 [2019-03-28 12:06:53,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 48.44/25.94 [2019-03-28 12:06:53,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1403 states to 508 states and 694 transitions. 48.44/25.94 [2019-03-28 12:06:53,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 48.44/25.94 [2019-03-28 12:06:53,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 48.44/25.94 [2019-03-28 12:06:53,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 508 states and 694 transitions. 48.44/25.94 [2019-03-28 12:06:53,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 48.44/25.94 [2019-03-28 12:06:53,043 INFO L706 BuchiCegarLoop]: Abstraction has 508 states and 694 transitions. 48.44/25.94 [2019-03-28 12:06:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states and 694 transitions. 48.44/25.94 [2019-03-28 12:06:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 452. 48.44/25.94 [2019-03-28 12:06:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. 48.44/25.94 [2019-03-28 12:06:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 590 transitions. 48.44/25.94 [2019-03-28 12:06:53,059 INFO L729 BuchiCegarLoop]: Abstraction has 452 states and 590 transitions. 48.44/25.94 [2019-03-28 12:06:53,059 INFO L609 BuchiCegarLoop]: Abstraction has 452 states and 590 transitions. 48.44/25.94 [2019-03-28 12:06:53,059 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 48.44/25.94 [2019-03-28 12:06:53,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 452 states and 590 transitions. 48.44/25.94 [2019-03-28 12:06:53,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 48.44/25.94 [2019-03-28 12:06:53,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.44/25.94 [2019-03-28 12:06:53,063 INFO L119 BuchiIsEmpty]: Starting construction of run 48.44/25.94 [2019-03-28 12:06:53,065 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [12, 8, 7, 6, 5, 5, 5, 3, 3, 1, 1] 48.44/25.94 [2019-03-28 12:06:53,065 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 5, 4, 4, 3, 3, 3, 2, 2] 48.44/25.94 [2019-03-28 12:06:53,066 INFO L794 eck$LassoCheckResult]: Stem: 24247#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L16: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 24248#L16 [23] L16-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_1|} AuxVars[] AssignedVars[mc91_#in~n]< 24249#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24286#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24282#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24283#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24285#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24281#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24284#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24351#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24350#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24349#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24303#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24302#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24304#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24441#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24437#mc91EXIT >[36] mc91EXIT-->L11-2: AOR: Formula: (= |v_mc91_#t~ret1_4| |v_mc91_#resOutParam_3|) InVars {mc91_#res=|v_mc91_#resOutParam_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_4|} AuxVars[] AssignedVars[mc91_#t~ret1] LVA: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n] 24436#L11-2 [25] L11-2-->mc91FINAL: Formula: (= |v_mc91_#res_2| |v_mc91_#t~ret1_3|) InVars {mc91_#t~ret1=|v_mc91_#t~ret1_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_2|, mc91_#t~ret0=|v_mc91_#t~ret0_3|, mc91_#res=|v_mc91_#res_2|} AuxVars[] AssignedVars[mc91_#t~ret1, mc91_#t~ret0, mc91_#res] 24435#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24430#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24431#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24439#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24461#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24463#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24464#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24477#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24474#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24475#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24486#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24473#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24476#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24488#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24487#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24472#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24385#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24393#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24388#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24387#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24467#mc91EXIT >[36] mc91EXIT-->L11-2: AOR: Formula: (= |v_mc91_#t~ret1_4| |v_mc91_#resOutParam_3|) InVars {mc91_#res=|v_mc91_#resOutParam_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_4|} AuxVars[] AssignedVars[mc91_#t~ret1] LVA: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n] 24468#L11-2 [25] L11-2-->mc91FINAL: Formula: (= |v_mc91_#res_2| |v_mc91_#t~ret1_3|) InVars {mc91_#t~ret1=|v_mc91_#t~ret1_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_2|, mc91_#t~ret0=|v_mc91_#t~ret0_3|, mc91_#res=|v_mc91_#res_2|} AuxVars[] AssignedVars[mc91_#t~ret1, mc91_#t~ret0, mc91_#res] 24484#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24482#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24480#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24481#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24544#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24489#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24478#mc91EXIT >[36] mc91EXIT-->L11-2: AOR: Formula: (= |v_mc91_#t~ret1_4| |v_mc91_#resOutParam_3|) InVars {mc91_#res=|v_mc91_#resOutParam_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_4|} AuxVars[] AssignedVars[mc91_#t~ret1] LVA: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n] 24448#L11-2 [25] L11-2-->mc91FINAL: Formula: (= |v_mc91_#res_2| |v_mc91_#t~ret1_3|) InVars {mc91_#t~ret1=|v_mc91_#t~ret1_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_2|, mc91_#t~ret0=|v_mc91_#t~ret0_3|, mc91_#res=|v_mc91_#res_2|} AuxVars[] AssignedVars[mc91_#t~ret1, mc91_#t~ret0, mc91_#res] 24471#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24470#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24341#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24457#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24515#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24518#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24519#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24534#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24531#L11 48.44/25.94 [2019-03-28 12:06:53,067 INFO L796 eck$LassoCheckResult]: Loop: 24531#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24532#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24539#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24530#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24532#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24539#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24530#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24533#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24541#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24537#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24529#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24526#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24528#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24622#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24619#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24524#mc91EXIT >[36] mc91EXIT-->L11-2: AOR: Formula: (= |v_mc91_#t~ret1_4| |v_mc91_#resOutParam_3|) InVars {mc91_#res=|v_mc91_#resOutParam_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_4|} AuxVars[] AssignedVars[mc91_#t~ret1] LVA: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n] 24527#L11-2 [25] L11-2-->mc91FINAL: Formula: (= |v_mc91_#res_2| |v_mc91_#t~ret1_3|) InVars {mc91_#t~ret1=|v_mc91_#t~ret1_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_2|, mc91_#t~ret0=|v_mc91_#t~ret0_3|, mc91_#res=|v_mc91_#res_2|} AuxVars[] AssignedVars[mc91_#t~ret1, mc91_#t~ret0, mc91_#res] 24543#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24542#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24252#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24536#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24645#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24633#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24535#mc91EXIT >[36] mc91EXIT-->L11-2: AOR: Formula: (= |v_mc91_#t~ret1_4| |v_mc91_#resOutParam_3|) InVars {mc91_#res=|v_mc91_#resOutParam_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_4|} AuxVars[] AssignedVars[mc91_#t~ret1] LVA: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n] 24506#L11-2 [25] L11-2-->mc91FINAL: Formula: (= |v_mc91_#res_2| |v_mc91_#t~ret1_3|) InVars {mc91_#t~ret1=|v_mc91_#t~ret1_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_2|, mc91_#t~ret0=|v_mc91_#t~ret0_3|, mc91_#res=|v_mc91_#res_2|} AuxVars[] AssignedVars[mc91_#t~ret1, mc91_#t~ret0, mc91_#res] 24540#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24538#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24293#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24258#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24348#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24517#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24519#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24534#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24531#L11 48.44/25.94 [2019-03-28 12:06:53,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:53,068 INFO L82 PathProgramCache]: Analyzing trace with hash 521030405, now seen corresponding path program 2 times 48.44/25.94 [2019-03-28 12:06:53,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.94 [2019-03-28 12:06:53,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.94 [2019-03-28 12:06:53,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:53,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:53,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. 48.44/25.94 [2019-03-28 12:06:53,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.44/25.94 [2019-03-28 12:06:53,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 48.44/25.94 [2019-03-28 12:06:53,165 INFO L799 eck$LassoCheckResult]: stem already infeasible 48.44/25.94 [2019-03-28 12:06:53,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.44/25.94 [2019-03-28 12:06:53,165 INFO L82 PathProgramCache]: Analyzing trace with hash -672784141, now seen corresponding path program 2 times 48.44/25.94 [2019-03-28 12:06:53,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.44/25.94 [2019-03-28 12:06:53,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.44/25.94 [2019-03-28 12:06:53,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:53,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:53,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.44/25.94 [2019-03-28 12:06:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.44/25.94 [2019-03-28 12:06:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. 48.44/25.94 [2019-03-28 12:06:53,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.44/25.94 [2019-03-28 12:06:53,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 48.44/25.94 [2019-03-28 12:06:53,243 INFO L811 eck$LassoCheckResult]: loop already infeasible 48.44/25.94 [2019-03-28 12:06:53,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 48.44/25.94 [2019-03-28 12:06:53,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 48.44/25.94 [2019-03-28 12:06:53,243 INFO L87 Difference]: Start difference. First operand 452 states and 590 transitions. cyclomatic complexity: 148 Second operand 9 states. 48.44/25.94 [2019-03-28 12:06:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.44/25.94 [2019-03-28 12:06:53,394 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. 48.44/25.94 [2019-03-28 12:06:53,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 48.44/25.94 [2019-03-28 12:06:53,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 75 transitions. 48.44/25.94 [2019-03-28 12:06:53,396 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 48.44/25.94 [2019-03-28 12:06:53,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. 48.44/25.94 [2019-03-28 12:06:53,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 48.44/25.94 [2019-03-28 12:06:53,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 48.44/25.94 [2019-03-28 12:06:53,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 48.44/25.94 [2019-03-28 12:06:53,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 48.44/25.94 [2019-03-28 12:06:53,397 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 48.44/25.94 [2019-03-28 12:06:53,397 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 48.44/25.94 [2019-03-28 12:06:53,397 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 48.44/25.94 [2019-03-28 12:06:53,398 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 48.44/25.94 [2019-03-28 12:06:53,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 48.44/25.94 [2019-03-28 12:06:53,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 48.44/25.94 [2019-03-28 12:06:53,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 48.44/25.94 [2019-03-28 12:06:53,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:06:53 BasicIcfg 48.44/25.94 [2019-03-28 12:06:53,405 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 48.44/25.94 [2019-03-28 12:06:53,405 INFO L168 Benchmark]: Toolchain (without parser) took 21517.21 ms. Allocated memory was 649.6 MB in the beginning and 1.0 GB in the end (delta: 369.6 MB). Free memory was 563.9 MB in the beginning and 842.7 MB in the end (delta: -278.9 MB). Peak memory consumption was 90.8 MB. Max. memory is 50.3 GB. 48.44/25.94 [2019-03-28 12:06:53,407 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. 48.44/25.94 [2019-03-28 12:06:53,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.79 ms. Allocated memory was 649.6 MB in the beginning and 674.2 MB in the end (delta: 24.6 MB). Free memory was 563.9 MB in the beginning and 641.7 MB in the end (delta: -77.9 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 48.44/25.94 [2019-03-28 12:06:53,408 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.68 ms. Allocated memory is still 674.2 MB. Free memory was 641.7 MB in the beginning and 640.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 48.44/25.94 [2019-03-28 12:06:53,408 INFO L168 Benchmark]: Boogie Preprocessor took 16.10 ms. Allocated memory is still 674.2 MB. Free memory was 640.4 MB in the beginning and 639.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 48.44/25.94 [2019-03-28 12:06:53,409 INFO L168 Benchmark]: RCFGBuilder took 197.43 ms. Allocated memory is still 674.2 MB. Free memory was 639.0 MB in the beginning and 624.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 50.3 GB. 48.44/25.94 [2019-03-28 12:06:53,409 INFO L168 Benchmark]: BlockEncodingV2 took 73.22 ms. Allocated memory is still 674.2 MB. Free memory was 624.4 MB in the beginning and 619.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. 48.44/25.94 [2019-03-28 12:06:53,410 INFO L168 Benchmark]: TraceAbstraction took 175.87 ms. Allocated memory is still 674.2 MB. Free memory was 617.9 MB in the beginning and 608.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 48.44/25.94 [2019-03-28 12:06:53,410 INFO L168 Benchmark]: BuchiAutomizer took 20746.02 ms. Allocated memory was 674.2 MB in the beginning and 1.0 GB in the end (delta: 345.0 MB). Free memory was 608.4 MB in the beginning and 842.7 MB in the end (delta: -234.3 MB). Peak memory consumption was 110.7 MB. Max. memory is 50.3 GB. 48.44/25.94 [2019-03-28 12:06:53,414 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 48.44/25.94 --- Results --- 48.44/25.94 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 48.44/25.94 - StatisticsResult: Initial Icfg 48.44/25.94 13 locations, 15 edges 48.44/25.94 - StatisticsResult: Encoded RCFG 48.44/25.94 9 locations, 11 edges 48.44/25.94 * Results from de.uni_freiburg.informatik.ultimate.core: 48.44/25.94 - StatisticsResult: Toolchain Benchmarks 48.44/25.94 Benchmark results are: 48.44/25.94 * 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. 48.44/25.94 * CACSL2BoogieTranslator took 268.79 ms. Allocated memory was 649.6 MB in the beginning and 674.2 MB in the end (delta: 24.6 MB). Free memory was 563.9 MB in the beginning and 641.7 MB in the end (delta: -77.9 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 48.44/25.94 * Boogie Procedure Inliner took 34.68 ms. Allocated memory is still 674.2 MB. Free memory was 641.7 MB in the beginning and 640.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 48.44/25.94 * Boogie Preprocessor took 16.10 ms. Allocated memory is still 674.2 MB. Free memory was 640.4 MB in the beginning and 639.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 48.44/25.94 * RCFGBuilder took 197.43 ms. Allocated memory is still 674.2 MB. Free memory was 639.0 MB in the beginning and 624.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 50.3 GB. 48.44/25.94 * BlockEncodingV2 took 73.22 ms. Allocated memory is still 674.2 MB. Free memory was 624.4 MB in the beginning and 619.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. 48.44/25.94 * TraceAbstraction took 175.87 ms. Allocated memory is still 674.2 MB. Free memory was 617.9 MB in the beginning and 608.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 48.44/25.94 * BuchiAutomizer took 20746.02 ms. Allocated memory was 674.2 MB in the beginning and 1.0 GB in the end (delta: 345.0 MB). Free memory was 608.4 MB in the beginning and 842.7 MB in the end (delta: -234.3 MB). Peak memory consumption was 110.7 MB. Max. memory is 50.3 GB. 48.44/25.94 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 48.44/25.94 - AllSpecificationsHoldResult: All specifications hold 48.44/25.94 We were not able to verify any specifiation because the program does not contain any specification. 48.44/25.94 - StatisticsResult: Ultimate Automizer benchmark data 48.44/25.94 CFG has 2 procedures, 9 locations, 0 error locations. SAFE Result, 0.1s 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=9occurred 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, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 48.44/25.94 - StatisticsResult: Constructed decomposition of program 48.44/25.94 Your program was decomposed into 8 terminating modules (3 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function -2 * \old(n) + 211 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * \old(n) + 211 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * \old(n) + 90 and consists of 28 locations. One nondeterministic module has affine ranking function -2 * n + 189 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * \old(n) + 201 and consists of 11 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. 48.44/25.94 - StatisticsResult: Timing statistics 48.44/25.94 BüchiAutomizer plugin needed 20.7s and 7 iterations. TraceHistogramMax:12. Analysis of lassos took 14.4s. Construction of modules took 0.8s. Büchi inclusion checks took 4.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 348 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 479 states and ocurred in iteration 4. Nontrivial modules had stage [4, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/22 HoareTripleCheckerStatistics: 123 SDtfs, 220 SDslu, 208 SDs, 0 SdLazy, 769 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT1 SILN0 SILU0 SILI1 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf93 smp100 dnf100 smp100 tf111 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.4s 48.44/25.94 - TerminationAnalysisResult: Termination proven 48.44/25.94 Buchi Automizer proved that your program is terminating 48.44/25.94 RESULT: Ultimate proved your program to be correct! 48.44/25.94 !SESSION 2019-03-28 12:06:28.614 ----------------------------------------------- 48.44/25.94 eclipse.buildId=unknown 48.44/25.94 java.version=1.8.0_181 48.44/25.94 java.vendor=Oracle Corporation 48.44/25.94 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 48.44/25.94 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 48.44/25.94 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 48.44/25.94 48.44/25.94 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:06:53.646 48.44/25.94 !MESSAGE The workspace will exit with unsaved changes in this session. 48.44/25.94 Received shutdown request... 48.44/25.94 Ultimate: 48.44/25.94 GTK+ Version Check 48.44/25.94 EOF