19.38/8.73 YES 19.38/8.73 19.38/8.73 Ultimate: Cannot open display: 19.38/8.73 This is Ultimate 0.1.24-8dc7c08-m 19.38/8.73 [2019-03-28 12:39:59,793 INFO L170 SettingsManager]: Resetting all preferences to default values... 19.38/8.73 [2019-03-28 12:39:59,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 19.38/8.73 [2019-03-28 12:39:59,806 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 19.38/8.73 [2019-03-28 12:39:59,806 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 19.38/8.73 [2019-03-28 12:39:59,807 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 19.38/8.73 [2019-03-28 12:39:59,809 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 19.38/8.73 [2019-03-28 12:39:59,810 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 19.38/8.73 [2019-03-28 12:39:59,812 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 19.38/8.73 [2019-03-28 12:39:59,812 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 19.38/8.73 [2019-03-28 12:39:59,813 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 19.38/8.73 [2019-03-28 12:39:59,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 19.38/8.73 [2019-03-28 12:39:59,814 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 19.38/8.73 [2019-03-28 12:39:59,815 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 19.38/8.73 [2019-03-28 12:39:59,816 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 19.38/8.73 [2019-03-28 12:39:59,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 19.38/8.73 [2019-03-28 12:39:59,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 19.38/8.73 [2019-03-28 12:39:59,820 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 19.38/8.73 [2019-03-28 12:39:59,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 19.38/8.73 [2019-03-28 12:39:59,823 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 19.38/8.73 [2019-03-28 12:39:59,824 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 19.38/8.73 [2019-03-28 12:39:59,825 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 19.38/8.73 [2019-03-28 12:39:59,827 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 19.38/8.73 [2019-03-28 12:39:59,828 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 19.38/8.73 [2019-03-28 12:39:59,828 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 19.38/8.73 [2019-03-28 12:39:59,829 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 19.38/8.73 [2019-03-28 12:39:59,829 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 19.38/8.73 [2019-03-28 12:39:59,830 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 19.38/8.73 [2019-03-28 12:39:59,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 19.38/8.73 [2019-03-28 12:39:59,831 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 19.38/8.73 [2019-03-28 12:39:59,832 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 19.38/8.73 [2019-03-28 12:39:59,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 19.38/8.73 [2019-03-28 12:39:59,834 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 19.38/8.73 [2019-03-28 12:39:59,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 19.38/8.73 [2019-03-28 12:39:59,835 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 19.38/8.73 [2019-03-28 12:39:59,835 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 19.38/8.73 [2019-03-28 12:39:59,835 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 19.38/8.73 [2019-03-28 12:39:59,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 19.38/8.73 [2019-03-28 12:39:59,837 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 19.38/8.73 [2019-03-28 12:39:59,837 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 19.38/8.73 [2019-03-28 12:39:59,852 INFO L110 SettingsManager]: Loading preferences was successful 19.38/8.73 [2019-03-28 12:39:59,852 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 19.38/8.73 [2019-03-28 12:39:59,853 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 19.38/8.73 [2019-03-28 12:39:59,853 INFO L133 SettingsManager]: * Rewrite not-equals=true 19.38/8.73 [2019-03-28 12:39:59,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 19.38/8.73 [2019-03-28 12:39:59,854 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 19.38/8.73 [2019-03-28 12:39:59,854 INFO L133 SettingsManager]: * Use SBE=true 19.38/8.73 [2019-03-28 12:39:59,854 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 19.38/8.73 [2019-03-28 12:39:59,854 INFO L133 SettingsManager]: * Use old map elimination=false 19.38/8.73 [2019-03-28 12:39:59,854 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 19.38/8.73 [2019-03-28 12:39:59,855 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 19.38/8.73 [2019-03-28 12:39:59,855 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 19.38/8.73 [2019-03-28 12:39:59,855 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 19.38/8.73 [2019-03-28 12:39:59,855 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 19.38/8.73 [2019-03-28 12:39:59,855 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.38/8.73 [2019-03-28 12:39:59,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 19.38/8.73 [2019-03-28 12:39:59,856 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 19.38/8.73 [2019-03-28 12:39:59,856 INFO L133 SettingsManager]: * Check division by zero=IGNORE 19.38/8.73 [2019-03-28 12:39:59,856 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 19.38/8.73 [2019-03-28 12:39:59,856 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 19.38/8.73 [2019-03-28 12:39:59,856 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 19.38/8.73 [2019-03-28 12:39:59,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 19.38/8.73 [2019-03-28 12:39:59,857 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 19.38/8.73 [2019-03-28 12:39:59,857 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 19.38/8.73 [2019-03-28 12:39:59,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.38/8.73 [2019-03-28 12:39:59,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 19.38/8.73 [2019-03-28 12:39:59,857 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 19.38/8.73 [2019-03-28 12:39:59,858 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 19.38/8.73 [2019-03-28 12:39:59,858 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 19.38/8.73 [2019-03-28 12:39:59,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 19.38/8.73 [2019-03-28 12:39:59,897 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 19.38/8.73 [2019-03-28 12:39:59,901 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 19.38/8.73 [2019-03-28 12:39:59,902 INFO L271 PluginConnector]: Initializing CDTParser... 19.38/8.73 [2019-03-28 12:39:59,902 INFO L276 PluginConnector]: CDTParser initialized 19.38/8.73 [2019-03-28 12:39:59,903 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 19.38/8.73 [2019-03-28 12:39:59,969 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/dba06c9525b94569b1d35f170ec1efc3/FLAG03fc00bf6 19.38/8.73 [2019-03-28 12:40:00,315 INFO L307 CDTParser]: Found 1 translation units. 19.38/8.73 [2019-03-28 12:40:00,316 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 19.38/8.73 [2019-03-28 12:40:00,316 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 19.38/8.73 [2019-03-28 12:40:00,323 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/dba06c9525b94569b1d35f170ec1efc3/FLAG03fc00bf6 19.38/8.73 [2019-03-28 12:40:00,718 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/dba06c9525b94569b1d35f170ec1efc3 19.38/8.73 [2019-03-28 12:40:00,730 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 19.38/8.73 [2019-03-28 12:40:00,731 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 19.38/8.73 [2019-03-28 12:40:00,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 19.38/8.73 [2019-03-28 12:40:00,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 19.38/8.73 [2019-03-28 12:40:00,737 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 19.38/8.73 [2019-03-28 12:40:00,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:00" (1/1) ... 19.38/8.73 [2019-03-28 12:40:00,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27352d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:00, skipping insertion in model container 19.38/8.73 [2019-03-28 12:40:00,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:00" (1/1) ... 19.38/8.73 [2019-03-28 12:40:00,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 19.38/8.73 [2019-03-28 12:40:00,767 INFO L176 MainTranslator]: Built tables and reachable declarations 19.38/8.73 [2019-03-28 12:40:00,934 INFO L206 PostProcessor]: Analyzing one entry point: main 19.38/8.73 [2019-03-28 12:40:00,947 INFO L191 MainTranslator]: Completed pre-run 19.38/8.73 [2019-03-28 12:40:01,027 INFO L206 PostProcessor]: Analyzing one entry point: main 19.38/8.73 [2019-03-28 12:40:01,043 INFO L195 MainTranslator]: Completed translation 19.38/8.73 [2019-03-28 12:40:01,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:01 WrapperNode 19.38/8.73 [2019-03-28 12:40:01,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 19.38/8.73 [2019-03-28 12:40:01,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 19.38/8.73 [2019-03-28 12:40:01,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 19.38/8.73 [2019-03-28 12:40:01,045 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 19.38/8.73 [2019-03-28 12:40:01,054 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:40:01" (1/1) ... 19.38/8.73 [2019-03-28 12:40:01,063 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:40:01" (1/1) ... 19.38/8.73 [2019-03-28 12:40:01,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 19.38/8.73 [2019-03-28 12:40:01,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 19.38/8.73 [2019-03-28 12:40:01,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 19.38/8.73 [2019-03-28 12:40:01,084 INFO L276 PluginConnector]: Boogie Preprocessor initialized 19.38/8.73 [2019-03-28 12:40:01,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:01" (1/1) ... 19.38/8.73 [2019-03-28 12:40:01,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:01" (1/1) ... 19.38/8.73 [2019-03-28 12:40:01,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:01" (1/1) ... 19.38/8.73 [2019-03-28 12:40:01,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:01" (1/1) ... 19.38/8.73 [2019-03-28 12:40:01,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:01" (1/1) ... 19.38/8.73 [2019-03-28 12:40:01,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:01" (1/1) ... 19.38/8.73 [2019-03-28 12:40:01,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:01" (1/1) ... 19.38/8.73 [2019-03-28 12:40:01,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 19.38/8.73 [2019-03-28 12:40:01,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 19.38/8.73 [2019-03-28 12:40:01,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... 19.38/8.73 [2019-03-28 12:40:01,109 INFO L276 PluginConnector]: RCFGBuilder initialized 19.38/8.73 [2019-03-28 12:40:01,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:01" (1/1) ... 19.38/8.73 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.38/8.73 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 19.38/8.73 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.38/8.73 [2019-03-28 12:40:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 19.38/8.73 [2019-03-28 12:40:01,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 19.38/8.73 [2019-03-28 12:40:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 19.38/8.73 [2019-03-28 12:40:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 19.38/8.73 [2019-03-28 12:40:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 19.38/8.73 [2019-03-28 12:40:01,352 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 19.38/8.73 [2019-03-28 12:40:01,353 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 19.38/8.73 [2019-03-28 12:40:01,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:01 BoogieIcfgContainer 19.38/8.73 [2019-03-28 12:40:01,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 19.38/8.73 [2019-03-28 12:40:01,355 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 19.38/8.73 [2019-03-28 12:40:01,355 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 19.38/8.73 [2019-03-28 12:40:01,357 INFO L276 PluginConnector]: BlockEncodingV2 initialized 19.38/8.73 [2019-03-28 12:40:01,358 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:01" (1/1) ... 19.38/8.73 [2019-03-28 12:40:01,375 INFO L313 BlockEncoder]: Initial Icfg 15 locations, 17 edges 19.38/8.73 [2019-03-28 12:40:01,377 INFO L258 BlockEncoder]: Using Remove infeasible edges 19.38/8.73 [2019-03-28 12:40:01,378 INFO L263 BlockEncoder]: Using Maximize final states 19.38/8.73 [2019-03-28 12:40:01,379 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 19.38/8.73 [2019-03-28 12:40:01,379 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 19.38/8.73 [2019-03-28 12:40:01,381 INFO L296 BlockEncoder]: Using Remove sink states 19.38/8.73 [2019-03-28 12:40:01,382 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 19.38/8.73 [2019-03-28 12:40:01,382 INFO L179 BlockEncoder]: Using Rewrite not-equals 19.38/8.73 [2019-03-28 12:40:01,398 INFO L185 BlockEncoder]: Using Use SBE 19.38/8.73 [2019-03-28 12:40:01,416 INFO L200 BlockEncoder]: SBE split 3 edges 19.38/8.73 [2019-03-28 12:40:01,421 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 19.38/8.73 [2019-03-28 12:40:01,422 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.38/8.73 [2019-03-28 12:40:01,448 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 19.38/8.73 [2019-03-28 12:40:01,451 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 19.38/8.73 [2019-03-28 12:40:01,452 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 19.38/8.73 [2019-03-28 12:40:01,452 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.38/8.73 [2019-03-28 12:40:01,453 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 19.38/8.73 [2019-03-28 12:40:01,453 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 19.38/8.73 [2019-03-28 12:40:01,453 INFO L313 BlockEncoder]: Encoded RCFG 7 locations, 11 edges 19.38/8.73 [2019-03-28 12:40:01,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:01 BasicIcfg 19.38/8.73 [2019-03-28 12:40:01,454 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 19.38/8.73 [2019-03-28 12:40:01,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 19.38/8.73 [2019-03-28 12:40:01,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... 19.38/8.73 [2019-03-28 12:40:01,459 INFO L276 PluginConnector]: TraceAbstraction initialized 19.38/8.73 [2019-03-28 12:40:01,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:40:00" (1/4) ... 19.38/8.73 [2019-03-28 12:40:01,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378445e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:01, skipping insertion in model container 19.38/8.73 [2019-03-28 12:40:01,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:01" (2/4) ... 19.38/8.73 [2019-03-28 12:40:01,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378445e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:01, skipping insertion in model container 19.38/8.73 [2019-03-28 12:40:01,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:01" (3/4) ... 19.38/8.73 [2019-03-28 12:40:01,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378445e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:01, skipping insertion in model container 19.38/8.73 [2019-03-28 12:40:01,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:01" (4/4) ... 19.38/8.73 [2019-03-28 12:40:01,464 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.38/8.73 [2019-03-28 12:40:01,474 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 19.38/8.73 [2019-03-28 12:40:01,485 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. 19.38/8.73 [2019-03-28 12:40:01,502 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. 19.38/8.73 [2019-03-28 12:40:01,531 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.38/8.73 [2019-03-28 12:40:01,532 INFO L382 AbstractCegarLoop]: Interprodecural is true 19.38/8.73 [2019-03-28 12:40:01,532 INFO L383 AbstractCegarLoop]: Hoare is true 19.38/8.73 [2019-03-28 12:40:01,532 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 19.38/8.73 [2019-03-28 12:40:01,532 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 19.38/8.73 [2019-03-28 12:40:01,533 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.38/8.73 [2019-03-28 12:40:01,533 INFO L387 AbstractCegarLoop]: Difference is false 19.38/8.73 [2019-03-28 12:40:01,533 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 19.38/8.73 [2019-03-28 12:40:01,533 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 19.38/8.73 [2019-03-28 12:40:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. 19.38/8.73 [2019-03-28 12:40:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 19.38/8.73 [2019-03-28 12:40:01,554 INFO L394 BasicCegarLoop]: Found error trace 19.38/8.73 [2019-03-28 12:40:01,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 19.38/8.73 [2019-03-28 12:40:01,555 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 19.38/8.73 [2019-03-28 12:40:01,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:01,560 INFO L82 PathProgramCache]: Analyzing trace with hash 86507541, now seen corresponding path program 1 times 19.38/8.73 [2019-03-28 12:40:01,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.38/8.73 [2019-03-28 12:40:01,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.38/8.73 [2019-03-28 12:40:01,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:01,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:01,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.38/8.73 [2019-03-28 12:40:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.38/8.73 [2019-03-28 12:40:01,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.38/8.73 [2019-03-28 12:40:01,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 19.38/8.73 [2019-03-28 12:40:01,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 19.38/8.73 [2019-03-28 12:40:01,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 19.38/8.73 [2019-03-28 12:40:01,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 19.38/8.73 [2019-03-28 12:40:01,774 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. 19.38/8.73 [2019-03-28 12:40:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.38/8.73 [2019-03-28 12:40:01,838 INFO L93 Difference]: Finished difference Result 8 states and 12 transitions. 19.38/8.73 [2019-03-28 12:40:01,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 19.38/8.73 [2019-03-28 12:40:01,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 19.38/8.73 [2019-03-28 12:40:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.38/8.73 [2019-03-28 12:40:01,852 INFO L225 Difference]: With dead ends: 8 19.38/8.73 [2019-03-28 12:40:01,852 INFO L226 Difference]: Without dead ends: 7 19.38/8.73 [2019-03-28 12:40:01,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 19.38/8.73 [2019-03-28 12:40:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. 19.38/8.73 [2019-03-28 12:40:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. 19.38/8.73 [2019-03-28 12:40:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 19.38/8.73 [2019-03-28 12:40:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. 19.38/8.73 [2019-03-28 12:40:01,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 5 19.38/8.73 [2019-03-28 12:40:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. 19.38/8.73 [2019-03-28 12:40:01,893 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. 19.38/8.73 [2019-03-28 12:40:01,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 19.38/8.73 [2019-03-28 12:40:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. 19.38/8.73 [2019-03-28 12:40:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 19.38/8.73 [2019-03-28 12:40:01,893 INFO L394 BasicCegarLoop]: Found error trace 19.38/8.73 [2019-03-28 12:40:01,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 19.38/8.73 [2019-03-28 12:40:01,894 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 19.38/8.73 [2019-03-28 12:40:01,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:01,894 INFO L82 PathProgramCache]: Analyzing trace with hash 86507543, now seen corresponding path program 1 times 19.38/8.73 [2019-03-28 12:40:01,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.38/8.73 [2019-03-28 12:40:01,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.38/8.73 [2019-03-28 12:40:01,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:01,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:01,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.38/8.73 [2019-03-28 12:40:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.38/8.73 [2019-03-28 12:40:01,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.38/8.73 [2019-03-28 12:40:01,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 19.38/8.73 [2019-03-28 12:40:01,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 19.38/8.73 [2019-03-28 12:40:01,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 19.38/8.73 [2019-03-28 12:40:01,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 19.38/8.73 [2019-03-28 12:40:01,960 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. 19.38/8.73 [2019-03-28 12:40:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.38/8.73 [2019-03-28 12:40:02,004 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. 19.38/8.73 [2019-03-28 12:40:02,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 19.38/8.73 [2019-03-28 12:40:02,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 19.38/8.73 [2019-03-28 12:40:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.38/8.73 [2019-03-28 12:40:02,005 INFO L225 Difference]: With dead ends: 8 19.38/8.73 [2019-03-28 12:40:02,005 INFO L226 Difference]: Without dead ends: 7 19.38/8.73 [2019-03-28 12:40:02,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 19.38/8.73 [2019-03-28 12:40:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. 19.38/8.73 [2019-03-28 12:40:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. 19.38/8.73 [2019-03-28 12:40:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 19.38/8.73 [2019-03-28 12:40:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. 19.38/8.73 [2019-03-28 12:40:02,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 8 transitions. Word has length 5 19.38/8.73 [2019-03-28 12:40:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. 19.38/8.73 [2019-03-28 12:40:02,009 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 8 transitions. 19.38/8.73 [2019-03-28 12:40:02,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 19.38/8.73 [2019-03-28 12:40:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 8 transitions. 19.38/8.73 [2019-03-28 12:40:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 19.38/8.73 [2019-03-28 12:40:02,010 INFO L394 BasicCegarLoop]: Found error trace 19.38/8.73 [2019-03-28 12:40:02,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 19.38/8.73 [2019-03-28 12:40:02,011 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 19.38/8.73 [2019-03-28 12:40:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash 86507544, now seen corresponding path program 1 times 19.38/8.73 [2019-03-28 12:40:02,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.38/8.73 [2019-03-28 12:40:02,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.38/8.73 [2019-03-28 12:40:02,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.38/8.73 [2019-03-28 12:40:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.38/8.73 [2019-03-28 12:40:02,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.38/8.73 [2019-03-28 12:40:02,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 19.38/8.73 [2019-03-28 12:40:02,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 19.38/8.73 [2019-03-28 12:40:02,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 19.38/8.73 [2019-03-28 12:40:02,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 19.38/8.73 [2019-03-28 12:40:02,055 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand 4 states. 19.38/8.73 [2019-03-28 12:40:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.38/8.73 [2019-03-28 12:40:02,096 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. 19.38/8.73 [2019-03-28 12:40:02,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 19.38/8.73 [2019-03-28 12:40:02,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 19.38/8.73 [2019-03-28 12:40:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.38/8.73 [2019-03-28 12:40:02,098 INFO L225 Difference]: With dead ends: 10 19.38/8.73 [2019-03-28 12:40:02,098 INFO L226 Difference]: Without dead ends: 9 19.38/8.73 [2019-03-28 12:40:02,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 19.38/8.73 [2019-03-28 12:40:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. 19.38/8.73 [2019-03-28 12:40:02,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. 19.38/8.73 [2019-03-28 12:40:02,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 19.38/8.73 [2019-03-28 12:40:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. 19.38/8.73 [2019-03-28 12:40:02,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 19.38/8.73 [2019-03-28 12:40:02,102 INFO L84 Accepts]: Finished accepts. word is rejected. 19.38/8.73 [2019-03-28 12:40:02,102 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. 19.38/8.73 [2019-03-28 12:40:02,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 19.38/8.73 [2019-03-28 12:40:02,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. 19.38/8.73 [2019-03-28 12:40:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 19.38/8.73 [2019-03-28 12:40:02,103 INFO L394 BasicCegarLoop]: Found error trace 19.38/8.73 [2019-03-28 12:40:02,103 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] 19.38/8.73 [2019-03-28 12:40:02,104 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 19.38/8.73 [2019-03-28 12:40:02,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:02,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1529377172, now seen corresponding path program 1 times 19.38/8.73 [2019-03-28 12:40:02,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.38/8.73 [2019-03-28 12:40:02,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.38/8.73 [2019-03-28 12:40:02,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.38/8.73 [2019-03-28 12:40:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.38/8.73 [2019-03-28 12:40:02,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 19.38/8.73 [2019-03-28 12:40:02,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 19.38/8.73 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.38/8.73 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 19.38/8.73 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 19.38/8.73 [2019-03-28 12:40:02,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.38/8.73 [2019-03-28 12:40:02,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core 19.38/8.73 [2019-03-28 12:40:02,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.38/8.73 [2019-03-28 12:40:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.38/8.73 [2019-03-28 12:40:02,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 19.38/8.73 [2019-03-28 12:40:02,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 19.38/8.73 [2019-03-28 12:40:02,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 19.38/8.73 [2019-03-28 12:40:02,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 19.38/8.73 [2019-03-28 12:40:02,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 19.38/8.73 [2019-03-28 12:40:02,307 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 8 states. 19.38/8.73 [2019-03-28 12:40:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.38/8.73 [2019-03-28 12:40:02,396 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. 19.38/8.73 [2019-03-28 12:40:02,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 19.38/8.73 [2019-03-28 12:40:02,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 19.38/8.73 [2019-03-28 12:40:02,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.38/8.73 [2019-03-28 12:40:02,397 INFO L225 Difference]: With dead ends: 9 19.38/8.73 [2019-03-28 12:40:02,397 INFO L226 Difference]: Without dead ends: 0 19.38/8.73 [2019-03-28 12:40:02,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 19.38/8.73 [2019-03-28 12:40:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 19.38/8.73 [2019-03-28 12:40:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 19.38/8.73 [2019-03-28 12:40:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 19.38/8.73 [2019-03-28 12:40:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 19.38/8.73 [2019-03-28 12:40:02,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 19.38/8.73 [2019-03-28 12:40:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. 19.38/8.73 [2019-03-28 12:40:02,399 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 19.38/8.73 [2019-03-28 12:40:02,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 19.38/8.73 [2019-03-28 12:40:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 19.38/8.73 [2019-03-28 12:40:02,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 19.38/8.73 [2019-03-28 12:40:02,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 19.38/8.73 [2019-03-28 12:40:02,519 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 19.38/8.73 [2019-03-28 12:40:02,520 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 19.38/8.73 [2019-03-28 12:40:02,539 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 19.38/8.73 [2019-03-28 12:40:02,540 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. 19.38/8.73 [2019-03-28 12:40:02,540 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 22) no Hoare annotation was computed. 19.38/8.73 [2019-03-28 12:40:02,540 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 19.38/8.73 [2019-03-28 12:40:02,540 INFO L444 ceAbstractionStarter]: At program point L10-3(lines 10 14) the Hoare annotation is: (let ((.cse0 (<= (* 4 ULTIMATE.start_sumOfThirdBytes_~array_size) (select |#length| |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|))) (.cse1 (= 1 (select |#valid| |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|))) (.cse2 (= 0 |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset|))) (or (and (<= ULTIMATE.start_sumOfThirdBytes_~p~0.offset (+ |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset| (* 4 ULTIMATE.start_sumOfThirdBytes_~i~0) 2)) .cse0 .cse1 .cse2 (<= 1 ULTIMATE.start_sumOfThirdBytes_~i~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0)))) 19.38/8.73 [2019-03-28 12:40:02,541 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 19.38/8.73 [2019-03-28 12:40:02,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.38/8.73 [2019-03-28 12:40:02,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.38/8.73 [2019-03-28 12:40:02,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.38/8.73 [2019-03-28 12:40:02,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.38/8.73 [2019-03-28 12:40:02,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:02 BasicIcfg 19.38/8.73 [2019-03-28 12:40:02,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 19.38/8.73 [2019-03-28 12:40:02,561 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 19.38/8.73 [2019-03-28 12:40:02,561 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 19.38/8.73 [2019-03-28 12:40:02,564 INFO L276 PluginConnector]: BuchiAutomizer initialized 19.38/8.73 [2019-03-28 12:40:02,565 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.38/8.73 [2019-03-28 12:40:02,565 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:40:00" (1/5) ... 19.38/8.73 [2019-03-28 12:40:02,566 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16cd2302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:40:02, skipping insertion in model container 19.38/8.73 [2019-03-28 12:40:02,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.38/8.73 [2019-03-28 12:40:02,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:01" (2/5) ... 19.38/8.73 [2019-03-28 12:40:02,566 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16cd2302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:40:02, skipping insertion in model container 19.38/8.73 [2019-03-28 12:40:02,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.38/8.73 [2019-03-28 12:40:02,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:01" (3/5) ... 19.38/8.73 [2019-03-28 12:40:02,567 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16cd2302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:02, skipping insertion in model container 19.38/8.73 [2019-03-28 12:40:02,567 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.38/8.73 [2019-03-28 12:40:02,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:01" (4/5) ... 19.38/8.73 [2019-03-28 12:40:02,567 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16cd2302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:02, skipping insertion in model container 19.38/8.73 [2019-03-28 12:40:02,568 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.38/8.73 [2019-03-28 12:40:02,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:02" (5/5) ... 19.38/8.73 [2019-03-28 12:40:02,569 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.38/8.73 [2019-03-28 12:40:02,590 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.38/8.73 [2019-03-28 12:40:02,590 INFO L374 BuchiCegarLoop]: Interprodecural is true 19.38/8.73 [2019-03-28 12:40:02,590 INFO L375 BuchiCegarLoop]: Hoare is true 19.38/8.73 [2019-03-28 12:40:02,590 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 19.38/8.73 [2019-03-28 12:40:02,591 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 19.38/8.73 [2019-03-28 12:40:02,591 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.38/8.73 [2019-03-28 12:40:02,591 INFO L379 BuchiCegarLoop]: Difference is false 19.38/8.73 [2019-03-28 12:40:02,591 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 19.38/8.73 [2019-03-28 12:40:02,591 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 19.38/8.73 [2019-03-28 12:40:02,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. 19.38/8.73 [2019-03-28 12:40:02,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 19.38/8.73 [2019-03-28 12:40:02,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.38/8.73 [2019-03-28 12:40:02,599 INFO L119 BuchiIsEmpty]: Starting construction of run 19.38/8.73 [2019-03-28 12:40:02,603 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 19.38/8.73 [2019-03-28 12:40:02,603 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 19.38/8.73 [2019-03-28 12:40:02,603 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 19.38/8.73 [2019-03-28 12:40:02,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. 19.38/8.73 [2019-03-28 12:40:02,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 19.38/8.73 [2019-03-28 12:40:02,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.38/8.73 [2019-03-28 12:40:02,604 INFO L119 BuchiIsEmpty]: Starting construction of run 19.38/8.73 [2019-03-28 12:40:02,605 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 19.38/8.73 [2019-03-28 12:40:02,605 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 19.38/8.73 [2019-03-28 12:40:02,610 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [61] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_9|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 9#L20true [40] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 7#L20-2true [56] L20-2-->L10-3: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1 0) (= v_ULTIMATE.start_sumOfThirdBytes_~i~0_1 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= v_ULTIMATE.start_sumOfThirdBytes_~array_size_1 |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_1, ULTIMATE.start_sumOfThirdBytes_#in~array_size=|v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_1, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_1, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_1, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|, ULTIMATE.start_sumOfThirdBytes_#res=|v_ULTIMATE.start_sumOfThirdBytes_#res_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~#numbers.offset, ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_#in~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_sumOfThirdBytes_~#numbers.base, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base, ULTIMATE.start_sumOfThirdBytes_#res, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset, ULTIMATE.start_sumOfThirdBytes_~sum~0] 6#L10-3true 19.38/8.73 [2019-03-28 12:40:02,610 INFO L796 eck$LassoCheckResult]: Loop: 6#L10-3true [37] L10-3-->L13: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3 |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|) (< v_ULTIMATE.start_sumOfThirdBytes_~i~0_5 v_ULTIMATE.start_sumOfThirdBytes_~array_size_4) (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3 (+ |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3| (* 4 v_ULTIMATE.start_sumOfThirdBytes_~i~0_5) 2))) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base] 8#L13true [65] L13-->L10-3: Formula: (and (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8 1) (select |v_#length_6| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9)) (= (select |v_#valid_14| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9) 1) (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_11 (+ v_ULTIMATE.start_sumOfThirdBytes_~sum~0_12 (select (select |v_#memory_int_3| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8))) (= (+ v_ULTIMATE.start_sumOfThirdBytes_~i~0_11 1) v_ULTIMATE.start_sumOfThirdBytes_~i~0_10)) InVars {ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_11, #length=|v_#length_6|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_12} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_10, #length=|v_#length_6|, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_4|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_7|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_11} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~sum~0] 6#L10-3true 19.38/8.73 [2019-03-28 12:40:02,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:02,611 INFO L82 PathProgramCache]: Analyzing trace with hash 89708, now seen corresponding path program 1 times 19.38/8.73 [2019-03-28 12:40:02,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.38/8.73 [2019-03-28 12:40:02,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.38/8.73 [2019-03-28 12:40:02,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:02,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:02,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2173, now seen corresponding path program 1 times 19.38/8.73 [2019-03-28 12:40:02,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.38/8.73 [2019-03-28 12:40:02,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.38/8.73 [2019-03-28 12:40:02,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:02,656 INFO L82 PathProgramCache]: Analyzing trace with hash 86210600, now seen corresponding path program 1 times 19.38/8.73 [2019-03-28 12:40:02,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.38/8.73 [2019-03-28 12:40:02,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.38/8.73 [2019-03-28 12:40:02,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:02,871 INFO L216 LassoAnalysis]: Preferences: 19.38/8.73 [2019-03-28 12:40:02,872 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.38/8.73 [2019-03-28 12:40:02,872 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.38/8.73 [2019-03-28 12:40:02,872 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.38/8.73 [2019-03-28 12:40:02,873 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.38/8.73 [2019-03-28 12:40:02,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.38/8.73 [2019-03-28 12:40:02,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.38/8.73 [2019-03-28 12:40:02,873 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.38/8.73 [2019-03-28 12:40:02,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 19.38/8.73 [2019-03-28 12:40:02,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.38/8.73 [2019-03-28 12:40:02,874 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.38/8.73 [2019-03-28 12:40:02,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:02,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:02,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:02,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:02,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:02,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:02,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:02,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:03,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:03,277 INFO L300 LassoAnalysis]: Preprocessing complete. 19.38/8.73 [2019-03-28 12:40:03,283 INFO L497 LassoAnalysis]: Using template 'affine'. 19.38/8.73 [2019-03-28 12:40:03,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:03,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:03,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.38/8.73 [2019-03-28 12:40:03,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:03,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:03,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:03,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:03,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:03,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:03,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:03,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:03,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.38/8.73 [2019-03-28 12:40:03,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:03,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:03,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:03,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:03,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:03,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:03,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:03,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:03,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.38/8.73 [2019-03-28 12:40:03,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:03,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:03,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:03,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:03,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:03,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:03,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:03,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:03,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.38/8.73 [2019-03-28 12:40:03,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:03,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:03,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:03,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:03,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:03,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:03,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:03,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:03,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:03,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:03,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:03,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:03,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:03,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:03,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:03,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:03,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:03,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:03,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:03,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:03,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:03,362 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.38/8.73 [2019-03-28 12:40:03,408 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 19.38/8.73 [2019-03-28 12:40:03,408 INFO L444 ModelExtractionUtils]: 27 out of 37 variables were initially zero. Simplification set additionally 7 variables to zero. 19.38/8.73 [2019-03-28 12:40:03,411 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.38/8.73 [2019-03-28 12:40:03,412 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 19.38/8.73 [2019-03-28 12:40:03,413 INFO L518 LassoAnalysis]: Proved termination. 19.38/8.73 [2019-03-28 12:40:03,414 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.38/8.73 Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 19.38/8.73 Supporting invariants [] 19.38/8.73 [2019-03-28 12:40:03,419 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed 19.38/8.73 [2019-03-28 12:40:03,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.38/8.73 [2019-03-28 12:40:03,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core 19.38/8.73 [2019-03-28 12:40:03,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.38/8.73 [2019-03-28 12:40:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.38/8.73 [2019-03-28 12:40:03,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 19.38/8.73 [2019-03-28 12:40:03,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.38/8.73 [2019-03-28 12:40:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.38/8.73 [2019-03-28 12:40:03,488 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 19.38/8.73 [2019-03-28 12:40:03,491 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 19.38/8.73 [2019-03-28 12:40:03,492 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states. Second operand 3 states. 19.38/8.73 [2019-03-28 12:40:03,529 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states.. Second operand 3 states. Result 15 states and 24 transitions. Complement of second has 4 states. 19.38/8.73 [2019-03-28 12:40:03,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 19.38/8.73 [2019-03-28 12:40:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 19.38/8.73 [2019-03-28 12:40:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. 19.38/8.73 [2019-03-28 12:40:03,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 3 letters. Loop has 2 letters. 19.38/8.73 [2019-03-28 12:40:03,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.38/8.73 [2019-03-28 12:40:03,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 2 letters. 19.38/8.73 [2019-03-28 12:40:03,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.38/8.73 [2019-03-28 12:40:03,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 3 letters. Loop has 4 letters. 19.38/8.73 [2019-03-28 12:40:03,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.38/8.73 [2019-03-28 12:40:03,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 24 transitions. 19.38/8.73 [2019-03-28 12:40:03,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 19.38/8.73 [2019-03-28 12:40:03,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 5 states and 6 transitions. 19.38/8.73 [2019-03-28 12:40:03,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 19.38/8.73 [2019-03-28 12:40:03,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 19.38/8.73 [2019-03-28 12:40:03,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. 19.38/8.73 [2019-03-28 12:40:03,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.38/8.73 [2019-03-28 12:40:03,545 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. 19.38/8.73 [2019-03-28 12:40:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. 19.38/8.73 [2019-03-28 12:40:03,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. 19.38/8.73 [2019-03-28 12:40:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 19.38/8.73 [2019-03-28 12:40:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. 19.38/8.73 [2019-03-28 12:40:03,547 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. 19.38/8.73 [2019-03-28 12:40:03,548 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. 19.38/8.73 [2019-03-28 12:40:03,548 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 19.38/8.73 [2019-03-28 12:40:03,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. 19.38/8.73 [2019-03-28 12:40:03,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 19.38/8.73 [2019-03-28 12:40:03,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.38/8.73 [2019-03-28 12:40:03,548 INFO L119 BuchiIsEmpty]: Starting construction of run 19.38/8.73 [2019-03-28 12:40:03,549 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 19.38/8.73 [2019-03-28 12:40:03,549 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 19.38/8.73 [2019-03-28 12:40:03,550 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_9|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 66#L20 [40] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 69#L20-2 [55] L20-2-->L10-3: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1 0) (= v_ULTIMATE.start_sumOfThirdBytes_~i~0_1 0) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= v_ULTIMATE.start_sumOfThirdBytes_~array_size_1 |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_1, ULTIMATE.start_sumOfThirdBytes_#in~array_size=|v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_1, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_1, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_1, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|, ULTIMATE.start_sumOfThirdBytes_#res=|v_ULTIMATE.start_sumOfThirdBytes_#res_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~#numbers.offset, ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_#in~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_sumOfThirdBytes_~#numbers.base, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base, ULTIMATE.start_sumOfThirdBytes_#res, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset, ULTIMATE.start_sumOfThirdBytes_~sum~0] 67#L10-3 19.38/8.73 [2019-03-28 12:40:03,550 INFO L796 eck$LassoCheckResult]: Loop: 67#L10-3 [37] L10-3-->L13: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3 |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|) (< v_ULTIMATE.start_sumOfThirdBytes_~i~0_5 v_ULTIMATE.start_sumOfThirdBytes_~array_size_4) (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3 (+ |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3| (* 4 v_ULTIMATE.start_sumOfThirdBytes_~i~0_5) 2))) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base] 68#L13 [65] L13-->L10-3: Formula: (and (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8 1) (select |v_#length_6| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9)) (= (select |v_#valid_14| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9) 1) (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_11 (+ v_ULTIMATE.start_sumOfThirdBytes_~sum~0_12 (select (select |v_#memory_int_3| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8))) (= (+ v_ULTIMATE.start_sumOfThirdBytes_~i~0_11 1) v_ULTIMATE.start_sumOfThirdBytes_~i~0_10)) InVars {ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_11, #length=|v_#length_6|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_12} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_10, #length=|v_#length_6|, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_4|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_7|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_11} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~sum~0] 67#L10-3 19.38/8.73 [2019-03-28 12:40:03,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:03,550 INFO L82 PathProgramCache]: Analyzing trace with hash 89707, now seen corresponding path program 1 times 19.38/8.73 [2019-03-28 12:40:03,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.38/8.73 [2019-03-28 12:40:03,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.38/8.73 [2019-03-28 12:40:03,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:03,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:03,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:03,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:03,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2173, now seen corresponding path program 2 times 19.38/8.73 [2019-03-28 12:40:03,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.38/8.73 [2019-03-28 12:40:03,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.38/8.73 [2019-03-28 12:40:03,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:03,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:03,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:03,595 INFO L82 PathProgramCache]: Analyzing trace with hash 86209639, now seen corresponding path program 1 times 19.38/8.73 [2019-03-28 12:40:03,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.38/8.73 [2019-03-28 12:40:03,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.38/8.73 [2019-03-28 12:40:03,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:03,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:03,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:03,754 INFO L216 LassoAnalysis]: Preferences: 19.38/8.73 [2019-03-28 12:40:03,754 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.38/8.73 [2019-03-28 12:40:03,754 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.38/8.73 [2019-03-28 12:40:03,755 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.38/8.73 [2019-03-28 12:40:03,755 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.38/8.73 [2019-03-28 12:40:03,755 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.38/8.73 [2019-03-28 12:40:03,755 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.38/8.73 [2019-03-28 12:40:03,755 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.38/8.73 [2019-03-28 12:40:03,755 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 19.38/8.73 [2019-03-28 12:40:03,755 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.38/8.73 [2019-03-28 12:40:03,755 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.38/8.73 [2019-03-28 12:40:03,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:03,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:03,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:03,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:03,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:03,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:03,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:03,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:03,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:04,027 INFO L300 LassoAnalysis]: Preprocessing complete. 19.38/8.73 [2019-03-28 12:40:04,027 INFO L497 LassoAnalysis]: Using template 'affine'. 19.38/8.73 [2019-03-28 12:40:04,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:04,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:04,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.38/8.73 [2019-03-28 12:40:04,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:04,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:04,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:04,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:04,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:04,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:04,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:04,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:04,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:04,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:04,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:04,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:04,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:04,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:04,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:04,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:04,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:04,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:04,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:04,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:04,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:04,063 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.38/8.73 [2019-03-28 12:40:04,079 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 19.38/8.73 [2019-03-28 12:40:04,079 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. 19.38/8.73 [2019-03-28 12:40:04,079 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.38/8.73 [2019-03-28 12:40:04,081 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 19.38/8.73 [2019-03-28 12:40:04,081 INFO L518 LassoAnalysis]: Proved termination. 19.38/8.73 [2019-03-28 12:40:04,081 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.38/8.73 Ranking function f(ULTIMATE.start_sumOfThirdBytes_~i~0) = -2*ULTIMATE.start_sumOfThirdBytes_~i~0 + 1 19.38/8.73 Supporting invariants [-1*ULTIMATE.start_sumOfThirdBytes_~array_size + 1 >= 0] 19.38/8.73 [2019-03-28 12:40:04,088 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed 19.38/8.73 [2019-03-28 12:40:04,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.38/8.73 [2019-03-28 12:40:04,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core 19.38/8.73 [2019-03-28 12:40:04,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.38/8.73 [2019-03-28 12:40:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.38/8.73 [2019-03-28 12:40:04,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core 19.38/8.73 [2019-03-28 12:40:04,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.38/8.73 [2019-03-28 12:40:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.38/8.73 [2019-03-28 12:40:04,192 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 19.38/8.73 [2019-03-28 12:40:04,193 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates 19.38/8.73 [2019-03-28 12:40:04,193 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 4 states. 19.38/8.73 [2019-03-28 12:40:04,246 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 6 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 14 states and 17 transitions. Complement of second has 10 states. 19.38/8.73 [2019-03-28 12:40:04,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 3 non-accepting loop states 2 accepting loop states 19.38/8.73 [2019-03-28 12:40:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 19.38/8.73 [2019-03-28 12:40:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. 19.38/8.73 [2019-03-28 12:40:04,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 3 letters. Loop has 2 letters. 19.38/8.73 [2019-03-28 12:40:04,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.38/8.73 [2019-03-28 12:40:04,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 5 letters. Loop has 2 letters. 19.38/8.73 [2019-03-28 12:40:04,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.38/8.73 [2019-03-28 12:40:04,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 3 letters. Loop has 4 letters. 19.38/8.73 [2019-03-28 12:40:04,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.38/8.73 [2019-03-28 12:40:04,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. 19.38/8.73 [2019-03-28 12:40:04,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 19.38/8.73 [2019-03-28 12:40:04,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 7 states and 7 transitions. 19.38/8.73 [2019-03-28 12:40:04,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 19.38/8.73 [2019-03-28 12:40:04,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 19.38/8.73 [2019-03-28 12:40:04,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 7 transitions. 19.38/8.73 [2019-03-28 12:40:04,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.38/8.73 [2019-03-28 12:40:04,252 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. 19.38/8.73 [2019-03-28 12:40:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 7 transitions. 19.38/8.73 [2019-03-28 12:40:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 5. 19.38/8.73 [2019-03-28 12:40:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 19.38/8.73 [2019-03-28 12:40:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. 19.38/8.73 [2019-03-28 12:40:04,254 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. 19.38/8.73 [2019-03-28 12:40:04,254 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. 19.38/8.73 [2019-03-28 12:40:04,254 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 19.38/8.73 [2019-03-28 12:40:04,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 5 transitions. 19.38/8.73 [2019-03-28 12:40:04,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 19.38/8.73 [2019-03-28 12:40:04,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.38/8.73 [2019-03-28 12:40:04,255 INFO L119 BuchiIsEmpty]: Starting construction of run 19.38/8.73 [2019-03-28 12:40:04,255 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 19.38/8.73 [2019-03-28 12:40:04,255 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 19.38/8.73 [2019-03-28 12:40:04,255 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_9|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 150#L20 [50] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 153#L20-2 [55] L20-2-->L10-3: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1 0) (= v_ULTIMATE.start_sumOfThirdBytes_~i~0_1 0) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= v_ULTIMATE.start_sumOfThirdBytes_~array_size_1 |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_1, ULTIMATE.start_sumOfThirdBytes_#in~array_size=|v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_1, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_1, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_1, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|, ULTIMATE.start_sumOfThirdBytes_#res=|v_ULTIMATE.start_sumOfThirdBytes_#res_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~#numbers.offset, ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_#in~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_sumOfThirdBytes_~#numbers.base, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base, ULTIMATE.start_sumOfThirdBytes_#res, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset, ULTIMATE.start_sumOfThirdBytes_~sum~0] 151#L10-3 19.38/8.73 [2019-03-28 12:40:04,256 INFO L796 eck$LassoCheckResult]: Loop: 151#L10-3 [37] L10-3-->L13: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3 |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|) (< v_ULTIMATE.start_sumOfThirdBytes_~i~0_5 v_ULTIMATE.start_sumOfThirdBytes_~array_size_4) (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3 (+ |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3| (* 4 v_ULTIMATE.start_sumOfThirdBytes_~i~0_5) 2))) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base] 152#L13 [65] L13-->L10-3: Formula: (and (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8 1) (select |v_#length_6| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9)) (= (select |v_#valid_14| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9) 1) (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_11 (+ v_ULTIMATE.start_sumOfThirdBytes_~sum~0_12 (select (select |v_#memory_int_3| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8))) (= (+ v_ULTIMATE.start_sumOfThirdBytes_~i~0_11 1) v_ULTIMATE.start_sumOfThirdBytes_~i~0_10)) InVars {ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_11, #length=|v_#length_6|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_12} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_10, #length=|v_#length_6|, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_4|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_7|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_11} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~sum~0] 151#L10-3 19.38/8.73 [2019-03-28 12:40:04,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:04,256 INFO L82 PathProgramCache]: Analyzing trace with hash 90017, now seen corresponding path program 1 times 19.38/8.73 [2019-03-28 12:40:04,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.38/8.73 [2019-03-28 12:40:04,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.38/8.73 [2019-03-28 12:40:04,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:04,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:04,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:04,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2173, now seen corresponding path program 3 times 19.38/8.73 [2019-03-28 12:40:04,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.38/8.73 [2019-03-28 12:40:04,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.38/8.73 [2019-03-28 12:40:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:04,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:04,277 INFO L82 PathProgramCache]: Analyzing trace with hash 86507549, now seen corresponding path program 1 times 19.38/8.73 [2019-03-28 12:40:04,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.38/8.73 [2019-03-28 12:40:04,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.38/8.73 [2019-03-28 12:40:04,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:04,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:04,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.38/8.73 [2019-03-28 12:40:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.38/8.73 [2019-03-28 12:40:04,441 INFO L216 LassoAnalysis]: Preferences: 19.38/8.73 [2019-03-28 12:40:04,442 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.38/8.73 [2019-03-28 12:40:04,442 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.38/8.73 [2019-03-28 12:40:04,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.38/8.73 [2019-03-28 12:40:04,442 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.38/8.73 [2019-03-28 12:40:04,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.38/8.73 [2019-03-28 12:40:04,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.38/8.73 [2019-03-28 12:40:04,442 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.38/8.73 [2019-03-28 12:40:04,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 19.38/8.73 [2019-03-28 12:40:04,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.38/8.73 [2019-03-28 12:40:04,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.38/8.73 [2019-03-28 12:40:04,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:04,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:04,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:04,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:04,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:04,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:04,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:04,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:04,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.38/8.73 [2019-03-28 12:40:04,754 INFO L300 LassoAnalysis]: Preprocessing complete. 19.38/8.73 [2019-03-28 12:40:04,754 INFO L497 LassoAnalysis]: Using template 'affine'. 19.38/8.73 [2019-03-28 12:40:04,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:04,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:04,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.38/8.73 [2019-03-28 12:40:04,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:04,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:04,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:04,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:04,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:04,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:04,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:04,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:04,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:04,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:04,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:04,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:04,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:04,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:04,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:04,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:04,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.38/8.73 [2019-03-28 12:40:04,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:04,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:04,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:04,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:04,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:04,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:04,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:04,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:04,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.38/8.73 [2019-03-28 12:40:04,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:04,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:04,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:04,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:04,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:04,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:04,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:04,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:04,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:04,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:04,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:04,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:04,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:04,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:04,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:04,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:04,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.38/8.73 [2019-03-28 12:40:04,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:04,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:04,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:04,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:04,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:04,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:04,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:04,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:04,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.38/8.73 [2019-03-28 12:40:04,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:04,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:04,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:04,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:04,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:04,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:04,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:04,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:04,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:04,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:04,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:04,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:04,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:04,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.38/8.73 [2019-03-28 12:40:04,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.38/8.73 Termination analysis: LINEAR_WITH_GUESSES 19.38/8.73 Number of strict supporting invariants: 0 19.38/8.73 Number of non-strict supporting invariants: 1 19.38/8.73 Consider only non-deceasing supporting invariants: true 19.38/8.73 Simplify termination arguments: true 19.38/8.73 Simplify supporting invariants: trueOverapproximate stem: false 19.38/8.73 [2019-03-28 12:40:04,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.38/8.73 [2019-03-28 12:40:04,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.38/8.73 [2019-03-28 12:40:04,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.38/8.73 [2019-03-28 12:40:04,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.38/8.73 [2019-03-28 12:40:04,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.38/8.73 [2019-03-28 12:40:04,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.38/8.73 [2019-03-28 12:40:04,807 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.38/8.73 [2019-03-28 12:40:04,821 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 19.38/8.73 [2019-03-28 12:40:04,821 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. 19.38/8.73 [2019-03-28 12:40:04,821 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.38/8.73 [2019-03-28 12:40:04,823 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 19.38/8.73 [2019-03-28 12:40:04,823 INFO L518 LassoAnalysis]: Proved termination. 19.38/8.73 [2019-03-28 12:40:04,823 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.38/8.73 Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 19.38/8.73 Supporting invariants [] 19.38/8.73 [2019-03-28 12:40:04,826 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed 19.38/8.73 [2019-03-28 12:40:04,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.38/8.73 [2019-03-28 12:40:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.38/8.73 [2019-03-28 12:40:04,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core 19.38/8.73 [2019-03-28 12:40:04,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.38/8.73 [2019-03-28 12:40:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.38/8.73 [2019-03-28 12:40:04,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 19.38/8.73 [2019-03-28 12:40:04,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.38/8.73 [2019-03-28 12:40:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.38/8.73 [2019-03-28 12:40:04,881 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 19.38/8.73 [2019-03-28 12:40:04,881 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 19.38/8.73 [2019-03-28 12:40:04,881 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1 Second operand 3 states. 19.38/8.73 [2019-03-28 12:40:04,892 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1. Second operand 3 states. Result 7 states and 8 transitions. Complement of second has 4 states. 19.38/8.73 [2019-03-28 12:40:04,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 19.38/8.73 [2019-03-28 12:40:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 19.38/8.73 [2019-03-28 12:40:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. 19.38/8.73 [2019-03-28 12:40:04,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 2 letters. 19.38/8.73 [2019-03-28 12:40:04,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.38/8.73 [2019-03-28 12:40:04,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. 19.38/8.73 [2019-03-28 12:40:04,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.38/8.73 [2019-03-28 12:40:04,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 4 letters. 19.38/8.73 [2019-03-28 12:40:04,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.38/8.73 [2019-03-28 12:40:04,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. 19.38/8.73 [2019-03-28 12:40:04,896 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.38/8.73 [2019-03-28 12:40:04,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 0 states and 0 transitions. 19.38/8.73 [2019-03-28 12:40:04,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 19.38/8.73 [2019-03-28 12:40:04,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 19.38/8.73 [2019-03-28 12:40:04,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 19.38/8.73 [2019-03-28 12:40:04,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.38/8.73 [2019-03-28 12:40:04,897 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.38/8.73 [2019-03-28 12:40:04,897 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.38/8.73 [2019-03-28 12:40:04,897 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.38/8.73 [2019-03-28 12:40:04,897 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 19.38/8.73 [2019-03-28 12:40:04,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 19.38/8.73 [2019-03-28 12:40:04,897 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.38/8.73 [2019-03-28 12:40:04,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 19.38/8.73 [2019-03-28 12:40:04,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:04 BasicIcfg 19.38/8.73 [2019-03-28 12:40:04,904 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 19.38/8.73 [2019-03-28 12:40:04,904 INFO L168 Benchmark]: Toolchain (without parser) took 4173.97 ms. Allocated memory was 649.6 MB in the beginning and 746.6 MB in the end (delta: 97.0 MB). Free memory was 563.8 MB in the beginning and 433.6 MB in the end (delta: 130.2 MB). Peak memory consumption was 227.2 MB. Max. memory is 50.3 GB. 19.38/8.73 [2019-03-28 12:40:04,906 INFO L168 Benchmark]: CDTParser took 0.16 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. 19.38/8.73 [2019-03-28 12:40:04,907 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.65 ms. Allocated memory was 649.6 MB in the beginning and 665.3 MB in the end (delta: 15.7 MB). Free memory was 563.8 MB in the beginning and 632.9 MB in the end (delta: -69.1 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 19.38/8.73 [2019-03-28 12:40:04,907 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.12 ms. Allocated memory is still 665.3 MB. Free memory was 631.6 MB in the beginning and 628.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 19.38/8.73 [2019-03-28 12:40:04,908 INFO L168 Benchmark]: Boogie Preprocessor took 24.35 ms. Allocated memory is still 665.3 MB. Free memory was 628.5 MB in the beginning and 627.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 19.38/8.73 [2019-03-28 12:40:04,908 INFO L168 Benchmark]: RCFGBuilder took 245.87 ms. Allocated memory is still 665.3 MB. Free memory was 627.1 MB in the beginning and 609.1 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 50.3 GB. 19.38/8.73 [2019-03-28 12:40:04,909 INFO L168 Benchmark]: BlockEncodingV2 took 99.60 ms. Allocated memory is still 665.3 MB. Free memory was 609.1 MB in the beginning and 602.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 50.3 GB. 19.38/8.73 [2019-03-28 12:40:04,910 INFO L168 Benchmark]: TraceAbstraction took 1104.71 ms. Allocated memory is still 665.3 MB. Free memory was 602.3 MB in the beginning and 513.3 MB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 50.3 GB. 19.38/8.73 [2019-03-28 12:40:04,910 INFO L168 Benchmark]: BuchiAutomizer took 2343.22 ms. Allocated memory was 665.3 MB in the beginning and 746.6 MB in the end (delta: 81.3 MB). Free memory was 513.3 MB in the beginning and 433.6 MB in the end (delta: 79.7 MB). Peak memory consumption was 161.0 MB. Max. memory is 50.3 GB. 19.38/8.73 [2019-03-28 12:40:04,914 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 19.38/8.73 --- Results --- 19.38/8.73 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 19.38/8.73 - StatisticsResult: Initial Icfg 19.38/8.73 15 locations, 17 edges 19.38/8.73 - StatisticsResult: Encoded RCFG 19.38/8.73 7 locations, 11 edges 19.38/8.73 * Results from de.uni_freiburg.informatik.ultimate.core: 19.38/8.73 - StatisticsResult: Toolchain Benchmarks 19.38/8.73 Benchmark results are: 19.38/8.73 * CDTParser took 0.16 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. 19.38/8.73 * CACSL2BoogieTranslator took 311.65 ms. Allocated memory was 649.6 MB in the beginning and 665.3 MB in the end (delta: 15.7 MB). Free memory was 563.8 MB in the beginning and 632.9 MB in the end (delta: -69.1 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 19.38/8.73 * Boogie Procedure Inliner took 39.12 ms. Allocated memory is still 665.3 MB. Free memory was 631.6 MB in the beginning and 628.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 19.38/8.73 * Boogie Preprocessor took 24.35 ms. Allocated memory is still 665.3 MB. Free memory was 628.5 MB in the beginning and 627.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 19.38/8.73 * RCFGBuilder took 245.87 ms. Allocated memory is still 665.3 MB. Free memory was 627.1 MB in the beginning and 609.1 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 50.3 GB. 19.38/8.73 * BlockEncodingV2 took 99.60 ms. Allocated memory is still 665.3 MB. Free memory was 609.1 MB in the beginning and 602.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 50.3 GB. 19.38/8.73 * TraceAbstraction took 1104.71 ms. Allocated memory is still 665.3 MB. Free memory was 602.3 MB in the beginning and 513.3 MB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 50.3 GB. 19.38/8.73 * BuchiAutomizer took 2343.22 ms. Allocated memory was 665.3 MB in the beginning and 746.6 MB in the end (delta: 81.3 MB). Free memory was 513.3 MB in the beginning and 433.6 MB in the end (delta: 79.7 MB). Peak memory consumption was 161.0 MB. Max. memory is 50.3 GB. 19.38/8.73 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 19.38/8.73 - GenericResult: Unfinished Backtranslation 19.38/8.73 unknown boogie variable #length 19.38/8.73 - GenericResult: Unfinished Backtranslation 19.38/8.73 unknown boogie variable #length 19.38/8.73 - GenericResult: Unfinished Backtranslation 19.38/8.73 unknown boogie variable #length 19.38/8.73 - GenericResult: Unfinished Backtranslation 19.38/8.73 unknown boogie variable #length 19.38/8.73 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 19.38/8.73 - PositiveResult [Line: 13]: pointer dereference always succeeds 19.38/8.73 For all program executions holds that pointer dereference always succeeds at this location 19.38/8.73 - PositiveResult [Line: 13]: pointer dereference always succeeds 19.38/8.73 For all program executions holds that pointer dereference always succeeds at this location 19.38/8.73 - AllSpecificationsHoldResult: All specifications hold 19.38/8.73 2 specifications checked. All of them hold 19.38/8.73 - InvariantResult [Line: 10]: Loop Invariant 19.38/8.73 [2019-03-28 12:40:04,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.38/8.73 [2019-03-28 12:40:04,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.38/8.73 [2019-03-28 12:40:04,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.38/8.73 [2019-03-28 12:40:04,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.38/8.73 Derived loop invariant: ((((p <= numbers + 4 * i + 2 && 4 * array_size <= unknown-#length-unknown[numbers]) && 1 == \valid[numbers]) && 0 == numbers) && 1 <= i) || (((4 * array_size <= unknown-#length-unknown[numbers] && 1 == \valid[numbers]) && 0 == numbers) && 0 == i) 19.38/8.73 - StatisticsResult: Ultimate Automizer benchmark data 19.38/8.73 CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 1.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 9 SDtfs, 13 SDslu, 29 SDs, 0 SdLazy, 62 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 47 HoareAnnotationTreeSize, 1 FomulaSimplifications, 283 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 51 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 24 ConstructedInterpolants, 1 QuantifiedInterpolants, 512 SizeOfPredicates, 5 NumberOfNonLiveVariables, 55 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 19.38/8.73 - StatisticsResult: Constructed decomposition of program 19.38/8.73 Your program was decomposed into 3 terminating modules (0 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 1 and consists of 7 locations. One nondeterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. 19.38/8.73 - StatisticsResult: Timing statistics 19.38/8.73 BüchiAutomizer plugin needed 2.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 5 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 37 SDslu, 6 SDs, 0 SdLazy, 47 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital118 mio100 ax100 hnf100 lsp94 ukn80 mio100 lsp61 div100 bol100 ite100 ukn100 eq193 hnf90 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 19.38/8.73 - TerminationAnalysisResult: Termination proven 19.38/8.73 Buchi Automizer proved that your program is terminating 19.38/8.73 RESULT: Ultimate proved your program to be correct! 19.38/8.73 !SESSION 2019-03-28 12:39:57.459 ----------------------------------------------- 19.38/8.73 eclipse.buildId=unknown 19.38/8.73 java.version=1.8.0_181 19.38/8.73 java.vendor=Oracle Corporation 19.38/8.73 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 19.38/8.73 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 19.38/8.73 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 19.38/8.73 19.38/8.73 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:40:05.148 19.38/8.73 !MESSAGE The workspace will exit with unsaved changes in this session. 19.38/8.73 Received shutdown request... 19.38/8.73 Ultimate: 19.38/8.73 GTK+ Version Check 19.38/8.73 EOF