21.99/11.06 NO 21.99/11.06 21.99/11.06 Ultimate: Cannot open display: 21.99/11.06 This is Ultimate 0.1.24-8dc7c08-m 21.99/11.06 [2019-03-28 12:06:00,822 INFO L170 SettingsManager]: Resetting all preferences to default values... 21.99/11.06 [2019-03-28 12:06:00,824 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 21.99/11.06 [2019-03-28 12:06:00,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 21.99/11.06 [2019-03-28 12:06:00,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 21.99/11.06 [2019-03-28 12:06:00,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 21.99/11.06 [2019-03-28 12:06:00,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 21.99/11.06 [2019-03-28 12:06:00,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 21.99/11.06 [2019-03-28 12:06:00,841 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 21.99/11.06 [2019-03-28 12:06:00,842 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 21.99/11.06 [2019-03-28 12:06:00,843 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 21.99/11.06 [2019-03-28 12:06:00,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 21.99/11.06 [2019-03-28 12:06:00,844 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 21.99/11.06 [2019-03-28 12:06:00,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 21.99/11.06 [2019-03-28 12:06:00,846 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 21.99/11.06 [2019-03-28 12:06:00,846 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 21.99/11.06 [2019-03-28 12:06:00,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 21.99/11.06 [2019-03-28 12:06:00,849 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 21.99/11.06 [2019-03-28 12:06:00,851 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 21.99/11.06 [2019-03-28 12:06:00,852 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 21.99/11.06 [2019-03-28 12:06:00,853 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 21.99/11.06 [2019-03-28 12:06:00,854 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 21.99/11.06 [2019-03-28 12:06:00,856 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 21.99/11.06 [2019-03-28 12:06:00,857 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 21.99/11.06 [2019-03-28 12:06:00,857 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 21.99/11.06 [2019-03-28 12:06:00,858 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 21.99/11.06 [2019-03-28 12:06:00,858 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 21.99/11.06 [2019-03-28 12:06:00,859 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 21.99/11.06 [2019-03-28 12:06:00,859 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 21.99/11.06 [2019-03-28 12:06:00,860 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 21.99/11.06 [2019-03-28 12:06:00,861 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 21.99/11.06 [2019-03-28 12:06:00,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 21.99/11.06 [2019-03-28 12:06:00,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 21.99/11.06 [2019-03-28 12:06:00,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 21.99/11.06 [2019-03-28 12:06:00,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 21.99/11.06 [2019-03-28 12:06:00,863 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 21.99/11.06 [2019-03-28 12:06:00,863 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 21.99/11.06 [2019-03-28 12:06:00,864 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 21.99/11.06 [2019-03-28 12:06:00,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 21.99/11.06 [2019-03-28 12:06:00,865 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 21.99/11.06 [2019-03-28 12:06:00,880 INFO L110 SettingsManager]: Loading preferences was successful 21.99/11.06 [2019-03-28 12:06:00,880 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 21.99/11.06 [2019-03-28 12:06:00,881 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 21.99/11.06 [2019-03-28 12:06:00,881 INFO L133 SettingsManager]: * Rewrite not-equals=true 21.99/11.06 [2019-03-28 12:06:00,882 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 21.99/11.06 [2019-03-28 12:06:00,882 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 21.99/11.06 [2019-03-28 12:06:00,882 INFO L133 SettingsManager]: * Use SBE=true 21.99/11.06 [2019-03-28 12:06:00,882 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 21.99/11.06 [2019-03-28 12:06:00,882 INFO L133 SettingsManager]: * Use old map elimination=false 21.99/11.06 [2019-03-28 12:06:00,882 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 21.99/11.06 [2019-03-28 12:06:00,883 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 21.99/11.06 [2019-03-28 12:06:00,883 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 21.99/11.06 [2019-03-28 12:06:00,883 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 21.99/11.06 [2019-03-28 12:06:00,883 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 21.99/11.06 [2019-03-28 12:06:00,883 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.06 [2019-03-28 12:06:00,884 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 21.99/11.06 [2019-03-28 12:06:00,884 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 21.99/11.06 [2019-03-28 12:06:00,884 INFO L133 SettingsManager]: * Check division by zero=IGNORE 21.99/11.06 [2019-03-28 12:06:00,884 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 21.99/11.06 [2019-03-28 12:06:00,884 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 21.99/11.06 [2019-03-28 12:06:00,884 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 21.99/11.06 [2019-03-28 12:06:00,885 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 21.99/11.06 [2019-03-28 12:06:00,885 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 21.99/11.06 [2019-03-28 12:06:00,885 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 21.99/11.06 [2019-03-28 12:06:00,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 21.99/11.06 [2019-03-28 12:06:00,885 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 21.99/11.06 [2019-03-28 12:06:00,885 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 21.99/11.06 [2019-03-28 12:06:00,886 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 21.99/11.06 [2019-03-28 12:06:00,886 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 21.99/11.06 [2019-03-28 12:06:00,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 21.99/11.06 [2019-03-28 12:06:00,925 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 21.99/11.06 [2019-03-28 12:06:00,928 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 21.99/11.06 [2019-03-28 12:06:00,930 INFO L271 PluginConnector]: Initializing CDTParser... 21.99/11.06 [2019-03-28 12:06:00,930 INFO L276 PluginConnector]: CDTParser initialized 21.99/11.06 [2019-03-28 12:06:00,931 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 21.99/11.06 [2019-03-28 12:06:01,347 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/05cba11a54d84d5592ba676d26722627/FLAGad2c1f2b8 21.99/11.06 !SESSION 2019-03-28 12:05:58.456 ----------------------------------------------- 21.99/11.06 eclipse.buildId=unknown 21.99/11.06 java.version=1.8.0_181 21.99/11.06 java.vendor=Oracle Corporation 21.99/11.06 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 21.99/11.06 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 21.99/11.06 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 21.99/11.06 21.99/11.06 !ENTRY org.eclipse.cdt.core 1 0 2019-03-28 12:06:01.476 21.99/11.06 !MESSAGE Indexed 'FLAGad2c1f2b8' (0 sources, 0 headers) in 0.003 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) 21.99/11.06 [2019-03-28 12:06:01,691 INFO L307 CDTParser]: Found 1 translation units. 21.99/11.06 [2019-03-28 12:06:01,691 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 21.99/11.06 [2019-03-28 12:06:01,698 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/05cba11a54d84d5592ba676d26722627/FLAGad2c1f2b8 21.99/11.06 [2019-03-28 12:06:01,726 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/05cba11a54d84d5592ba676d26722627 21.99/11.06 [2019-03-28 12:06:01,739 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 21.99/11.06 [2019-03-28 12:06:01,741 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 21.99/11.06 [2019-03-28 12:06:01,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 21.99/11.06 [2019-03-28 12:06:01,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 21.99/11.06 [2019-03-28 12:06:01,746 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 21.99/11.06 [2019-03-28 12:06:01,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:06:01" (1/1) ... 21.99/11.06 [2019-03-28 12:06:01,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d38462f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:01, skipping insertion in model container 21.99/11.06 [2019-03-28 12:06:01,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:06:01" (1/1) ... 21.99/11.06 [2019-03-28 12:06:01,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 21.99/11.06 [2019-03-28 12:06:01,774 INFO L176 MainTranslator]: Built tables and reachable declarations 21.99/11.06 [2019-03-28 12:06:01,927 INFO L206 PostProcessor]: Analyzing one entry point: main 21.99/11.06 [2019-03-28 12:06:01,931 INFO L191 MainTranslator]: Completed pre-run 21.99/11.06 [2019-03-28 12:06:01,947 INFO L206 PostProcessor]: Analyzing one entry point: main 21.99/11.06 [2019-03-28 12:06:02,025 INFO L195 MainTranslator]: Completed translation 21.99/11.06 [2019-03-28 12:06:02,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:02 WrapperNode 21.99/11.06 [2019-03-28 12:06:02,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 21.99/11.06 [2019-03-28 12:06:02,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 21.99/11.06 [2019-03-28 12:06:02,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 21.99/11.06 [2019-03-28 12:06:02,027 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 21.99/11.06 [2019-03-28 12:06:02,037 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:02" (1/1) ... 21.99/11.06 [2019-03-28 12:06:02,043 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:02" (1/1) ... 21.99/11.06 [2019-03-28 12:06:02,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 21.99/11.06 [2019-03-28 12:06:02,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 21.99/11.06 [2019-03-28 12:06:02,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 21.99/11.06 [2019-03-28 12:06:02,065 INFO L276 PluginConnector]: Boogie Preprocessor initialized 21.99/11.06 [2019-03-28 12:06:02,074 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:02" (1/1) ... 21.99/11.06 [2019-03-28 12:06:02,075 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:02" (1/1) ... 21.99/11.06 [2019-03-28 12:06:02,075 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:02" (1/1) ... 21.99/11.06 [2019-03-28 12:06:02,076 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:02" (1/1) ... 21.99/11.06 [2019-03-28 12:06:02,078 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:02" (1/1) ... 21.99/11.06 [2019-03-28 12:06:02,080 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:02" (1/1) ... 21.99/11.06 [2019-03-28 12:06:02,081 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:02" (1/1) ... 21.99/11.06 [2019-03-28 12:06:02,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 21.99/11.06 [2019-03-28 12:06:02,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 21.99/11.06 [2019-03-28 12:06:02,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... 21.99/11.06 [2019-03-28 12:06:02,083 INFO L276 PluginConnector]: RCFGBuilder initialized 21.99/11.06 [2019-03-28 12:06:02,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:02" (1/1) ... 21.99/11.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.06 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 21.99/11.06 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 21.99/11.06 [2019-03-28 12:06:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure g 21.99/11.06 [2019-03-28 12:06:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure g 21.99/11.06 [2019-03-28 12:06:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 21.99/11.06 [2019-03-28 12:06:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 21.99/11.06 [2019-03-28 12:06:02,299 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 21.99/11.06 [2019-03-28 12:06:02,300 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 21.99/11.06 [2019-03-28 12:06:02,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:02 BoogieIcfgContainer 21.99/11.06 [2019-03-28 12:06:02,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 21.99/11.06 [2019-03-28 12:06:02,302 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 21.99/11.06 [2019-03-28 12:06:02,302 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 21.99/11.06 [2019-03-28 12:06:02,304 INFO L276 PluginConnector]: BlockEncodingV2 initialized 21.99/11.06 [2019-03-28 12:06:02,305 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:02" (1/1) ... 21.99/11.06 [2019-03-28 12:06:02,322 INFO L313 BlockEncoder]: Initial Icfg 14 locations, 17 edges 21.99/11.06 [2019-03-28 12:06:02,324 INFO L258 BlockEncoder]: Using Remove infeasible edges 21.99/11.06 [2019-03-28 12:06:02,325 INFO L263 BlockEncoder]: Using Maximize final states 21.99/11.06 [2019-03-28 12:06:02,326 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 21.99/11.06 [2019-03-28 12:06:02,326 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 21.99/11.06 [2019-03-28 12:06:02,328 INFO L296 BlockEncoder]: Using Remove sink states 21.99/11.06 [2019-03-28 12:06:02,329 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 21.99/11.06 [2019-03-28 12:06:02,329 INFO L179 BlockEncoder]: Using Rewrite not-equals 21.99/11.06 [2019-03-28 12:06:02,345 INFO L185 BlockEncoder]: Using Use SBE 21.99/11.06 [2019-03-28 12:06:02,360 INFO L200 BlockEncoder]: SBE split 1 edges 21.99/11.06 [2019-03-28 12:06:02,366 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 21.99/11.06 [2019-03-28 12:06:02,368 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.99/11.06 [2019-03-28 12:06:02,377 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 21.99/11.06 [2019-03-28 12:06:02,380 INFO L70 RemoveSinkStates]: Removed 4 edges and 3 locations by removing sink states 21.99/11.06 [2019-03-28 12:06:02,382 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 21.99/11.06 [2019-03-28 12:06:02,382 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.99/11.06 [2019-03-28 12:06:02,387 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 21.99/11.06 [2019-03-28 12:06:02,388 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 21.99/11.06 [2019-03-28 12:06:02,388 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 21.99/11.06 [2019-03-28 12:06:02,389 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.99/11.06 [2019-03-28 12:06:02,389 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 21.99/11.06 [2019-03-28 12:06:02,389 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 21.99/11.06 [2019-03-28 12:06:02,390 INFO L313 BlockEncoder]: Encoded RCFG 9 locations, 12 edges 21.99/11.06 [2019-03-28 12:06:02,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:06:02 BasicIcfg 21.99/11.06 [2019-03-28 12:06:02,390 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 21.99/11.06 [2019-03-28 12:06:02,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 21.99/11.06 [2019-03-28 12:06:02,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... 21.99/11.06 [2019-03-28 12:06:02,396 INFO L276 PluginConnector]: TraceAbstraction initialized 21.99/11.06 [2019-03-28 12:06:02,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:06:01" (1/4) ... 21.99/11.06 [2019-03-28 12:06:02,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ba4e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:06:02, skipping insertion in model container 21.99/11.06 [2019-03-28 12:06:02,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:02" (2/4) ... 21.99/11.06 [2019-03-28 12:06:02,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ba4e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:06:02, skipping insertion in model container 21.99/11.06 [2019-03-28 12:06:02,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:02" (3/4) ... 21.99/11.06 [2019-03-28 12:06:02,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ba4e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:06:02, skipping insertion in model container 21.99/11.06 [2019-03-28 12:06:02,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:06:02" (4/4) ... 21.99/11.06 [2019-03-28 12:06:02,401 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 21.99/11.06 [2019-03-28 12:06:02,412 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 21.99/11.06 [2019-03-28 12:06:02,421 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 21.99/11.06 [2019-03-28 12:06:02,440 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 21.99/11.06 [2019-03-28 12:06:02,471 INFO L133 ementStrategyFactory]: Using default assertion order modulation 21.99/11.06 [2019-03-28 12:06:02,472 INFO L382 AbstractCegarLoop]: Interprodecural is true 21.99/11.06 [2019-03-28 12:06:02,472 INFO L383 AbstractCegarLoop]: Hoare is true 21.99/11.06 [2019-03-28 12:06:02,472 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 21.99/11.06 [2019-03-28 12:06:02,473 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 21.99/11.06 [2019-03-28 12:06:02,473 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 21.99/11.06 [2019-03-28 12:06:02,473 INFO L387 AbstractCegarLoop]: Difference is false 21.99/11.06 [2019-03-28 12:06:02,473 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 21.99/11.06 [2019-03-28 12:06:02,473 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 21.99/11.06 [2019-03-28 12:06:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. 21.99/11.06 [2019-03-28 12:06:02,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 21.99/11.06 [2019-03-28 12:06:02,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. 21.99/11.06 [2019-03-28 12:06:02,561 INFO L451 ceAbstractionStarter]: At program point L15(line 15) the Hoare annotation is: true 21.99/11.06 [2019-03-28 12:06:02,561 INFO L451 ceAbstractionStarter]: At program point L15-1(line 15) the Hoare annotation is: true 21.99/11.06 [2019-03-28 12:06:02,562 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. 21.99/11.06 [2019-03-28 12:06:02,562 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 15) no Hoare annotation was computed. 21.99/11.06 [2019-03-28 12:06:02,562 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 10 16) no Hoare annotation was computed. 21.99/11.06 [2019-03-28 12:06:02,562 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 10 16) no Hoare annotation was computed. 21.99/11.06 [2019-03-28 12:06:02,562 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 10 16) the Hoare annotation is: true 21.99/11.06 [2019-03-28 12:06:02,562 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 21.99/11.06 [2019-03-28 12:06:02,563 INFO L451 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: true 21.99/11.06 [2019-03-28 12:06:02,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:06:02 BasicIcfg 21.99/11.06 [2019-03-28 12:06:02,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 21.99/11.06 [2019-03-28 12:06:02,567 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 21.99/11.06 [2019-03-28 12:06:02,567 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 21.99/11.06 [2019-03-28 12:06:02,570 INFO L276 PluginConnector]: BuchiAutomizer initialized 21.99/11.06 [2019-03-28 12:06:02,571 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.99/11.06 [2019-03-28 12:06:02,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:06:01" (1/5) ... 21.99/11.06 [2019-03-28 12:06:02,572 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58a15f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:06:02, skipping insertion in model container 21.99/11.06 [2019-03-28 12:06:02,572 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.99/11.06 [2019-03-28 12:06:02,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:02" (2/5) ... 21.99/11.06 [2019-03-28 12:06:02,573 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58a15f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:06:02, skipping insertion in model container 21.99/11.06 [2019-03-28 12:06:02,573 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.99/11.06 [2019-03-28 12:06:02,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:02" (3/5) ... 21.99/11.06 [2019-03-28 12:06:02,573 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58a15f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:06:02, skipping insertion in model container 21.99/11.06 [2019-03-28 12:06:02,574 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.99/11.06 [2019-03-28 12:06:02,574 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:06:02" (4/5) ... 21.99/11.06 [2019-03-28 12:06:02,574 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58a15f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:06:02, skipping insertion in model container 21.99/11.06 [2019-03-28 12:06:02,574 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.99/11.06 [2019-03-28 12:06:02,574 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:06:02" (5/5) ... 21.99/11.06 [2019-03-28 12:06:02,576 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 21.99/11.06 [2019-03-28 12:06:02,613 INFO L133 ementStrategyFactory]: Using default assertion order modulation 21.99/11.06 [2019-03-28 12:06:02,613 INFO L374 BuchiCegarLoop]: Interprodecural is true 21.99/11.06 [2019-03-28 12:06:02,613 INFO L375 BuchiCegarLoop]: Hoare is true 21.99/11.06 [2019-03-28 12:06:02,614 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 21.99/11.06 [2019-03-28 12:06:02,614 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 21.99/11.06 [2019-03-28 12:06:02,614 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 21.99/11.06 [2019-03-28 12:06:02,614 INFO L379 BuchiCegarLoop]: Difference is false 21.99/11.06 [2019-03-28 12:06:02,614 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 21.99/11.06 [2019-03-28 12:06:02,614 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 21.99/11.06 [2019-03-28 12:06:02,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. 21.99/11.06 [2019-03-28 12:06:02,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 21.99/11.06 [2019-03-28 12:06:02,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.99/11.06 [2019-03-28 12:06:02,640 INFO L119 BuchiIsEmpty]: Starting construction of run 21.99/11.06 [2019-03-28 12:06:02,648 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 21.99/11.06 [2019-03-28 12:06:02,648 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.99/11.06 [2019-03-28 12:06:02,648 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 21.99/11.06 [2019-03-28 12:06:02,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. 21.99/11.06 [2019-03-28 12:06:02,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 21.99/11.06 [2019-03-28 12:06:02,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.99/11.06 [2019-03-28 12:06:02,650 INFO L119 BuchiIsEmpty]: Starting construction of run 21.99/11.06 [2019-03-28 12:06:02,651 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 21.99/11.06 [2019-03-28 12:06:02,651 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.99/11.06 [2019-03-28 12:06:02,656 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 3#L21true [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 6#gENTRYtrue 21.99/11.06 [2019-03-28 12:06:02,657 INFO L796 eck$LassoCheckResult]: Loop: 6#gENTRYtrue [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 4#L12true [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 8#L15true [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 6#gENTRYtrue 21.99/11.06 [2019-03-28 12:06:02,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.06 [2019-03-28 12:06:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2514, now seen corresponding path program 1 times 21.99/11.06 [2019-03-28 12:06:02,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.06 [2019-03-28 12:06:02,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.06 [2019-03-28 12:06:02,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:02,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:02,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.06 [2019-03-28 12:06:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.06 [2019-03-28 12:06:02,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.06 [2019-03-28 12:06:02,735 INFO L82 PathProgramCache]: Analyzing trace with hash 65850, now seen corresponding path program 1 times 21.99/11.06 [2019-03-28 12:06:02,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.06 [2019-03-28 12:06:02,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.06 [2019-03-28 12:06:02,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:02,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:02,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.06 [2019-03-28 12:06:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.06 [2019-03-28 12:06:02,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.06 [2019-03-28 12:06:02,747 INFO L82 PathProgramCache]: Analyzing trace with hash 74930633, now seen corresponding path program 1 times 21.99/11.06 [2019-03-28 12:06:02,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.06 [2019-03-28 12:06:02,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.06 [2019-03-28 12:06:02,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:02,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:02,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.06 [2019-03-28 12:06:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.06 [2019-03-28 12:06:02,837 INFO L216 LassoAnalysis]: Preferences: 21.99/11.06 [2019-03-28 12:06:02,838 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.99/11.06 [2019-03-28 12:06:02,838 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.99/11.06 [2019-03-28 12:06:02,838 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.99/11.06 [2019-03-28 12:06:02,838 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.99/11.06 [2019-03-28 12:06:02,838 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.06 [2019-03-28 12:06:02,839 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.99/11.06 [2019-03-28 12:06:02,839 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.99/11.06 [2019-03-28 12:06:02,839 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 21.99/11.06 [2019-03-28 12:06:02,839 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.99/11.06 [2019-03-28 12:06:02,839 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.99/11.06 [2019-03-28 12:06:02,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.06 [2019-03-28 12:06:02,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.06 [2019-03-28 12:06:02,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.06 [2019-03-28 12:06:02,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.06 [2019-03-28 12:06:02,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.06 [2019-03-28 12:06:02,955 INFO L300 LassoAnalysis]: Preprocessing complete. 21.99/11.06 [2019-03-28 12:06:02,955 INFO L412 LassoAnalysis]: Checking for nontermination... 21.99/11.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.06 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.06 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.06 [2019-03-28 12:06:02,963 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.06 [2019-03-28 12:06:02,964 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.06 [2019-03-28 12:06:02,974 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.06 [2019-03-28 12:06:02,974 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_~x=0} Honda state: {g_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.06 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.06 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.06 [2019-03-28 12:06:03,004 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.06 [2019-03-28 12:06:03,004 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.06 [2019-03-28 12:06:03,008 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.06 [2019-03-28 12:06:03,009 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.06 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.06 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.06 [2019-03-28 12:06:03,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.06 [2019-03-28 12:06:03,037 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.06 [2019-03-28 12:06:03,041 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.06 [2019-03-28 12:06:03,041 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.06 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.06 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.06 [2019-03-28 12:06:03,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.06 [2019-03-28 12:06:03,072 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.06 [2019-03-28 12:06:03,076 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.06 [2019-03-28 12:06:03,076 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.06 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.06 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.06 [2019-03-28 12:06:03,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.06 [2019-03-28 12:06:03,104 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.06 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.06 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.06 [2019-03-28 12:06:03,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.99/11.06 [2019-03-28 12:06:03,136 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.06 [2019-03-28 12:06:03,167 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.99/11.06 [2019-03-28 12:06:03,169 INFO L216 LassoAnalysis]: Preferences: 21.99/11.06 [2019-03-28 12:06:03,170 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.99/11.06 [2019-03-28 12:06:03,170 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.99/11.06 [2019-03-28 12:06:03,170 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.99/11.06 [2019-03-28 12:06:03,170 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.99/11.06 [2019-03-28 12:06:03,170 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.99/11.06 [2019-03-28 12:06:03,170 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.99/11.06 [2019-03-28 12:06:03,170 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.99/11.06 [2019-03-28 12:06:03,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 21.99/11.06 [2019-03-28 12:06:03,171 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.99/11.06 [2019-03-28 12:06:03,171 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.99/11.06 [2019-03-28 12:06:03,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.06 [2019-03-28 12:06:03,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.06 [2019-03-28 12:06:03,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.06 [2019-03-28 12:06:03,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.06 [2019-03-28 12:06:03,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.06 [2019-03-28 12:06:03,226 INFO L300 LassoAnalysis]: Preprocessing complete. 21.99/11.06 [2019-03-28 12:06:03,232 INFO L497 LassoAnalysis]: Using template 'affine'. 21.99/11.06 [2019-03-28 12:06:03,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.99/11.06 Termination analysis: LINEAR_WITH_GUESSES 21.99/11.06 Number of strict supporting invariants: 0 21.99/11.06 Number of non-strict supporting invariants: 1 21.99/11.06 Consider only non-deceasing supporting invariants: true 21.99/11.06 Simplify termination arguments: true 21.99/11.06 Simplify supporting invariants: trueOverapproximate stem: false 21.99/11.06 [2019-03-28 12:06:03,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.99/11.06 [2019-03-28 12:06:03,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.99/11.06 [2019-03-28 12:06:03,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.99/11.06 [2019-03-28 12:06:03,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.99/11.06 [2019-03-28 12:06:03,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.99/11.06 [2019-03-28 12:06:03,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.99/11.06 [2019-03-28 12:06:03,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.99/11.06 [2019-03-28 12:06:03,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.99/11.06 [2019-03-28 12:06:03,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.99/11.06 Termination analysis: LINEAR_WITH_GUESSES 21.99/11.06 Number of strict supporting invariants: 0 21.99/11.06 Number of non-strict supporting invariants: 1 21.99/11.06 Consider only non-deceasing supporting invariants: true 21.99/11.06 Simplify termination arguments: true 21.99/11.06 Simplify supporting invariants: trueOverapproximate stem: false 21.99/11.06 [2019-03-28 12:06:03,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.99/11.06 [2019-03-28 12:06:03,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.99/11.06 [2019-03-28 12:06:03,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.99/11.06 [2019-03-28 12:06:03,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.99/11.06 [2019-03-28 12:06:03,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.99/11.06 [2019-03-28 12:06:03,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.99/11.06 [2019-03-28 12:06:03,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.99/11.06 [2019-03-28 12:06:03,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.99/11.06 [2019-03-28 12:06:03,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.99/11.06 Termination analysis: LINEAR_WITH_GUESSES 21.99/11.06 Number of strict supporting invariants: 0 21.99/11.06 Number of non-strict supporting invariants: 1 21.99/11.06 Consider only non-deceasing supporting invariants: true 21.99/11.06 Simplify termination arguments: true 21.99/11.06 Simplify supporting invariants: trueOverapproximate stem: false 21.99/11.06 [2019-03-28 12:06:03,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.99/11.06 [2019-03-28 12:06:03,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.99/11.06 [2019-03-28 12:06:03,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.99/11.06 [2019-03-28 12:06:03,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.99/11.06 [2019-03-28 12:06:03,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.99/11.06 [2019-03-28 12:06:03,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.99/11.06 [2019-03-28 12:06:03,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.99/11.06 [2019-03-28 12:06:03,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.99/11.06 [2019-03-28 12:06:03,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.99/11.06 Termination analysis: LINEAR_WITH_GUESSES 21.99/11.06 Number of strict supporting invariants: 0 21.99/11.06 Number of non-strict supporting invariants: 1 21.99/11.06 Consider only non-deceasing supporting invariants: true 21.99/11.06 Simplify termination arguments: true 21.99/11.06 Simplify supporting invariants: trueOverapproximate stem: false 21.99/11.06 [2019-03-28 12:06:03,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.99/11.06 [2019-03-28 12:06:03,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.99/11.06 [2019-03-28 12:06:03,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.99/11.06 [2019-03-28 12:06:03,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.99/11.06 [2019-03-28 12:06:03,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.99/11.06 [2019-03-28 12:06:03,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.99/11.06 [2019-03-28 12:06:03,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.99/11.06 [2019-03-28 12:06:03,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.99/11.06 [2019-03-28 12:06:03,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.99/11.06 Termination analysis: LINEAR_WITH_GUESSES 21.99/11.06 Number of strict supporting invariants: 0 21.99/11.06 Number of non-strict supporting invariants: 1 21.99/11.06 Consider only non-deceasing supporting invariants: true 21.99/11.06 Simplify termination arguments: true 21.99/11.06 Simplify supporting invariants: trueOverapproximate stem: false 21.99/11.06 [2019-03-28 12:06:03,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.99/11.06 [2019-03-28 12:06:03,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.99/11.06 [2019-03-28 12:06:03,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.99/11.06 [2019-03-28 12:06:03,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.99/11.06 [2019-03-28 12:06:03,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.99/11.06 [2019-03-28 12:06:03,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.99/11.06 [2019-03-28 12:06:03,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.99/11.06 [2019-03-28 12:06:03,267 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.99/11.06 [2019-03-28 12:06:03,270 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 21.99/11.06 [2019-03-28 12:06:03,271 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 21.99/11.06 [2019-03-28 12:06:03,273 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.99/11.06 [2019-03-28 12:06:03,273 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 21.99/11.06 [2019-03-28 12:06:03,273 INFO L518 LassoAnalysis]: Proved termination. 21.99/11.06 [2019-03-28 12:06:03,274 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.99/11.06 Ranking function f(g_#in~x) = 1*g_#in~x 21.99/11.06 Supporting invariants [] 21.99/11.06 [2019-03-28 12:06:03,275 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 21.99/11.06 [2019-03-28 12:06:03,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.06 [2019-03-28 12:06:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.99/11.06 [2019-03-28 12:06:03,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core 21.99/11.06 [2019-03-28 12:06:03,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.99/11.06 [2019-03-28 12:06:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.99/11.06 [2019-03-28 12:06:03,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 21.99/11.06 [2019-03-28 12:06:03,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.99/11.06 [2019-03-28 12:06:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.99/11.06 [2019-03-28 12:06:03,419 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 21.99/11.06 [2019-03-28 12:06:03,424 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 21.99/11.06 [2019-03-28 12:06:03,426 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states. Second operand 4 states. 21.99/11.06 [2019-03-28 12:06:03,525 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states.. Second operand 4 states. Result 49 states and 75 transitions. Complement of second has 24 states. 21.99/11.06 [2019-03-28 12:06:03,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 21.99/11.06 [2019-03-28 12:06:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 21.99/11.06 [2019-03-28 12:06:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. 21.99/11.06 [2019-03-28 12:06:03,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. 21.99/11.06 [2019-03-28 12:06:03,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.99/11.06 [2019-03-28 12:06:03,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. 21.99/11.06 [2019-03-28 12:06:03,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.99/11.06 [2019-03-28 12:06:03,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. 21.99/11.06 [2019-03-28 12:06:03,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.99/11.06 [2019-03-28 12:06:03,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 75 transitions. 21.99/11.06 [2019-03-28 12:06:03,548 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 21.99/11.06 [2019-03-28 12:06:03,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 60 transitions. 21.99/11.06 [2019-03-28 12:06:03,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 21.99/11.06 [2019-03-28 12:06:03,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 21.99/11.06 [2019-03-28 12:06:03,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 60 transitions. 21.99/11.06 [2019-03-28 12:06:03,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.99/11.06 [2019-03-28 12:06:03,560 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 60 transitions. 21.99/11.06 [2019-03-28 12:06:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 60 transitions. 21.99/11.06 [2019-03-28 12:06:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. 21.99/11.06 [2019-03-28 12:06:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 21.99/11.06 [2019-03-28 12:06:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. 21.99/11.06 [2019-03-28 12:06:03,597 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. 21.99/11.06 [2019-03-28 12:06:03,598 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. 21.99/11.06 [2019-03-28 12:06:03,598 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 21.99/11.06 [2019-03-28 12:06:03,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 41 transitions. 21.99/11.06 [2019-03-28 12:06:03,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 21.99/11.06 [2019-03-28 12:06:03,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.99/11.06 [2019-03-28 12:06:03,599 INFO L119 BuchiIsEmpty]: Starting construction of run 21.99/11.06 [2019-03-28 12:06:03,600 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 21.99/11.06 [2019-03-28 12:06:03,600 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.99/11.06 [2019-03-28 12:06:03,600 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 124#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 130#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 123#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 125#L15 21.99/11.06 [2019-03-28 12:06:03,601 INFO L796 eck$LassoCheckResult]: Loop: 125#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 132#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 133#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 125#L15 21.99/11.06 [2019-03-28 12:06:03,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.06 [2019-03-28 12:06:03,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2417117, now seen corresponding path program 1 times 21.99/11.06 [2019-03-28 12:06:03,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.06 [2019-03-28 12:06:03,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.06 [2019-03-28 12:06:03,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:03,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:03,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.99/11.06 [2019-03-28 12:06:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.99/11.06 [2019-03-28 12:06:03,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.99/11.06 [2019-03-28 12:06:03,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 21.99/11.06 [2019-03-28 12:06:03,648 INFO L799 eck$LassoCheckResult]: stem already infeasible 21.99/11.06 [2019-03-28 12:06:03,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.06 [2019-03-28 12:06:03,649 INFO L82 PathProgramCache]: Analyzing trace with hash 66511, now seen corresponding path program 1 times 21.99/11.06 [2019-03-28 12:06:03,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.06 [2019-03-28 12:06:03,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.06 [2019-03-28 12:06:03,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:03,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:03,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.06 [2019-03-28 12:06:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.06 [2019-03-28 12:06:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.06 [2019-03-28 12:06:03,688 INFO L216 LassoAnalysis]: Preferences: 21.99/11.06 [2019-03-28 12:06:03,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.99/11.06 [2019-03-28 12:06:03,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.99/11.06 [2019-03-28 12:06:03,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.99/11.06 [2019-03-28 12:06:03,689 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.99/11.06 [2019-03-28 12:06:03,689 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.06 [2019-03-28 12:06:03,689 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.99/11.06 [2019-03-28 12:06:03,689 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.99/11.06 [2019-03-28 12:06:03,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 21.99/11.07 [2019-03-28 12:06:03,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.99/11.07 [2019-03-28 12:06:03,690 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.99/11.07 [2019-03-28 12:06:03,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:03,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:03,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:03,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:03,746 INFO L300 LassoAnalysis]: Preprocessing complete. 21.99/11.07 [2019-03-28 12:06:03,746 INFO L412 LassoAnalysis]: Checking for nontermination... 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:03,751 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:03,751 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:03,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:03,794 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:04,025 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.07 [2019-03-28 12:06:04,025 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-2, g_~x=-6} Honda state: {g_#in~x=-2, g_~x=-6} Generalized eigenvectors: [{g_#in~x=1, g_~x=0}, {g_#in~x=-5, g_~x=0}, {g_#in~x=-1, g_~x=-1}] Lambdas: [5, 0, 1] Nus: [1, 0] 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:04,056 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:04,056 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:04,060 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.07 [2019-03-28 12:06:04,060 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:04,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:04,091 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:04,095 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.07 [2019-03-28 12:06:04,095 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:04,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:04,127 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:04,131 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.07 [2019-03-28 12:06:04,131 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.07 [2019-03-28 12:06:04,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 21.99/11.07 [2019-03-28 12:06:04,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 21.99/11.07 [2019-03-28 12:06:04,162 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. cyclomatic complexity: 17 Second operand 5 states. 21.99/11.07 [2019-03-28 12:06:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.99/11.07 [2019-03-28 12:06:04,223 INFO L93 Difference]: Finished difference Result 36 states and 57 transitions. 21.99/11.07 [2019-03-28 12:06:04,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 21.99/11.07 [2019-03-28 12:06:04,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 57 transitions. 21.99/11.07 [2019-03-28 12:06:04,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 21.99/11.07 [2019-03-28 12:06:04,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 32 states and 52 transitions. 21.99/11.07 [2019-03-28 12:06:04,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 21.99/11.07 [2019-03-28 12:06:04,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 21.99/11.07 [2019-03-28 12:06:04,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 52 transitions. 21.99/11.07 [2019-03-28 12:06:04,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.99/11.07 [2019-03-28 12:06:04,233 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 52 transitions. 21.99/11.07 [2019-03-28 12:06:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 52 transitions. 21.99/11.07 [2019-03-28 12:06:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. 21.99/11.07 [2019-03-28 12:06:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 21.99/11.07 [2019-03-28 12:06:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. 21.99/11.07 [2019-03-28 12:06:04,239 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. 21.99/11.07 [2019-03-28 12:06:04,240 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. 21.99/11.07 [2019-03-28 12:06:04,240 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 21.99/11.07 [2019-03-28 12:06:04,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 51 transitions. 21.99/11.07 [2019-03-28 12:06:04,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 21.99/11.07 [2019-03-28 12:06:04,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.99/11.07 [2019-03-28 12:06:04,241 INFO L119 BuchiIsEmpty]: Starting construction of run 21.99/11.07 [2019-03-28 12:06:04,242 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] 21.99/11.07 [2019-03-28 12:06:04,242 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.99/11.07 [2019-03-28 12:06:04,242 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 196#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 197#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 205#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 206#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 217#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 224#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 209#L15 21.99/11.07 [2019-03-28 12:06:04,243 INFO L796 eck$LassoCheckResult]: Loop: 209#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 208#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 210#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 209#L15 21.99/11.07 [2019-03-28 12:06:04,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.07 [2019-03-28 12:06:04,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1006104556, now seen corresponding path program 1 times 21.99/11.07 [2019-03-28 12:06:04,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.07 [2019-03-28 12:06:04,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.07 [2019-03-28 12:06:04,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.99/11.07 [2019-03-28 12:06:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.99/11.07 [2019-03-28 12:06:04,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.99/11.07 [2019-03-28 12:06:04,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 21.99/11.07 [2019-03-28 12:06:04,290 INFO L799 eck$LassoCheckResult]: stem already infeasible 21.99/11.07 [2019-03-28 12:06:04,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.07 [2019-03-28 12:06:04,290 INFO L82 PathProgramCache]: Analyzing trace with hash 66511, now seen corresponding path program 2 times 21.99/11.07 [2019-03-28 12:06:04,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.07 [2019-03-28 12:06:04,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.07 [2019-03-28 12:06:04,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:04,327 INFO L216 LassoAnalysis]: Preferences: 21.99/11.07 [2019-03-28 12:06:04,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.99/11.07 [2019-03-28 12:06:04,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.99/11.07 [2019-03-28 12:06:04,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.99/11.07 [2019-03-28 12:06:04,328 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.99/11.07 [2019-03-28 12:06:04,328 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:04,328 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.99/11.07 [2019-03-28 12:06:04,328 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.99/11.07 [2019-03-28 12:06:04,328 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 21.99/11.07 [2019-03-28 12:06:04,328 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.99/11.07 [2019-03-28 12:06:04,328 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.99/11.07 [2019-03-28 12:06:04,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:04,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:04,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:04,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:04,373 INFO L300 LassoAnalysis]: Preprocessing complete. 21.99/11.07 [2019-03-28 12:06:04,373 INFO L412 LassoAnalysis]: Checking for nontermination... 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:04,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:04,378 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:04,414 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:04,415 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:04,627 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.07 [2019-03-28 12:06:04,628 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-7, g_~x=-2} Honda state: {g_#in~x=-7, g_~x=-2} Generalized eigenvectors: [{g_#in~x=-1, g_~x=0}, {g_#in~x=6, g_~x=0}, {g_#in~x=-1, g_~x=-1}] Lambdas: [6, 0, 1] Nus: [1, 0] 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:04,657 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:04,658 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:04,662 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.07 [2019-03-28 12:06:04,662 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:04,689 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:04,690 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:04,694 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.07 [2019-03-28 12:06:04,694 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:04,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:04,723 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:04,735 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.07 [2019-03-28 12:06:04,735 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.07 [2019-03-28 12:06:04,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 21.99/11.07 [2019-03-28 12:06:04,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 21.99/11.07 [2019-03-28 12:06:04,761 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. cyclomatic complexity: 23 Second operand 5 states. 21.99/11.07 [2019-03-28 12:06:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.99/11.07 [2019-03-28 12:06:04,840 INFO L93 Difference]: Finished difference Result 35 states and 53 transitions. 21.99/11.07 [2019-03-28 12:06:04,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 21.99/11.07 [2019-03-28 12:06:04,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. 21.99/11.07 [2019-03-28 12:06:04,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 21.99/11.07 [2019-03-28 12:06:04,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 53 transitions. 21.99/11.07 [2019-03-28 12:06:04,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 21.99/11.07 [2019-03-28 12:06:04,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 21.99/11.07 [2019-03-28 12:06:04,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 53 transitions. 21.99/11.07 [2019-03-28 12:06:04,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.99/11.07 [2019-03-28 12:06:04,849 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 53 transitions. 21.99/11.07 [2019-03-28 12:06:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 53 transitions. 21.99/11.07 [2019-03-28 12:06:04,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. 21.99/11.07 [2019-03-28 12:06:04,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 21.99/11.07 [2019-03-28 12:06:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. 21.99/11.07 [2019-03-28 12:06:04,855 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. 21.99/11.07 [2019-03-28 12:06:04,855 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. 21.99/11.07 [2019-03-28 12:06:04,855 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 21.99/11.07 [2019-03-28 12:06:04,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. 21.99/11.07 [2019-03-28 12:06:04,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 21.99/11.07 [2019-03-28 12:06:04,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.99/11.07 [2019-03-28 12:06:04,856 INFO L119 BuchiIsEmpty]: Starting construction of run 21.99/11.07 [2019-03-28 12:06:04,857 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 21.99/11.07 [2019-03-28 12:06:04,858 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.99/11.07 [2019-03-28 12:06:04,858 INFO L794 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 280#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 281#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 279#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 277#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 287#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 275#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 278#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 296#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 293#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| 1)) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 295#gENTRY 21.99/11.07 [2019-03-28 12:06:04,858 INFO L796 eck$LassoCheckResult]: Loop: 295#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 302#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 290#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 295#gENTRY 21.99/11.07 [2019-03-28 12:06:04,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.07 [2019-03-28 12:06:04,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1715364408, now seen corresponding path program 1 times 21.99/11.07 [2019-03-28 12:06:04,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.07 [2019-03-28 12:06:04,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.07 [2019-03-28 12:06:04,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:04,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.07 [2019-03-28 12:06:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash 65881, now seen corresponding path program 3 times 21.99/11.07 [2019-03-28 12:06:04,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.07 [2019-03-28 12:06:04,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.07 [2019-03-28 12:06:04,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:04,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.07 [2019-03-28 12:06:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash 900227010, now seen corresponding path program 1 times 21.99/11.07 [2019-03-28 12:06:04,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.07 [2019-03-28 12:06:04,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.07 [2019-03-28 12:06:04,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.99/11.07 [2019-03-28 12:06:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 21.99/11.07 [2019-03-28 12:06:04,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.99/11.07 [2019-03-28 12:06:04,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 21.99/11.07 [2019-03-28 12:06:04,951 INFO L216 LassoAnalysis]: Preferences: 21.99/11.07 [2019-03-28 12:06:04,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.99/11.07 [2019-03-28 12:06:04,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.99/11.07 [2019-03-28 12:06:04,952 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.99/11.07 [2019-03-28 12:06:04,952 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.99/11.07 [2019-03-28 12:06:04,952 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:04,952 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.99/11.07 [2019-03-28 12:06:04,952 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.99/11.07 [2019-03-28 12:06:04,952 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 21.99/11.07 [2019-03-28 12:06:04,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.99/11.07 [2019-03-28 12:06:04,953 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.99/11.07 [2019-03-28 12:06:04,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:04,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:04,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:04,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:04,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:04,998 INFO L300 LassoAnalysis]: Preprocessing complete. 21.99/11.07 [2019-03-28 12:06:04,999 INFO L412 LassoAnalysis]: Checking for nontermination... 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:05,006 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:05,006 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:05,010 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.07 [2019-03-28 12:06:05,011 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:05,042 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:05,042 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:05,046 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.07 [2019-03-28 12:06:05,046 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:05,099 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:05,103 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:05,107 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.07 [2019-03-28 12:06:05,107 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_~x=0} Honda state: {g_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:05,137 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:05,137 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:05,141 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.07 [2019-03-28 12:06:05,141 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:05,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:05,172 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:05,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:05,206 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:05,222 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.99/11.07 [2019-03-28 12:06:05,223 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-1} Honda state: {g_#in~x=-1} Generalized eigenvectors: [{g_#in~x=-1}, {g_#in~x=0}, {g_#in~x=0}] Lambdas: [1, 0, 0] Nus: [0, 0] 21.99/11.07 [2019-03-28 12:06:05,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 21.99/11.07 [2019-03-28 12:06:05,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 21.99/11.07 [2019-03-28 12:06:05,248 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. cyclomatic complexity: 13 Second operand 6 states. 21.99/11.07 [2019-03-28 12:06:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.99/11.07 [2019-03-28 12:06:05,289 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. 21.99/11.07 [2019-03-28 12:06:05,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 21.99/11.07 [2019-03-28 12:06:05,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. 21.99/11.07 [2019-03-28 12:06:05,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 21.99/11.07 [2019-03-28 12:06:05,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. 21.99/11.07 [2019-03-28 12:06:05,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 21.99/11.07 [2019-03-28 12:06:05,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 21.99/11.07 [2019-03-28 12:06:05,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. 21.99/11.07 [2019-03-28 12:06:05,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.99/11.07 [2019-03-28 12:06:05,294 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. 21.99/11.07 [2019-03-28 12:06:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. 21.99/11.07 [2019-03-28 12:06:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. 21.99/11.07 [2019-03-28 12:06:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 21.99/11.07 [2019-03-28 12:06:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. 21.99/11.07 [2019-03-28 12:06:05,297 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. 21.99/11.07 [2019-03-28 12:06:05,297 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. 21.99/11.07 [2019-03-28 12:06:05,297 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 21.99/11.07 [2019-03-28 12:06:05,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. 21.99/11.07 [2019-03-28 12:06:05,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 21.99/11.07 [2019-03-28 12:06:05,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.99/11.07 [2019-03-28 12:06:05,298 INFO L119 BuchiIsEmpty]: Starting construction of run 21.99/11.07 [2019-03-28 12:06:05,298 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] 21.99/11.07 [2019-03-28 12:06:05,299 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] 21.99/11.07 [2019-03-28 12:06:05,299 INFO L794 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 345#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 346#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 344#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 342#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 348#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 341#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 343#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 354#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 352#L15-1 21.99/11.07 [2019-03-28 12:06:05,299 INFO L796 eck$LassoCheckResult]: Loop: 352#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| 1)) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 355#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 356#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 350#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 353#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 357#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 349#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 351#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 352#L15-1 21.99/11.07 [2019-03-28 12:06:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.07 [2019-03-28 12:06:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash -498854994, now seen corresponding path program 1 times 21.99/11.07 [2019-03-28 12:06:05,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.07 [2019-03-28 12:06:05,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.07 [2019-03-28 12:06:05,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:05,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:05,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:05,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.07 [2019-03-28 12:06:05,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1062566437, now seen corresponding path program 1 times 21.99/11.07 [2019-03-28 12:06:05,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.07 [2019-03-28 12:06:05,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.07 [2019-03-28 12:06:05,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:05,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:05,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.07 [2019-03-28 12:06:05,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1701485704, now seen corresponding path program 2 times 21.99/11.07 [2019-03-28 12:06:05,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.07 [2019-03-28 12:06:05,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.07 [2019-03-28 12:06:05,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:05,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:05,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.99/11.07 [2019-03-28 12:06:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. 21.99/11.07 [2019-03-28 12:06:05,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 21.99/11.07 [2019-03-28 12:06:05,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 21.99/11.07 [2019-03-28 12:06:05,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 21.99/11.07 [2019-03-28 12:06:05,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 21.99/11.07 [2019-03-28 12:06:05,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 21.99/11.07 [2019-03-28 12:06:05,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core 21.99/11.07 [2019-03-28 12:06:05,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.99/11.07 [2019-03-28 12:06:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. 21.99/11.07 [2019-03-28 12:06:05,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 21.99/11.07 [2019-03-28 12:06:05,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 21.99/11.07 [2019-03-28 12:06:05,514 INFO L216 LassoAnalysis]: Preferences: 21.99/11.07 [2019-03-28 12:06:05,514 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.99/11.07 [2019-03-28 12:06:05,514 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.99/11.07 [2019-03-28 12:06:05,515 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.99/11.07 [2019-03-28 12:06:05,515 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.99/11.07 [2019-03-28 12:06:05,515 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:05,515 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.99/11.07 [2019-03-28 12:06:05,515 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.99/11.07 [2019-03-28 12:06:05,515 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 21.99/11.07 [2019-03-28 12:06:05,515 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.99/11.07 [2019-03-28 12:06:05,515 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.99/11.07 [2019-03-28 12:06:05,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:05,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:05,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:05,557 INFO L300 LassoAnalysis]: Preprocessing complete. 21.99/11.07 [2019-03-28 12:06:05,557 INFO L412 LassoAnalysis]: Checking for nontermination... 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:05,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:05,560 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.99/11.07 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.99/11.07 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:05,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.99/11.07 [2019-03-28 12:06:05,592 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.99/11.07 [2019-03-28 12:06:07,552 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.99/11.07 [2019-03-28 12:06:07,555 INFO L216 LassoAnalysis]: Preferences: 21.99/11.07 [2019-03-28 12:06:07,568 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.99/11.07 [2019-03-28 12:06:07,568 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.99/11.07 [2019-03-28 12:06:07,568 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.99/11.07 [2019-03-28 12:06:07,568 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.99/11.07 [2019-03-28 12:06:07,569 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.99/11.07 [2019-03-28 12:06:07,569 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.99/11.07 [2019-03-28 12:06:07,569 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.99/11.07 [2019-03-28 12:06:07,569 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 21.99/11.07 [2019-03-28 12:06:07,569 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.99/11.07 [2019-03-28 12:06:07,569 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.99/11.07 [2019-03-28 12:06:07,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:07,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:07,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.99/11.07 [2019-03-28 12:06:07,614 INFO L300 LassoAnalysis]: Preprocessing complete. 21.99/11.07 [2019-03-28 12:06:07,614 INFO L497 LassoAnalysis]: Using template 'affine'. 21.99/11.07 [2019-03-28 12:06:07,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.99/11.07 Termination analysis: LINEAR_WITH_GUESSES 21.99/11.07 Number of strict supporting invariants: 0 21.99/11.07 Number of non-strict supporting invariants: 1 21.99/11.07 Consider only non-deceasing supporting invariants: true 21.99/11.07 Simplify termination arguments: true 21.99/11.07 Simplify supporting invariants: trueOverapproximate stem: false 21.99/11.07 [2019-03-28 12:06:07,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.99/11.07 [2019-03-28 12:06:07,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.99/11.07 [2019-03-28 12:06:07,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.99/11.07 [2019-03-28 12:06:07,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.99/11.07 [2019-03-28 12:06:07,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.99/11.07 [2019-03-28 12:06:07,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.99/11.07 [2019-03-28 12:06:07,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.99/11.07 [2019-03-28 12:06:07,624 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.99/11.07 [2019-03-28 12:06:07,629 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 21.99/11.07 [2019-03-28 12:06:07,629 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. 21.99/11.07 [2019-03-28 12:06:07,630 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.99/11.07 [2019-03-28 12:06:07,630 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 21.99/11.07 [2019-03-28 12:06:07,630 INFO L518 LassoAnalysis]: Proved termination. 21.99/11.07 [2019-03-28 12:06:07,630 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.99/11.07 Ranking function f(g_#t~ret0) = -2*g_#t~ret0 + 1 21.99/11.07 Supporting invariants [] 21.99/11.07 [2019-03-28 12:06:07,631 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 21.99/11.07 [2019-03-28 12:06:07,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.07 [2019-03-28 12:06:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.99/11.07 [2019-03-28 12:06:07,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core 21.99/11.07 [2019-03-28 12:06:07,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.99/11.07 [2019-03-28 12:06:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.99/11.07 [2019-03-28 12:06:07,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core 21.99/11.07 [2019-03-28 12:06:07,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.99/11.07 [2019-03-28 12:06:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.99/11.07 [2019-03-28 12:06:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:07,880 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.99/11.07 [2019-03-28 12:06:07,880 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 21.99/11.07 [2019-03-28 12:06:07,880 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 21.99/11.07 [2019-03-28 12:06:07,880 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 8 states. 21.99/11.07 [2019-03-28 12:06:08,160 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 8 states. Result 345 states and 475 transitions. Complement of second has 231 states. 21.99/11.07 [2019-03-28 12:06:08,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 5 non-accepting loop states 2 accepting loop states 21.99/11.07 [2019-03-28 12:06:08,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 21.99/11.07 [2019-03-28 12:06:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. 21.99/11.07 [2019-03-28 12:06:08,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 9 letters. Loop has 8 letters. 21.99/11.07 [2019-03-28 12:06:08,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.99/11.07 [2019-03-28 12:06:08,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 17 letters. Loop has 8 letters. 21.99/11.07 [2019-03-28 12:06:08,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.99/11.07 [2019-03-28 12:06:08,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 9 letters. Loop has 16 letters. 21.99/11.07 [2019-03-28 12:06:08,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.99/11.07 [2019-03-28 12:06:08,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 345 states and 475 transitions. 21.99/11.07 [2019-03-28 12:06:08,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 21.99/11.07 [2019-03-28 12:06:08,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 345 states to 85 states and 103 transitions. 21.99/11.07 [2019-03-28 12:06:08,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 21.99/11.07 [2019-03-28 12:06:08,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 21.99/11.07 [2019-03-28 12:06:08,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 103 transitions. 21.99/11.07 [2019-03-28 12:06:08,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.99/11.07 [2019-03-28 12:06:08,179 INFO L706 BuchiCegarLoop]: Abstraction has 85 states and 103 transitions. 21.99/11.07 [2019-03-28 12:06:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 103 transitions. 21.99/11.07 [2019-03-28 12:06:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 28. 21.99/11.07 [2019-03-28 12:06:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 21.99/11.07 [2019-03-28 12:06:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. 21.99/11.07 [2019-03-28 12:06:08,183 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. 21.99/11.07 [2019-03-28 12:06:08,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 21.99/11.07 [2019-03-28 12:06:08,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 21.99/11.07 [2019-03-28 12:06:08,184 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 8 states. 21.99/11.07 [2019-03-28 12:06:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.99/11.07 [2019-03-28 12:06:08,254 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. 21.99/11.07 [2019-03-28 12:06:08,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 21.99/11.07 [2019-03-28 12:06:08,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. 21.99/11.07 [2019-03-28 12:06:08,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 21.99/11.07 [2019-03-28 12:06:08,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 22 transitions. 21.99/11.07 [2019-03-28 12:06:08,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 21.99/11.07 [2019-03-28 12:06:08,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 21.99/11.07 [2019-03-28 12:06:08,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. 21.99/11.07 [2019-03-28 12:06:08,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.99/11.07 [2019-03-28 12:06:08,259 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. 21.99/11.07 [2019-03-28 12:06:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. 21.99/11.07 [2019-03-28 12:06:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 21.99/11.07 [2019-03-28 12:06:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 21.99/11.07 [2019-03-28 12:06:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. 21.99/11.07 [2019-03-28 12:06:08,261 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. 21.99/11.07 [2019-03-28 12:06:08,261 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. 21.99/11.07 [2019-03-28 12:06:08,261 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 21.99/11.07 [2019-03-28 12:06:08,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. 21.99/11.07 [2019-03-28 12:06:08,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 21.99/11.07 [2019-03-28 12:06:08,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.99/11.07 [2019-03-28 12:06:08,262 INFO L119 BuchiIsEmpty]: Starting construction of run 21.99/11.07 [2019-03-28 12:06:08,262 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] 21.99/11.07 [2019-03-28 12:06:08,263 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1] 21.99/11.07 [2019-03-28 12:06:08,263 INFO L794 eck$LassoCheckResult]: Stem: 1148#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 1146#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 1147#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 1144#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 1145#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 1150#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 1151#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 1159#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1155#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 1154#L15-1 21.99/11.07 [2019-03-28 12:06:08,263 INFO L796 eck$LassoCheckResult]: Loop: 1154#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| 1)) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 1156#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 1158#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 1142#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 1149#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 1141#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 1143#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 1157#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 1160#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 1152#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1153#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 1154#L15-1 21.99/11.07 [2019-03-28 12:06:08,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.07 [2019-03-28 12:06:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash -498854994, now seen corresponding path program 2 times 21.99/11.07 [2019-03-28 12:06:08,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.07 [2019-03-28 12:06:08,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.07 [2019-03-28 12:06:08,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:08,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:08,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.07 [2019-03-28 12:06:08,273 INFO L82 PathProgramCache]: Analyzing trace with hash -456592758, now seen corresponding path program 2 times 21.99/11.07 [2019-03-28 12:06:08,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.07 [2019-03-28 12:06:08,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.07 [2019-03-28 12:06:08,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:08,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:08,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:08,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.99/11.07 [2019-03-28 12:06:08,283 INFO L82 PathProgramCache]: Analyzing trace with hash 307740861, now seen corresponding path program 3 times 21.99/11.07 [2019-03-28 12:06:08,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.99/11.07 [2019-03-28 12:06:08,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.99/11.07 [2019-03-28 12:06:08,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:08,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:08,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.99/11.07 [2019-03-28 12:06:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.99/11.07 [2019-03-28 12:06:08,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:06:08 BasicIcfg 21.99/11.07 [2019-03-28 12:06:08,541 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 21.99/11.07 [2019-03-28 12:06:08,541 INFO L168 Benchmark]: Toolchain (without parser) took 6801.83 ms. Allocated memory was 649.6 MB in the beginning and 751.3 MB in the end (delta: 101.7 MB). Free memory was 566.0 MB in the beginning and 456.1 MB in the end (delta: 109.8 MB). Peak memory consumption was 211.5 MB. Max. memory is 50.3 GB. 21.99/11.07 [2019-03-28 12:06:08,543 INFO L168 Benchmark]: CDTParser took 0.18 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. 21.99/11.07 [2019-03-28 12:06:08,543 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.54 ms. Allocated memory was 649.6 MB in the beginning and 677.9 MB in the end (delta: 28.3 MB). Free memory was 564.9 MB in the beginning and 644.6 MB in the end (delta: -79.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. 21.99/11.07 [2019-03-28 12:06:08,544 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.48 ms. Allocated memory is still 677.9 MB. Free memory was 644.6 MB in the beginning and 643.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 21.99/11.07 [2019-03-28 12:06:08,544 INFO L168 Benchmark]: Boogie Preprocessor took 18.00 ms. Allocated memory is still 677.9 MB. Free memory was 643.5 MB in the beginning and 642.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 21.99/11.07 [2019-03-28 12:06:08,545 INFO L168 Benchmark]: RCFGBuilder took 218.73 ms. Allocated memory is still 677.9 MB. Free memory was 642.4 MB in the beginning and 626.9 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 50.3 GB. 21.99/11.07 [2019-03-28 12:06:08,545 INFO L168 Benchmark]: BlockEncodingV2 took 88.87 ms. Allocated memory is still 677.9 MB. Free memory was 626.9 MB in the beginning and 621.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 21.99/11.07 [2019-03-28 12:06:08,546 INFO L168 Benchmark]: TraceAbstraction took 174.68 ms. Allocated memory is still 677.9 MB. Free memory was 621.6 MB in the beginning and 610.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 50.3 GB. 21.99/11.07 [2019-03-28 12:06:08,546 INFO L168 Benchmark]: BuchiAutomizer took 5974.17 ms. Allocated memory was 677.9 MB in the beginning and 751.3 MB in the end (delta: 73.4 MB). Free memory was 610.6 MB in the beginning and 456.1 MB in the end (delta: 154.5 MB). Peak memory consumption was 227.9 MB. Max. memory is 50.3 GB. 21.99/11.07 [2019-03-28 12:06:08,550 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 21.99/11.07 --- Results --- 21.99/11.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 21.99/11.07 - StatisticsResult: Initial Icfg 21.99/11.07 14 locations, 17 edges 21.99/11.07 - StatisticsResult: Encoded RCFG 21.99/11.07 9 locations, 12 edges 21.99/11.07 * Results from de.uni_freiburg.informatik.ultimate.core: 21.99/11.07 - StatisticsResult: Toolchain Benchmarks 21.99/11.07 Benchmark results are: 21.99/11.07 * CDTParser took 0.18 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. 21.99/11.07 * CACSL2BoogieTranslator took 284.54 ms. Allocated memory was 649.6 MB in the beginning and 677.9 MB in the end (delta: 28.3 MB). Free memory was 564.9 MB in the beginning and 644.6 MB in the end (delta: -79.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. 21.99/11.07 * Boogie Procedure Inliner took 37.48 ms. Allocated memory is still 677.9 MB. Free memory was 644.6 MB in the beginning and 643.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 21.99/11.07 * Boogie Preprocessor took 18.00 ms. Allocated memory is still 677.9 MB. Free memory was 643.5 MB in the beginning and 642.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 21.99/11.07 * RCFGBuilder took 218.73 ms. Allocated memory is still 677.9 MB. Free memory was 642.4 MB in the beginning and 626.9 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 50.3 GB. 21.99/11.07 * BlockEncodingV2 took 88.87 ms. Allocated memory is still 677.9 MB. Free memory was 626.9 MB in the beginning and 621.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 21.99/11.07 * TraceAbstraction took 174.68 ms. Allocated memory is still 677.9 MB. Free memory was 621.6 MB in the beginning and 610.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 50.3 GB. 21.99/11.07 * BuchiAutomizer took 5974.17 ms. Allocated memory was 677.9 MB in the beginning and 751.3 MB in the end (delta: 73.4 MB). Free memory was 610.6 MB in the beginning and 456.1 MB in the end (delta: 154.5 MB). Peak memory consumption was 227.9 MB. Max. memory is 50.3 GB. 21.99/11.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 21.99/11.07 - AllSpecificationsHoldResult: All specifications hold 21.99/11.07 We were not able to verify any specifiation because the program does not contain any specification. 21.99/11.07 - StatisticsResult: Ultimate Automizer benchmark data 21.99/11.07 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 21.99/11.07 - StatisticsResult: Constructed decomposition of program 21.99/11.07 Your program was decomposed into 6 terminating modules (4 trivial, 0 deterministic, 2 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function \old(x) and consists of 6 locations. One nondeterministic module has affine ranking function -2 * aux-g(x - 1)-aux + 1 and consists of 9 locations. 4 modules have a trivial ranking function, the largest among these consists of 8 locations. The remainder module has 20 locations. 21.99/11.07 - StatisticsResult: Timing statistics 21.99/11.07 BüchiAutomizer plugin needed 5.9s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 4.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 77 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 79 SDtfs, 76 SDslu, 116 SDs, 0 SdLazy, 200 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc1 concLT1 SILN2 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq179 hnf91 smp100 dnf100 smp100 tf110 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.8s 21.99/11.07 - TerminationAnalysisResult: Nontermination possible 21.99/11.07 Buchi Automizer proved that your program is nonterminating for some inputs 21.99/11.07 - FixpointNonTerminationResult [Line: 15]: Nontermination argument in form of an infinite program execution. 21.99/11.07 Nontermination argument in form of an infinite execution 21.99/11.07 State at position 0 is 21.99/11.07 {} 21.99/11.07 State at position 1 is 21.99/11.07 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d286df5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a05434d=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60b08aa3=0, \old(x)=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bf48c5a=0, x=0, x=1, NULL=0} 21.99/11.07 - StatisticsResult: NonterminationArgumentStatistics 21.99/11.07 Fixpoint 21.99/11.07 - NonterminatingLassoResult [Line: 15]: Nonterminating execution 21.99/11.07 Found a nonterminating execution for the following lasso shaped sequence of statements. 21.99/11.07 Stem: 21.99/11.07 [L19] int x = __VERIFIER_nondet_int(); 21.99/11.07 [L20] COND FALSE !(x < 0) 21.99/11.07 [L21] CALL g(x) 21.99/11.07 [L12] COND FALSE !(x == 0) 21.99/11.07 [L15] CALL g(x - 1) 21.99/11.07 [L12] COND TRUE x == 0 21.99/11.07 [L13] return 1; 21.99/11.07 [L15] RET g(x - 1) 21.99/11.07 Loop: 21.99/11.07 [L15] CALL g(g(x - 1) + 1) 21.99/11.07 [L12] COND FALSE !(x == 0) 21.99/11.07 [L15] CALL g(x - 1) 21.99/11.07 [L12] COND FALSE !(x == 0) 21.99/11.07 [L15] CALL g(x - 1) 21.99/11.07 [L12] COND TRUE x == 0 21.99/11.07 [L13] return 1; 21.99/11.07 [L15] RET g(x - 1) 21.99/11.07 End of lasso representation. 21.99/11.07 RESULT: Ultimate proved your program to be incorrect! 21.99/11.07 21.99/11.07 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:06:08.783 21.99/11.07 !MESSAGE The workspace will exit with unsaved changes in this session. 21.99/11.07 Received shutdown request... 21.99/11.07 Ultimate: 21.99/11.07 GTK+ Version Check 21.99/11.07 EOF