100.36/76.95 YES 100.36/76.95 100.36/76.95 Ultimate: Cannot open display: 100.36/76.95 This is Ultimate 0.1.24-8dc7c08-m 100.36/76.95 [2019-03-28 12:45:00,759 INFO L170 SettingsManager]: Resetting all preferences to default values... 100.36/76.95 [2019-03-28 12:45:00,761 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 100.36/76.95 [2019-03-28 12:45:00,773 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 100.36/76.95 [2019-03-28 12:45:00,773 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 100.36/76.95 [2019-03-28 12:45:00,774 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 100.36/76.95 [2019-03-28 12:45:00,775 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 100.36/76.95 [2019-03-28 12:45:00,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 100.36/76.95 [2019-03-28 12:45:00,778 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 100.36/76.95 [2019-03-28 12:45:00,779 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 100.36/76.95 [2019-03-28 12:45:00,780 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 100.36/76.95 [2019-03-28 12:45:00,780 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 100.36/76.95 [2019-03-28 12:45:00,781 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 100.36/76.95 [2019-03-28 12:45:00,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 100.36/76.95 [2019-03-28 12:45:00,783 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 100.36/76.95 [2019-03-28 12:45:00,784 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 100.36/76.95 [2019-03-28 12:45:00,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 100.36/76.95 [2019-03-28 12:45:00,786 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 100.36/76.95 [2019-03-28 12:45:00,788 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 100.36/76.95 [2019-03-28 12:45:00,790 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 100.36/76.95 [2019-03-28 12:45:00,791 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 100.36/76.95 [2019-03-28 12:45:00,792 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 100.36/76.95 [2019-03-28 12:45:00,794 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 100.36/76.95 [2019-03-28 12:45:00,794 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 100.36/76.95 [2019-03-28 12:45:00,794 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 100.36/76.95 [2019-03-28 12:45:00,795 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 100.36/76.95 [2019-03-28 12:45:00,796 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 100.36/76.95 [2019-03-28 12:45:00,797 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 100.36/76.95 [2019-03-28 12:45:00,797 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 100.36/76.95 [2019-03-28 12:45:00,797 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 100.36/76.95 [2019-03-28 12:45:00,798 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 100.36/76.95 [2019-03-28 12:45:00,799 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 100.36/76.95 [2019-03-28 12:45:00,800 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 100.36/76.95 [2019-03-28 12:45:00,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 100.36/76.95 [2019-03-28 12:45:00,801 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 100.36/76.95 [2019-03-28 12:45:00,801 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 100.36/76.95 [2019-03-28 12:45:00,801 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 100.36/76.95 [2019-03-28 12:45:00,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 100.36/76.95 [2019-03-28 12:45:00,803 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 100.36/76.95 [2019-03-28 12:45:00,803 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 100.36/76.95 [2019-03-28 12:45:00,818 INFO L110 SettingsManager]: Loading preferences was successful 100.36/76.95 [2019-03-28 12:45:00,818 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 100.36/76.95 [2019-03-28 12:45:00,819 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 100.36/76.95 [2019-03-28 12:45:00,820 INFO L133 SettingsManager]: * Rewrite not-equals=true 100.36/76.95 [2019-03-28 12:45:00,820 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 100.36/76.95 [2019-03-28 12:45:00,820 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 100.36/76.95 [2019-03-28 12:45:00,820 INFO L133 SettingsManager]: * Use SBE=true 100.36/76.95 [2019-03-28 12:45:00,820 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 100.36/76.95 [2019-03-28 12:45:00,820 INFO L133 SettingsManager]: * Use old map elimination=false 100.36/76.95 [2019-03-28 12:45:00,821 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 100.36/76.95 [2019-03-28 12:45:00,821 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 100.36/76.95 [2019-03-28 12:45:00,821 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 100.36/76.95 [2019-03-28 12:45:00,821 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 100.36/76.95 [2019-03-28 12:45:00,821 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 100.36/76.95 [2019-03-28 12:45:00,821 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 100.36/76.95 [2019-03-28 12:45:00,822 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 100.36/76.95 [2019-03-28 12:45:00,822 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 100.36/76.95 [2019-03-28 12:45:00,822 INFO L133 SettingsManager]: * Check division by zero=IGNORE 100.36/76.95 [2019-03-28 12:45:00,822 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 100.36/76.95 [2019-03-28 12:45:00,822 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 100.36/76.95 [2019-03-28 12:45:00,823 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 100.36/76.95 [2019-03-28 12:45:00,823 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 100.36/76.95 [2019-03-28 12:45:00,823 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 100.36/76.95 [2019-03-28 12:45:00,823 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 100.36/76.95 [2019-03-28 12:45:00,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 100.36/76.95 [2019-03-28 12:45:00,824 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 100.36/76.95 [2019-03-28 12:45:00,824 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 100.36/76.95 [2019-03-28 12:45:00,824 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 100.36/76.95 [2019-03-28 12:45:00,824 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 100.36/76.95 [2019-03-28 12:45:00,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 100.36/76.95 [2019-03-28 12:45:00,864 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 100.36/76.95 [2019-03-28 12:45:00,868 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 100.36/76.95 [2019-03-28 12:45:00,869 INFO L271 PluginConnector]: Initializing CDTParser... 100.36/76.95 [2019-03-28 12:45:00,870 INFO L276 PluginConnector]: CDTParser initialized 100.36/76.95 [2019-03-28 12:45:00,871 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 100.36/76.95 [2019-03-28 12:45:00,971 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/c894ced989f44724886b0f6e84e4d2f2/FLAG89a6e280b 100.36/76.95 [2019-03-28 12:45:01,315 INFO L307 CDTParser]: Found 1 translation units. 100.36/76.95 [2019-03-28 12:45:01,315 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 100.36/76.95 [2019-03-28 12:45:01,316 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 100.36/76.95 [2019-03-28 12:45:01,322 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/c894ced989f44724886b0f6e84e4d2f2/FLAG89a6e280b 100.36/76.95 [2019-03-28 12:45:01,719 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/c894ced989f44724886b0f6e84e4d2f2 100.36/76.95 [2019-03-28 12:45:01,731 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 100.36/76.95 [2019-03-28 12:45:01,732 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 100.36/76.95 [2019-03-28 12:45:01,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 100.36/76.95 [2019-03-28 12:45:01,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 100.36/76.95 [2019-03-28 12:45:01,737 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 100.36/76.95 [2019-03-28 12:45:01,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:01" (1/1) ... 100.36/76.95 [2019-03-28 12:45:01,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8990e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:01, skipping insertion in model container 100.36/76.95 [2019-03-28 12:45:01,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:01" (1/1) ... 100.36/76.95 [2019-03-28 12:45:01,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 100.36/76.95 [2019-03-28 12:45:01,768 INFO L176 MainTranslator]: Built tables and reachable declarations 100.36/76.95 [2019-03-28 12:45:01,932 INFO L206 PostProcessor]: Analyzing one entry point: main 100.36/76.95 [2019-03-28 12:45:01,944 INFO L191 MainTranslator]: Completed pre-run 100.36/76.95 [2019-03-28 12:45:02,017 INFO L206 PostProcessor]: Analyzing one entry point: main 100.36/76.95 [2019-03-28 12:45:02,033 INFO L195 MainTranslator]: Completed translation 100.36/76.95 [2019-03-28 12:45:02,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02 WrapperNode 100.36/76.95 [2019-03-28 12:45:02,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 100.36/76.95 [2019-03-28 12:45:02,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 100.36/76.95 [2019-03-28 12:45:02,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 100.36/76.95 [2019-03-28 12:45:02,035 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 100.36/76.95 [2019-03-28 12:45:02,045 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:45:02" (1/1) ... 100.36/76.95 [2019-03-28 12:45:02,054 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:45:02" (1/1) ... 100.36/76.95 [2019-03-28 12:45:02,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 100.36/76.95 [2019-03-28 12:45:02,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 100.36/76.95 [2019-03-28 12:45:02,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 100.36/76.95 [2019-03-28 12:45:02,077 INFO L276 PluginConnector]: Boogie Preprocessor initialized 100.36/76.95 [2019-03-28 12:45:02,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 100.36/76.95 [2019-03-28 12:45:02,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 100.36/76.95 [2019-03-28 12:45:02,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 100.36/76.95 [2019-03-28 12:45:02,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 100.36/76.95 [2019-03-28 12:45:02,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 100.36/76.95 [2019-03-28 12:45:02,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 100.36/76.95 [2019-03-28 12:45:02,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 100.36/76.95 [2019-03-28 12:45:02,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 100.36/76.95 [2019-03-28 12:45:02,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 100.36/76.95 [2019-03-28 12:45:02,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... 100.36/76.95 [2019-03-28 12:45:02,102 INFO L276 PluginConnector]: RCFGBuilder initialized 100.36/76.95 [2019-03-28 12:45:02,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 100.36/76.95 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 100.36/76.95 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 100.36/76.95 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 100.36/76.95 [2019-03-28 12:45:02,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 100.36/76.95 [2019-03-28 12:45:02,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 100.36/76.95 [2019-03-28 12:45:02,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 100.36/76.95 [2019-03-28 12:45:02,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 100.36/76.95 [2019-03-28 12:45:02,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 100.36/76.95 [2019-03-28 12:45:02,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 100.36/76.95 [2019-03-28 12:45:02,440 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 100.36/76.95 [2019-03-28 12:45:02,440 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 100.36/76.95 [2019-03-28 12:45:02,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:02 BoogieIcfgContainer 100.36/76.95 [2019-03-28 12:45:02,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 100.36/76.95 [2019-03-28 12:45:02,442 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 100.36/76.95 [2019-03-28 12:45:02,443 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 100.36/76.95 [2019-03-28 12:45:02,445 INFO L276 PluginConnector]: BlockEncodingV2 initialized 100.36/76.95 [2019-03-28 12:45:02,445 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:02" (1/1) ... 100.36/76.95 [2019-03-28 12:45:02,464 INFO L313 BlockEncoder]: Initial Icfg 50 locations, 53 edges 100.36/76.95 [2019-03-28 12:45:02,466 INFO L258 BlockEncoder]: Using Remove infeasible edges 100.36/76.95 [2019-03-28 12:45:02,466 INFO L263 BlockEncoder]: Using Maximize final states 100.36/76.95 [2019-03-28 12:45:02,467 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 100.36/76.95 [2019-03-28 12:45:02,467 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 100.36/76.95 [2019-03-28 12:45:02,469 INFO L296 BlockEncoder]: Using Remove sink states 100.36/76.95 [2019-03-28 12:45:02,470 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 100.36/76.95 [2019-03-28 12:45:02,470 INFO L179 BlockEncoder]: Using Rewrite not-equals 100.36/76.95 [2019-03-28 12:45:02,498 INFO L185 BlockEncoder]: Using Use SBE 100.36/76.95 [2019-03-28 12:45:02,537 INFO L200 BlockEncoder]: SBE split 28 edges 100.36/76.95 [2019-03-28 12:45:02,542 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 100.36/76.95 [2019-03-28 12:45:02,544 INFO L71 MaximizeFinalStates]: 0 new accepting states 100.36/76.95 [2019-03-28 12:45:02,566 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 100.36/76.95 [2019-03-28 12:45:02,569 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 100.36/76.95 [2019-03-28 12:45:02,571 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 100.36/76.95 [2019-03-28 12:45:02,571 INFO L71 MaximizeFinalStates]: 0 new accepting states 100.36/76.95 [2019-03-28 12:45:02,572 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 100.36/76.95 [2019-03-28 12:45:02,572 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 100.36/76.95 [2019-03-28 12:45:02,573 INFO L313 BlockEncoder]: Encoded RCFG 43 locations, 78 edges 100.36/76.95 [2019-03-28 12:45:02,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:02 BasicIcfg 100.36/76.95 [2019-03-28 12:45:02,573 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 100.36/76.95 [2019-03-28 12:45:02,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 100.36/76.95 [2019-03-28 12:45:02,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... 100.36/76.95 [2019-03-28 12:45:02,578 INFO L276 PluginConnector]: TraceAbstraction initialized 100.36/76.95 [2019-03-28 12:45:02,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:45:01" (1/4) ... 100.36/76.95 [2019-03-28 12:45:02,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2dac6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:02, skipping insertion in model container 100.36/76.95 [2019-03-28 12:45:02,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (2/4) ... 100.36/76.95 [2019-03-28 12:45:02,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2dac6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:02, skipping insertion in model container 100.36/76.95 [2019-03-28 12:45:02,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:02" (3/4) ... 100.36/76.95 [2019-03-28 12:45:02,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2dac6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:02, skipping insertion in model container 100.36/76.95 [2019-03-28 12:45:02,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:02" (4/4) ... 100.36/76.95 [2019-03-28 12:45:02,583 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 100.36/76.95 [2019-03-28 12:45:02,595 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 100.36/76.95 [2019-03-28 12:45:02,603 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. 100.36/76.95 [2019-03-28 12:45:02,620 INFO L257 AbstractCegarLoop]: Starting to check reachability of 24 error locations. 100.36/76.95 [2019-03-28 12:45:02,649 INFO L133 ementStrategyFactory]: Using default assertion order modulation 100.36/76.95 [2019-03-28 12:45:02,650 INFO L382 AbstractCegarLoop]: Interprodecural is true 100.36/76.95 [2019-03-28 12:45:02,650 INFO L383 AbstractCegarLoop]: Hoare is true 100.36/76.95 [2019-03-28 12:45:02,650 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 100.36/76.95 [2019-03-28 12:45:02,651 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 100.36/76.95 [2019-03-28 12:45:02,651 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 100.36/76.95 [2019-03-28 12:45:02,651 INFO L387 AbstractCegarLoop]: Difference is false 100.36/76.95 [2019-03-28 12:45:02,651 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 100.36/76.95 [2019-03-28 12:45:02,651 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 100.36/76.95 [2019-03-28 12:45:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. 100.36/76.95 [2019-03-28 12:45:02,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 100.36/76.95 [2019-03-28 12:45:02,673 INFO L394 BasicCegarLoop]: Found error trace 100.36/76.95 [2019-03-28 12:45:02,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 100.36/76.95 [2019-03-28 12:45:02,675 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 100.36/76.95 [2019-03-28 12:45:02,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:02,681 INFO L82 PathProgramCache]: Analyzing trace with hash 120441, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:02,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:02,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:02,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:02,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:02,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.95 [2019-03-28 12:45:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.95 [2019-03-28 12:45:02,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.36/76.95 [2019-03-28 12:45:02,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 100.36/76.95 [2019-03-28 12:45:02,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.36/76.95 [2019-03-28 12:45:02,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.36/76.95 [2019-03-28 12:45:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:02,893 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. 100.36/76.95 [2019-03-28 12:45:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.36/76.95 [2019-03-28 12:45:03,080 INFO L93 Difference]: Finished difference Result 43 states and 78 transitions. 100.36/76.95 [2019-03-28 12:45:03,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 100.36/76.95 [2019-03-28 12:45:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.36/76.95 [2019-03-28 12:45:03,096 INFO L225 Difference]: With dead ends: 43 100.36/76.95 [2019-03-28 12:45:03,096 INFO L226 Difference]: Without dead ends: 38 100.36/76.95 [2019-03-28 12:45:03,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. 100.36/76.95 [2019-03-28 12:45:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. 100.36/76.95 [2019-03-28 12:45:03,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. 100.36/76.95 [2019-03-28 12:45:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 68 transitions. 100.36/76.95 [2019-03-28 12:45:03,142 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 68 transitions. Word has length 3 100.36/76.95 [2019-03-28 12:45:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. 100.36/76.95 [2019-03-28 12:45:03,143 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 68 transitions. 100.36/76.95 [2019-03-28 12:45:03,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 68 transitions. 100.36/76.95 [2019-03-28 12:45:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 100.36/76.95 [2019-03-28 12:45:03,144 INFO L394 BasicCegarLoop]: Found error trace 100.36/76.95 [2019-03-28 12:45:03,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 100.36/76.95 [2019-03-28 12:45:03,144 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 100.36/76.95 [2019-03-28 12:45:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:03,145 INFO L82 PathProgramCache]: Analyzing trace with hash 120443, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:03,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:03,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:03,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.95 [2019-03-28 12:45:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.95 [2019-03-28 12:45:03,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.36/76.95 [2019-03-28 12:45:03,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 100.36/76.95 [2019-03-28 12:45:03,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.36/76.95 [2019-03-28 12:45:03,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.36/76.95 [2019-03-28 12:45:03,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,192 INFO L87 Difference]: Start difference. First operand 38 states and 68 transitions. Second operand 3 states. 100.36/76.95 [2019-03-28 12:45:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.36/76.95 [2019-03-28 12:45:03,311 INFO L93 Difference]: Finished difference Result 38 states and 68 transitions. 100.36/76.95 [2019-03-28 12:45:03,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 100.36/76.95 [2019-03-28 12:45:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.36/76.95 [2019-03-28 12:45:03,312 INFO L225 Difference]: With dead ends: 38 100.36/76.95 [2019-03-28 12:45:03,313 INFO L226 Difference]: Without dead ends: 33 100.36/76.95 [2019-03-28 12:45:03,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. 100.36/76.95 [2019-03-28 12:45:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. 100.36/76.95 [2019-03-28 12:45:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 100.36/76.95 [2019-03-28 12:45:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 58 transitions. 100.36/76.95 [2019-03-28 12:45:03,319 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 58 transitions. Word has length 3 100.36/76.95 [2019-03-28 12:45:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. 100.36/76.95 [2019-03-28 12:45:03,319 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 58 transitions. 100.36/76.95 [2019-03-28 12:45:03,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 58 transitions. 100.36/76.95 [2019-03-28 12:45:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 100.36/76.95 [2019-03-28 12:45:03,320 INFO L394 BasicCegarLoop]: Found error trace 100.36/76.95 [2019-03-28 12:45:03,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:03,320 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 100.36/76.95 [2019-03-28 12:45:03,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:03,321 INFO L82 PathProgramCache]: Analyzing trace with hash 3731170, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:03,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:03,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:03,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.95 [2019-03-28 12:45:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.95 [2019-03-28 12:45:03,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.36/76.95 [2019-03-28 12:45:03,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 100.36/76.95 [2019-03-28 12:45:03,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.36/76.95 [2019-03-28 12:45:03,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.36/76.95 [2019-03-28 12:45:03,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,369 INFO L87 Difference]: Start difference. First operand 33 states and 58 transitions. Second operand 3 states. 100.36/76.95 [2019-03-28 12:45:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.36/76.95 [2019-03-28 12:45:03,456 INFO L93 Difference]: Finished difference Result 33 states and 58 transitions. 100.36/76.95 [2019-03-28 12:45:03,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 100.36/76.95 [2019-03-28 12:45:03,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.36/76.95 [2019-03-28 12:45:03,458 INFO L225 Difference]: With dead ends: 33 100.36/76.95 [2019-03-28 12:45:03,458 INFO L226 Difference]: Without dead ends: 30 100.36/76.95 [2019-03-28 12:45:03,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 100.36/76.95 [2019-03-28 12:45:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 100.36/76.95 [2019-03-28 12:45:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 100.36/76.95 [2019-03-28 12:45:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 52 transitions. 100.36/76.95 [2019-03-28 12:45:03,463 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 52 transitions. Word has length 4 100.36/76.95 [2019-03-28 12:45:03,464 INFO L84 Accepts]: Finished accepts. word is rejected. 100.36/76.95 [2019-03-28 12:45:03,464 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 52 transitions. 100.36/76.95 [2019-03-28 12:45:03,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,464 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 52 transitions. 100.36/76.95 [2019-03-28 12:45:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 100.36/76.95 [2019-03-28 12:45:03,464 INFO L394 BasicCegarLoop]: Found error trace 100.36/76.95 [2019-03-28 12:45:03,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:03,465 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 100.36/76.95 [2019-03-28 12:45:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash 3731172, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:03,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:03,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:03,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.95 [2019-03-28 12:45:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.95 [2019-03-28 12:45:03,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.36/76.95 [2019-03-28 12:45:03,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 100.36/76.95 [2019-03-28 12:45:03,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.36/76.95 [2019-03-28 12:45:03,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.36/76.95 [2019-03-28 12:45:03,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,493 INFO L87 Difference]: Start difference. First operand 30 states and 52 transitions. Second operand 3 states. 100.36/76.95 [2019-03-28 12:45:03,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.36/76.95 [2019-03-28 12:45:03,573 INFO L93 Difference]: Finished difference Result 33 states and 52 transitions. 100.36/76.95 [2019-03-28 12:45:03,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 100.36/76.95 [2019-03-28 12:45:03,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.36/76.95 [2019-03-28 12:45:03,575 INFO L225 Difference]: With dead ends: 33 100.36/76.95 [2019-03-28 12:45:03,575 INFO L226 Difference]: Without dead ends: 30 100.36/76.95 [2019-03-28 12:45:03,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 100.36/76.95 [2019-03-28 12:45:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 100.36/76.95 [2019-03-28 12:45:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 100.36/76.95 [2019-03-28 12:45:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. 100.36/76.95 [2019-03-28 12:45:03,581 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 4 100.36/76.95 [2019-03-28 12:45:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. 100.36/76.95 [2019-03-28 12:45:03,581 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. 100.36/76.95 [2019-03-28 12:45:03,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. 100.36/76.95 [2019-03-28 12:45:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 100.36/76.95 [2019-03-28 12:45:03,582 INFO L394 BasicCegarLoop]: Found error trace 100.36/76.95 [2019-03-28 12:45:03,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:03,583 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 100.36/76.95 [2019-03-28 12:45:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:03,583 INFO L82 PathProgramCache]: Analyzing trace with hash 3731173, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:03,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:03,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:03,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.95 [2019-03-28 12:45:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.95 [2019-03-28 12:45:03,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.36/76.95 [2019-03-28 12:45:03,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 100.36/76.95 [2019-03-28 12:45:03,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.36/76.95 [2019-03-28 12:45:03,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.36/76.95 [2019-03-28 12:45:03,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,634 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. 100.36/76.95 [2019-03-28 12:45:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.36/76.95 [2019-03-28 12:45:03,740 INFO L93 Difference]: Finished difference Result 30 states and 49 transitions. 100.36/76.95 [2019-03-28 12:45:03,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 100.36/76.95 [2019-03-28 12:45:03,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.36/76.95 [2019-03-28 12:45:03,742 INFO L225 Difference]: With dead ends: 30 100.36/76.95 [2019-03-28 12:45:03,742 INFO L226 Difference]: Without dead ends: 27 100.36/76.95 [2019-03-28 12:45:03,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 100.36/76.95 [2019-03-28 12:45:03,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 100.36/76.95 [2019-03-28 12:45:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 100.36/76.95 [2019-03-28 12:45:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. 100.36/76.95 [2019-03-28 12:45:03,747 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 4 100.36/76.95 [2019-03-28 12:45:03,747 INFO L84 Accepts]: Finished accepts. word is rejected. 100.36/76.95 [2019-03-28 12:45:03,747 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. 100.36/76.95 [2019-03-28 12:45:03,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. 100.36/76.95 [2019-03-28 12:45:03,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 100.36/76.95 [2019-03-28 12:45:03,748 INFO L394 BasicCegarLoop]: Found error trace 100.36/76.95 [2019-03-28 12:45:03,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:03,748 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 100.36/76.95 [2019-03-28 12:45:03,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:03,749 INFO L82 PathProgramCache]: Analyzing trace with hash 115665044, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:03,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:03,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:03,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.95 [2019-03-28 12:45:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.95 [2019-03-28 12:45:03,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.36/76.95 [2019-03-28 12:45:03,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 100.36/76.95 [2019-03-28 12:45:03,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.36/76.95 [2019-03-28 12:45:03,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.36/76.95 [2019-03-28 12:45:03,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,784 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 3 states. 100.36/76.95 [2019-03-28 12:45:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.36/76.95 [2019-03-28 12:45:03,848 INFO L93 Difference]: Finished difference Result 27 states and 46 transitions. 100.36/76.95 [2019-03-28 12:45:03,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 100.36/76.95 [2019-03-28 12:45:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.36/76.95 [2019-03-28 12:45:03,849 INFO L225 Difference]: With dead ends: 27 100.36/76.95 [2019-03-28 12:45:03,849 INFO L226 Difference]: Without dead ends: 23 100.36/76.95 [2019-03-28 12:45:03,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 100.36/76.95 [2019-03-28 12:45:03,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 100.36/76.95 [2019-03-28 12:45:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 100.36/76.95 [2019-03-28 12:45:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. 100.36/76.95 [2019-03-28 12:45:03,853 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 5 100.36/76.95 [2019-03-28 12:45:03,853 INFO L84 Accepts]: Finished accepts. word is rejected. 100.36/76.95 [2019-03-28 12:45:03,853 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. 100.36/76.95 [2019-03-28 12:45:03,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. 100.36/76.95 [2019-03-28 12:45:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 100.36/76.95 [2019-03-28 12:45:03,854 INFO L394 BasicCegarLoop]: Found error trace 100.36/76.95 [2019-03-28 12:45:03,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:03,854 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 100.36/76.95 [2019-03-28 12:45:03,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:03,855 INFO L82 PathProgramCache]: Analyzing trace with hash 115665046, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:03,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:03,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:03,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.95 [2019-03-28 12:45:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.95 [2019-03-28 12:45:03,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.36/76.95 [2019-03-28 12:45:03,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 100.36/76.95 [2019-03-28 12:45:03,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.36/76.95 [2019-03-28 12:45:03,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.36/76.95 [2019-03-28 12:45:03,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,880 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 3 states. 100.36/76.95 [2019-03-28 12:45:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.36/76.95 [2019-03-28 12:45:03,928 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. 100.36/76.95 [2019-03-28 12:45:03,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 100.36/76.95 [2019-03-28 12:45:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.36/76.95 [2019-03-28 12:45:03,929 INFO L225 Difference]: With dead ends: 27 100.36/76.95 [2019-03-28 12:45:03,930 INFO L226 Difference]: Without dead ends: 23 100.36/76.95 [2019-03-28 12:45:03,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 100.36/76.95 [2019-03-28 12:45:03,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 100.36/76.95 [2019-03-28 12:45:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 100.36/76.95 [2019-03-28 12:45:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. 100.36/76.95 [2019-03-28 12:45:03,934 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 5 100.36/76.95 [2019-03-28 12:45:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. 100.36/76.95 [2019-03-28 12:45:03,934 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. 100.36/76.95 [2019-03-28 12:45:03,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. 100.36/76.95 [2019-03-28 12:45:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 100.36/76.95 [2019-03-28 12:45:03,935 INFO L394 BasicCegarLoop]: Found error trace 100.36/76.95 [2019-03-28 12:45:03,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:03,935 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== 100.36/76.95 [2019-03-28 12:45:03,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash 115665047, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:03,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:03,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.95 [2019-03-28 12:45:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.95 [2019-03-28 12:45:03,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.36/76.95 [2019-03-28 12:45:03,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 100.36/76.95 [2019-03-28 12:45:03,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.36/76.95 [2019-03-28 12:45:03,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.36/76.95 [2019-03-28 12:45:03,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:03,974 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 3 states. 100.36/76.95 [2019-03-28 12:45:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.36/76.95 [2019-03-28 12:45:04,025 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. 100.36/76.95 [2019-03-28 12:45:04,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:04,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 100.36/76.95 [2019-03-28 12:45:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.36/76.95 [2019-03-28 12:45:04,026 INFO L225 Difference]: With dead ends: 23 100.36/76.95 [2019-03-28 12:45:04,027 INFO L226 Difference]: Without dead ends: 0 100.36/76.95 [2019-03-28 12:45:04,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 100.36/76.95 [2019-03-28 12:45:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 100.36/76.95 [2019-03-28 12:45:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 100.36/76.95 [2019-03-28 12:45:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 100.36/76.95 [2019-03-28 12:45:04,029 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 100.36/76.95 [2019-03-28 12:45:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. 100.36/76.95 [2019-03-28 12:45:04,029 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 100.36/76.95 [2019-03-28 12:45:04,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 100.36/76.95 [2019-03-28 12:45:04,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 100.36/76.95 [2019-03-28 12:45:04,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 100.36/76.95 [2019-03-28 12:45:04,064 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,064 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,064 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,064 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,066 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,066 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,066 INFO L448 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,066 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,067 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,068 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,068 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,068 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,068 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,069 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,069 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,069 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,069 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,069 INFO L448 ceAbstractionStarter]: For program point L14-6(lines 14 17) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,069 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,070 INFO L444 ceAbstractionStarter]: At program point L14-8(lines 14 17) the Hoare annotation is: (and (= 0 ULTIMATE.start_quot_~x_ref~0.offset) (= ULTIMATE.start_quot_~i~0.offset 0) (= (select |#length| ULTIMATE.start_quot_~x_ref~0.base) 4) (= (select |#valid| ULTIMATE.start_quot_~x_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_quot_~i~0.base)) (= (select |#length| ULTIMATE.start_quot_~i~0.base) 4) (= 4 (select |#length| ULTIMATE.start_quot_~y_ref~0.base)) (= ULTIMATE.start_quot_~y_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_quot_~y_ref~0.base) 1)) 100.36/76.95 [2019-03-28 12:45:04,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,070 INFO L448 ceAbstractionStarter]: For program point L14-9(lines 14 17) no Hoare annotation was computed. 100.36/76.95 [2019-03-28 12:45:04,070 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 100.36/76.95 [2019-03-28 12:45:04,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.36/76.95 [2019-03-28 12:45:04,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.36/76.95 [2019-03-28 12:45:04,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.36/76.95 [2019-03-28 12:45:04,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.36/76.95 [2019-03-28 12:45:04,087 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.36/76.95 [2019-03-28 12:45:04,087 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.36/76.95 [2019-03-28 12:45:04,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:04 BasicIcfg 100.36/76.95 [2019-03-28 12:45:04,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 100.36/76.95 [2019-03-28 12:45:04,091 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 100.36/76.95 [2019-03-28 12:45:04,091 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 100.36/76.95 [2019-03-28 12:45:04,094 INFO L276 PluginConnector]: BuchiAutomizer initialized 100.36/76.95 [2019-03-28 12:45:04,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 100.36/76.95 [2019-03-28 12:45:04,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:45:01" (1/5) ... 100.36/76.95 [2019-03-28 12:45:04,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b229229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:04, skipping insertion in model container 100.36/76.95 [2019-03-28 12:45:04,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 100.36/76.95 [2019-03-28 12:45:04,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (2/5) ... 100.36/76.95 [2019-03-28 12:45:04,096 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b229229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:04, skipping insertion in model container 100.36/76.95 [2019-03-28 12:45:04,096 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 100.36/76.95 [2019-03-28 12:45:04,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:02" (3/5) ... 100.36/76.95 [2019-03-28 12:45:04,096 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b229229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:04, skipping insertion in model container 100.36/76.95 [2019-03-28 12:45:04,097 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 100.36/76.95 [2019-03-28 12:45:04,097 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:02" (4/5) ... 100.36/76.95 [2019-03-28 12:45:04,097 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b229229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:04, skipping insertion in model container 100.36/76.95 [2019-03-28 12:45:04,097 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 100.36/76.95 [2019-03-28 12:45:04,097 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:04" (5/5) ... 100.36/76.95 [2019-03-28 12:45:04,099 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 100.36/76.95 [2019-03-28 12:45:04,120 INFO L133 ementStrategyFactory]: Using default assertion order modulation 100.36/76.95 [2019-03-28 12:45:04,120 INFO L374 BuchiCegarLoop]: Interprodecural is true 100.36/76.95 [2019-03-28 12:45:04,120 INFO L375 BuchiCegarLoop]: Hoare is true 100.36/76.95 [2019-03-28 12:45:04,120 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 100.36/76.95 [2019-03-28 12:45:04,120 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 100.36/76.95 [2019-03-28 12:45:04,120 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 100.36/76.95 [2019-03-28 12:45:04,121 INFO L379 BuchiCegarLoop]: Difference is false 100.36/76.95 [2019-03-28 12:45:04,121 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 100.36/76.95 [2019-03-28 12:45:04,121 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 100.36/76.95 [2019-03-28 12:45:04,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. 100.36/76.95 [2019-03-28 12:45:04,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 100.36/76.95 [2019-03-28 12:45:04,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 100.36/76.95 [2019-03-28 12:45:04,131 INFO L119 BuchiIsEmpty]: Starting construction of run 100.36/76.95 [2019-03-28 12:45:04,135 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:04,136 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:04,136 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 100.36/76.95 [2019-03-28 12:45:04,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. 100.36/76.95 [2019-03-28 12:45:04,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 100.36/76.95 [2019-03-28 12:45:04,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 100.36/76.95 [2019-03-28 12:45:04,139 INFO L119 BuchiIsEmpty]: Starting construction of run 100.36/76.95 [2019-03-28 12:45:04,139 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:04,139 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:04,145 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue [89] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_quot_~x_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= v_ULTIMATE.start_quot_~y_1 |v_ULTIMATE.start_quot_#in~y_1|) (= v_ULTIMATE.start_quot_~i~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_quot_~y_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= v_ULTIMATE.start_quot_~i~0.base_1 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (> |v_ULTIMATE.start_quot_#t~malloc2.base_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_quot_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= |v_ULTIMATE.start_quot_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_quot_~x_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= v_ULTIMATE.start_quot_~x_1 |v_ULTIMATE.start_quot_#in~x_1|) (= (select .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_quot_~y_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc1.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc2.base_1| 4) |v_#length_1|) (= (store .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 (select .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_1|, ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_1|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_1, ULTIMATE.start_quot_#t~malloc2.offset=|v_ULTIMATE.start_quot_#t~malloc2.offset_1|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_1|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_1|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_1|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_1|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_1, ULTIMATE.start_quot_#res=|v_ULTIMATE.start_quot_#res_1|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_quot_#t~malloc0.offset=|v_ULTIMATE.start_quot_#t~malloc0.offset_1|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_1, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_1, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_1, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_1, ULTIMATE.start_quot_#t~malloc2.base=|v_ULTIMATE.start_quot_#t~malloc2.base_1|, ULTIMATE.start_quot_#t~malloc1.base=|v_ULTIMATE.start_quot_#t~malloc1.base_1|, ULTIMATE.start_quot_#t~malloc0.base=|v_ULTIMATE.start_quot_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_quot_#t~malloc1.offset=|v_ULTIMATE.start_quot_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_quot_#t~mem10=|v_ULTIMATE.start_quot_#t~mem10_1|, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_1, #valid=|v_#valid_3|, ULTIMATE.start_quot_#in~y=|v_ULTIMATE.start_quot_#in~y_1|, ULTIMATE.start_quot_#in~x=|v_ULTIMATE.start_quot_#in~x_1|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3, ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_#t~malloc2.offset, ULTIMATE.start_quot_#t~mem7, ULTIMATE.start_quot_#t~short6, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9, ULTIMATE.start_quot_~i~0.offset, ULTIMATE.start_quot_#res, ULTIMATE.start_quot_~x_ref~0.base, #length, ULTIMATE.start_quot_#t~malloc0.offset, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~i~0.base, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_#t~malloc2.base, ULTIMATE.start_quot_#t~malloc1.base, ULTIMATE.start_quot_#t~malloc0.base, ULTIMATE.start_quot_#t~malloc1.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, ULTIMATE.start_quot_#t~mem10, ULTIMATE.start_quot_~y, #valid, ULTIMATE.start_quot_#in~y, ULTIMATE.start_quot_#in~x] 11#L10true [75] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_quot_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3) v_ULTIMATE.start_quot_~x_ref~0.offset_3 v_ULTIMATE.start_quot_~x_3))) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_quot_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 33#L10-1true [120] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3) v_ULTIMATE.start_quot_~y_ref~0.offset_3 v_ULTIMATE.start_quot_~y_3)) |v_#memory_int_3|) (= (select |v_#valid_9| v_ULTIMATE.start_quot_~y_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_quot_~y_ref~0.base_3))) InVars {ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int] 36#L11true [90] L11-->L12: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3) v_ULTIMATE.start_quot_~i~0.offset_3 0))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_quot_~i~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_quot_~i~0.base_3)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 16#L12true [104] L12-->L13: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_quot_~x_ref~0.base_6) v_ULTIMATE.start_quot_~x_ref~0.offset_5)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 41#L13true [178] L13-->L14-8: Formula: (< |v_ULTIMATE.start_quot_#t~mem3_6| 0) InVars {ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 28#L14-8true 100.36/76.95 [2019-03-28 12:45:04,146 INFO L796 eck$LassoCheckResult]: Loop: 28#L14-8true [115] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_7) (= |v_ULTIMATE.start_quot_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_quot_~x_ref~0.base_9) v_ULTIMATE.start_quot_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_quot_~x_ref~0.base_9)) (= (select |v_#valid_19| v_ULTIMATE.start_quot_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4] 20#L14-1true [187] L14-1-->L14-2: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem4_3|) |v_ULTIMATE.start_quot_#t~short6_2|) InVars {ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 17#L14-2true [83] L14-2-->L14-6: Formula: (not |v_ULTIMATE.start_quot_#t~short6_5|) InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_5|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_5|} AuxVars[] AssignedVars[] 31#L14-6true [119] L14-6-->L15: Formula: |v_ULTIMATE.start_quot_#t~short6_9| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_9|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_5|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_5|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_8|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_quot_#t~short6] 25#L15true [86] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~i~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_quot_~i~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_quot_~i~0.base_6) v_ULTIMATE.start_quot_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_5) (= (select |v_#valid_23| v_ULTIMATE.start_quot_~i~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, #length=|v_#length_17|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem7] 44#L15-1true [218] L15-1-->L16: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_quot_~i~0.base_16)) (= (store |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16 (store (select |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16) v_ULTIMATE.start_quot_~i~0.offset_12 (+ |v_ULTIMATE.start_quot_#t~mem7_6| 1))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_quot_~i~0.base_16)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_12)) InVars {ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_6|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem7] 5#L16true [101] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_9 4) (select |v_#length_21| v_ULTIMATE.start_quot_~x_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_quot_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_quot_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_quot_~x_ref~0.base_12) v_ULTIMATE.start_quot_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_2|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem8] 3#L16-1true [98] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_7) (= 1 (select |v_#valid_29| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_quot_~y_ref~0.base_9) v_ULTIMATE.start_quot_~y_ref~0.offset_7))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #length=|v_#length_23|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #valid=|v_#valid_29|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem9] 22#L16-2true [219] L16-2-->L14-8: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= (store |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18 (store (select |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18) v_ULTIMATE.start_quot_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_quot_#t~mem8_6| (* (- 1) |v_ULTIMATE.start_quot_#t~mem9_6|)))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_6|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_6|} OutVars{#valid=|v_#valid_42|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9] 28#L14-8true 100.36/76.95 [2019-03-28 12:45:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:04,147 INFO L82 PathProgramCache]: Analyzing trace with hash -543744080, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:04,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:04,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:04,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:04,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:04,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1733919629, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:04,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:04,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:04,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.95 [2019-03-28 12:45:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.95 [2019-03-28 12:45:04,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.36/76.95 [2019-03-28 12:45:04,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 100.36/76.95 [2019-03-28 12:45:04,214 INFO L811 eck$LassoCheckResult]: loop already infeasible 100.36/76.95 [2019-03-28 12:45:04,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.36/76.95 [2019-03-28 12:45:04,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:04,216 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. 100.36/76.95 [2019-03-28 12:45:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.36/76.95 [2019-03-28 12:45:04,336 INFO L93 Difference]: Finished difference Result 45 states and 80 transitions. 100.36/76.95 [2019-03-28 12:45:04,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:04,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 80 transitions. 100.36/76.95 [2019-03-28 12:45:04,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 100.36/76.95 [2019-03-28 12:45:04,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 20 states and 31 transitions. 100.36/76.95 [2019-03-28 12:45:04,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 100.36/76.95 [2019-03-28 12:45:04,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 100.36/76.95 [2019-03-28 12:45:04,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. 100.36/76.95 [2019-03-28 12:45:04,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 100.36/76.95 [2019-03-28 12:45:04,346 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. 100.36/76.95 [2019-03-28 12:45:04,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. 100.36/76.95 [2019-03-28 12:45:04,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. 100.36/76.95 [2019-03-28 12:45:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 100.36/76.95 [2019-03-28 12:45:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. 100.36/76.95 [2019-03-28 12:45:04,349 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. 100.36/76.95 [2019-03-28 12:45:04,349 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. 100.36/76.95 [2019-03-28 12:45:04,349 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 100.36/76.95 [2019-03-28 12:45:04,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 30 transitions. 100.36/76.95 [2019-03-28 12:45:04,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 100.36/76.95 [2019-03-28 12:45:04,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 100.36/76.95 [2019-03-28 12:45:04,351 INFO L119 BuchiIsEmpty]: Starting construction of run 100.36/76.95 [2019-03-28 12:45:04,351 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:04,351 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:04,352 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY [89] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 107#L-1 [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_quot_~x_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= v_ULTIMATE.start_quot_~y_1 |v_ULTIMATE.start_quot_#in~y_1|) (= v_ULTIMATE.start_quot_~i~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_quot_~y_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= v_ULTIMATE.start_quot_~i~0.base_1 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (> |v_ULTIMATE.start_quot_#t~malloc2.base_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_quot_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= |v_ULTIMATE.start_quot_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_quot_~x_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= v_ULTIMATE.start_quot_~x_1 |v_ULTIMATE.start_quot_#in~x_1|) (= (select .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_quot_~y_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc1.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc2.base_1| 4) |v_#length_1|) (= (store .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 (select .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_1|, ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_1|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_1, ULTIMATE.start_quot_#t~malloc2.offset=|v_ULTIMATE.start_quot_#t~malloc2.offset_1|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_1|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_1|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_1|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_1|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_1, ULTIMATE.start_quot_#res=|v_ULTIMATE.start_quot_#res_1|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_quot_#t~malloc0.offset=|v_ULTIMATE.start_quot_#t~malloc0.offset_1|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_1, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_1, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_1, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_1, ULTIMATE.start_quot_#t~malloc2.base=|v_ULTIMATE.start_quot_#t~malloc2.base_1|, ULTIMATE.start_quot_#t~malloc1.base=|v_ULTIMATE.start_quot_#t~malloc1.base_1|, ULTIMATE.start_quot_#t~malloc0.base=|v_ULTIMATE.start_quot_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_quot_#t~malloc1.offset=|v_ULTIMATE.start_quot_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_quot_#t~mem10=|v_ULTIMATE.start_quot_#t~mem10_1|, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_1, #valid=|v_#valid_3|, ULTIMATE.start_quot_#in~y=|v_ULTIMATE.start_quot_#in~y_1|, ULTIMATE.start_quot_#in~x=|v_ULTIMATE.start_quot_#in~x_1|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3, ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_#t~malloc2.offset, ULTIMATE.start_quot_#t~mem7, ULTIMATE.start_quot_#t~short6, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9, ULTIMATE.start_quot_~i~0.offset, ULTIMATE.start_quot_#res, ULTIMATE.start_quot_~x_ref~0.base, #length, ULTIMATE.start_quot_#t~malloc0.offset, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~i~0.base, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_#t~malloc2.base, ULTIMATE.start_quot_#t~malloc1.base, ULTIMATE.start_quot_#t~malloc0.base, ULTIMATE.start_quot_#t~malloc1.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, ULTIMATE.start_quot_#t~mem10, ULTIMATE.start_quot_~y, #valid, ULTIMATE.start_quot_#in~y, ULTIMATE.start_quot_#in~x] 108#L10 [75] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_quot_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3) v_ULTIMATE.start_quot_~x_ref~0.offset_3 v_ULTIMATE.start_quot_~x_3))) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_quot_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 105#L10-1 [120] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3) v_ULTIMATE.start_quot_~y_ref~0.offset_3 v_ULTIMATE.start_quot_~y_3)) |v_#memory_int_3|) (= (select |v_#valid_9| v_ULTIMATE.start_quot_~y_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_quot_~y_ref~0.base_3))) InVars {ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int] 106#L11 [90] L11-->L12: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3) v_ULTIMATE.start_quot_~i~0.offset_3 0))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_quot_~i~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_quot_~i~0.base_3)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 112#L12 [104] L12-->L13: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_quot_~x_ref~0.base_6) v_ULTIMATE.start_quot_~x_ref~0.offset_5)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 114#L13 [178] L13-->L14-8: Formula: (< |v_ULTIMATE.start_quot_#t~mem3_6| 0) InVars {ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 102#L14-8 100.36/76.95 [2019-03-28 12:45:04,352 INFO L796 eck$LassoCheckResult]: Loop: 102#L14-8 [115] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_7) (= |v_ULTIMATE.start_quot_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_quot_~x_ref~0.base_9) v_ULTIMATE.start_quot_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_quot_~x_ref~0.base_9)) (= (select |v_#valid_19| v_ULTIMATE.start_quot_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4] 103#L14-1 [188] L14-1-->L14-2: Formula: (and (>= 0 |v_ULTIMATE.start_quot_#t~mem4_3|) (not |v_ULTIMATE.start_quot_#t~short6_2|)) InVars {ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 115#L14-2 [83] L14-2-->L14-6: Formula: (not |v_ULTIMATE.start_quot_#t~short6_5|) InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_5|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_5|} AuxVars[] AssignedVars[] 104#L14-6 [119] L14-6-->L15: Formula: |v_ULTIMATE.start_quot_#t~short6_9| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_9|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_5|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_5|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_8|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_quot_#t~short6] 97#L15 [86] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~i~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_quot_~i~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_quot_~i~0.base_6) v_ULTIMATE.start_quot_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_5) (= (select |v_#valid_23| v_ULTIMATE.start_quot_~i~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, #length=|v_#length_17|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem7] 98#L15-1 [218] L15-1-->L16: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_quot_~i~0.base_16)) (= (store |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16 (store (select |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16) v_ULTIMATE.start_quot_~i~0.offset_12 (+ |v_ULTIMATE.start_quot_#t~mem7_6| 1))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_quot_~i~0.base_16)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_12)) InVars {ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_6|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem7] 101#L16 [101] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_9 4) (select |v_#length_21| v_ULTIMATE.start_quot_~x_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_quot_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_quot_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_quot_~x_ref~0.base_12) v_ULTIMATE.start_quot_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_2|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem8] 99#L16-1 [98] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_7) (= 1 (select |v_#valid_29| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_quot_~y_ref~0.base_9) v_ULTIMATE.start_quot_~y_ref~0.offset_7))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #length=|v_#length_23|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #valid=|v_#valid_29|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem9] 100#L16-2 [219] L16-2-->L14-8: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= (store |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18 (store (select |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18) v_ULTIMATE.start_quot_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_quot_#t~mem8_6| (* (- 1) |v_ULTIMATE.start_quot_#t~mem9_6|)))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_6|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_6|} OutVars{#valid=|v_#valid_42|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9] 102#L14-8 100.36/76.95 [2019-03-28 12:45:04,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:04,353 INFO L82 PathProgramCache]: Analyzing trace with hash -543744080, now seen corresponding path program 2 times 100.36/76.95 [2019-03-28 12:45:04,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:04,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:04,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:04,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:04,380 INFO L82 PathProgramCache]: Analyzing trace with hash -818237332, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:04,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:04,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:04,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.95 [2019-03-28 12:45:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.95 [2019-03-28 12:45:04,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.36/76.95 [2019-03-28 12:45:04,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 100.36/76.95 [2019-03-28 12:45:04,392 INFO L811 eck$LassoCheckResult]: loop already infeasible 100.36/76.95 [2019-03-28 12:45:04,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.36/76.95 [2019-03-28 12:45:04,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.36/76.95 [2019-03-28 12:45:04,392 INFO L87 Difference]: Start difference. First operand 19 states and 30 transitions. cyclomatic complexity: 12 Second operand 3 states. 100.36/76.95 [2019-03-28 12:45:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.36/76.95 [2019-03-28 12:45:04,429 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. 100.36/76.95 [2019-03-28 12:45:04,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.36/76.95 [2019-03-28 12:45:04,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 29 transitions. 100.36/76.95 [2019-03-28 12:45:04,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 100.36/76.95 [2019-03-28 12:45:04,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 26 transitions. 100.36/76.95 [2019-03-28 12:45:04,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 100.36/76.95 [2019-03-28 12:45:04,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 100.36/76.95 [2019-03-28 12:45:04,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. 100.36/76.95 [2019-03-28 12:45:04,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 100.36/76.95 [2019-03-28 12:45:04,431 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. 100.36/76.95 [2019-03-28 12:45:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. 100.36/76.95 [2019-03-28 12:45:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 100.36/76.95 [2019-03-28 12:45:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 100.36/76.95 [2019-03-28 12:45:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. 100.36/76.95 [2019-03-28 12:45:04,434 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. 100.36/76.95 [2019-03-28 12:45:04,434 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. 100.36/76.95 [2019-03-28 12:45:04,434 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 100.36/76.95 [2019-03-28 12:45:04,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. 100.36/76.95 [2019-03-28 12:45:04,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 100.36/76.95 [2019-03-28 12:45:04,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 100.36/76.95 [2019-03-28 12:45:04,435 INFO L119 BuchiIsEmpty]: Starting construction of run 100.36/76.95 [2019-03-28 12:45:04,436 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:04,436 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:04,436 INFO L794 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY [89] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 152#L-1 [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_quot_~x_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= v_ULTIMATE.start_quot_~y_1 |v_ULTIMATE.start_quot_#in~y_1|) (= v_ULTIMATE.start_quot_~i~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_quot_~y_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= v_ULTIMATE.start_quot_~i~0.base_1 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (> |v_ULTIMATE.start_quot_#t~malloc2.base_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_quot_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= |v_ULTIMATE.start_quot_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_quot_~x_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= v_ULTIMATE.start_quot_~x_1 |v_ULTIMATE.start_quot_#in~x_1|) (= (select .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_quot_~y_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc1.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc2.base_1| 4) |v_#length_1|) (= (store .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 (select .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_1|, ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_1|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_1, ULTIMATE.start_quot_#t~malloc2.offset=|v_ULTIMATE.start_quot_#t~malloc2.offset_1|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_1|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_1|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_1|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_1|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_1, ULTIMATE.start_quot_#res=|v_ULTIMATE.start_quot_#res_1|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_quot_#t~malloc0.offset=|v_ULTIMATE.start_quot_#t~malloc0.offset_1|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_1, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_1, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_1, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_1, ULTIMATE.start_quot_#t~malloc2.base=|v_ULTIMATE.start_quot_#t~malloc2.base_1|, ULTIMATE.start_quot_#t~malloc1.base=|v_ULTIMATE.start_quot_#t~malloc1.base_1|, ULTIMATE.start_quot_#t~malloc0.base=|v_ULTIMATE.start_quot_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_quot_#t~malloc1.offset=|v_ULTIMATE.start_quot_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_quot_#t~mem10=|v_ULTIMATE.start_quot_#t~mem10_1|, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_1, #valid=|v_#valid_3|, ULTIMATE.start_quot_#in~y=|v_ULTIMATE.start_quot_#in~y_1|, ULTIMATE.start_quot_#in~x=|v_ULTIMATE.start_quot_#in~x_1|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3, ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_#t~malloc2.offset, ULTIMATE.start_quot_#t~mem7, ULTIMATE.start_quot_#t~short6, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9, ULTIMATE.start_quot_~i~0.offset, ULTIMATE.start_quot_#res, ULTIMATE.start_quot_~x_ref~0.base, #length, ULTIMATE.start_quot_#t~malloc0.offset, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~i~0.base, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_#t~malloc2.base, ULTIMATE.start_quot_#t~malloc1.base, ULTIMATE.start_quot_#t~malloc0.base, ULTIMATE.start_quot_#t~malloc1.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, ULTIMATE.start_quot_#t~mem10, ULTIMATE.start_quot_~y, #valid, ULTIMATE.start_quot_#in~y, ULTIMATE.start_quot_#in~x] 153#L10 [75] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_quot_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3) v_ULTIMATE.start_quot_~x_ref~0.offset_3 v_ULTIMATE.start_quot_~x_3))) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_quot_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 150#L10-1 [120] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3) v_ULTIMATE.start_quot_~y_ref~0.offset_3 v_ULTIMATE.start_quot_~y_3)) |v_#memory_int_3|) (= (select |v_#valid_9| v_ULTIMATE.start_quot_~y_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_quot_~y_ref~0.base_3))) InVars {ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int] 151#L11 [90] L11-->L12: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3) v_ULTIMATE.start_quot_~i~0.offset_3 0))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_quot_~i~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_quot_~i~0.base_3)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 157#L12 [104] L12-->L13: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_quot_~x_ref~0.base_6) v_ULTIMATE.start_quot_~x_ref~0.offset_5)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 159#L13 [178] L13-->L14-8: Formula: (< |v_ULTIMATE.start_quot_#t~mem3_6| 0) InVars {ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 147#L14-8 100.36/76.95 [2019-03-28 12:45:04,437 INFO L796 eck$LassoCheckResult]: Loop: 147#L14-8 [115] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_7) (= |v_ULTIMATE.start_quot_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_quot_~x_ref~0.base_9) v_ULTIMATE.start_quot_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_quot_~x_ref~0.base_9)) (= (select |v_#valid_19| v_ULTIMATE.start_quot_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4] 148#L14-1 [187] L14-1-->L14-2: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem4_3|) |v_ULTIMATE.start_quot_#t~short6_2|) InVars {ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 158#L14-2 [82] L14-2-->L14-3: Formula: |v_ULTIMATE.start_quot_#t~short6_3| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} AuxVars[] AssignedVars[] 156#L14-3 [79] L14-3-->L14-4: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_quot_~y_ref~0.base_6) v_ULTIMATE.start_quot_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_quot_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_5) (= 1 (select |v_#valid_21| v_ULTIMATE.start_quot_~y_ref~0.base_6))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, #length=|v_#length_15|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_2|, #valid=|v_#valid_21|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem5] 154#L14-4 [193] L14-4-->L14-6: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem5_3|) |v_ULTIMATE.start_quot_#t~short6_4|) InVars {ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_4|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 149#L14-6 [119] L14-6-->L15: Formula: |v_ULTIMATE.start_quot_#t~short6_9| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_9|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_5|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_5|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_8|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_quot_#t~short6] 142#L15 [86] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~i~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_quot_~i~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_quot_~i~0.base_6) v_ULTIMATE.start_quot_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_5) (= (select |v_#valid_23| v_ULTIMATE.start_quot_~i~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, #length=|v_#length_17|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem7] 143#L15-1 [218] L15-1-->L16: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_quot_~i~0.base_16)) (= (store |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16 (store (select |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16) v_ULTIMATE.start_quot_~i~0.offset_12 (+ |v_ULTIMATE.start_quot_#t~mem7_6| 1))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_quot_~i~0.base_16)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_12)) InVars {ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_6|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem7] 146#L16 [101] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_9 4) (select |v_#length_21| v_ULTIMATE.start_quot_~x_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_quot_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_quot_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_quot_~x_ref~0.base_12) v_ULTIMATE.start_quot_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_2|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem8] 144#L16-1 [98] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_7) (= 1 (select |v_#valid_29| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_quot_~y_ref~0.base_9) v_ULTIMATE.start_quot_~y_ref~0.offset_7))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #length=|v_#length_23|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #valid=|v_#valid_29|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem9] 145#L16-2 [219] L16-2-->L14-8: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= (store |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18 (store (select |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18) v_ULTIMATE.start_quot_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_quot_#t~mem8_6| (* (- 1) |v_ULTIMATE.start_quot_#t~mem9_6|)))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_6|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_6|} OutVars{#valid=|v_#valid_42|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9] 147#L14-8 100.36/76.95 [2019-03-28 12:45:04,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:04,437 INFO L82 PathProgramCache]: Analyzing trace with hash -543744080, now seen corresponding path program 3 times 100.36/76.95 [2019-03-28 12:45:04,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:04,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:04,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:04,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:04,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1707090210, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:04,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:04,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:04,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:04,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1413518385, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:04,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:04,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.95 [2019-03-28 12:45:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.95 [2019-03-28 12:45:04,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.36/76.95 [2019-03-28 12:45:04,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 100.36/76.95 [2019-03-28 12:45:04,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 100.36/76.95 [2019-03-28 12:45:04,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 100.36/76.95 [2019-03-28 12:45:04,684 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 9 Second operand 5 states. 100.36/76.95 [2019-03-28 12:45:04,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.36/76.95 [2019-03-28 12:45:04,758 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. 100.36/76.95 [2019-03-28 12:45:04,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 100.36/76.95 [2019-03-28 12:45:04,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. 100.36/76.95 [2019-03-28 12:45:04,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 100.36/76.95 [2019-03-28 12:45:04,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 25 transitions. 100.36/76.95 [2019-03-28 12:45:04,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 100.36/76.95 [2019-03-28 12:45:04,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 100.36/76.95 [2019-03-28 12:45:04,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. 100.36/76.95 [2019-03-28 12:45:04,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 100.36/76.95 [2019-03-28 12:45:04,761 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. 100.36/76.95 [2019-03-28 12:45:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. 100.36/76.95 [2019-03-28 12:45:04,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 100.36/76.95 [2019-03-28 12:45:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 100.36/76.95 [2019-03-28 12:45:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. 100.36/76.95 [2019-03-28 12:45:04,763 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. 100.36/76.95 [2019-03-28 12:45:04,763 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. 100.36/76.95 [2019-03-28 12:45:04,763 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 100.36/76.95 [2019-03-28 12:45:04,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. 100.36/76.95 [2019-03-28 12:45:04,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 100.36/76.95 [2019-03-28 12:45:04,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 100.36/76.95 [2019-03-28 12:45:04,764 INFO L119 BuchiIsEmpty]: Starting construction of run 100.36/76.95 [2019-03-28 12:45:04,764 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:04,764 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.36/76.95 [2019-03-28 12:45:04,765 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY [89] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 202#L-1 [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_quot_~x_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= v_ULTIMATE.start_quot_~y_1 |v_ULTIMATE.start_quot_#in~y_1|) (= v_ULTIMATE.start_quot_~i~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_quot_~y_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= v_ULTIMATE.start_quot_~i~0.base_1 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (> |v_ULTIMATE.start_quot_#t~malloc2.base_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_quot_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= |v_ULTIMATE.start_quot_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_quot_~x_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= v_ULTIMATE.start_quot_~x_1 |v_ULTIMATE.start_quot_#in~x_1|) (= (select .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_quot_~y_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc1.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc2.base_1| 4) |v_#length_1|) (= (store .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 (select .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_1|, ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_1|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_1, ULTIMATE.start_quot_#t~malloc2.offset=|v_ULTIMATE.start_quot_#t~malloc2.offset_1|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_1|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_1|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_1|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_1|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_1, ULTIMATE.start_quot_#res=|v_ULTIMATE.start_quot_#res_1|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_quot_#t~malloc0.offset=|v_ULTIMATE.start_quot_#t~malloc0.offset_1|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_1, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_1, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_1, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_1, ULTIMATE.start_quot_#t~malloc2.base=|v_ULTIMATE.start_quot_#t~malloc2.base_1|, ULTIMATE.start_quot_#t~malloc1.base=|v_ULTIMATE.start_quot_#t~malloc1.base_1|, ULTIMATE.start_quot_#t~malloc0.base=|v_ULTIMATE.start_quot_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_quot_#t~malloc1.offset=|v_ULTIMATE.start_quot_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_quot_#t~mem10=|v_ULTIMATE.start_quot_#t~mem10_1|, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_1, #valid=|v_#valid_3|, ULTIMATE.start_quot_#in~y=|v_ULTIMATE.start_quot_#in~y_1|, ULTIMATE.start_quot_#in~x=|v_ULTIMATE.start_quot_#in~x_1|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3, ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_#t~malloc2.offset, ULTIMATE.start_quot_#t~mem7, ULTIMATE.start_quot_#t~short6, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9, ULTIMATE.start_quot_~i~0.offset, ULTIMATE.start_quot_#res, ULTIMATE.start_quot_~x_ref~0.base, #length, ULTIMATE.start_quot_#t~malloc0.offset, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~i~0.base, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_#t~malloc2.base, ULTIMATE.start_quot_#t~malloc1.base, ULTIMATE.start_quot_#t~malloc0.base, ULTIMATE.start_quot_#t~malloc1.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, ULTIMATE.start_quot_#t~mem10, ULTIMATE.start_quot_~y, #valid, ULTIMATE.start_quot_#in~y, ULTIMATE.start_quot_#in~x] 203#L10 [75] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_quot_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3) v_ULTIMATE.start_quot_~x_ref~0.offset_3 v_ULTIMATE.start_quot_~x_3))) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_quot_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 200#L10-1 [120] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3) v_ULTIMATE.start_quot_~y_ref~0.offset_3 v_ULTIMATE.start_quot_~y_3)) |v_#memory_int_3|) (= (select |v_#valid_9| v_ULTIMATE.start_quot_~y_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_quot_~y_ref~0.base_3))) InVars {ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int] 201#L11 [90] L11-->L12: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3) v_ULTIMATE.start_quot_~i~0.offset_3 0))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_quot_~i~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_quot_~i~0.base_3)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 206#L12 [104] L12-->L13: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_quot_~x_ref~0.base_6) v_ULTIMATE.start_quot_~x_ref~0.offset_5)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 208#L13 [177] L13-->L14-8: Formula: (> |v_ULTIMATE.start_quot_#t~mem3_6| 0) InVars {ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 197#L14-8 100.36/76.95 [2019-03-28 12:45:04,766 INFO L796 eck$LassoCheckResult]: Loop: 197#L14-8 [115] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_7) (= |v_ULTIMATE.start_quot_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_quot_~x_ref~0.base_9) v_ULTIMATE.start_quot_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_quot_~x_ref~0.base_9)) (= (select |v_#valid_19| v_ULTIMATE.start_quot_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4] 198#L14-1 [187] L14-1-->L14-2: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem4_3|) |v_ULTIMATE.start_quot_#t~short6_2|) InVars {ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 209#L14-2 [82] L14-2-->L14-3: Formula: |v_ULTIMATE.start_quot_#t~short6_3| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} AuxVars[] AssignedVars[] 207#L14-3 [79] L14-3-->L14-4: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_quot_~y_ref~0.base_6) v_ULTIMATE.start_quot_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_quot_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_5) (= 1 (select |v_#valid_21| v_ULTIMATE.start_quot_~y_ref~0.base_6))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, #length=|v_#length_15|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_2|, #valid=|v_#valid_21|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem5] 204#L14-4 [193] L14-4-->L14-6: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem5_3|) |v_ULTIMATE.start_quot_#t~short6_4|) InVars {ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_4|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 199#L14-6 [119] L14-6-->L15: Formula: |v_ULTIMATE.start_quot_#t~short6_9| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_9|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_5|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_5|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_8|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_quot_#t~short6] 192#L15 [86] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~i~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_quot_~i~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_quot_~i~0.base_6) v_ULTIMATE.start_quot_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_5) (= (select |v_#valid_23| v_ULTIMATE.start_quot_~i~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, #length=|v_#length_17|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem7] 193#L15-1 [218] L15-1-->L16: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_quot_~i~0.base_16)) (= (store |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16 (store (select |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16) v_ULTIMATE.start_quot_~i~0.offset_12 (+ |v_ULTIMATE.start_quot_#t~mem7_6| 1))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_quot_~i~0.base_16)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_12)) InVars {ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_6|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem7] 196#L16 [101] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_9 4) (select |v_#length_21| v_ULTIMATE.start_quot_~x_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_quot_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_quot_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_quot_~x_ref~0.base_12) v_ULTIMATE.start_quot_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_2|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem8] 194#L16-1 [98] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_7) (= 1 (select |v_#valid_29| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_quot_~y_ref~0.base_9) v_ULTIMATE.start_quot_~y_ref~0.offset_7))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #length=|v_#length_23|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #valid=|v_#valid_29|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem9] 195#L16-2 [219] L16-2-->L14-8: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= (store |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18 (store (select |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18) v_ULTIMATE.start_quot_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_quot_#t~mem8_6| (* (- 1) |v_ULTIMATE.start_quot_#t~mem9_6|)))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_6|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_6|} OutVars{#valid=|v_#valid_42|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9] 197#L14-8 100.36/76.95 [2019-03-28 12:45:04,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:04,766 INFO L82 PathProgramCache]: Analyzing trace with hash -543744081, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:04,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:04,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:04,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:04,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:04,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1707090210, now seen corresponding path program 2 times 100.36/76.95 [2019-03-28 12:45:04,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:04,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:04,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:04,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.95 [2019-03-28 12:45:04,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1542601104, now seen corresponding path program 1 times 100.36/76.95 [2019-03-28 12:45:04,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.95 [2019-03-28 12:45:04,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.95 [2019-03-28 12:45:04,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.95 [2019-03-28 12:45:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.95 [2019-03-28 12:45:05,356 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 100.36/76.95 [2019-03-28 12:45:05,544 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 87 100.36/76.95 [2019-03-28 12:45:05,558 INFO L216 LassoAnalysis]: Preferences: 100.36/76.95 [2019-03-28 12:45:05,559 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 100.36/76.95 [2019-03-28 12:45:05,559 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 100.36/76.95 [2019-03-28 12:45:05,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 100.36/76.95 [2019-03-28 12:45:05,559 INFO L127 ssoRankerPreferences]: Use exernal solver: false 100.36/76.95 [2019-03-28 12:45:05,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 100.36/76.95 [2019-03-28 12:45:05,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 100.36/76.95 [2019-03-28 12:45:05,560 INFO L130 ssoRankerPreferences]: Path of dumped script: 100.36/76.95 [2019-03-28 12:45:05,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 100.36/76.95 [2019-03-28 12:45:05,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 100.36/76.95 [2019-03-28 12:45:05,560 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 100.36/76.95 [2019-03-28 12:45:05,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:05,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:05,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:05,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:05,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:05,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:05,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:05,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:05,948 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 100.36/76.95 [2019-03-28 12:45:06,058 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 100.36/76.95 [2019-03-28 12:45:06,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:06,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:06,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:06,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:06,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:06,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:06,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.95 [2019-03-28 12:45:06,503 INFO L300 LassoAnalysis]: Preprocessing complete. 100.36/76.95 [2019-03-28 12:45:06,509 INFO L497 LassoAnalysis]: Using template 'affine'. 100.36/76.95 [2019-03-28 12:45:06,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.95 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.95 Number of strict supporting invariants: 0 100.36/76.95 Number of non-strict supporting invariants: 1 100.36/76.95 Consider only non-deceasing supporting invariants: true 100.36/76.95 Simplify termination arguments: true 100.36/76.95 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.95 [2019-03-28 12:45:06,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.95 [2019-03-28 12:45:06,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.95 [2019-03-28 12:45:06,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.95 [2019-03-28 12:45:06,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.95 [2019-03-28 12:45:06,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.95 [2019-03-28 12:45:06,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.95 [2019-03-28 12:45:06,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.95 [2019-03-28 12:45:06,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.95 [2019-03-28 12:45:06,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.95 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.95 Number of strict supporting invariants: 0 100.36/76.95 Number of non-strict supporting invariants: 1 100.36/76.95 Consider only non-deceasing supporting invariants: true 100.36/76.95 Simplify termination arguments: true 100.36/76.95 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.95 [2019-03-28 12:45:06,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.95 [2019-03-28 12:45:06,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.95 [2019-03-28 12:45:06,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.95 [2019-03-28 12:45:06,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.95 [2019-03-28 12:45:06,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.95 [2019-03-28 12:45:06,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.95 [2019-03-28 12:45:06,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.95 [2019-03-28 12:45:06,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.95 [2019-03-28 12:45:06,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.95 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.95 Number of strict supporting invariants: 0 100.36/76.95 Number of non-strict supporting invariants: 1 100.36/76.95 Consider only non-deceasing supporting invariants: true 100.36/76.95 Simplify termination arguments: true 100.36/76.95 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.95 [2019-03-28 12:45:06,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.95 [2019-03-28 12:45:06,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.95 [2019-03-28 12:45:06,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.95 [2019-03-28 12:45:06,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.95 [2019-03-28 12:45:06,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.95 [2019-03-28 12:45:06,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.95 [2019-03-28 12:45:06,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.95 [2019-03-28 12:45:06,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.95 [2019-03-28 12:45:06,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.95 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.95 Number of strict supporting invariants: 0 100.36/76.95 Number of non-strict supporting invariants: 1 100.36/76.95 Consider only non-deceasing supporting invariants: true 100.36/76.95 Simplify termination arguments: true 100.36/76.95 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.95 [2019-03-28 12:45:06,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.95 [2019-03-28 12:45:06,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.95 [2019-03-28 12:45:06,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.95 [2019-03-28 12:45:06,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.95 [2019-03-28 12:45:06,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.95 [2019-03-28 12:45:06,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.95 [2019-03-28 12:45:06,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.95 [2019-03-28 12:45:06,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.95 [2019-03-28 12:45:06,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.95 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.95 Number of strict supporting invariants: 0 100.36/76.95 Number of non-strict supporting invariants: 1 100.36/76.95 Consider only non-deceasing supporting invariants: true 100.36/76.95 Simplify termination arguments: true 100.36/76.95 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.95 [2019-03-28 12:45:06,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.95 [2019-03-28 12:45:06,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.95 [2019-03-28 12:45:06,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.95 [2019-03-28 12:45:06,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.95 [2019-03-28 12:45:06,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.95 [2019-03-28 12:45:06,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.95 [2019-03-28 12:45:06,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.95 [2019-03-28 12:45:06,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.95 [2019-03-28 12:45:06,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.95 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.95 Number of strict supporting invariants: 0 100.36/76.95 Number of non-strict supporting invariants: 1 100.36/76.95 Consider only non-deceasing supporting invariants: true 100.36/76.95 Simplify termination arguments: true 100.36/76.95 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.95 [2019-03-28 12:45:06,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.95 [2019-03-28 12:45:06,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.95 [2019-03-28 12:45:06,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.95 [2019-03-28 12:45:06,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.95 [2019-03-28 12:45:06,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.95 [2019-03-28 12:45:06,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.95 [2019-03-28 12:45:06,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.95 [2019-03-28 12:45:06,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.95 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.95 Number of strict supporting invariants: 0 100.36/76.95 Number of non-strict supporting invariants: 1 100.36/76.95 Consider only non-deceasing supporting invariants: true 100.36/76.95 Simplify termination arguments: true 100.36/76.95 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.95 [2019-03-28 12:45:06,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.95 [2019-03-28 12:45:06,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.95 [2019-03-28 12:45:06,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.95 [2019-03-28 12:45:06,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.95 [2019-03-28 12:45:06,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.95 [2019-03-28 12:45:06,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.95 [2019-03-28 12:45:06,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.95 [2019-03-28 12:45:06,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.95 [2019-03-28 12:45:06,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.95 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.95 Number of strict supporting invariants: 0 100.36/76.95 Number of non-strict supporting invariants: 1 100.36/76.95 Consider only non-deceasing supporting invariants: true 100.36/76.95 Simplify termination arguments: true 100.36/76.95 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.95 [2019-03-28 12:45:06,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.95 [2019-03-28 12:45:06,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.95 [2019-03-28 12:45:06,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.95 [2019-03-28 12:45:06,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.95 [2019-03-28 12:45:06,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.95 [2019-03-28 12:45:06,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.95 [2019-03-28 12:45:06,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.95 [2019-03-28 12:45:06,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.95 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.95 Number of strict supporting invariants: 0 100.36/76.95 Number of non-strict supporting invariants: 1 100.36/76.95 Consider only non-deceasing supporting invariants: true 100.36/76.95 Simplify termination arguments: true 100.36/76.95 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:06,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:06,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:06,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:06,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:06,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:06,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:06,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:06,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:06,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:06,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:06,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:06,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:06,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:06,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:06,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:06,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:06,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:06,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:06,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:06,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:06,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:06,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:06,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:06,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:06,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:06,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:06,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:06,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:06,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:06,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:06,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:06,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:06,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:06,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:06,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:06,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:06,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:06,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:06,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:06,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:06,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:06,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:06,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:06,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:06,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:06,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:06,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:06,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:06,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:06,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:06,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:06,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:06,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:06,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:06,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:06,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:06,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:06,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:06,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:06,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:06,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:06,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:06,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:06,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:06,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:06,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:06,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:06,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:06,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:06,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:06,656 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 100.36/76.96 [2019-03-28 12:45:06,668 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 100.36/76.96 [2019-03-28 12:45:06,669 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 100.36/76.96 [2019-03-28 12:45:06,671 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 100.36/76.96 [2019-03-28 12:45:06,673 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 100.36/76.96 [2019-03-28 12:45:06,673 INFO L518 LassoAnalysis]: Proved termination. 100.36/76.96 [2019-03-28 12:45:06,673 INFO L520 LassoAnalysis]: Termination argument consisting of: 100.36/76.96 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1 100.36/76.96 Supporting invariants [] 100.36/76.96 [2019-03-28 12:45:06,766 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 100.36/76.96 [2019-03-28 12:45:06,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.36/76.96 [2019-03-28 12:45:06,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.96 [2019-03-28 12:45:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.96 [2019-03-28 12:45:06,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core 100.36/76.96 [2019-03-28 12:45:06,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.36/76.96 [2019-03-28 12:45:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.96 [2019-03-28 12:45:06,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core 100.36/76.96 [2019-03-28 12:45:06,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.36/76.96 [2019-03-28 12:45:07,033 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:07,033 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 86 100.36/76.96 [2019-03-28 12:45:07,050 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:07,151 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 100.36/76.96 [2019-03-28 12:45:07,151 INFO L497 ElimStorePlain]: treesize reduction 88, result has 38.5 percent of original size 100.36/76.96 [2019-03-28 12:45:07,153 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:07,153 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:47 100.36/76.96 [2019-03-28 12:45:12,709 WARN L188 SmtUtils]: Spent 3.62 s on a formula simplification that was a NOOP. DAG size: 31 100.36/76.96 [2019-03-28 12:45:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.96 [2019-03-28 12:45:14,776 WARN L860 $PredicateComparison]: unable to prove that (or (<= 2 (select (select |c_#memory_int| c_ULTIMATE.start_quot_~i~0.base) c_ULTIMATE.start_quot_~y_ref~0.offset)) (exists ((ULTIMATE.start_quot_~i~0.offset Int)) (not (and (= c_ULTIMATE.start_quot_~y_ref~0.base c_ULTIMATE.start_quot_~i~0.base) (= ULTIMATE.start_quot_~i~0.offset c_ULTIMATE.start_quot_~y_ref~0.offset))))) is different from true 100.36/76.96 [2019-03-28 12:45:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:14,882 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 100.36/76.96 [2019-03-28 12:45:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.96 [2019-03-28 12:45:14,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core 100.36/76.96 [2019-03-28 12:45:14,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.36/76.96 [2019-03-28 12:45:14,904 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 100.36/76.96 [2019-03-28 12:45:14,904 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:14,912 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:14,912 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:14,913 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 100.36/76.96 [2019-03-28 12:45:15,007 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:15,008 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 68 100.36/76.96 [2019-03-28 12:45:15,015 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:15,076 INFO L497 ElimStorePlain]: treesize reduction 49, result has 51.0 percent of original size 100.36/76.96 [2019-03-28 12:45:15,078 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:15,078 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 100.36/76.96 [2019-03-28 12:45:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.96 [2019-03-28 12:45:15,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core 100.36/76.96 [2019-03-28 12:45:15,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.36/76.96 [2019-03-28 12:45:15,801 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:15,802 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 68 100.36/76.96 [2019-03-28 12:45:15,808 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:15,905 INFO L497 ElimStorePlain]: treesize reduction 49, result has 51.0 percent of original size 100.36/76.96 [2019-03-28 12:45:15,907 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:15,907 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 100.36/76.96 [2019-03-28 12:45:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:15,988 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 100.36/76.96 [2019-03-28 12:45:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:15,998 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 100.36/76.96 [2019-03-28 12:45:15,998 INFO L98 LoopCannibalizer]: 13 predicates before loop cannibalization 22 predicates after loop cannibalization 100.36/76.96 [2019-03-28 12:45:16,002 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 22 loop predicates 100.36/76.96 [2019-03-28 12:45:16,003 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 25 transitions. cyclomatic complexity: 8 Second operand 11 states. 100.36/76.96 [2019-03-28 12:45:28,576 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 25 transitions. cyclomatic complexity: 8. Second operand 11 states. Result 232 states and 243 transitions. Complement of second has 172 states. 100.36/76.96 [2019-03-28 12:45:28,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 47 states 4 stem states 39 non-accepting loop states 4 accepting loop states 100.36/76.96 [2019-03-28 12:45:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 100.36/76.96 [2019-03-28 12:45:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 131 transitions. 100.36/76.96 [2019-03-28 12:45:28,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 131 transitions. Stem has 7 letters. Loop has 11 letters. 100.36/76.96 [2019-03-28 12:45:28,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. 100.36/76.96 [2019-03-28 12:45:28,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 131 transitions. Stem has 18 letters. Loop has 11 letters. 100.36/76.96 [2019-03-28 12:45:28,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. 100.36/76.96 [2019-03-28 12:45:28,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 131 transitions. Stem has 7 letters. Loop has 22 letters. 100.36/76.96 [2019-03-28 12:45:28,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. 100.36/76.96 [2019-03-28 12:45:28,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 243 transitions. 100.36/76.96 [2019-03-28 12:45:28,596 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 100.36/76.96 [2019-03-28 12:45:28,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 98 states and 103 transitions. 100.36/76.96 [2019-03-28 12:45:28,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 100.36/76.96 [2019-03-28 12:45:28,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 100.36/76.96 [2019-03-28 12:45:28,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 103 transitions. 100.36/76.96 [2019-03-28 12:45:28,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 100.36/76.96 [2019-03-28 12:45:28,599 INFO L706 BuchiCegarLoop]: Abstraction has 98 states and 103 transitions. 100.36/76.96 [2019-03-28 12:45:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 103 transitions. 100.36/76.96 [2019-03-28 12:45:28,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 18. 100.36/76.96 [2019-03-28 12:45:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 100.36/76.96 [2019-03-28 12:45:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. 100.36/76.96 [2019-03-28 12:45:28,602 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. 100.36/76.96 [2019-03-28 12:45:28,602 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. 100.36/76.96 [2019-03-28 12:45:28,602 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 100.36/76.96 [2019-03-28 12:45:28,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. 100.36/76.96 [2019-03-28 12:45:28,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 100.36/76.96 [2019-03-28 12:45:28,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 100.36/76.96 [2019-03-28 12:45:28,603 INFO L119 BuchiIsEmpty]: Starting construction of run 100.36/76.96 [2019-03-28 12:45:28,603 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 100.36/76.96 [2019-03-28 12:45:28,604 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.36/76.96 [2019-03-28 12:45:28,604 INFO L794 eck$LassoCheckResult]: Stem: 987#ULTIMATE.startENTRY [89] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 984#L-1 [158] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_quot_~x_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= v_ULTIMATE.start_quot_~y_1 |v_ULTIMATE.start_quot_#in~y_1|) (= v_ULTIMATE.start_quot_~i~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| 0) (< |v_ULTIMATE.start_quot_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_quot_~y_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= v_ULTIMATE.start_quot_~i~0.base_1 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_quot_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= |v_ULTIMATE.start_quot_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_quot_~x_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= v_ULTIMATE.start_quot_~x_1 |v_ULTIMATE.start_quot_#in~x_1|) (< 0 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (< 0 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= (select .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_quot_~y_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc1.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc2.base_1| 4) |v_#length_1|) (= (store .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 (select .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_1|, ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_1|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_1, ULTIMATE.start_quot_#t~malloc2.offset=|v_ULTIMATE.start_quot_#t~malloc2.offset_1|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_1|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_1|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_1|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_1|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_1, ULTIMATE.start_quot_#res=|v_ULTIMATE.start_quot_#res_1|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_quot_#t~malloc0.offset=|v_ULTIMATE.start_quot_#t~malloc0.offset_1|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_1, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_1, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_1, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_1, ULTIMATE.start_quot_#t~malloc2.base=|v_ULTIMATE.start_quot_#t~malloc2.base_1|, ULTIMATE.start_quot_#t~malloc1.base=|v_ULTIMATE.start_quot_#t~malloc1.base_1|, ULTIMATE.start_quot_#t~malloc0.base=|v_ULTIMATE.start_quot_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_quot_#t~malloc1.offset=|v_ULTIMATE.start_quot_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_quot_#t~mem10=|v_ULTIMATE.start_quot_#t~mem10_1|, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_1, #valid=|v_#valid_3|, ULTIMATE.start_quot_#in~y=|v_ULTIMATE.start_quot_#in~y_1|, ULTIMATE.start_quot_#in~x=|v_ULTIMATE.start_quot_#in~x_1|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3, ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_#t~malloc2.offset, ULTIMATE.start_quot_#t~mem7, ULTIMATE.start_quot_#t~short6, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9, ULTIMATE.start_quot_~i~0.offset, ULTIMATE.start_quot_#res, ULTIMATE.start_quot_~x_ref~0.base, #length, ULTIMATE.start_quot_#t~malloc0.offset, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~i~0.base, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_#t~malloc2.base, ULTIMATE.start_quot_#t~malloc1.base, ULTIMATE.start_quot_#t~malloc0.base, ULTIMATE.start_quot_#t~malloc1.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, ULTIMATE.start_quot_#t~mem10, ULTIMATE.start_quot_~y, #valid, ULTIMATE.start_quot_#in~y, ULTIMATE.start_quot_#in~x] 985#L10 [75] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_quot_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3) v_ULTIMATE.start_quot_~x_ref~0.offset_3 v_ULTIMATE.start_quot_~x_3))) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_quot_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 982#L10-1 [120] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3) v_ULTIMATE.start_quot_~y_ref~0.offset_3 v_ULTIMATE.start_quot_~y_3)) |v_#memory_int_3|) (= (select |v_#valid_9| v_ULTIMATE.start_quot_~y_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_quot_~y_ref~0.base_3))) InVars {ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int] 983#L11 [90] L11-->L12: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3) v_ULTIMATE.start_quot_~i~0.offset_3 0))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_quot_~i~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_quot_~i~0.base_3)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 989#L12 [104] L12-->L13: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_quot_~x_ref~0.base_6) v_ULTIMATE.start_quot_~x_ref~0.offset_5)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 991#L13 [177] L13-->L14-8: Formula: (> |v_ULTIMATE.start_quot_#t~mem3_6| 0) InVars {ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 979#L14-8 100.36/76.96 [2019-03-28 12:45:28,605 INFO L796 eck$LassoCheckResult]: Loop: 979#L14-8 [115] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_7) (= |v_ULTIMATE.start_quot_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_quot_~x_ref~0.base_9) v_ULTIMATE.start_quot_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_quot_~x_ref~0.base_9)) (= (select |v_#valid_19| v_ULTIMATE.start_quot_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4] 980#L14-1 [187] L14-1-->L14-2: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem4_3|) |v_ULTIMATE.start_quot_#t~short6_2|) InVars {ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 990#L14-2 [82] L14-2-->L14-3: Formula: |v_ULTIMATE.start_quot_#t~short6_3| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} AuxVars[] AssignedVars[] 988#L14-3 [79] L14-3-->L14-4: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_quot_~y_ref~0.base_6) v_ULTIMATE.start_quot_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_quot_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_5) (= 1 (select |v_#valid_21| v_ULTIMATE.start_quot_~y_ref~0.base_6))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, #length=|v_#length_15|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_2|, #valid=|v_#valid_21|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem5] 986#L14-4 [193] L14-4-->L14-6: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem5_3|) |v_ULTIMATE.start_quot_#t~short6_4|) InVars {ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_4|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 981#L14-6 [119] L14-6-->L15: Formula: |v_ULTIMATE.start_quot_#t~short6_9| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_9|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_5|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_5|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_8|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_quot_#t~short6] 974#L15 [86] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~i~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_quot_~i~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_quot_~i~0.base_6) v_ULTIMATE.start_quot_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_5) (= (select |v_#valid_23| v_ULTIMATE.start_quot_~i~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, #length=|v_#length_17|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem7] 975#L15-1 [218] L15-1-->L16: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_quot_~i~0.base_16)) (= (store |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16 (store (select |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16) v_ULTIMATE.start_quot_~i~0.offset_12 (+ |v_ULTIMATE.start_quot_#t~mem7_6| 1))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_quot_~i~0.base_16)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_12)) InVars {ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_6|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem7] 978#L16 [101] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_9 4) (select |v_#length_21| v_ULTIMATE.start_quot_~x_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_quot_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_quot_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_quot_~x_ref~0.base_12) v_ULTIMATE.start_quot_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_2|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem8] 976#L16-1 [98] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_7) (= 1 (select |v_#valid_29| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_quot_~y_ref~0.base_9) v_ULTIMATE.start_quot_~y_ref~0.offset_7))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #length=|v_#length_23|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #valid=|v_#valid_29|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem9] 977#L16-2 [219] L16-2-->L14-8: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= (store |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18 (store (select |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18) v_ULTIMATE.start_quot_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_quot_#t~mem8_6| (* (- 1) |v_ULTIMATE.start_quot_#t~mem9_6|)))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_6|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_6|} OutVars{#valid=|v_#valid_42|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9] 979#L14-8 100.36/76.96 [2019-03-28 12:45:28,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.96 [2019-03-28 12:45:28,605 INFO L82 PathProgramCache]: Analyzing trace with hash -572373232, now seen corresponding path program 1 times 100.36/76.96 [2019-03-28 12:45:28,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.96 [2019-03-28 12:45:28,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.96 [2019-03-28 12:45:28,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:28,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:28,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:28,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.96 [2019-03-28 12:45:28,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1707090210, now seen corresponding path program 3 times 100.36/76.96 [2019-03-28 12:45:28,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.96 [2019-03-28 12:45:28,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.96 [2019-03-28 12:45:28,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:28,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:28,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:28,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.96 [2019-03-28 12:45:28,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1399056495, now seen corresponding path program 1 times 100.36/76.96 [2019-03-28 12:45:28,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.96 [2019-03-28 12:45:28,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.96 [2019-03-28 12:45:28,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:28,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:28,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:28,849 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 100.36/76.96 [2019-03-28 12:45:29,246 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 100.36/76.96 [2019-03-28 12:45:29,418 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 85 100.36/76.96 [2019-03-28 12:45:29,421 INFO L216 LassoAnalysis]: Preferences: 100.36/76.96 [2019-03-28 12:45:29,421 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 100.36/76.96 [2019-03-28 12:45:29,421 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 100.36/76.96 [2019-03-28 12:45:29,421 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 100.36/76.96 [2019-03-28 12:45:29,422 INFO L127 ssoRankerPreferences]: Use exernal solver: false 100.36/76.96 [2019-03-28 12:45:29,422 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 100.36/76.96 [2019-03-28 12:45:29,422 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 100.36/76.96 [2019-03-28 12:45:29,422 INFO L130 ssoRankerPreferences]: Path of dumped script: 100.36/76.96 [2019-03-28 12:45:29,422 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 100.36/76.96 [2019-03-28 12:45:29,422 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 100.36/76.96 [2019-03-28 12:45:29,422 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 100.36/76.96 [2019-03-28 12:45:29,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,748 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 100.36/76.96 [2019-03-28 12:45:29,865 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 100.36/76.96 [2019-03-28 12:45:29,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:29,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:30,275 INFO L300 LassoAnalysis]: Preprocessing complete. 100.36/76.96 [2019-03-28 12:45:30,276 INFO L497 LassoAnalysis]: Using template 'affine'. 100.36/76.96 [2019-03-28 12:45:30,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:30,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:30,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.96 [2019-03-28 12:45:30,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:30,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:30,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:30,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:30,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:30,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:30,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:30,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:30,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.96 [2019-03-28 12:45:30,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:30,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:30,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:30,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:30,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:30,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:30,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:30,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:30,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:30,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:30,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:30,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:30,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:30,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:30,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:30,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:30,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.96 [2019-03-28 12:45:30,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:30,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:30,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:30,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:30,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:30,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:30,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:30,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:30,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.96 [2019-03-28 12:45:30,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:30,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:30,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:30,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:30,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:30,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:30,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:30,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:30,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.96 [2019-03-28 12:45:30,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:30,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:30,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:30,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:30,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:30,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:30,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:30,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:30,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.96 [2019-03-28 12:45:30,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:30,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:30,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:30,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:30,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:30,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:30,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:30,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:30,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.96 [2019-03-28 12:45:30,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:30,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:30,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:30,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:30,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:30,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:30,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:30,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:30,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:30,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:30,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:30,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:30,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:30,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:30,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:30,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:30,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:30,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:30,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:30,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:30,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:30,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:30,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:30,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:30,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:30,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:30,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:30,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:30,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:30,323 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 100.36/76.96 [2019-03-28 12:45:30,332 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 100.36/76.96 [2019-03-28 12:45:30,332 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 100.36/76.96 [2019-03-28 12:45:30,333 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 100.36/76.96 [2019-03-28 12:45:30,334 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 100.36/76.96 [2019-03-28 12:45:30,334 INFO L518 LassoAnalysis]: Proved termination. 100.36/76.96 [2019-03-28 12:45:30,334 INFO L520 LassoAnalysis]: Termination argument consisting of: 100.36/76.96 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_2 100.36/76.96 Supporting invariants [] 100.36/76.96 [2019-03-28 12:45:30,418 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 100.36/76.96 [2019-03-28 12:45:30,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.36/76.96 [2019-03-28 12:45:30,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.96 [2019-03-28 12:45:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.96 [2019-03-28 12:45:30,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core 100.36/76.96 [2019-03-28 12:45:30,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.36/76.96 [2019-03-28 12:45:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.96 [2019-03-28 12:45:30,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core 100.36/76.96 [2019-03-28 12:45:30,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.36/76.96 [2019-03-28 12:45:30,609 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:30,609 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 86 100.36/76.96 [2019-03-28 12:45:30,619 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:30,743 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 100.36/76.96 [2019-03-28 12:45:30,743 INFO L497 ElimStorePlain]: treesize reduction 94, result has 36.9 percent of original size 100.36/76.96 [2019-03-28 12:45:30,744 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:30,745 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:47 100.36/76.96 [2019-03-28 12:45:36,397 WARN L188 SmtUtils]: Spent 3.70 s on a formula simplification that was a NOOP. DAG size: 31 100.36/76.96 [2019-03-28 12:45:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.96 [2019-03-28 12:45:38,472 WARN L860 $PredicateComparison]: unable to prove that (or (<= 2 (select (select |c_#memory_int| c_ULTIMATE.start_quot_~i~0.base) c_ULTIMATE.start_quot_~y_ref~0.offset)) (exists ((ULTIMATE.start_quot_~i~0.offset Int)) (not (and (= c_ULTIMATE.start_quot_~y_ref~0.base c_ULTIMATE.start_quot_~i~0.base) (= ULTIMATE.start_quot_~i~0.offset c_ULTIMATE.start_quot_~y_ref~0.offset))))) is different from true 100.36/76.96 [2019-03-28 12:45:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:38,573 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 100.36/76.96 [2019-03-28 12:45:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.96 [2019-03-28 12:45:38,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core 100.36/76.96 [2019-03-28 12:45:38,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.36/76.96 [2019-03-28 12:45:38,602 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 100.36/76.96 [2019-03-28 12:45:38,603 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:38,610 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:38,611 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:38,611 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 100.36/76.96 [2019-03-28 12:45:38,725 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:38,725 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 68 100.36/76.96 [2019-03-28 12:45:38,730 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:38,790 INFO L497 ElimStorePlain]: treesize reduction 49, result has 51.0 percent of original size 100.36/76.96 [2019-03-28 12:45:38,792 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:38,792 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 100.36/76.96 [2019-03-28 12:45:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.96 [2019-03-28 12:45:39,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core 100.36/76.96 [2019-03-28 12:45:39,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.36/76.96 [2019-03-28 12:45:39,490 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:39,490 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 68 100.36/76.96 [2019-03-28 12:45:39,495 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:39,570 INFO L497 ElimStorePlain]: treesize reduction 49, result has 51.0 percent of original size 100.36/76.96 [2019-03-28 12:45:39,572 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:39,572 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 100.36/76.96 [2019-03-28 12:45:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:39,651 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 100.36/76.96 [2019-03-28 12:45:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:39,661 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 100.36/76.96 [2019-03-28 12:45:39,661 INFO L98 LoopCannibalizer]: 13 predicates before loop cannibalization 22 predicates after loop cannibalization 100.36/76.96 [2019-03-28 12:45:39,661 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 22 loop predicates 100.36/76.96 [2019-03-28 12:45:39,662 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 23 transitions. cyclomatic complexity: 6 Second operand 11 states. 100.36/76.96 [2019-03-28 12:45:52,213 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 23 transitions. cyclomatic complexity: 6. Second operand 11 states. Result 174 states and 182 transitions. Complement of second has 129 states. 100.36/76.96 [2019-03-28 12:45:52,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 47 states 4 stem states 39 non-accepting loop states 4 accepting loop states 100.36/76.96 [2019-03-28 12:45:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 100.36/76.96 [2019-03-28 12:45:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 112 transitions. 100.36/76.96 [2019-03-28 12:45:52,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 112 transitions. Stem has 7 letters. Loop has 11 letters. 100.36/76.96 [2019-03-28 12:45:52,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. 100.36/76.96 [2019-03-28 12:45:52,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 112 transitions. Stem has 18 letters. Loop has 11 letters. 100.36/76.96 [2019-03-28 12:45:52,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. 100.36/76.96 [2019-03-28 12:45:52,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 112 transitions. Stem has 7 letters. Loop has 22 letters. 100.36/76.96 [2019-03-28 12:45:52,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. 100.36/76.96 [2019-03-28 12:45:52,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 182 transitions. 100.36/76.96 [2019-03-28 12:45:52,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 100.36/76.96 [2019-03-28 12:45:52,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 66 states and 69 transitions. 100.36/76.96 [2019-03-28 12:45:52,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 100.36/76.96 [2019-03-28 12:45:52,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 100.36/76.96 [2019-03-28 12:45:52,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 69 transitions. 100.36/76.96 [2019-03-28 12:45:52,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 100.36/76.96 [2019-03-28 12:45:52,228 INFO L706 BuchiCegarLoop]: Abstraction has 66 states and 69 transitions. 100.36/76.96 [2019-03-28 12:45:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 69 transitions. 100.36/76.96 [2019-03-28 12:45:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 18. 100.36/76.96 [2019-03-28 12:45:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 100.36/76.96 [2019-03-28 12:45:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. 100.36/76.96 [2019-03-28 12:45:52,231 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. 100.36/76.96 [2019-03-28 12:45:52,231 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. 100.36/76.96 [2019-03-28 12:45:52,231 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 100.36/76.96 [2019-03-28 12:45:52,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. 100.36/76.96 [2019-03-28 12:45:52,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 100.36/76.96 [2019-03-28 12:45:52,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 100.36/76.96 [2019-03-28 12:45:52,232 INFO L119 BuchiIsEmpty]: Starting construction of run 100.36/76.96 [2019-03-28 12:45:52,232 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 100.36/76.96 [2019-03-28 12:45:52,232 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.36/76.96 [2019-03-28 12:45:52,233 INFO L794 eck$LassoCheckResult]: Stem: 1668#ULTIMATE.startENTRY [89] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1665#L-1 [157] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_quot_~x_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= v_ULTIMATE.start_quot_~y_1 |v_ULTIMATE.start_quot_#in~y_1|) (= v_ULTIMATE.start_quot_~i~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| 0) (< |v_ULTIMATE.start_quot_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_quot_~y_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (= v_ULTIMATE.start_quot_~i~0.base_1 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_quot_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_quot_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc2.offset_1|) (> 0 |v_ULTIMATE.start_quot_#t~malloc1.base_1|) (< |v_ULTIMATE.start_quot_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc0.offset_1|) (= |v_ULTIMATE.start_quot_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_quot_~x_ref~0.base_1 |v_ULTIMATE.start_quot_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (= v_ULTIMATE.start_quot_~x_1 |v_ULTIMATE.start_quot_#in~x_1|) (= (select .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1|) 0) (= v_ULTIMATE.start_quot_~y_ref~0.offset_1 |v_ULTIMATE.start_quot_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_quot_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_quot_#t~malloc0.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc1.base_1| 4) |v_ULTIMATE.start_quot_#t~malloc2.base_1| 4) |v_#length_1|) (= (store .cse0 |v_ULTIMATE.start_quot_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 (select .cse1 |v_ULTIMATE.start_quot_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_1|, ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_1|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_1, ULTIMATE.start_quot_#t~malloc2.offset=|v_ULTIMATE.start_quot_#t~malloc2.offset_1|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_1|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_1|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_1|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_1|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_1, ULTIMATE.start_quot_#res=|v_ULTIMATE.start_quot_#res_1|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_quot_#t~malloc0.offset=|v_ULTIMATE.start_quot_#t~malloc0.offset_1|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_1, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_1, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_1, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_1, ULTIMATE.start_quot_#t~malloc2.base=|v_ULTIMATE.start_quot_#t~malloc2.base_1|, ULTIMATE.start_quot_#t~malloc1.base=|v_ULTIMATE.start_quot_#t~malloc1.base_1|, ULTIMATE.start_quot_#t~malloc0.base=|v_ULTIMATE.start_quot_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_quot_#t~malloc1.offset=|v_ULTIMATE.start_quot_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_quot_#t~mem10=|v_ULTIMATE.start_quot_#t~mem10_1|, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_1, #valid=|v_#valid_3|, ULTIMATE.start_quot_#in~y=|v_ULTIMATE.start_quot_#in~y_1|, ULTIMATE.start_quot_#in~x=|v_ULTIMATE.start_quot_#in~x_1|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3, ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_#t~malloc2.offset, ULTIMATE.start_quot_#t~mem7, ULTIMATE.start_quot_#t~short6, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9, ULTIMATE.start_quot_~i~0.offset, ULTIMATE.start_quot_#res, ULTIMATE.start_quot_~x_ref~0.base, #length, ULTIMATE.start_quot_#t~malloc0.offset, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~i~0.base, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_#t~malloc2.base, ULTIMATE.start_quot_#t~malloc1.base, ULTIMATE.start_quot_#t~malloc0.base, ULTIMATE.start_quot_#t~malloc1.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, ULTIMATE.start_quot_#t~mem10, ULTIMATE.start_quot_~y, #valid, ULTIMATE.start_quot_#in~y, ULTIMATE.start_quot_#in~x] 1666#L10 [75] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_quot_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_quot_~x_ref~0.base_3) v_ULTIMATE.start_quot_~x_ref~0.offset_3 v_ULTIMATE.start_quot_~x_3))) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_quot_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_quot_~x=v_ULTIMATE.start_quot_~x_3, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1663#L10-1 [120] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_quot_~y_ref~0.base_3) v_ULTIMATE.start_quot_~y_ref~0.offset_3 v_ULTIMATE.start_quot_~y_3)) |v_#memory_int_3|) (= (select |v_#valid_9| v_ULTIMATE.start_quot_~y_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_quot_~y_ref~0.base_3))) InVars {ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_3, ULTIMATE.start_quot_~y=v_ULTIMATE.start_quot_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_3, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int] 1664#L11 [90] L11-->L12: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_quot_~i~0.base_3) v_ULTIMATE.start_quot_~i~0.offset_3 0))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_quot_~i~0.base_3)) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_quot_~i~0.base_3)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_3, #length=|v_#length_9|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1670#L12 [104] L12-->L13: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_quot_~x_ref~0.base_6) v_ULTIMATE.start_quot_~x_ref~0.offset_5)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_quot_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_6, #length=|v_#length_11|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 1672#L13 [177] L13-->L14-8: Formula: (> |v_ULTIMATE.start_quot_#t~mem3_6| 0) InVars {ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_6|} OutVars{ULTIMATE.start_quot_#t~mem3=|v_ULTIMATE.start_quot_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem3] 1660#L14-8 100.36/76.96 [2019-03-28 12:45:52,233 INFO L796 eck$LassoCheckResult]: Loop: 1660#L14-8 [115] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_7) (= |v_ULTIMATE.start_quot_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_quot_~x_ref~0.base_9) v_ULTIMATE.start_quot_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_quot_~x_ref~0.base_9)) (= (select |v_#valid_19| v_ULTIMATE.start_quot_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_9, #length=|v_#length_13|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4] 1661#L14-1 [187] L14-1-->L14-2: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem4_3|) |v_ULTIMATE.start_quot_#t~short6_2|) InVars {ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_3|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 1671#L14-2 [82] L14-2-->L14-3: Formula: |v_ULTIMATE.start_quot_#t~short6_3| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_3|} AuxVars[] AssignedVars[] 1669#L14-3 [79] L14-3-->L14-4: Formula: (and (= |v_ULTIMATE.start_quot_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_quot_~y_ref~0.base_6) v_ULTIMATE.start_quot_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_quot_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_5) (= 1 (select |v_#valid_21| v_ULTIMATE.start_quot_~y_ref~0.base_6))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, #length=|v_#length_15|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_5, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_2|, #valid=|v_#valid_21|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_6, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem5] 1667#L14-4 [193] L14-4-->L14-6: Formula: (and (< 0 |v_ULTIMATE.start_quot_#t~mem5_3|) |v_ULTIMATE.start_quot_#t~short6_4|) InVars {ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} OutVars{ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_4|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~short6] 1662#L14-6 [119] L14-6-->L15: Formula: |v_ULTIMATE.start_quot_#t~short6_9| InVars {ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_9|} OutVars{ULTIMATE.start_quot_#t~mem4=|v_ULTIMATE.start_quot_#t~mem4_5|, ULTIMATE.start_quot_#t~mem5=|v_ULTIMATE.start_quot_#t~mem5_5|, ULTIMATE.start_quot_#t~short6=|v_ULTIMATE.start_quot_#t~short6_8|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem4, ULTIMATE.start_quot_#t~mem5, ULTIMATE.start_quot_#t~short6] 1657#L15 [86] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~i~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_quot_~i~0.base_6)) (= |v_ULTIMATE.start_quot_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_quot_~i~0.base_6) v_ULTIMATE.start_quot_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_5) (= (select |v_#valid_23| v_ULTIMATE.start_quot_~i~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, #length=|v_#length_17|, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_6, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_5, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem7] 1658#L15-1 [218] L15-1-->L16: Formula: (and (= 1 (select |v_#valid_41| v_ULTIMATE.start_quot_~i~0.base_16)) (= (store |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16 (store (select |v_#memory_int_20| v_ULTIMATE.start_quot_~i~0.base_16) v_ULTIMATE.start_quot_~i~0.offset_12 (+ |v_ULTIMATE.start_quot_#t~mem7_6| 1))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_quot_~i~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_quot_~i~0.base_16)) (<= 0 v_ULTIMATE.start_quot_~i~0.offset_12)) InVars {ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_6|} OutVars{ULTIMATE.start_quot_~i~0.base=v_ULTIMATE.start_quot_~i~0.base_16, ULTIMATE.start_quot_~i~0.offset=v_ULTIMATE.start_quot_~i~0.offset_12, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_quot_#t~mem7=|v_ULTIMATE.start_quot_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem7] 1659#L16 [101] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_9 4) (select |v_#length_21| v_ULTIMATE.start_quot_~x_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_quot_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_quot_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_quot_~x_ref~0.base_12) v_ULTIMATE.start_quot_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_12, #length=|v_#length_21|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_2|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem8] 1655#L16-1 [98] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_quot_~y_ref~0.offset_7) (= 1 (select |v_#valid_29| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_quot_~y_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_quot_~y_ref~0.base_9)) (= |v_ULTIMATE.start_quot_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_quot_~y_ref~0.base_9) v_ULTIMATE.start_quot_~y_ref~0.offset_7))) InVars {ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #length=|v_#length_23|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_quot_~y_ref~0.offset=v_ULTIMATE.start_quot_~y_ref~0.offset_7, #valid=|v_#valid_29|, ULTIMATE.start_quot_~y_ref~0.base=v_ULTIMATE.start_quot_~y_ref~0.base_9, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_quot_#t~mem9] 1656#L16-2 [219] L16-2-->L14-8: Formula: (and (<= 0 v_ULTIMATE.start_quot_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_quot_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_quot_~x_ref~0.base_18)) (= (store |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18 (store (select |v_#memory_int_22| v_ULTIMATE.start_quot_~x_ref~0.base_18) v_ULTIMATE.start_quot_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_quot_#t~mem8_6| (* (- 1) |v_ULTIMATE.start_quot_#t~mem9_6|)))) |v_#memory_int_21|)) InVars {#valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_6|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_6|} OutVars{#valid=|v_#valid_42|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_quot_~x_ref~0.base=v_ULTIMATE.start_quot_~x_ref~0.base_18, #length=|v_#length_31|, ULTIMATE.start_quot_#t~mem8=|v_ULTIMATE.start_quot_#t~mem8_5|, ULTIMATE.start_quot_~x_ref~0.offset=v_ULTIMATE.start_quot_~x_ref~0.offset_13, ULTIMATE.start_quot_#t~mem9=|v_ULTIMATE.start_quot_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_quot_#t~mem8, ULTIMATE.start_quot_#t~mem9] 1660#L14-8 100.36/76.96 [2019-03-28 12:45:52,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.96 [2019-03-28 12:45:52,234 INFO L82 PathProgramCache]: Analyzing trace with hash -601002383, now seen corresponding path program 1 times 100.36/76.96 [2019-03-28 12:45:52,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.96 [2019-03-28 12:45:52,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.96 [2019-03-28 12:45:52,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:52,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:52,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:52,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.96 [2019-03-28 12:45:52,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1707090210, now seen corresponding path program 4 times 100.36/76.96 [2019-03-28 12:45:52,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.96 [2019-03-28 12:45:52,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.96 [2019-03-28 12:45:52,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:52,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:52,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.96 [2019-03-28 12:45:52,265 INFO L82 PathProgramCache]: Analyzing trace with hash 45746798, now seen corresponding path program 1 times 100.36/76.96 [2019-03-28 12:45:52,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.36/76.96 [2019-03-28 12:45:52,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.36/76.96 [2019-03-28 12:45:52,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:52,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:52,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.36/76.96 [2019-03-28 12:45:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:45:52,702 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 100.36/76.96 [2019-03-28 12:45:52,849 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 83 100.36/76.96 [2019-03-28 12:45:52,853 INFO L216 LassoAnalysis]: Preferences: 100.36/76.96 [2019-03-28 12:45:52,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 100.36/76.96 [2019-03-28 12:45:52,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 100.36/76.96 [2019-03-28 12:45:52,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 100.36/76.96 [2019-03-28 12:45:52,853 INFO L127 ssoRankerPreferences]: Use exernal solver: false 100.36/76.96 [2019-03-28 12:45:52,854 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 100.36/76.96 [2019-03-28 12:45:52,854 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 100.36/76.96 [2019-03-28 12:45:52,854 INFO L130 ssoRankerPreferences]: Path of dumped script: 100.36/76.96 [2019-03-28 12:45:52,854 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 100.36/76.96 [2019-03-28 12:45:52,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 100.36/76.96 [2019-03-28 12:45:52,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 100.36/76.96 [2019-03-28 12:45:52,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:52,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:52,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:52,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:52,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:53,152 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 100.36/76.96 [2019-03-28 12:45:53,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:53,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:53,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:53,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:53,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:53,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:53,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:53,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:53,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.36/76.96 [2019-03-28 12:45:53,649 INFO L300 LassoAnalysis]: Preprocessing complete. 100.36/76.96 [2019-03-28 12:45:53,649 INFO L497 LassoAnalysis]: Using template 'affine'. 100.36/76.96 [2019-03-28 12:45:53,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:53,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:53,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.96 [2019-03-28 12:45:53,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:53,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:53,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:53,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:53,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:53,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:53,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:53,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:53,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.96 [2019-03-28 12:45:53,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:53,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:53,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:53,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:53,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:53,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:53,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:53,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:53,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:53,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:53,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:53,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:53,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:53,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:53,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:53,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:53,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.36/76.96 [2019-03-28 12:45:53,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:53,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:53,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:53,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:53,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:53,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:53,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:53,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:53,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:53,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:53,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:53,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:53,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:53,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.36/76.96 [2019-03-28 12:45:53,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.36/76.96 Termination analysis: LINEAR_WITH_GUESSES 100.36/76.96 Number of strict supporting invariants: 0 100.36/76.96 Number of non-strict supporting invariants: 1 100.36/76.96 Consider only non-deceasing supporting invariants: true 100.36/76.96 Simplify termination arguments: true 100.36/76.96 Simplify supporting invariants: trueOverapproximate stem: false 100.36/76.96 [2019-03-28 12:45:53,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.36/76.96 [2019-03-28 12:45:53,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.36/76.96 [2019-03-28 12:45:53,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.36/76.96 [2019-03-28 12:45:53,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.36/76.96 [2019-03-28 12:45:53,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.36/76.96 [2019-03-28 12:45:53,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.36/76.96 [2019-03-28 12:45:53,680 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 100.36/76.96 [2019-03-28 12:45:53,689 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 100.36/76.96 [2019-03-28 12:45:53,689 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 100.36/76.96 [2019-03-28 12:45:53,690 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 100.36/76.96 [2019-03-28 12:45:53,690 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 100.36/76.96 [2019-03-28 12:45:53,691 INFO L518 LassoAnalysis]: Proved termination. 100.36/76.96 [2019-03-28 12:45:53,691 INFO L520 LassoAnalysis]: Termination argument consisting of: 100.36/76.96 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_3 100.36/76.96 Supporting invariants [] 100.36/76.96 [2019-03-28 12:45:53,783 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 100.36/76.96 [2019-03-28 12:45:53,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.36/76.96 [2019-03-28 12:45:53,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.36/76.96 [2019-03-28 12:45:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.96 [2019-03-28 12:45:53,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core 100.36/76.96 [2019-03-28 12:45:53,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.36/76.96 [2019-03-28 12:45:53,859 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:53,859 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 100.36/76.96 [2019-03-28 12:45:53,859 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:53,866 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:53,870 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 100.36/76.96 [2019-03-28 12:45:53,870 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:53,876 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:53,876 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:53,876 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:12 100.36/76.96 [2019-03-28 12:45:53,897 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:53,898 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 100.36/76.96 [2019-03-28 12:45:53,899 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 100.36/76.96 [2019-03-28 12:45:53,905 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:53,906 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:53,906 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:10 100.36/76.96 [2019-03-28 12:45:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.96 [2019-03-28 12:45:53,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core 100.36/76.96 [2019-03-28 12:45:53,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.36/76.96 [2019-03-28 12:45:54,087 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:45:54,088 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 86 100.36/76.96 [2019-03-28 12:45:54,095 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:54,175 INFO L497 ElimStorePlain]: treesize reduction 122, result has 31.1 percent of original size 100.36/76.96 [2019-03-28 12:45:54,177 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 100.36/76.96 [2019-03-28 12:45:54,177 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:47 100.36/76.96 [2019-03-28 12:45:59,865 WARN L188 SmtUtils]: Spent 3.72 s on a formula simplification that was a NOOP. DAG size: 31 100.36/76.96 [2019-03-28 12:46:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.36/76.96 [2019-03-28 12:46:02,020 WARN L860 $PredicateComparison]: unable to prove that (or (<= 2 (select (select |c_#memory_int| c_ULTIMATE.start_quot_~i~0.base) c_ULTIMATE.start_quot_~y_ref~0.offset)) (exists ((ULTIMATE.start_quot_~i~0.offset Int)) (not (and (= c_ULTIMATE.start_quot_~y_ref~0.base c_ULTIMATE.start_quot_~i~0.base) (= ULTIMATE.start_quot_~i~0.offset c_ULTIMATE.start_quot_~y_ref~0.offset))))) is different from true 100.36/76.96 [2019-03-28 12:46:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:46:02,131 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 100.36/76.96 [2019-03-28 12:46:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.96 [2019-03-28 12:46:02,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core 100.36/76.96 [2019-03-28 12:46:02,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.36/76.96 [2019-03-28 12:46:02,148 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 100.36/76.96 [2019-03-28 12:46:02,148 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:46:02,155 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:46:02,155 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:46:02,155 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 100.36/76.96 [2019-03-28 12:46:02,245 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:46:02,246 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 68 100.36/76.96 [2019-03-28 12:46:02,249 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:46:02,302 INFO L497 ElimStorePlain]: treesize reduction 50, result has 49.5 percent of original size 100.36/76.96 [2019-03-28 12:46:02,303 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:46:02,303 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 100.36/76.96 [2019-03-28 12:46:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.36/76.96 [2019-03-28 12:46:03,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core 100.36/76.96 [2019-03-28 12:46:03,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.36/76.96 [2019-03-28 12:46:03,162 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.36/76.96 [2019-03-28 12:46:03,162 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 68 100.36/76.96 [2019-03-28 12:46:03,165 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:46:03,233 INFO L497 ElimStorePlain]: treesize reduction 50, result has 49.5 percent of original size 100.36/76.96 [2019-03-28 12:46:03,234 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.36/76.96 [2019-03-28 12:46:03,234 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 100.36/76.96 [2019-03-28 12:46:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:46:03,333 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 100.36/76.96 [2019-03-28 12:46:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.36/76.96 [2019-03-28 12:46:03,345 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 100.36/76.96 [2019-03-28 12:46:03,345 INFO L98 LoopCannibalizer]: 13 predicates before loop cannibalization 22 predicates after loop cannibalization 100.36/76.96 [2019-03-28 12:46:03,346 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 22 loop predicates 100.36/76.96 [2019-03-28 12:46:03,346 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 21 transitions. cyclomatic complexity: 4 Second operand 14 states. 100.36/76.96 [2019-03-28 12:46:14,355 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 21 transitions. cyclomatic complexity: 4. Second operand 14 states. Result 58 states and 62 transitions. Complement of second has 44 states. 100.36/76.96 [2019-03-28 12:46:14,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 3 stem states 18 non-accepting loop states 3 accepting loop states 100.36/76.96 [2019-03-28 12:46:14,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 100.36/76.96 [2019-03-28 12:46:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 57 transitions. 100.36/76.96 [2019-03-28 12:46:14,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 57 transitions. Stem has 7 letters. Loop has 11 letters. 100.36/76.96 [2019-03-28 12:46:14,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. 100.36/76.96 [2019-03-28 12:46:14,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 57 transitions. Stem has 18 letters. Loop has 11 letters. 100.36/76.96 [2019-03-28 12:46:14,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. 100.36/76.96 [2019-03-28 12:46:14,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 57 transitions. Stem has 7 letters. Loop has 22 letters. 100.36/76.96 [2019-03-28 12:46:14,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. 100.36/76.96 [2019-03-28 12:46:14,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. 100.36/76.96 [2019-03-28 12:46:14,365 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 100.36/76.96 [2019-03-28 12:46:14,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 0 states and 0 transitions. 100.36/76.96 [2019-03-28 12:46:14,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 100.36/76.96 [2019-03-28 12:46:14,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 100.36/76.96 [2019-03-28 12:46:14,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 100.36/76.96 [2019-03-28 12:46:14,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 100.36/76.96 [2019-03-28 12:46:14,366 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 100.36/76.96 [2019-03-28 12:46:14,366 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 100.36/76.96 [2019-03-28 12:46:14,366 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 100.36/76.96 [2019-03-28 12:46:14,366 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 100.36/76.96 [2019-03-28 12:46:14,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 100.36/76.96 [2019-03-28 12:46:14,367 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 100.36/76.96 [2019-03-28 12:46:14,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 100.36/76.96 [2019-03-28 12:46:14,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:14 BasicIcfg 100.36/76.96 [2019-03-28 12:46:14,373 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 100.36/76.96 [2019-03-28 12:46:14,374 INFO L168 Benchmark]: Toolchain (without parser) took 72642.64 ms. Allocated memory was 649.6 MB in the beginning and 929.6 MB in the end (delta: 280.0 MB). Free memory was 563.9 MB in the beginning and 624.1 MB in the end (delta: -60.2 MB). Peak memory consumption was 219.8 MB. Max. memory is 50.3 GB. 100.36/76.96 [2019-03-28 12:46:14,375 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 100.36/76.96 [2019-03-28 12:46:14,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.78 ms. Allocated memory was 649.6 MB in the beginning and 681.6 MB in the end (delta: 32.0 MB). Free memory was 563.9 MB in the beginning and 647.8 MB in the end (delta: -83.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 100.36/76.96 [2019-03-28 12:46:14,376 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.82 ms. Allocated memory is still 681.6 MB. Free memory was 647.8 MB in the beginning and 644.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 100.36/76.96 [2019-03-28 12:46:14,376 INFO L168 Benchmark]: Boogie Preprocessor took 24.27 ms. Allocated memory is still 681.6 MB. Free memory was 644.7 MB in the beginning and 643.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 100.36/76.96 [2019-03-28 12:46:14,377 INFO L168 Benchmark]: RCFGBuilder took 340.71 ms. Allocated memory is still 681.6 MB. Free memory was 643.3 MB in the beginning and 618.2 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. 100.36/76.96 [2019-03-28 12:46:14,377 INFO L168 Benchmark]: BlockEncodingV2 took 131.19 ms. Allocated memory is still 681.6 MB. Free memory was 618.2 MB in the beginning and 607.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 100.36/76.96 [2019-03-28 12:46:14,378 INFO L168 Benchmark]: TraceAbstraction took 1515.75 ms. Allocated memory is still 681.6 MB. Free memory was 607.4 MB in the beginning and 438.6 MB in the end (delta: 168.9 MB). Peak memory consumption was 168.9 MB. Max. memory is 50.3 GB. 100.36/76.96 [2019-03-28 12:46:14,378 INFO L168 Benchmark]: BuchiAutomizer took 70282.92 ms. Allocated memory was 681.6 MB in the beginning and 929.6 MB in the end (delta: 248.0 MB). Free memory was 438.6 MB in the beginning and 624.1 MB in the end (delta: -185.5 MB). Peak memory consumption was 62.5 MB. Max. memory is 50.3 GB. 100.36/76.96 [2019-03-28 12:46:14,382 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 100.36/76.96 --- Results --- 100.36/76.96 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 100.36/76.96 - StatisticsResult: Initial Icfg 100.36/76.96 50 locations, 53 edges 100.36/76.96 - StatisticsResult: Encoded RCFG 100.36/76.96 43 locations, 78 edges 100.36/76.96 * Results from de.uni_freiburg.informatik.ultimate.core: 100.36/76.96 - StatisticsResult: Toolchain Benchmarks 100.36/76.96 Benchmark results are: 100.36/76.96 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 100.36/76.96 * CACSL2BoogieTranslator took 300.78 ms. Allocated memory was 649.6 MB in the beginning and 681.6 MB in the end (delta: 32.0 MB). Free memory was 563.9 MB in the beginning and 647.8 MB in the end (delta: -83.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 100.36/76.96 * Boogie Procedure Inliner took 41.82 ms. Allocated memory is still 681.6 MB. Free memory was 647.8 MB in the beginning and 644.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 100.36/76.96 * Boogie Preprocessor took 24.27 ms. Allocated memory is still 681.6 MB. Free memory was 644.7 MB in the beginning and 643.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 100.36/76.96 * RCFGBuilder took 340.71 ms. Allocated memory is still 681.6 MB. Free memory was 643.3 MB in the beginning and 618.2 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. 100.36/76.96 * BlockEncodingV2 took 131.19 ms. Allocated memory is still 681.6 MB. Free memory was 618.2 MB in the beginning and 607.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 100.36/76.96 * TraceAbstraction took 1515.75 ms. Allocated memory is still 681.6 MB. Free memory was 607.4 MB in the beginning and 438.6 MB in the end (delta: 168.9 MB). Peak memory consumption was 168.9 MB. Max. memory is 50.3 GB. 100.36/76.96 * BuchiAutomizer took 70282.92 ms. Allocated memory was 681.6 MB in the beginning and 929.6 MB in the end (delta: 248.0 MB). Free memory was 438.6 MB in the beginning and 624.1 MB in the end (delta: -185.5 MB). Peak memory consumption was 62.5 MB. Max. memory is 50.3 GB. 100.36/76.96 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 100.36/76.96 - GenericResult: Unfinished Backtranslation 100.36/76.96 unknown boogie variable #length 100.36/76.96 - GenericResult: Unfinished Backtranslation 100.36/76.96 unknown boogie variable #length 100.36/76.96 - GenericResult: Unfinished Backtranslation 100.36/76.96 unknown boogie variable #length 100.36/76.96 - GenericResult: Unfinished Backtranslation 100.36/76.96 unknown boogie variable #length 100.36/76.96 - GenericResult: Unfinished Backtranslation 100.36/76.96 unknown boogie variable #length 100.36/76.96 - GenericResult: Unfinished Backtranslation 100.36/76.96 unknown boogie variable #length 100.36/76.96 - GenericResult: Unfinished Backtranslation 100.36/76.96 unknown boogie variable #memory_int 100.36/76.96 - GenericResult: Unfinished Backtranslation 100.36/76.96 unknown boogie variable #memory_int 100.36/76.96 - GenericResult: Unfinished Backtranslation 100.36/76.96 unknown boogie variable #memory_int 100.36/76.96 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 100.36/76.96 - PositiveResult [Line: 12]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 15]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 16]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 12]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 13]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 16]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 16]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 13]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 14]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 16]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 16]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 14]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 14]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 10]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 16]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 18]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 14]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 10]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 15]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 11]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 18]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 15]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 11]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - PositiveResult [Line: 15]: pointer dereference always succeeds 100.36/76.96 For all program executions holds that pointer dereference always succeeds at this location 100.36/76.96 - AllSpecificationsHoldResult: All specifications hold 100.36/76.96 24 specifications checked. All of them hold 100.36/76.96 - InvariantResult [Line: 14]: Loop Invariant 100.36/76.96 [2019-03-28 12:46:14,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.36/76.96 [2019-03-28 12:46:14,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.36/76.96 [2019-03-28 12:46:14,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.36/76.96 [2019-03-28 12:46:14,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.36/76.96 [2019-03-28 12:46:14,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.36/76.96 [2019-03-28 12:46:14,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.36/76.96 Derived loop invariant: (((((((0 == x_ref && i == 0) && unknown-#length-unknown[x_ref] == 4) && \valid[x_ref] == 1) && 1 == \valid[i]) && unknown-#length-unknown[i] == 4) && 4 == unknown-#length-unknown[y_ref]) && y_ref == 0) && \valid[y_ref] == 1 100.36/76.96 - StatisticsResult: Ultimate Automizer benchmark data 100.36/76.96 CFG has 1 procedures, 43 locations, 24 error locations. SAFE Result, 1.4s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 294 SDslu, 5 SDs, 0 SdLazy, 322 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 100.36/76.96 - StatisticsResult: Constructed decomposition of program 100.36/76.96 Your program was decomposed into 6 terminating modules (3 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 47 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 47 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 24 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. 100.36/76.96 - StatisticsResult: Timing statistics 100.36/76.96 BüchiAutomizer plugin needed 70.2s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 5.7s. Construction of modules took 1.5s. Büchi inclusion checks took 62.9s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 129 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 119 SDtfs, 478 SDslu, 516 SDs, 0 SdLazy, 1985 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital340 mio100 ax100 hnf100 lsp97 ukn56 mio100 lsp38 div100 bol100 ite100 ukn100 eq186 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 100.36/76.96 - TerminationAnalysisResult: Termination proven 100.36/76.96 Buchi Automizer proved that your program is terminating 100.36/76.96 RESULT: Ultimate proved your program to be correct! 100.36/76.96 !SESSION 2019-03-28 12:44:58.447 ----------------------------------------------- 100.36/76.96 eclipse.buildId=unknown 100.36/76.96 java.version=1.8.0_181 100.36/76.96 java.vendor=Oracle Corporation 100.36/76.96 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 100.36/76.96 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 100.36/76.96 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 100.36/76.96 100.36/76.96 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:46:14.619 100.36/76.96 !MESSAGE The workspace will exit with unsaved changes in this session. 100.36/76.96 Received shutdown request... 100.36/76.96 Ultimate: 100.36/76.96 GTK+ Version Check 100.36/76.96 EOF