139.06/125.98 YES 139.06/125.98 139.06/125.98 Ultimate: Cannot open display: 139.06/125.98 This is Ultimate 0.1.24-8dc7c08-m 139.06/125.98 [2019-03-28 12:36:45,486 INFO L170 SettingsManager]: Resetting all preferences to default values... 139.06/125.98 [2019-03-28 12:36:45,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 139.06/125.98 [2019-03-28 12:36:45,499 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 139.06/125.98 [2019-03-28 12:36:45,500 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 139.06/125.98 [2019-03-28 12:36:45,501 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 139.06/125.98 [2019-03-28 12:36:45,502 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 139.06/125.98 [2019-03-28 12:36:45,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 139.06/125.98 [2019-03-28 12:36:45,505 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 139.06/125.98 [2019-03-28 12:36:45,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 139.06/125.98 [2019-03-28 12:36:45,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 139.06/125.98 [2019-03-28 12:36:45,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 139.06/125.98 [2019-03-28 12:36:45,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 139.06/125.98 [2019-03-28 12:36:45,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 139.06/125.98 [2019-03-28 12:36:45,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 139.06/125.98 [2019-03-28 12:36:45,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 139.06/125.98 [2019-03-28 12:36:45,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 139.06/125.98 [2019-03-28 12:36:45,513 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 139.06/125.98 [2019-03-28 12:36:45,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 139.06/125.98 [2019-03-28 12:36:45,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 139.06/125.98 [2019-03-28 12:36:45,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 139.06/125.98 [2019-03-28 12:36:45,519 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 139.06/125.98 [2019-03-28 12:36:45,521 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 139.06/125.98 [2019-03-28 12:36:45,521 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 139.06/125.98 [2019-03-28 12:36:45,522 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 139.06/125.98 [2019-03-28 12:36:45,522 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 139.06/125.98 [2019-03-28 12:36:45,523 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 139.06/125.98 [2019-03-28 12:36:45,524 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 139.06/125.98 [2019-03-28 12:36:45,524 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 139.06/125.98 [2019-03-28 12:36:45,525 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 139.06/125.98 [2019-03-28 12:36:45,525 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 139.06/125.98 [2019-03-28 12:36:45,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 139.06/125.98 [2019-03-28 12:36:45,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 139.06/125.98 [2019-03-28 12:36:45,527 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 139.06/125.98 [2019-03-28 12:36:45,528 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 139.06/125.98 [2019-03-28 12:36:45,528 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 139.06/125.98 [2019-03-28 12:36:45,528 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 139.06/125.98 [2019-03-28 12:36:45,529 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 139.06/125.98 [2019-03-28 12:36:45,530 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 139.06/125.98 [2019-03-28 12:36:45,530 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 139.06/125.98 [2019-03-28 12:36:45,545 INFO L110 SettingsManager]: Loading preferences was successful 139.06/125.98 [2019-03-28 12:36:45,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 139.06/125.98 [2019-03-28 12:36:45,546 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 139.06/125.98 [2019-03-28 12:36:45,546 INFO L133 SettingsManager]: * Rewrite not-equals=true 139.06/125.98 [2019-03-28 12:36:45,546 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 139.06/125.98 [2019-03-28 12:36:45,546 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 139.06/125.98 [2019-03-28 12:36:45,547 INFO L133 SettingsManager]: * Use SBE=true 139.06/125.98 [2019-03-28 12:36:45,547 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 139.06/125.98 [2019-03-28 12:36:45,547 INFO L133 SettingsManager]: * Use old map elimination=false 139.06/125.98 [2019-03-28 12:36:45,547 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 139.06/125.98 [2019-03-28 12:36:45,547 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 139.06/125.98 [2019-03-28 12:36:45,547 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 139.06/125.98 [2019-03-28 12:36:45,548 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 139.06/125.98 [2019-03-28 12:36:45,548 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 139.06/125.98 [2019-03-28 12:36:45,548 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 139.06/125.98 [2019-03-28 12:36:45,548 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 139.06/125.98 [2019-03-28 12:36:45,548 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 139.06/125.98 [2019-03-28 12:36:45,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE 139.06/125.98 [2019-03-28 12:36:45,549 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 139.06/125.98 [2019-03-28 12:36:45,549 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 139.06/125.98 [2019-03-28 12:36:45,549 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 139.06/125.98 [2019-03-28 12:36:45,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 139.06/125.98 [2019-03-28 12:36:45,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 139.06/125.98 [2019-03-28 12:36:45,550 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 139.06/125.98 [2019-03-28 12:36:45,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 139.06/125.98 [2019-03-28 12:36:45,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 139.06/125.98 [2019-03-28 12:36:45,550 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 139.06/125.98 [2019-03-28 12:36:45,550 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 139.06/125.98 [2019-03-28 12:36:45,550 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 139.06/125.98 [2019-03-28 12:36:45,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 139.06/125.98 [2019-03-28 12:36:45,589 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 139.06/125.98 [2019-03-28 12:36:45,592 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 139.06/125.98 [2019-03-28 12:36:45,594 INFO L271 PluginConnector]: Initializing CDTParser... 139.06/125.98 [2019-03-28 12:36:45,594 INFO L276 PluginConnector]: CDTParser initialized 139.06/125.98 [2019-03-28 12:36:45,595 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 139.06/125.98 [2019-03-28 12:36:45,656 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/5bdca5d963524c27b39e20e0792c8a5c/FLAGcab8ccc59 139.06/125.98 [2019-03-28 12:36:46,005 INFO L307 CDTParser]: Found 1 translation units. 139.06/125.98 [2019-03-28 12:36:46,006 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 139.06/125.98 [2019-03-28 12:36:46,006 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 139.06/125.98 [2019-03-28 12:36:46,013 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/5bdca5d963524c27b39e20e0792c8a5c/FLAGcab8ccc59 139.06/125.98 [2019-03-28 12:36:46,407 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/5bdca5d963524c27b39e20e0792c8a5c 139.06/125.98 [2019-03-28 12:36:46,418 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 139.06/125.98 [2019-03-28 12:36:46,420 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 139.06/125.98 [2019-03-28 12:36:46,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 139.06/125.98 [2019-03-28 12:36:46,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 139.06/125.98 [2019-03-28 12:36:46,425 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 139.06/125.98 [2019-03-28 12:36:46,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:36:46" (1/1) ... 139.06/125.98 [2019-03-28 12:36:46,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a106f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46, skipping insertion in model container 139.06/125.98 [2019-03-28 12:36:46,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:36:46" (1/1) ... 139.06/125.98 [2019-03-28 12:36:46,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 139.06/125.98 [2019-03-28 12:36:46,455 INFO L176 MainTranslator]: Built tables and reachable declarations 139.06/125.98 [2019-03-28 12:36:46,618 INFO L206 PostProcessor]: Analyzing one entry point: main 139.06/125.98 [2019-03-28 12:36:46,631 INFO L191 MainTranslator]: Completed pre-run 139.06/125.98 [2019-03-28 12:36:46,703 INFO L206 PostProcessor]: Analyzing one entry point: main 139.06/125.98 [2019-03-28 12:36:46,720 INFO L195 MainTranslator]: Completed translation 139.06/125.98 [2019-03-28 12:36:46,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46 WrapperNode 139.06/125.98 [2019-03-28 12:36:46,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 139.06/125.98 [2019-03-28 12:36:46,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 139.06/125.98 [2019-03-28 12:36:46,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 139.06/125.98 [2019-03-28 12:36:46,722 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 139.06/125.98 [2019-03-28 12:36:46,731 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:36:46" (1/1) ... 139.06/125.98 [2019-03-28 12:36:46,740 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:36:46" (1/1) ... 139.06/125.98 [2019-03-28 12:36:46,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 139.06/125.98 [2019-03-28 12:36:46,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 139.06/125.98 [2019-03-28 12:36:46,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 139.06/125.98 [2019-03-28 12:36:46,763 INFO L276 PluginConnector]: Boogie Preprocessor initialized 139.06/125.98 [2019-03-28 12:36:46,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 139.06/125.98 [2019-03-28 12:36:46,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 139.06/125.98 [2019-03-28 12:36:46,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 139.06/125.98 [2019-03-28 12:36:46,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 139.06/125.98 [2019-03-28 12:36:46,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 139.06/125.98 [2019-03-28 12:36:46,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 139.06/125.98 [2019-03-28 12:36:46,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 139.06/125.98 [2019-03-28 12:36:46,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 139.06/125.98 [2019-03-28 12:36:46,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 139.06/125.98 [2019-03-28 12:36:46,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... 139.06/125.98 [2019-03-28 12:36:46,788 INFO L276 PluginConnector]: RCFGBuilder initialized 139.06/125.98 [2019-03-28 12:36:46,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 139.06/125.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 139.06/125.98 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 139.06/125.98 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 139.06/125.98 [2019-03-28 12:36:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 139.06/125.98 [2019-03-28 12:36:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 139.06/125.98 [2019-03-28 12:36:46,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 139.06/125.98 [2019-03-28 12:36:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 139.06/125.98 [2019-03-28 12:36:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 139.06/125.98 [2019-03-28 12:36:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 139.06/125.98 [2019-03-28 12:36:47,144 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 139.06/125.98 [2019-03-28 12:36:47,144 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 139.06/125.98 [2019-03-28 12:36:47,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:47 BoogieIcfgContainer 139.06/125.98 [2019-03-28 12:36:47,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 139.06/125.98 [2019-03-28 12:36:47,146 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 139.06/125.98 [2019-03-28 12:36:47,147 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 139.06/125.98 [2019-03-28 12:36:47,149 INFO L276 PluginConnector]: BlockEncodingV2 initialized 139.06/125.98 [2019-03-28 12:36:47,150 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:47" (1/1) ... 139.06/125.98 [2019-03-28 12:36:47,168 INFO L313 BlockEncoder]: Initial Icfg 40 locations, 41 edges 139.06/125.98 [2019-03-28 12:36:47,170 INFO L258 BlockEncoder]: Using Remove infeasible edges 139.06/125.98 [2019-03-28 12:36:47,171 INFO L263 BlockEncoder]: Using Maximize final states 139.06/125.98 [2019-03-28 12:36:47,172 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 139.06/125.98 [2019-03-28 12:36:47,172 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 139.06/125.98 [2019-03-28 12:36:47,174 INFO L296 BlockEncoder]: Using Remove sink states 139.06/125.98 [2019-03-28 12:36:47,175 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 139.06/125.98 [2019-03-28 12:36:47,175 INFO L179 BlockEncoder]: Using Rewrite not-equals 139.06/125.98 [2019-03-28 12:36:47,202 INFO L185 BlockEncoder]: Using Use SBE 139.06/125.98 [2019-03-28 12:36:47,238 INFO L200 BlockEncoder]: SBE split 21 edges 139.06/125.98 [2019-03-28 12:36:47,244 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 139.06/125.98 [2019-03-28 12:36:47,246 INFO L71 MaximizeFinalStates]: 0 new accepting states 139.06/125.98 [2019-03-28 12:36:47,310 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 139.06/125.98 [2019-03-28 12:36:47,313 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 139.06/125.98 [2019-03-28 12:36:47,314 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 139.06/125.98 [2019-03-28 12:36:47,315 INFO L71 MaximizeFinalStates]: 0 new accepting states 139.06/125.98 [2019-03-28 12:36:47,315 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 139.06/125.98 [2019-03-28 12:36:47,316 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 139.06/125.98 [2019-03-28 12:36:47,316 INFO L313 BlockEncoder]: Encoded RCFG 33 locations, 60 edges 139.06/125.98 [2019-03-28 12:36:47,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:47 BasicIcfg 139.06/125.98 [2019-03-28 12:36:47,317 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 139.06/125.98 [2019-03-28 12:36:47,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 139.06/125.98 [2019-03-28 12:36:47,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... 139.06/125.98 [2019-03-28 12:36:47,322 INFO L276 PluginConnector]: TraceAbstraction initialized 139.06/125.98 [2019-03-28 12:36:47,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:36:46" (1/4) ... 139.06/125.98 [2019-03-28 12:36:47,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e8c555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:36:47, skipping insertion in model container 139.06/125.98 [2019-03-28 12:36:47,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (2/4) ... 139.06/125.98 [2019-03-28 12:36:47,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e8c555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:36:47, skipping insertion in model container 139.06/125.98 [2019-03-28 12:36:47,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:47" (3/4) ... 139.06/125.98 [2019-03-28 12:36:47,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e8c555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:47, skipping insertion in model container 139.06/125.98 [2019-03-28 12:36:47,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:47" (4/4) ... 139.06/125.98 [2019-03-28 12:36:47,326 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 139.06/125.98 [2019-03-28 12:36:47,337 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 139.06/125.98 [2019-03-28 12:36:47,346 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. 139.06/125.98 [2019-03-28 12:36:47,365 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. 139.06/125.98 [2019-03-28 12:36:47,397 INFO L133 ementStrategyFactory]: Using default assertion order modulation 139.06/125.98 [2019-03-28 12:36:47,398 INFO L382 AbstractCegarLoop]: Interprodecural is true 139.06/125.98 [2019-03-28 12:36:47,398 INFO L383 AbstractCegarLoop]: Hoare is true 139.06/125.98 [2019-03-28 12:36:47,398 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 139.06/125.98 [2019-03-28 12:36:47,398 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 139.06/125.98 [2019-03-28 12:36:47,398 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 139.06/125.98 [2019-03-28 12:36:47,399 INFO L387 AbstractCegarLoop]: Difference is false 139.06/125.98 [2019-03-28 12:36:47,399 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 139.06/125.98 [2019-03-28 12:36:47,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 139.06/125.98 [2019-03-28 12:36:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. 139.06/125.98 [2019-03-28 12:36:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 139.06/125.98 [2019-03-28 12:36:47,422 INFO L394 BasicCegarLoop]: Found error trace 139.06/125.98 [2019-03-28 12:36:47,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 139.06/125.98 [2019-03-28 12:36:47,423 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 139.06/125.98 [2019-03-28 12:36:47,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 139.06/125.98 [2019-03-28 12:36:47,429 INFO L82 PathProgramCache]: Analyzing trace with hash 112313, now seen corresponding path program 1 times 139.06/125.98 [2019-03-28 12:36:47,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 139.06/125.98 [2019-03-28 12:36:47,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 139.06/125.98 [2019-03-28 12:36:47,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:47,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:47,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 139.06/125.98 [2019-03-28 12:36:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 139.06/125.98 [2019-03-28 12:36:47,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 139.06/125.98 [2019-03-28 12:36:47,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 139.06/125.98 [2019-03-28 12:36:47,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 139.06/125.98 [2019-03-28 12:36:47,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 139.06/125.98 [2019-03-28 12:36:47,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 139.06/125.98 [2019-03-28 12:36:47,641 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. 139.06/125.98 [2019-03-28 12:36:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 139.06/125.98 [2019-03-28 12:36:47,804 INFO L93 Difference]: Finished difference Result 33 states and 60 transitions. 139.06/125.98 [2019-03-28 12:36:47,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 139.06/125.98 [2019-03-28 12:36:47,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 139.06/125.98 [2019-03-28 12:36:47,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 139.06/125.98 [2019-03-28 12:36:47,820 INFO L225 Difference]: With dead ends: 33 139.06/125.98 [2019-03-28 12:36:47,820 INFO L226 Difference]: Without dead ends: 31 139.06/125.98 [2019-03-28 12:36:47,824 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 139.06/125.98 [2019-03-28 12:36:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 139.06/125.98 [2019-03-28 12:36:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 139.06/125.98 [2019-03-28 12:36:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 139.06/125.98 [2019-03-28 12:36:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 56 transitions. 139.06/125.98 [2019-03-28 12:36:47,864 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 56 transitions. Word has length 3 139.06/125.98 [2019-03-28 12:36:47,865 INFO L84 Accepts]: Finished accepts. word is rejected. 139.06/125.98 [2019-03-28 12:36:47,865 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 56 transitions. 139.06/125.98 [2019-03-28 12:36:47,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 139.06/125.98 [2019-03-28 12:36:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 56 transitions. 139.06/125.98 [2019-03-28 12:36:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 139.06/125.98 [2019-03-28 12:36:47,866 INFO L394 BasicCegarLoop]: Found error trace 139.06/125.98 [2019-03-28 12:36:47,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 139.06/125.98 [2019-03-28 12:36:47,867 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 139.06/125.98 [2019-03-28 12:36:47,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 139.06/125.98 [2019-03-28 12:36:47,867 INFO L82 PathProgramCache]: Analyzing trace with hash 112315, now seen corresponding path program 1 times 139.06/125.98 [2019-03-28 12:36:47,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 139.06/125.98 [2019-03-28 12:36:47,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 139.06/125.98 [2019-03-28 12:36:47,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:47,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:47,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 139.06/125.98 [2019-03-28 12:36:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 139.06/125.98 [2019-03-28 12:36:47,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 139.06/125.98 [2019-03-28 12:36:47,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 139.06/125.98 [2019-03-28 12:36:47,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 139.06/125.98 [2019-03-28 12:36:47,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 139.06/125.98 [2019-03-28 12:36:47,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 139.06/125.98 [2019-03-28 12:36:47,900 INFO L87 Difference]: Start difference. First operand 31 states and 56 transitions. Second operand 3 states. 139.06/125.98 [2019-03-28 12:36:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 139.06/125.98 [2019-03-28 12:36:47,991 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. 139.06/125.98 [2019-03-28 12:36:47,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 139.06/125.98 [2019-03-28 12:36:47,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 139.06/125.98 [2019-03-28 12:36:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 139.06/125.98 [2019-03-28 12:36:47,993 INFO L225 Difference]: With dead ends: 33 139.06/125.98 [2019-03-28 12:36:47,993 INFO L226 Difference]: Without dead ends: 31 139.06/125.98 [2019-03-28 12:36:47,994 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 139.06/125.98 [2019-03-28 12:36:47,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 139.06/125.98 [2019-03-28 12:36:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 139.06/125.98 [2019-03-28 12:36:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 139.06/125.98 [2019-03-28 12:36:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. 139.06/125.98 [2019-03-28 12:36:48,000 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 3 139.06/125.98 [2019-03-28 12:36:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. 139.06/125.98 [2019-03-28 12:36:48,000 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. 139.06/125.98 [2019-03-28 12:36:48,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 139.06/125.98 [2019-03-28 12:36:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. 139.06/125.98 [2019-03-28 12:36:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 139.06/125.98 [2019-03-28 12:36:48,001 INFO L394 BasicCegarLoop]: Found error trace 139.06/125.98 [2019-03-28 12:36:48,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 139.06/125.98 [2019-03-28 12:36:48,001 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 139.06/125.98 [2019-03-28 12:36:48,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 139.06/125.98 [2019-03-28 12:36:48,002 INFO L82 PathProgramCache]: Analyzing trace with hash 112316, now seen corresponding path program 1 times 139.06/125.98 [2019-03-28 12:36:48,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 139.06/125.98 [2019-03-28 12:36:48,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 139.06/125.98 [2019-03-28 12:36:48,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:48,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:48,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 139.06/125.98 [2019-03-28 12:36:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 139.06/125.98 [2019-03-28 12:36:48,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 139.06/125.98 [2019-03-28 12:36:48,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 139.06/125.98 [2019-03-28 12:36:48,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 139.06/125.98 [2019-03-28 12:36:48,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 139.06/125.98 [2019-03-28 12:36:48,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 139.06/125.98 [2019-03-28 12:36:48,042 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand 3 states. 139.06/125.98 [2019-03-28 12:36:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 139.06/125.98 [2019-03-28 12:36:48,155 INFO L93 Difference]: Finished difference Result 31 states and 54 transitions. 139.06/125.98 [2019-03-28 12:36:48,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 139.06/125.98 [2019-03-28 12:36:48,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 139.06/125.98 [2019-03-28 12:36:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 139.06/125.98 [2019-03-28 12:36:48,157 INFO L225 Difference]: With dead ends: 31 139.06/125.98 [2019-03-28 12:36:48,157 INFO L226 Difference]: Without dead ends: 29 139.06/125.98 [2019-03-28 12:36:48,157 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 139.06/125.98 [2019-03-28 12:36:48,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 139.06/125.98 [2019-03-28 12:36:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 139.06/125.98 [2019-03-28 12:36:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 139.06/125.98 [2019-03-28 12:36:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 52 transitions. 139.06/125.98 [2019-03-28 12:36:48,162 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 52 transitions. Word has length 3 139.06/125.98 [2019-03-28 12:36:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. 139.06/125.98 [2019-03-28 12:36:48,162 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 52 transitions. 139.06/125.98 [2019-03-28 12:36:48,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 139.06/125.98 [2019-03-28 12:36:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 52 transitions. 139.06/125.98 [2019-03-28 12:36:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 139.06/125.98 [2019-03-28 12:36:48,163 INFO L394 BasicCegarLoop]: Found error trace 139.06/125.98 [2019-03-28 12:36:48,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 139.06/125.98 [2019-03-28 12:36:48,163 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 139.06/125.98 [2019-03-28 12:36:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 139.06/125.98 [2019-03-28 12:36:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash 3480560, now seen corresponding path program 1 times 139.06/125.98 [2019-03-28 12:36:48,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 139.06/125.98 [2019-03-28 12:36:48,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 139.06/125.98 [2019-03-28 12:36:48,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:48,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:48,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 139.06/125.98 [2019-03-28 12:36:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 139.06/125.98 [2019-03-28 12:36:48,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 139.06/125.98 [2019-03-28 12:36:48,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 139.06/125.98 [2019-03-28 12:36:48,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 139.06/125.98 [2019-03-28 12:36:48,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 139.06/125.98 [2019-03-28 12:36:48,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 139.06/125.98 [2019-03-28 12:36:48,206 INFO L87 Difference]: Start difference. First operand 29 states and 52 transitions. Second operand 3 states. 139.06/125.98 [2019-03-28 12:36:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 139.06/125.98 [2019-03-28 12:36:48,303 INFO L93 Difference]: Finished difference Result 29 states and 52 transitions. 139.06/125.98 [2019-03-28 12:36:48,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 139.06/125.98 [2019-03-28 12:36:48,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 139.06/125.98 [2019-03-28 12:36:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 139.06/125.98 [2019-03-28 12:36:48,305 INFO L225 Difference]: With dead ends: 29 139.06/125.98 [2019-03-28 12:36:48,305 INFO L226 Difference]: Without dead ends: 25 139.06/125.98 [2019-03-28 12:36:48,305 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 139.06/125.98 [2019-03-28 12:36:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 139.06/125.98 [2019-03-28 12:36:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 139.06/125.98 [2019-03-28 12:36:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 139.06/125.98 [2019-03-28 12:36:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. 139.06/125.98 [2019-03-28 12:36:48,309 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 4 139.06/125.98 [2019-03-28 12:36:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. 139.06/125.98 [2019-03-28 12:36:48,310 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 44 transitions. 139.06/125.98 [2019-03-28 12:36:48,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 139.06/125.98 [2019-03-28 12:36:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 44 transitions. 139.06/125.98 [2019-03-28 12:36:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 139.06/125.98 [2019-03-28 12:36:48,310 INFO L394 BasicCegarLoop]: Found error trace 139.06/125.98 [2019-03-28 12:36:48,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 139.06/125.98 [2019-03-28 12:36:48,311 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 139.06/125.98 [2019-03-28 12:36:48,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 139.06/125.98 [2019-03-28 12:36:48,311 INFO L82 PathProgramCache]: Analyzing trace with hash 3480562, now seen corresponding path program 1 times 139.06/125.98 [2019-03-28 12:36:48,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 139.06/125.98 [2019-03-28 12:36:48,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 139.06/125.98 [2019-03-28 12:36:48,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:48,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:48,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.98 [2019-03-28 12:36:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 139.06/125.98 [2019-03-28 12:36:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 139.06/125.98 [2019-03-28 12:36:48,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 139.06/125.98 [2019-03-28 12:36:48,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 139.06/125.98 [2019-03-28 12:36:48,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 139.06/125.98 [2019-03-28 12:36:48,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 139.06/125.98 [2019-03-28 12:36:48,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 139.06/125.98 [2019-03-28 12:36:48,341 INFO L87 Difference]: Start difference. First operand 25 states and 44 transitions. Second operand 3 states. 139.06/125.98 [2019-03-28 12:36:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 139.06/125.98 [2019-03-28 12:36:48,408 INFO L93 Difference]: Finished difference Result 29 states and 44 transitions. 139.06/125.98 [2019-03-28 12:36:48,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 139.06/125.98 [2019-03-28 12:36:48,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 139.06/125.98 [2019-03-28 12:36:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 139.06/125.98 [2019-03-28 12:36:48,410 INFO L225 Difference]: With dead ends: 29 139.06/125.98 [2019-03-28 12:36:48,410 INFO L226 Difference]: Without dead ends: 25 139.06/125.98 [2019-03-28 12:36:48,411 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 139.06/125.98 [2019-03-28 12:36:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 139.06/125.98 [2019-03-28 12:36:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 139.06/125.98 [2019-03-28 12:36:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 139.06/125.98 [2019-03-28 12:36:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. 139.06/125.98 [2019-03-28 12:36:48,414 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 4 139.06/125.98 [2019-03-28 12:36:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. 139.06/125.98 [2019-03-28 12:36:48,415 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. 139.06/125.98 [2019-03-28 12:36:48,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 139.06/125.98 [2019-03-28 12:36:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. 139.06/125.98 [2019-03-28 12:36:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 139.06/125.98 [2019-03-28 12:36:48,416 INFO L394 BasicCegarLoop]: Found error trace 139.06/125.99 [2019-03-28 12:36:48,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 139.06/125.99 [2019-03-28 12:36:48,416 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 139.06/125.99 [2019-03-28 12:36:48,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 139.06/125.99 [2019-03-28 12:36:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash 3480563, now seen corresponding path program 1 times 139.06/125.99 [2019-03-28 12:36:48,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 139.06/125.99 [2019-03-28 12:36:48,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 139.06/125.99 [2019-03-28 12:36:48,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 139.06/125.99 [2019-03-28 12:36:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 139.06/125.99 [2019-03-28 12:36:48,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 139.06/125.99 [2019-03-28 12:36:48,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 139.06/125.99 [2019-03-28 12:36:48,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 139.06/125.99 [2019-03-28 12:36:48,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 139.06/125.99 [2019-03-28 12:36:48,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 139.06/125.99 [2019-03-28 12:36:48,456 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 3 states. 139.06/125.99 [2019-03-28 12:36:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 139.06/125.99 [2019-03-28 12:36:48,524 INFO L93 Difference]: Finished difference Result 25 states and 40 transitions. 139.06/125.99 [2019-03-28 12:36:48,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 139.06/125.99 [2019-03-28 12:36:48,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 139.06/125.99 [2019-03-28 12:36:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 139.06/125.99 [2019-03-28 12:36:48,526 INFO L225 Difference]: With dead ends: 25 139.06/125.99 [2019-03-28 12:36:48,526 INFO L226 Difference]: Without dead ends: 21 139.06/125.99 [2019-03-28 12:36:48,527 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 139.06/125.99 [2019-03-28 12:36:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 139.06/125.99 [2019-03-28 12:36:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 139.06/125.99 [2019-03-28 12:36:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 139.06/125.99 [2019-03-28 12:36:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. 139.06/125.99 [2019-03-28 12:36:48,530 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 4 139.06/125.99 [2019-03-28 12:36:48,530 INFO L84 Accepts]: Finished accepts. word is rejected. 139.06/125.99 [2019-03-28 12:36:48,530 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. 139.06/125.99 [2019-03-28 12:36:48,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 139.06/125.99 [2019-03-28 12:36:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. 139.06/125.99 [2019-03-28 12:36:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 139.06/125.99 [2019-03-28 12:36:48,531 INFO L394 BasicCegarLoop]: Found error trace 139.06/125.99 [2019-03-28 12:36:48,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 139.06/125.99 [2019-03-28 12:36:48,532 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 139.06/125.99 [2019-03-28 12:36:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 139.06/125.99 [2019-03-28 12:36:48,532 INFO L82 PathProgramCache]: Analyzing trace with hash 107895973, now seen corresponding path program 1 times 139.06/125.99 [2019-03-28 12:36:48,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 139.06/125.99 [2019-03-28 12:36:48,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 139.06/125.99 [2019-03-28 12:36:48,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 139.06/125.99 [2019-03-28 12:36:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 139.06/125.99 [2019-03-28 12:36:48,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 139.06/125.99 [2019-03-28 12:36:48,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 139.06/125.99 [2019-03-28 12:36:48,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 139.06/125.99 [2019-03-28 12:36:48,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 139.06/125.99 [2019-03-28 12:36:48,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 139.06/125.99 [2019-03-28 12:36:48,567 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 3 states. 139.06/125.99 [2019-03-28 12:36:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 139.06/125.99 [2019-03-28 12:36:48,627 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. 139.06/125.99 [2019-03-28 12:36:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 139.06/125.99 [2019-03-28 12:36:48,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 139.06/125.99 [2019-03-28 12:36:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 139.06/125.99 [2019-03-28 12:36:48,628 INFO L225 Difference]: With dead ends: 21 139.06/125.99 [2019-03-28 12:36:48,628 INFO L226 Difference]: Without dead ends: 17 139.06/125.99 [2019-03-28 12:36:48,628 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 139.06/125.99 [2019-03-28 12:36:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 139.06/125.99 [2019-03-28 12:36:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 139.06/125.99 [2019-03-28 12:36:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 139.06/125.99 [2019-03-28 12:36:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. 139.06/125.99 [2019-03-28 12:36:48,632 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 5 139.06/125.99 [2019-03-28 12:36:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. 139.06/125.99 [2019-03-28 12:36:48,632 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 28 transitions. 139.06/125.99 [2019-03-28 12:36:48,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 139.06/125.99 [2019-03-28 12:36:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 28 transitions. 139.06/125.99 [2019-03-28 12:36:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 139.06/125.99 [2019-03-28 12:36:48,633 INFO L394 BasicCegarLoop]: Found error trace 139.06/125.99 [2019-03-28 12:36:48,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 139.06/125.99 [2019-03-28 12:36:48,633 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 139.06/125.99 [2019-03-28 12:36:48,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 139.06/125.99 [2019-03-28 12:36:48,633 INFO L82 PathProgramCache]: Analyzing trace with hash 107895975, now seen corresponding path program 1 times 139.06/125.99 [2019-03-28 12:36:48,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 139.06/125.99 [2019-03-28 12:36:48,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 139.06/125.99 [2019-03-28 12:36:48,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 139.06/125.99 [2019-03-28 12:36:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 139.06/125.99 [2019-03-28 12:36:48,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 139.06/125.99 [2019-03-28 12:36:48,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 139.06/125.99 [2019-03-28 12:36:48,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 139.06/125.99 [2019-03-28 12:36:48,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 139.06/125.99 [2019-03-28 12:36:48,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 139.06/125.99 [2019-03-28 12:36:48,681 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. Second operand 3 states. 139.06/125.99 [2019-03-28 12:36:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 139.06/125.99 [2019-03-28 12:36:48,733 INFO L93 Difference]: Finished difference Result 17 states and 28 transitions. 139.06/125.99 [2019-03-28 12:36:48,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 139.06/125.99 [2019-03-28 12:36:48,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 139.06/125.99 [2019-03-28 12:36:48,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 139.06/125.99 [2019-03-28 12:36:48,734 INFO L225 Difference]: With dead ends: 17 139.06/125.99 [2019-03-28 12:36:48,734 INFO L226 Difference]: Without dead ends: 0 139.06/125.99 [2019-03-28 12:36:48,734 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 139.06/125.99 [2019-03-28 12:36:48,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 139.06/125.99 [2019-03-28 12:36:48,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 139.06/125.99 [2019-03-28 12:36:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 139.06/125.99 [2019-03-28 12:36:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 139.06/125.99 [2019-03-28 12:36:48,735 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 139.06/125.99 [2019-03-28 12:36:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. 139.06/125.99 [2019-03-28 12:36:48,735 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 139.06/125.99 [2019-03-28 12:36:48,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 139.06/125.99 [2019-03-28 12:36:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 139.06/125.99 [2019-03-28 12:36:48,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 139.06/125.99 [2019-03-28 12:36:48,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 139.06/125.99 [2019-03-28 12:36:48,771 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,772 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,772 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,772 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,772 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,772 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,772 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,772 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,773 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,773 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,774 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,774 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,774 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,774 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,774 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,775 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,775 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,776 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 17) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,776 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,776 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 13 17) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~r_ref~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~r_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~r_ref~0.base))) 139.06/125.99 [2019-03-28 12:36:48,776 INFO L448 ceAbstractionStarter]: For program point L14-3(lines 14 17) no Hoare annotation was computed. 139.06/125.99 [2019-03-28 12:36:48,777 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 139.06/125.99 [2019-03-28 12:36:48,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 139.06/125.99 [2019-03-28 12:36:48,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 139.06/125.99 [2019-03-28 12:36:48,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 139.06/125.99 [2019-03-28 12:36:48,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 139.06/125.99 [2019-03-28 12:36:48,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 139.06/125.99 [2019-03-28 12:36:48,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 139.06/125.99 [2019-03-28 12:36:48,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:48 BasicIcfg 139.06/125.99 [2019-03-28 12:36:48,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 139.06/125.99 [2019-03-28 12:36:48,805 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 139.06/125.99 [2019-03-28 12:36:48,805 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 139.06/125.99 [2019-03-28 12:36:48,808 INFO L276 PluginConnector]: BuchiAutomizer initialized 139.06/125.99 [2019-03-28 12:36:48,809 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 139.06/125.99 [2019-03-28 12:36:48,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:36:46" (1/5) ... 139.06/125.99 [2019-03-28 12:36:48,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2473e536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:48, skipping insertion in model container 139.06/125.99 [2019-03-28 12:36:48,810 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 139.06/125.99 [2019-03-28 12:36:48,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (2/5) ... 139.06/125.99 [2019-03-28 12:36:48,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2473e536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:48, skipping insertion in model container 139.06/125.99 [2019-03-28 12:36:48,810 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 139.06/125.99 [2019-03-28 12:36:48,811 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:47" (3/5) ... 139.06/125.99 [2019-03-28 12:36:48,811 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2473e536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:48, skipping insertion in model container 139.06/125.99 [2019-03-28 12:36:48,811 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 139.06/125.99 [2019-03-28 12:36:48,811 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:47" (4/5) ... 139.06/125.99 [2019-03-28 12:36:48,811 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2473e536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:48, skipping insertion in model container 139.06/125.99 [2019-03-28 12:36:48,812 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 139.06/125.99 [2019-03-28 12:36:48,812 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:48" (5/5) ... 139.06/125.99 [2019-03-28 12:36:48,813 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 139.06/125.99 [2019-03-28 12:36:48,835 INFO L133 ementStrategyFactory]: Using default assertion order modulation 139.06/125.99 [2019-03-28 12:36:48,835 INFO L374 BuchiCegarLoop]: Interprodecural is true 139.06/125.99 [2019-03-28 12:36:48,835 INFO L375 BuchiCegarLoop]: Hoare is true 139.06/125.99 [2019-03-28 12:36:48,835 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 139.06/125.99 [2019-03-28 12:36:48,835 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 139.06/125.99 [2019-03-28 12:36:48,836 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 139.06/125.99 [2019-03-28 12:36:48,836 INFO L379 BuchiCegarLoop]: Difference is false 139.06/125.99 [2019-03-28 12:36:48,836 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 139.06/125.99 [2019-03-28 12:36:48,836 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 139.06/125.99 [2019-03-28 12:36:48,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. 139.06/125.99 [2019-03-28 12:36:48,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 139.06/125.99 [2019-03-28 12:36:48,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 139.06/125.99 [2019-03-28 12:36:48,846 INFO L119 BuchiIsEmpty]: Starting construction of run 139.06/125.99 [2019-03-28 12:36:48,850 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 139.06/125.99 [2019-03-28 12:36:48,850 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 139.06/125.99 [2019-03-28 12:36:48,850 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 139.06/125.99 [2019-03-28 12:36:48,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. 139.06/125.99 [2019-03-28 12:36:48,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 139.06/125.99 [2019-03-28 12:36:48,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 139.06/125.99 [2019-03-28 12:36:48,853 INFO L119 BuchiIsEmpty]: Starting construction of run 139.06/125.99 [2019-03-28 12:36:48,853 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 139.06/125.99 [2019-03-28 12:36:48,853 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 139.06/125.99 [2019-03-28 12:36:48,858 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [82] 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] 9#L-1true [123] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet8_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet9_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~r_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= v_ULTIMATE.start_test_fun_~r_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~r_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~r_1 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_test_fun_~r=v_ULTIMATE.start_test_fun_~r_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#in~r=|v_ULTIMATE.start_test_fun_#in~r_1|, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_1, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_1, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_test_fun_~r, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#in~r, ULTIMATE.start_test_fun_~r_ref~0.offset, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_~r_ref~0.base, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_test_fun_~y_ref~0.offset] 28#L11true [83] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 25#L11-1true [79] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 14#L12true [65] L12-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~r_ref~0.offset_3) (= (select |v_#valid_11| v_ULTIMATE.start_test_fun_~r_ref~0.base_3) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~r_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~r_ref~0.base_3) v_ULTIMATE.start_test_fun_~r_ref~0.offset_3 v_ULTIMATE.start_test_fun_~r_4))) (<= (+ v_ULTIMATE.start_test_fun_~r_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~r_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_3, ULTIMATE.start_test_fun_~r=v_ULTIMATE.start_test_fun_~r_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_3, ULTIMATE.start_test_fun_~r=v_ULTIMATE.start_test_fun_~r_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 15#L14-2true 139.06/125.99 [2019-03-28 12:36:48,859 INFO L796 eck$LassoCheckResult]: Loop: 15#L14-2true [69] L14-2-->L14: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem3_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 17#L14true [74] L14-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 19#L15true [76] L15-->L15-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~r_ref~0.base_6) v_ULTIMATE.start_test_fun_~r_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~r_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~r_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~r_ref~0.base_6)) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~r_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_6, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_5, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 34#L15-1true [91] L15-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 32#L15-2true [166] L15-2-->L16: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~r_ref~0.offset_13 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~r_ref~0.base_17)) (= (store |v_#memory_int_19| v_ULTIMATE.start_test_fun_~r_ref~0.base_17 (store (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~r_ref~0.base_17) v_ULTIMATE.start_test_fun_~r_ref~0.offset_13 (* |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|))) |v_#memory_int_18|) (<= 0 v_ULTIMATE.start_test_fun_~r_ref~0.offset_13) (= 1 (select |v_#valid_35| v_ULTIMATE.start_test_fun_~r_ref~0.base_17))) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_13, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_19|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_17} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_13, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_18|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, #memory_int] 5#L16true [56] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 3#L16-1true [169] L16-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_40| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (= (store |v_#memory_int_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| (- 1)))) |v_#memory_int_22|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{#valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 15#L14-2true 139.06/125.99 [2019-03-28 12:36:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 139.06/125.99 [2019-03-28 12:36:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash 108104443, now seen corresponding path program 1 times 139.06/125.99 [2019-03-28 12:36:48,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 139.06/125.99 [2019-03-28 12:36:48,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 139.06/125.99 [2019-03-28 12:36:48,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 139.06/125.99 [2019-03-28 12:36:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 139.06/125.99 [2019-03-28 12:36:48,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 139.06/125.99 [2019-03-28 12:36:48,912 INFO L82 PathProgramCache]: Analyzing trace with hash 747672066, now seen corresponding path program 1 times 139.06/125.99 [2019-03-28 12:36:48,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 139.06/125.99 [2019-03-28 12:36:48,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 139.06/125.99 [2019-03-28 12:36:48,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,918 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 139.06/125.99 [2019-03-28 12:36:48,919 INFO L258 seRefinementStrategy]: Advancing trace checker 139.06/125.99 [2019-03-28 12:36:48,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 139.06/125.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 139.06/125.99 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 139.06/125.99 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 139.06/125.99 [2019-03-28 12:36:48,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 139.06/125.99 [2019-03-28 12:36:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 139.06/125.99 [2019-03-28 12:36:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 139.06/125.99 [2019-03-28 12:36:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash 152410568, now seen corresponding path program 1 times 139.06/125.99 [2019-03-28 12:36:48,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 139.06/125.99 [2019-03-28 12:36:48,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 139.06/125.99 [2019-03-28 12:36:48,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:48,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:49,003 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 139.06/125.99 [2019-03-28 12:36:49,004 INFO L258 seRefinementStrategy]: Advancing trace checker 139.06/125.99 [2019-03-28 12:36:49,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 139.06/125.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 139.06/125.99 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 139.06/125.99 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 139.06/125.99 [2019-03-28 12:36:49,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 139.06/125.99 [2019-03-28 12:36:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 139.06/125.99 [2019-03-28 12:36:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 139.06/125.99 [2019-03-28 12:36:49,633 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 139.06/125.99 [2019-03-28 12:36:49,782 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 85 139.06/125.99 [2019-03-28 12:36:49,796 INFO L216 LassoAnalysis]: Preferences: 139.06/125.99 [2019-03-28 12:36:49,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 139.06/125.99 [2019-03-28 12:36:49,798 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 139.06/125.99 [2019-03-28 12:36:49,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 139.06/125.99 [2019-03-28 12:36:49,798 INFO L127 ssoRankerPreferences]: Use exernal solver: false 139.06/125.99 [2019-03-28 12:36:49,798 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 139.06/125.99 [2019-03-28 12:36:49,798 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 139.06/125.99 [2019-03-28 12:36:49,799 INFO L130 ssoRankerPreferences]: Path of dumped script: 139.06/125.99 [2019-03-28 12:36:49,799 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 139.06/125.99 [2019-03-28 12:36:49,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 139.06/125.99 [2019-03-28 12:36:49,799 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 139.06/125.99 [2019-03-28 12:36:49,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 139.06/125.99 [2019-03-28 12:36:49,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 139.06/125.99 [2019-03-28 12:36:49,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 139.06/125.99 [2019-03-28 12:36:49,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 139.06/125.99 [2019-03-28 12:36:49,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 139.06/125.99 [2019-03-28 12:36:49,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 139.06/125.99 [2019-03-28 12:36:49,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 139.06/125.99 [2019-03-28 12:36:49,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 139.06/125.99 [2019-03-28 12:36:49,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 139.06/125.99 [2019-03-28 12:36:50,218 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 139.06/125.99 [2019-03-28 12:36:50,334 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 139.06/125.99 [2019-03-28 12:36:50,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 139.06/125.99 [2019-03-28 12:36:50,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 139.06/125.99 [2019-03-28 12:36:50,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 139.06/125.99 [2019-03-28 12:36:50,782 INFO L300 LassoAnalysis]: Preprocessing complete. 139.06/125.99 [2019-03-28 12:36:50,787 INFO L497 LassoAnalysis]: Using template 'affine'. 139.06/125.99 [2019-03-28 12:36:50,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 139.06/125.99 Termination analysis: LINEAR_WITH_GUESSES 139.06/125.99 Number of strict supporting invariants: 0 139.06/125.99 Number of non-strict supporting invariants: 1 139.06/125.99 Consider only non-deceasing supporting invariants: true 139.06/125.99 Simplify termination arguments: true 139.06/125.99 Simplify supporting invariants: trueOverapproximate stem: false 139.06/125.99 [2019-03-28 12:36:50,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. 139.06/125.99 [2019-03-28 12:36:50,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 139.06/125.99 [2019-03-28 12:36:50,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 139.06/125.99 [2019-03-28 12:36:50,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 139.06/125.99 [2019-03-28 12:36:50,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 139.06/125.99 [2019-03-28 12:36:50,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 139.06/125.99 [2019-03-28 12:36:50,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 139.06/125.99 [2019-03-28 12:36:50,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 139.06/125.99 [2019-03-28 12:36:50,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 139.06/125.99 Termination analysis: LINEAR_WITH_GUESSES 139.06/125.99 Number of strict supporting invariants: 0 139.06/125.99 Number of non-strict supporting invariants: 1 139.06/125.99 Consider only non-deceasing supporting invariants: true 139.06/125.99 Simplify termination arguments: true 139.06/125.99 Simplify supporting invariants: trueOverapproximate stem: false 139.06/125.99 [2019-03-28 12:36:50,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. 139.06/125.99 [2019-03-28 12:36:50,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 139.06/125.99 [2019-03-28 12:36:50,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 139.06/125.99 [2019-03-28 12:36:50,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 139.06/125.99 [2019-03-28 12:36:50,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 139.06/125.99 [2019-03-28 12:36:50,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 139.06/125.99 [2019-03-28 12:36:50,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 139.06/125.99 [2019-03-28 12:36:50,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 139.06/125.99 Termination analysis: LINEAR_WITH_GUESSES 139.06/125.99 Number of strict supporting invariants: 0 139.06/125.99 Number of non-strict supporting invariants: 1 139.06/125.99 Consider only non-deceasing supporting invariants: true 139.06/125.99 Simplify termination arguments: true 139.06/125.99 Simplify supporting invariants: trueOverapproximate stem: false 139.06/125.99 [2019-03-28 12:36:50,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. 139.06/125.99 [2019-03-28 12:36:50,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 139.06/125.99 [2019-03-28 12:36:50,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 139.06/125.99 [2019-03-28 12:36:50,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 139.06/125.99 [2019-03-28 12:36:50,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 139.06/125.99 [2019-03-28 12:36:50,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 139.06/125.99 [2019-03-28 12:36:50,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 139.06/125.99 [2019-03-28 12:36:50,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 139.06/125.99 [2019-03-28 12:36:50,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 139.06/125.99 Termination analysis: LINEAR_WITH_GUESSES 139.06/125.99 Number of strict supporting invariants: 0 139.06/125.99 Number of non-strict supporting invariants: 1 139.06/125.99 Consider only non-deceasing supporting invariants: true 139.06/125.99 Simplify termination arguments: true 139.06/125.99 Simplify supporting invariants: trueOverapproximate stem: false 139.06/125.99 [2019-03-28 12:36:50,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. 139.06/125.99 [2019-03-28 12:36:50,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 139.06/125.99 [2019-03-28 12:36:50,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 139.06/125.99 [2019-03-28 12:36:50,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 139.06/125.99 [2019-03-28 12:36:50,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 139.06/125.99 [2019-03-28 12:36:50,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 139.06/125.99 [2019-03-28 12:36:50,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 139.06/125.99 [2019-03-28 12:36:50,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 139.06/125.99 Termination analysis: LINEAR_WITH_GUESSES 139.06/125.99 Number of strict supporting invariants: 0 139.06/125.99 Number of non-strict supporting invariants: 1 139.06/125.99 Consider only non-deceasing supporting invariants: true 139.06/125.99 Simplify termination arguments: true 139.06/125.99 Simplify supporting invariants: trueOverapproximate stem: false 139.06/125.99 [2019-03-28 12:36:50,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. 139.06/125.99 [2019-03-28 12:36:50,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 139.06/125.99 [2019-03-28 12:36:50,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 139.06/125.99 [2019-03-28 12:36:50,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 139.06/125.99 [2019-03-28 12:36:50,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 139.06/125.99 [2019-03-28 12:36:50,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 139.06/125.99 [2019-03-28 12:36:50,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 139.06/125.99 [2019-03-28 12:36:50,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 139.06/125.99 [2019-03-28 12:36:50,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 139.06/125.99 Termination analysis: LINEAR_WITH_GUESSES 139.06/125.99 Number of strict supporting invariants: 0 139.06/125.99 Number of non-strict supporting invariants: 1 139.06/125.99 Consider only non-deceasing supporting invariants: true 139.06/125.99 Simplify termination arguments: true 139.06/125.99 Simplify supporting invariants: trueOverapproximate stem: false 139.06/125.99 [2019-03-28 12:36:50,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. 139.06/125.99 [2019-03-28 12:36:50,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 139.06/125.99 [2019-03-28 12:36:50,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 139.06/125.99 [2019-03-28 12:36:50,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 139.06/125.99 [2019-03-28 12:36:50,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 139.06/125.99 [2019-03-28 12:36:50,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 139.06/125.99 [2019-03-28 12:36:50,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 139.06/125.99 [2019-03-28 12:36:50,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 139.06/125.99 [2019-03-28 12:36:50,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 139.06/125.99 Termination analysis: LINEAR_WITH_GUESSES 139.06/125.99 Number of strict supporting invariants: 0 139.06/125.99 Number of non-strict supporting invariants: 1 139.06/125.99 Consider only non-deceasing supporting invariants: true 139.06/125.99 Simplify termination arguments: true 139.06/125.99 Simplify supporting invariants: trueOverapproximate stem: false 139.06/125.99 [2019-03-28 12:36:50,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. 139.06/125.99 [2019-03-28 12:36:50,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 139.06/125.99 [2019-03-28 12:36:50,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 139.06/125.99 [2019-03-28 12:36:50,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 139.06/125.99 [2019-03-28 12:36:50,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 139.06/125.99 [2019-03-28 12:36:50,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 139.06/125.99 [2019-03-28 12:36:50,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 139.06/125.99 [2019-03-28 12:36:50,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 139.06/125.99 [2019-03-28 12:36:50,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 139.06/125.99 Termination analysis: LINEAR_WITH_GUESSES 139.06/125.99 Number of strict supporting invariants: 0 139.06/125.99 Number of non-strict supporting invariants: 1 139.06/125.99 Consider only non-deceasing supporting invariants: true 139.06/125.99 Simplify termination arguments: true 139.06/125.99 Simplify supporting invariants: trueOverapproximate stem: false 139.06/125.99 [2019-03-28 12:36:50,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. 139.06/125.99 [2019-03-28 12:36:50,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 139.06/125.99 [2019-03-28 12:36:50,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 139.06/125.99 [2019-03-28 12:36:50,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 139.06/125.99 [2019-03-28 12:36:50,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 139.06/125.99 [2019-03-28 12:36:50,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 139.06/125.99 [2019-03-28 12:36:50,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 139.06/125.99 [2019-03-28 12:36:50,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 139.06/125.99 Termination analysis: LINEAR_WITH_GUESSES 139.06/125.99 Number of strict supporting invariants: 0 139.06/125.99 Number of non-strict supporting invariants: 1 139.06/125.99 Consider only non-deceasing supporting invariants: true 139.06/125.99 Simplify termination arguments: true 139.06/125.99 Simplify supporting invariants: trueOverapproximate stem: false 139.06/125.99 [2019-03-28 12:36:50,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. 139.06/125.99 [2019-03-28 12:36:50,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 139.06/125.99 [2019-03-28 12:36:50,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 139.06/125.99 [2019-03-28 12:36:50,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 139.06/125.99 [2019-03-28 12:36:50,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 139.06/125.99 [2019-03-28 12:36:50,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 139.06/125.99 [2019-03-28 12:36:50,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 139.06/125.99 [2019-03-28 12:36:50,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 139.06/125.99 Termination analysis: LINEAR_WITH_GUESSES 139.06/125.99 Number of strict supporting invariants: 0 139.06/125.99 Number of non-strict supporting invariants: 1 139.06/125.99 Consider only non-deceasing supporting invariants: true 139.06/125.99 Simplify termination arguments: true 139.06/125.99 Simplify supporting invariants: trueOverapproximate stem: false 139.06/125.99 [2019-03-28 12:36:50,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. 139.06/125.99 [2019-03-28 12:36:50,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 139.06/125.99 [2019-03-28 12:36:50,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 139.06/125.99 [2019-03-28 12:36:50,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 139.06/125.99 [2019-03-28 12:36:50,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 139.06/125.99 [2019-03-28 12:36:50,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 139.06/125.99 [2019-03-28 12:36:50,859 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 139.06/125.99 [2019-03-28 12:36:50,875 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 139.06/125.99 [2019-03-28 12:36:50,875 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. 139.06/125.99 [2019-03-28 12:36:50,878 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 139.06/125.99 [2019-03-28 12:36:50,880 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 139.06/125.99 [2019-03-28 12:36:50,880 INFO L518 LassoAnalysis]: Proved termination. 139.06/125.99 [2019-03-28 12:36:50,880 INFO L520 LassoAnalysis]: Termination argument consisting of: 139.06/125.99 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 139.06/125.99 Supporting invariants [] 139.06/125.99 [2019-03-28 12:36:50,959 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed 139.06/125.99 [2019-03-28 12:36:50,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 139.06/125.99 [2019-03-28 12:36:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 139.06/125.99 [2019-03-28 12:36:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 139.06/125.99 [2019-03-28 12:36:51,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core 139.06/125.99 [2019-03-28 12:36:51,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... 139.06/125.99 [2019-03-28 12:36:51,048 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 139.06/125.99 [2019-03-28 12:36:51,048 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 139.06/125.99 [2019-03-28 12:36:51,056 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 139.06/125.99 [2019-03-28 12:36:51,057 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 139.06/125.99 [2019-03-28 12:36:51,057 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 139.06/125.99 [2019-03-28 12:36:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 139.06/125.99 [2019-03-28 12:36:51,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core 139.06/125.99 [2019-03-28 12:36:51,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... 139.06/125.99 [2019-03-28 12:36:51,125 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 28 treesize of output 23 139.06/125.99 [2019-03-28 12:36:51,126 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 139.06/125.99 [2019-03-28 12:36:51,140 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 139.06/125.99 [2019-03-28 12:36:51,141 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 139.06/125.99 [2019-03-28 12:36:51,141 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:31 139.06/125.99 [2019-03-28 12:36:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 139.06/125.99 [2019-03-28 12:36:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 139.06/125.99 [2019-03-28 12:36:56,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core 139.06/125.99 [2019-03-28 12:36:56,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... 139.06/125.99 [2019-03-28 12:36:56,302 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 139.06/125.99 [2019-03-28 12:36:56,303 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 139.06/125.99 [2019-03-28 12:36:56,311 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 139.06/125.99 [2019-03-28 12:36:56,312 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 139.06/125.99 [2019-03-28 12:36:56,312 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:24 139.06/125.99 [2019-03-28 12:37:11,380 WARN L188 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 21 139.06/125.99 [2019-03-28 12:37:21,418 WARN L188 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 23 139.06/125.99 [2019-03-28 12:37:21,425 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 0 case distinctions, treesize of input 37 treesize of output 28 139.06/125.99 [2019-03-28 12:37:21,426 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 139.06/125.99 [2019-03-28 12:37:21,437 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 139.06/125.99 [2019-03-28 12:37:21,438 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 139.06/125.99 [2019-03-28 12:37:21,438 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:26 139.06/125.99 [2019-03-28 12:37:26,470 WARN L188 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 23 139.06/125.99 [2019-03-28 12:37:31,510 WARN L188 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 25 139.06/125.99 [2019-03-28 12:37:37,161 WARN L188 SmtUtils]: Spent 5.62 s on a formula simplification that was a NOOP. DAG size: 24 139.06/125.99 [2019-03-28 12:37:42,167 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_test_fun_#t~mem5_13| Int) (|v_ULTIMATE.start_test_fun_#t~mem4_13| Int) (ULTIMATE.start_test_fun_~r_ref~0.offset Int)) (= (* |v_ULTIMATE.start_test_fun_#t~mem4_13| |v_ULTIMATE.start_test_fun_#t~mem5_13|) (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~r_ref~0.base) ULTIMATE.start_test_fun_~r_ref~0.offset))) is different from true 139.06/125.99 [2019-03-28 12:37:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 139.06/125.99 [2019-03-28 12:37:42,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core 139.06/125.99 [2019-03-28 12:37:42,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... 139.06/125.99 [2019-03-28 12:37:42,215 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 139.06/125.99 [2019-03-28 12:37:42,216 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 139.06/125.99 [2019-03-28 12:37:42,225 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 139.06/125.99 [2019-03-28 12:37:42,226 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 139.06/125.99 [2019-03-28 12:37:42,226 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:24 139.06/125.99 [2019-03-28 12:37:52,264 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 0 case distinctions, treesize of input 37 treesize of output 28 139.06/125.99 [2019-03-28 12:37:52,265 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 139.06/125.99 [2019-03-28 12:37:52,275 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 139.06/125.99 [2019-03-28 12:37:52,276 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 139.06/125.99 [2019-03-28 12:37:52,277 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:26 139.06/125.99 [2019-03-28 12:37:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 139.06/125.99 [2019-03-28 12:37:52,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core 139.06/125.99 [2019-03-28 12:37:52,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... 139.06/125.99 [2019-03-28 12:38:02,366 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 139.06/125.99 [2019-03-28 12:38:02,367 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 139.06/125.99 [2019-03-28 12:38:02,375 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 139.06/125.99 [2019-03-28 12:38:02,376 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 139.06/125.99 [2019-03-28 12:38:02,376 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 139.06/125.99 [2019-03-28 12:38:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 139.06/125.99 [2019-03-28 12:38:37,795 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 139.06/125.99 [2019-03-28 12:38:37,795 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 8 predicates after loop cannibalization 139.06/125.99 [2019-03-28 12:38:37,799 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 8 loop predicates 139.06/125.99 [2019-03-28 12:38:37,800 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 33 states. Second operand 7 states. 139.06/125.99 [2019-03-28 12:38:48,076 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 33 states.. Second operand 7 states. Result 55 states and 105 transitions. Complement of second has 11 states. 139.06/125.99 [2019-03-28 12:38:48,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states 139.06/125.99 [2019-03-28 12:38:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 139.06/125.99 [2019-03-28 12:38:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. 139.06/125.99 [2019-03-28 12:38:48,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 97 transitions. Stem has 5 letters. Loop has 7 letters. 139.06/125.99 [2019-03-28 12:38:48,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. 139.06/125.99 [2019-03-28 12:38:48,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 97 transitions. Stem has 12 letters. Loop has 7 letters. 139.06/125.99 [2019-03-28 12:38:48,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. 139.06/125.99 [2019-03-28 12:38:48,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 97 transitions. Stem has 5 letters. Loop has 14 letters. 139.06/125.99 [2019-03-28 12:38:48,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. 139.06/125.99 [2019-03-28 12:38:48,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 105 transitions. 139.06/125.99 [2019-03-28 12:38:48,100 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 139.06/125.99 [2019-03-28 12:38:48,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. 139.06/125.99 [2019-03-28 12:38:48,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 139.06/125.99 [2019-03-28 12:38:48,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 139.06/125.99 [2019-03-28 12:38:48,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 139.06/125.99 [2019-03-28 12:38:48,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 139.06/125.99 [2019-03-28 12:38:48,103 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 139.06/125.99 [2019-03-28 12:38:48,103 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 139.06/125.99 [2019-03-28 12:38:48,103 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 139.06/125.99 [2019-03-28 12:38:48,103 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 139.06/125.99 [2019-03-28 12:38:48,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 139.06/125.99 [2019-03-28 12:38:48,103 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 139.06/125.99 [2019-03-28 12:38:48,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 139.06/125.99 [2019-03-28 12:38:48,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:48 BasicIcfg 139.06/125.99 [2019-03-28 12:38:48,109 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 139.06/125.99 [2019-03-28 12:38:48,109 INFO L168 Benchmark]: Toolchain (without parser) took 121690.26 ms. Allocated memory was 649.6 MB in the beginning and 767.0 MB in the end (delta: 117.4 MB). Free memory was 563.6 MB in the beginning and 593.7 MB in the end (delta: -30.1 MB). Peak memory consumption was 87.3 MB. Max. memory is 50.3 GB. 139.06/125.99 [2019-03-28 12:38:48,110 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 139.06/125.99 [2019-03-28 12:38:48,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.24 ms. Allocated memory was 649.6 MB in the beginning and 681.1 MB in the end (delta: 31.5 MB). Free memory was 563.6 MB in the beginning and 646.8 MB in the end (delta: -83.2 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 139.06/125.99 [2019-03-28 12:38:48,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.55 ms. Allocated memory is still 681.1 MB. Free memory was 646.8 MB in the beginning and 642.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 139.06/125.99 [2019-03-28 12:38:48,112 INFO L168 Benchmark]: Boogie Preprocessor took 24.36 ms. Allocated memory is still 681.1 MB. Free memory was 642.9 MB in the beginning and 641.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 139.06/125.99 [2019-03-28 12:38:48,112 INFO L168 Benchmark]: RCFGBuilder took 358.25 ms. Allocated memory is still 681.1 MB. Free memory was 641.8 MB in the beginning and 618.5 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 50.3 GB. 139.06/125.99 [2019-03-28 12:38:48,113 INFO L168 Benchmark]: BlockEncodingV2 took 170.41 ms. Allocated memory is still 681.1 MB. Free memory was 618.5 MB in the beginning and 608.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 139.06/125.99 [2019-03-28 12:38:48,113 INFO L168 Benchmark]: TraceAbstraction took 1486.67 ms. Allocated memory is still 681.1 MB. Free memory was 607.7 MB in the beginning and 448.8 MB in the end (delta: 158.9 MB). Peak memory consumption was 158.9 MB. Max. memory is 50.3 GB. 139.06/125.99 [2019-03-28 12:38:48,114 INFO L168 Benchmark]: BuchiAutomizer took 119304.10 ms. Allocated memory was 681.1 MB in the beginning and 767.0 MB in the end (delta: 86.0 MB). Free memory was 448.8 MB in the beginning and 593.7 MB in the end (delta: -144.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 139.06/125.99 [2019-03-28 12:38:48,118 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 139.06/125.99 --- Results --- 139.06/125.99 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 139.06/125.99 - StatisticsResult: Initial Icfg 139.06/125.99 40 locations, 41 edges 139.06/125.99 - StatisticsResult: Encoded RCFG 139.06/125.99 33 locations, 60 edges 139.06/125.99 * Results from de.uni_freiburg.informatik.ultimate.core: 139.06/125.99 - StatisticsResult: Toolchain Benchmarks 139.06/125.99 Benchmark results are: 139.06/125.99 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 139.06/125.99 * CACSL2BoogieTranslator took 299.24 ms. Allocated memory was 649.6 MB in the beginning and 681.1 MB in the end (delta: 31.5 MB). Free memory was 563.6 MB in the beginning and 646.8 MB in the end (delta: -83.2 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 139.06/125.99 * Boogie Procedure Inliner took 41.55 ms. Allocated memory is still 681.1 MB. Free memory was 646.8 MB in the beginning and 642.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 139.06/125.99 * Boogie Preprocessor took 24.36 ms. Allocated memory is still 681.1 MB. Free memory was 642.9 MB in the beginning and 641.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 139.06/125.99 * RCFGBuilder took 358.25 ms. Allocated memory is still 681.1 MB. Free memory was 641.8 MB in the beginning and 618.5 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 50.3 GB. 139.06/125.99 * BlockEncodingV2 took 170.41 ms. Allocated memory is still 681.1 MB. Free memory was 618.5 MB in the beginning and 608.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 139.06/125.99 * TraceAbstraction took 1486.67 ms. Allocated memory is still 681.1 MB. Free memory was 607.7 MB in the beginning and 448.8 MB in the end (delta: 158.9 MB). Peak memory consumption was 158.9 MB. Max. memory is 50.3 GB. 139.06/125.99 * BuchiAutomizer took 119304.10 ms. Allocated memory was 681.1 MB in the beginning and 767.0 MB in the end (delta: 86.0 MB). Free memory was 448.8 MB in the beginning and 593.7 MB in the end (delta: -144.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 139.06/125.99 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 139.06/125.99 - GenericResult: Unfinished Backtranslation 139.06/125.99 unknown boogie variable #length 139.06/125.99 - GenericResult: Unfinished Backtranslation 139.06/125.99 unknown boogie variable #length 139.06/125.99 - GenericResult: Unfinished Backtranslation 139.06/125.99 unknown boogie variable #length 139.06/125.99 - GenericResult: Unfinished Backtranslation 139.06/125.99 unknown boogie variable #length 139.06/125.99 - GenericResult: Unfinished Backtranslation 139.06/125.99 unknown boogie variable #length 139.06/125.99 - GenericResult: Unfinished Backtranslation 139.06/125.99 unknown boogie variable #length 139.06/125.99 - GenericResult: Unfinished Backtranslation 139.06/125.99 unknown boogie variable #memory_int 139.06/125.99 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 139.06/125.99 - PositiveResult [Line: 15]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 11]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 12]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 11]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 15]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 18]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 15]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 15]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 15]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 14]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 13]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 16]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 14]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 18]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 16]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 12]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 16]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 15]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 16]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - PositiveResult [Line: 13]: pointer dereference always succeeds 139.06/125.99 For all program executions holds that pointer dereference always succeeds at this location 139.06/125.99 - AllSpecificationsHoldResult: All specifications hold 139.06/125.99 20 specifications checked. All of them hold 139.06/125.99 - InvariantResult [Line: 13]: Loop Invariant 139.06/125.99 [2019-03-28 12:38:48,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 139.06/125.99 [2019-03-28 12:38:48,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 139.06/125.99 [2019-03-28 12:38:48,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 139.06/125.99 [2019-03-28 12:38:48,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 139.06/125.99 [2019-03-28 12:38:48,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 139.06/125.99 [2019-03-28 12:38:48,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 139.06/125.99 Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == r_ref) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[r_ref]) && 1 == \valid[r_ref] 139.06/125.99 - StatisticsResult: Ultimate Automizer benchmark data 139.06/125.99 CFG has 1 procedures, 33 locations, 20 error locations. SAFE Result, 1.3s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28 SDtfs, 251 SDslu, 5 SDs, 0 SdLazy, 305 SolverSat, 88 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=33occurred 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, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 327 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 139.06/125.99 - StatisticsResult: Constructed decomposition of program 139.06/125.99 Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 7 locations. 139.06/125.99 - StatisticsResult: Timing statistics 139.06/125.99 BüchiAutomizer plugin needed 119.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 116.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4 SDtfs, 284 SDslu, 31 SDs, 0 SdLazy, 242 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital320 mio100 ax100 hnf100 lsp97 ukn59 mio100 lsp36 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 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 139.06/125.99 - TerminationAnalysisResult: Termination proven 139.06/125.99 Buchi Automizer proved that your program is terminating 139.06/125.99 RESULT: Ultimate proved your program to be correct! 139.06/125.99 !SESSION 2019-03-28 12:36:43.143 ----------------------------------------------- 139.06/125.99 eclipse.buildId=unknown 139.06/125.99 java.version=1.8.0_181 139.06/125.99 java.vendor=Oracle Corporation 139.06/125.99 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 139.06/125.99 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 139.06/125.99 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 139.06/125.99 139.06/125.99 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:38:48.356 139.06/125.99 !MESSAGE The workspace will exit with unsaved changes in this session. 139.06/125.99 Received shutdown request... 139.06/125.99 Ultimate: 139.06/125.99 GTK+ Version Check 139.06/125.99 EOF