25.79/10.95 YES 25.79/10.95 25.79/10.95 Ultimate: Cannot open display: 25.79/10.95 This is Ultimate 0.1.24-8dc7c08-m 25.79/10.95 [2019-03-28 12:37:58,731 INFO L170 SettingsManager]: Resetting all preferences to default values... 25.79/10.95 [2019-03-28 12:37:58,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 25.79/10.95 [2019-03-28 12:37:58,744 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 25.79/10.95 [2019-03-28 12:37:58,745 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 25.79/10.95 [2019-03-28 12:37:58,746 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 25.79/10.95 [2019-03-28 12:37:58,747 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 25.79/10.95 [2019-03-28 12:37:58,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 25.79/10.95 [2019-03-28 12:37:58,750 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 25.79/10.95 [2019-03-28 12:37:58,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 25.79/10.95 [2019-03-28 12:37:58,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 25.79/10.95 [2019-03-28 12:37:58,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 25.79/10.95 [2019-03-28 12:37:58,753 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 25.79/10.95 [2019-03-28 12:37:58,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 25.79/10.95 [2019-03-28 12:37:58,755 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 25.79/10.95 [2019-03-28 12:37:58,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 25.79/10.95 [2019-03-28 12:37:58,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 25.79/10.95 [2019-03-28 12:37:58,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 25.79/10.95 [2019-03-28 12:37:58,760 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 25.79/10.95 [2019-03-28 12:37:58,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 25.79/10.95 [2019-03-28 12:37:58,762 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 25.79/10.95 [2019-03-28 12:37:58,763 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 25.79/10.95 [2019-03-28 12:37:58,766 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 25.79/10.95 [2019-03-28 12:37:58,766 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 25.79/10.95 [2019-03-28 12:37:58,766 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 25.79/10.95 [2019-03-28 12:37:58,767 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 25.79/10.95 [2019-03-28 12:37:58,767 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 25.79/10.95 [2019-03-28 12:37:58,768 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 25.79/10.95 [2019-03-28 12:37:58,768 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 25.79/10.95 [2019-03-28 12:37:58,769 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 25.79/10.95 [2019-03-28 12:37:58,770 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 25.79/10.95 [2019-03-28 12:37:58,770 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 25.79/10.95 [2019-03-28 12:37:58,771 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 25.79/10.95 [2019-03-28 12:37:58,772 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 25.79/10.95 [2019-03-28 12:37:58,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 25.79/10.95 [2019-03-28 12:37:58,772 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 25.79/10.95 [2019-03-28 12:37:58,773 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 25.79/10.95 [2019-03-28 12:37:58,774 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 25.79/10.95 [2019-03-28 12:37:58,774 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 25.79/10.95 [2019-03-28 12:37:58,775 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 25.79/10.95 [2019-03-28 12:37:58,789 INFO L110 SettingsManager]: Loading preferences was successful 25.79/10.95 [2019-03-28 12:37:58,789 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 25.79/10.95 [2019-03-28 12:37:58,790 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 25.79/10.95 [2019-03-28 12:37:58,791 INFO L133 SettingsManager]: * Rewrite not-equals=true 25.79/10.95 [2019-03-28 12:37:58,791 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 25.79/10.95 [2019-03-28 12:37:58,791 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 25.79/10.95 [2019-03-28 12:37:58,791 INFO L133 SettingsManager]: * Use SBE=true 25.79/10.95 [2019-03-28 12:37:58,791 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 25.79/10.95 [2019-03-28 12:37:58,791 INFO L133 SettingsManager]: * Use old map elimination=false 25.79/10.95 [2019-03-28 12:37:58,792 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 25.79/10.95 [2019-03-28 12:37:58,792 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 25.79/10.95 [2019-03-28 12:37:58,792 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 25.79/10.95 [2019-03-28 12:37:58,792 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 25.79/10.95 [2019-03-28 12:37:58,792 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 25.79/10.95 [2019-03-28 12:37:58,792 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.79/10.95 [2019-03-28 12:37:58,793 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 25.79/10.95 [2019-03-28 12:37:58,793 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 25.79/10.95 [2019-03-28 12:37:58,793 INFO L133 SettingsManager]: * Check division by zero=IGNORE 25.79/10.95 [2019-03-28 12:37:58,793 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 25.79/10.95 [2019-03-28 12:37:58,793 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 25.79/10.95 [2019-03-28 12:37:58,793 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 25.79/10.95 [2019-03-28 12:37:58,794 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 25.79/10.95 [2019-03-28 12:37:58,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 25.79/10.95 [2019-03-28 12:37:58,794 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 25.79/10.95 [2019-03-28 12:37:58,794 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.79/10.95 [2019-03-28 12:37:58,794 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 25.79/10.95 [2019-03-28 12:37:58,795 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 25.79/10.95 [2019-03-28 12:37:58,795 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 25.79/10.95 [2019-03-28 12:37:58,795 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 25.79/10.95 [2019-03-28 12:37:58,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 25.79/10.95 [2019-03-28 12:37:58,833 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 25.79/10.95 [2019-03-28 12:37:58,836 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 25.79/10.95 [2019-03-28 12:37:58,838 INFO L271 PluginConnector]: Initializing CDTParser... 25.79/10.95 [2019-03-28 12:37:58,838 INFO L276 PluginConnector]: CDTParser initialized 25.79/10.95 [2019-03-28 12:37:58,839 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 25.79/10.95 [2019-03-28 12:37:58,909 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/9b8685fc2b5f4eb6b241f75adbf1c4da/FLAG86084c0bb 25.79/10.95 [2019-03-28 12:37:59,247 INFO L307 CDTParser]: Found 1 translation units. 25.79/10.95 [2019-03-28 12:37:59,247 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 25.79/10.95 [2019-03-28 12:37:59,248 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 25.79/10.95 [2019-03-28 12:37:59,255 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/9b8685fc2b5f4eb6b241f75adbf1c4da/FLAG86084c0bb 25.79/10.95 [2019-03-28 12:37:59,656 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/9b8685fc2b5f4eb6b241f75adbf1c4da 25.79/10.95 [2019-03-28 12:37:59,668 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 25.79/10.95 [2019-03-28 12:37:59,670 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 25.79/10.95 [2019-03-28 12:37:59,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 25.79/10.95 [2019-03-28 12:37:59,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 25.79/10.95 [2019-03-28 12:37:59,675 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 25.79/10.95 [2019-03-28 12:37:59,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:59" (1/1) ... 25.79/10.95 [2019-03-28 12:37:59,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bb25ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:59, skipping insertion in model container 25.79/10.95 [2019-03-28 12:37:59,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:59" (1/1) ... 25.79/10.95 [2019-03-28 12:37:59,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 25.79/10.95 [2019-03-28 12:37:59,704 INFO L176 MainTranslator]: Built tables and reachable declarations 25.79/10.95 [2019-03-28 12:37:59,870 INFO L206 PostProcessor]: Analyzing one entry point: main 25.79/10.95 [2019-03-28 12:37:59,882 INFO L191 MainTranslator]: Completed pre-run 25.79/10.95 [2019-03-28 12:37:59,962 INFO L206 PostProcessor]: Analyzing one entry point: main 25.79/10.95 [2019-03-28 12:37:59,979 INFO L195 MainTranslator]: Completed translation 25.79/10.95 [2019-03-28 12:37:59,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:59 WrapperNode 25.79/10.95 [2019-03-28 12:37:59,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 25.79/10.95 [2019-03-28 12:37:59,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 25.79/10.95 [2019-03-28 12:37:59,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 25.79/10.95 [2019-03-28 12:37:59,981 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 25.79/10.95 [2019-03-28 12:37:59,991 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:37:59" (1/1) ... 25.79/10.95 [2019-03-28 12:38:00,001 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:37:59" (1/1) ... 25.79/10.95 [2019-03-28 12:38:00,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 25.79/10.95 [2019-03-28 12:38:00,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 25.79/10.95 [2019-03-28 12:38:00,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 25.79/10.95 [2019-03-28 12:38:00,024 INFO L276 PluginConnector]: Boogie Preprocessor initialized 25.79/10.95 [2019-03-28 12:38:00,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:59" (1/1) ... 25.79/10.95 [2019-03-28 12:38:00,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:59" (1/1) ... 25.79/10.95 [2019-03-28 12:38:00,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:59" (1/1) ... 25.79/10.95 [2019-03-28 12:38:00,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:59" (1/1) ... 25.79/10.95 [2019-03-28 12:38:00,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:59" (1/1) ... 25.79/10.95 [2019-03-28 12:38:00,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:59" (1/1) ... 25.79/10.95 [2019-03-28 12:38:00,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:59" (1/1) ... 25.79/10.95 [2019-03-28 12:38:00,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 25.79/10.95 [2019-03-28 12:38:00,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 25.79/10.95 [2019-03-28 12:38:00,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... 25.79/10.95 [2019-03-28 12:38:00,051 INFO L276 PluginConnector]: RCFGBuilder initialized 25.79/10.95 [2019-03-28 12:38:00,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:59" (1/1) ... 25.79/10.95 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.79/10.95 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 25.79/10.95 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.79/10.95 [2019-03-28 12:38:00,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 25.79/10.95 [2019-03-28 12:38:00,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 25.79/10.95 [2019-03-28 12:38:00,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 25.79/10.95 [2019-03-28 12:38:00,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 25.79/10.95 [2019-03-28 12:38:00,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 25.79/10.95 [2019-03-28 12:38:00,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 25.79/10.95 [2019-03-28 12:38:00,379 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 25.79/10.95 [2019-03-28 12:38:00,380 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 25.79/10.95 [2019-03-28 12:38:00,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:00 BoogieIcfgContainer 25.79/10.95 [2019-03-28 12:38:00,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 25.79/10.95 [2019-03-28 12:38:00,382 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 25.79/10.95 [2019-03-28 12:38:00,382 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 25.79/10.95 [2019-03-28 12:38:00,384 INFO L276 PluginConnector]: BlockEncodingV2 initialized 25.79/10.95 [2019-03-28 12:38:00,385 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:00" (1/1) ... 25.79/10.95 [2019-03-28 12:38:00,404 INFO L313 BlockEncoder]: Initial Icfg 27 locations, 31 edges 25.79/10.95 [2019-03-28 12:38:00,405 INFO L258 BlockEncoder]: Using Remove infeasible edges 25.79/10.95 [2019-03-28 12:38:00,406 INFO L263 BlockEncoder]: Using Maximize final states 25.79/10.95 [2019-03-28 12:38:00,407 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 25.79/10.95 [2019-03-28 12:38:00,407 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 25.79/10.95 [2019-03-28 12:38:00,411 INFO L296 BlockEncoder]: Using Remove sink states 25.79/10.95 [2019-03-28 12:38:00,412 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 25.79/10.95 [2019-03-28 12:38:00,413 INFO L179 BlockEncoder]: Using Rewrite not-equals 25.79/10.95 [2019-03-28 12:38:00,437 INFO L185 BlockEncoder]: Using Use SBE 25.79/10.95 [2019-03-28 12:38:00,467 INFO L200 BlockEncoder]: SBE split 12 edges 25.79/10.95 [2019-03-28 12:38:00,472 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 25.79/10.95 [2019-03-28 12:38:00,474 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.79/10.95 [2019-03-28 12:38:00,495 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 25.79/10.95 [2019-03-28 12:38:00,498 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states 25.79/10.95 [2019-03-28 12:38:00,500 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.79/10.95 [2019-03-28 12:38:00,500 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.79/10.95 [2019-03-28 12:38:00,500 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 25.79/10.95 [2019-03-28 12:38:00,501 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 25.79/10.95 [2019-03-28 12:38:00,501 INFO L313 BlockEncoder]: Encoded RCFG 19 locations, 42 edges 25.79/10.95 [2019-03-28 12:38:00,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:00 BasicIcfg 25.79/10.95 [2019-03-28 12:38:00,502 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 25.79/10.95 [2019-03-28 12:38:00,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 25.79/10.95 [2019-03-28 12:38:00,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... 25.79/10.95 [2019-03-28 12:38:00,506 INFO L276 PluginConnector]: TraceAbstraction initialized 25.79/10.95 [2019-03-28 12:38:00,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:37:59" (1/4) ... 25.79/10.95 [2019-03-28 12:38:00,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3e6614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:38:00, skipping insertion in model container 25.79/10.95 [2019-03-28 12:38:00,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:59" (2/4) ... 25.79/10.95 [2019-03-28 12:38:00,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3e6614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:38:00, skipping insertion in model container 25.79/10.95 [2019-03-28 12:38:00,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:00" (3/4) ... 25.79/10.95 [2019-03-28 12:38:00,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3e6614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:00, skipping insertion in model container 25.79/10.95 [2019-03-28 12:38:00,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:00" (4/4) ... 25.79/10.95 [2019-03-28 12:38:00,511 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.79/10.95 [2019-03-28 12:38:00,521 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 25.79/10.95 [2019-03-28 12:38:00,530 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. 25.79/10.95 [2019-03-28 12:38:00,547 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. 25.79/10.95 [2019-03-28 12:38:00,575 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.79/10.95 [2019-03-28 12:38:00,576 INFO L382 AbstractCegarLoop]: Interprodecural is true 25.79/10.95 [2019-03-28 12:38:00,576 INFO L383 AbstractCegarLoop]: Hoare is true 25.79/10.95 [2019-03-28 12:38:00,576 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 25.79/10.95 [2019-03-28 12:38:00,577 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 25.79/10.95 [2019-03-28 12:38:00,577 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.79/10.95 [2019-03-28 12:38:00,577 INFO L387 AbstractCegarLoop]: Difference is false 25.79/10.95 [2019-03-28 12:38:00,577 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 25.79/10.95 [2019-03-28 12:38:00,577 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 25.79/10.95 [2019-03-28 12:38:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. 25.79/10.95 [2019-03-28 12:38:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 25.79/10.95 [2019-03-28 12:38:00,598 INFO L394 BasicCegarLoop]: Found error trace 25.79/10.95 [2019-03-28 12:38:00,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 25.79/10.95 [2019-03-28 12:38:00,599 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.79/10.95 [2019-03-28 12:38:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.95 [2019-03-28 12:38:00,605 INFO L82 PathProgramCache]: Analyzing trace with hash 4971540, now seen corresponding path program 1 times 25.79/10.95 [2019-03-28 12:38:00,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.95 [2019-03-28 12:38:00,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.95 [2019-03-28 12:38:00,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:00,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:00,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.95 [2019-03-28 12:38:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.95 [2019-03-28 12:38:00,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.79/10.95 [2019-03-28 12:38:00,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.79/10.95 [2019-03-28 12:38:00,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.79/10.95 [2019-03-28 12:38:00,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.79/10.95 [2019-03-28 12:38:00,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.79/10.95 [2019-03-28 12:38:00,786 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. 25.79/10.95 [2019-03-28 12:38:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.79/10.95 [2019-03-28 12:38:00,888 INFO L93 Difference]: Finished difference Result 32 states and 74 transitions. 25.79/10.95 [2019-03-28 12:38:00,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.79/10.95 [2019-03-28 12:38:00,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 25.79/10.95 [2019-03-28 12:38:00,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.79/10.95 [2019-03-28 12:38:00,904 INFO L225 Difference]: With dead ends: 32 25.79/10.95 [2019-03-28 12:38:00,904 INFO L226 Difference]: Without dead ends: 18 25.79/10.95 [2019-03-28 12:38:00,908 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 25.79/10.95 [2019-03-28 12:38:00,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 25.79/10.95 [2019-03-28 12:38:00,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 25.79/10.95 [2019-03-28 12:38:00,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 25.79/10.95 [2019-03-28 12:38:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. 25.79/10.95 [2019-03-28 12:38:00,946 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 38 transitions. Word has length 4 25.79/10.95 [2019-03-28 12:38:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. 25.79/10.95 [2019-03-28 12:38:00,946 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 38 transitions. 25.79/10.95 [2019-03-28 12:38:00,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.79/10.95 [2019-03-28 12:38:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 38 transitions. 25.79/10.95 [2019-03-28 12:38:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 25.79/10.95 [2019-03-28 12:38:00,947 INFO L394 BasicCegarLoop]: Found error trace 25.79/10.95 [2019-03-28 12:38:00,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 25.79/10.95 [2019-03-28 12:38:00,948 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.79/10.95 [2019-03-28 12:38:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.95 [2019-03-28 12:38:00,948 INFO L82 PathProgramCache]: Analyzing trace with hash 4971542, now seen corresponding path program 1 times 25.79/10.95 [2019-03-28 12:38:00,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.95 [2019-03-28 12:38:00,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.95 [2019-03-28 12:38:00,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:00,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:00,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.95 [2019-03-28 12:38:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.95 [2019-03-28 12:38:00,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.79/10.95 [2019-03-28 12:38:00,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.79/10.95 [2019-03-28 12:38:00,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.79/10.95 [2019-03-28 12:38:00,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.79/10.95 [2019-03-28 12:38:00,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.79/10.95 [2019-03-28 12:38:00,982 INFO L87 Difference]: Start difference. First operand 18 states and 38 transitions. Second operand 4 states. 25.79/10.95 [2019-03-28 12:38:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.79/10.95 [2019-03-28 12:38:01,061 INFO L93 Difference]: Finished difference Result 19 states and 38 transitions. 25.79/10.95 [2019-03-28 12:38:01,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.79/10.95 [2019-03-28 12:38:01,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 25.79/10.95 [2019-03-28 12:38:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.79/10.95 [2019-03-28 12:38:01,063 INFO L225 Difference]: With dead ends: 19 25.79/10.95 [2019-03-28 12:38:01,063 INFO L226 Difference]: Without dead ends: 18 25.79/10.95 [2019-03-28 12:38:01,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.79/10.95 [2019-03-28 12:38:01,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 25.79/10.95 [2019-03-28 12:38:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 25.79/10.95 [2019-03-28 12:38:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 25.79/10.95 [2019-03-28 12:38:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. 25.79/10.95 [2019-03-28 12:38:01,068 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 4 25.79/10.95 [2019-03-28 12:38:01,068 INFO L84 Accepts]: Finished accepts. word is rejected. 25.79/10.95 [2019-03-28 12:38:01,069 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. 25.79/10.95 [2019-03-28 12:38:01,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.79/10.95 [2019-03-28 12:38:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. 25.79/10.95 [2019-03-28 12:38:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 25.79/10.95 [2019-03-28 12:38:01,069 INFO L394 BasicCegarLoop]: Found error trace 25.79/10.95 [2019-03-28 12:38:01,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 25.79/10.95 [2019-03-28 12:38:01,070 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.79/10.95 [2019-03-28 12:38:01,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.95 [2019-03-28 12:38:01,070 INFO L82 PathProgramCache]: Analyzing trace with hash 4971543, now seen corresponding path program 1 times 25.79/10.95 [2019-03-28 12:38:01,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.95 [2019-03-28 12:38:01,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.95 [2019-03-28 12:38:01,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.95 [2019-03-28 12:38:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.95 [2019-03-28 12:38:01,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.79/10.95 [2019-03-28 12:38:01,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.79/10.95 [2019-03-28 12:38:01,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.79/10.95 [2019-03-28 12:38:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.79/10.95 [2019-03-28 12:38:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.79/10.95 [2019-03-28 12:38:01,099 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 3 states. 25.79/10.95 [2019-03-28 12:38:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.79/10.95 [2019-03-28 12:38:01,160 INFO L93 Difference]: Finished difference Result 18 states and 37 transitions. 25.79/10.95 [2019-03-28 12:38:01,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.79/10.95 [2019-03-28 12:38:01,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 25.79/10.95 [2019-03-28 12:38:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.79/10.95 [2019-03-28 12:38:01,162 INFO L225 Difference]: With dead ends: 18 25.79/10.95 [2019-03-28 12:38:01,162 INFO L226 Difference]: Without dead ends: 17 25.79/10.95 [2019-03-28 12:38:01,162 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 25.79/10.95 [2019-03-28 12:38:01,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 25.79/10.95 [2019-03-28 12:38:01,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 25.79/10.95 [2019-03-28 12:38:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 25.79/10.95 [2019-03-28 12:38:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. 25.79/10.95 [2019-03-28 12:38:01,166 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 36 transitions. Word has length 4 25.79/10.95 [2019-03-28 12:38:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. 25.79/10.95 [2019-03-28 12:38:01,166 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 36 transitions. 25.79/10.95 [2019-03-28 12:38:01,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.79/10.95 [2019-03-28 12:38:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 36 transitions. 25.79/10.95 [2019-03-28 12:38:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 25.79/10.95 [2019-03-28 12:38:01,167 INFO L394 BasicCegarLoop]: Found error trace 25.79/10.95 [2019-03-28 12:38:01,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 25.79/10.95 [2019-03-28 12:38:01,167 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.79/10.95 [2019-03-28 12:38:01,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.95 [2019-03-28 12:38:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash 154118868, now seen corresponding path program 1 times 25.79/10.95 [2019-03-28 12:38:01,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.95 [2019-03-28 12:38:01,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.95 [2019-03-28 12:38:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.95 [2019-03-28 12:38:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.95 [2019-03-28 12:38:01,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.79/10.95 [2019-03-28 12:38:01,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.79/10.95 [2019-03-28 12:38:01,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.79/10.95 [2019-03-28 12:38:01,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.79/10.95 [2019-03-28 12:38:01,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.79/10.95 [2019-03-28 12:38:01,196 INFO L87 Difference]: Start difference. First operand 17 states and 36 transitions. Second operand 3 states. 25.79/10.95 [2019-03-28 12:38:01,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.79/10.95 [2019-03-28 12:38:01,246 INFO L93 Difference]: Finished difference Result 17 states and 36 transitions. 25.79/10.95 [2019-03-28 12:38:01,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.79/10.95 [2019-03-28 12:38:01,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 25.79/10.95 [2019-03-28 12:38:01,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.79/10.95 [2019-03-28 12:38:01,247 INFO L225 Difference]: With dead ends: 17 25.79/10.95 [2019-03-28 12:38:01,247 INFO L226 Difference]: Without dead ends: 14 25.79/10.95 [2019-03-28 12:38:01,248 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 25.79/10.95 [2019-03-28 12:38:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 25.79/10.95 [2019-03-28 12:38:01,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 25.79/10.95 [2019-03-28 12:38:01,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 25.79/10.95 [2019-03-28 12:38:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. 25.79/10.95 [2019-03-28 12:38:01,252 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 5 25.79/10.95 [2019-03-28 12:38:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. 25.79/10.95 [2019-03-28 12:38:01,252 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 30 transitions. 25.79/10.95 [2019-03-28 12:38:01,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.79/10.95 [2019-03-28 12:38:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 30 transitions. 25.79/10.95 [2019-03-28 12:38:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 25.79/10.95 [2019-03-28 12:38:01,253 INFO L394 BasicCegarLoop]: Found error trace 25.79/10.95 [2019-03-28 12:38:01,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 25.79/10.95 [2019-03-28 12:38:01,253 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.79/10.95 [2019-03-28 12:38:01,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.95 [2019-03-28 12:38:01,254 INFO L82 PathProgramCache]: Analyzing trace with hash 154118870, now seen corresponding path program 1 times 25.79/10.95 [2019-03-28 12:38:01,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.95 [2019-03-28 12:38:01,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.95 [2019-03-28 12:38:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.95 [2019-03-28 12:38:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.95 [2019-03-28 12:38:01,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.79/10.95 [2019-03-28 12:38:01,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.79/10.95 [2019-03-28 12:38:01,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.79/10.95 [2019-03-28 12:38:01,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.79/10.95 [2019-03-28 12:38:01,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 25.79/10.95 [2019-03-28 12:38:01,288 INFO L87 Difference]: Start difference. First operand 14 states and 30 transitions. Second operand 4 states. 25.79/10.95 [2019-03-28 12:38:01,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.79/10.95 [2019-03-28 12:38:01,381 INFO L93 Difference]: Finished difference Result 27 states and 54 transitions. 25.79/10.95 [2019-03-28 12:38:01,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.79/10.95 [2019-03-28 12:38:01,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 25.79/10.95 [2019-03-28 12:38:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.79/10.95 [2019-03-28 12:38:01,382 INFO L225 Difference]: With dead ends: 27 25.79/10.95 [2019-03-28 12:38:01,383 INFO L226 Difference]: Without dead ends: 24 25.79/10.95 [2019-03-28 12:38:01,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 25.79/10.95 [2019-03-28 12:38:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 25.79/10.95 [2019-03-28 12:38:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. 25.79/10.95 [2019-03-28 12:38:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 25.79/10.95 [2019-03-28 12:38:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 51 transitions. 25.79/10.95 [2019-03-28 12:38:01,388 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 51 transitions. Word has length 5 25.79/10.95 [2019-03-28 12:38:01,389 INFO L84 Accepts]: Finished accepts. word is rejected. 25.79/10.95 [2019-03-28 12:38:01,389 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 51 transitions. 25.79/10.95 [2019-03-28 12:38:01,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.79/10.95 [2019-03-28 12:38:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 51 transitions. 25.79/10.95 [2019-03-28 12:38:01,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 25.79/10.95 [2019-03-28 12:38:01,390 INFO L394 BasicCegarLoop]: Found error trace 25.79/10.95 [2019-03-28 12:38:01,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 25.79/10.95 [2019-03-28 12:38:01,390 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.79/10.95 [2019-03-28 12:38:01,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.95 [2019-03-28 12:38:01,390 INFO L82 PathProgramCache]: Analyzing trace with hash 154118871, now seen corresponding path program 1 times 25.79/10.95 [2019-03-28 12:38:01,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.95 [2019-03-28 12:38:01,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.95 [2019-03-28 12:38:01,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.95 [2019-03-28 12:38:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.95 [2019-03-28 12:38:01,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.79/10.95 [2019-03-28 12:38:01,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.79/10.95 [2019-03-28 12:38:01,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 25.79/10.95 [2019-03-28 12:38:01,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.79/10.95 [2019-03-28 12:38:01,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 25.79/10.95 [2019-03-28 12:38:01,442 INFO L87 Difference]: Start difference. First operand 21 states and 51 transitions. Second operand 5 states. 25.79/10.95 [2019-03-28 12:38:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.79/10.95 [2019-03-28 12:38:01,548 INFO L93 Difference]: Finished difference Result 24 states and 51 transitions. 25.79/10.95 [2019-03-28 12:38:01,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 25.79/10.95 [2019-03-28 12:38:01,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 25.79/10.95 [2019-03-28 12:38:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.79/10.95 [2019-03-28 12:38:01,549 INFO L225 Difference]: With dead ends: 24 25.79/10.95 [2019-03-28 12:38:01,549 INFO L226 Difference]: Without dead ends: 20 25.79/10.95 [2019-03-28 12:38:01,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 25.79/10.95 [2019-03-28 12:38:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 25.79/10.95 [2019-03-28 12:38:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 25.79/10.95 [2019-03-28 12:38:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 25.79/10.95 [2019-03-28 12:38:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. 25.79/10.95 [2019-03-28 12:38:01,554 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 47 transitions. Word has length 5 25.79/10.95 [2019-03-28 12:38:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. 25.79/10.95 [2019-03-28 12:38:01,554 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 47 transitions. 25.79/10.95 [2019-03-28 12:38:01,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 25.79/10.95 [2019-03-28 12:38:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 47 transitions. 25.79/10.95 [2019-03-28 12:38:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 25.79/10.95 [2019-03-28 12:38:01,555 INFO L394 BasicCegarLoop]: Found error trace 25.79/10.95 [2019-03-28 12:38:01,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 25.79/10.95 [2019-03-28 12:38:01,555 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.79/10.95 [2019-03-28 12:38:01,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.95 [2019-03-28 12:38:01,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1069293027, now seen corresponding path program 1 times 25.79/10.95 [2019-03-28 12:38:01,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.95 [2019-03-28 12:38:01,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.95 [2019-03-28 12:38:01,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.95 [2019-03-28 12:38:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.95 [2019-03-28 12:38:01,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.79/10.95 [2019-03-28 12:38:01,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.79/10.95 [2019-03-28 12:38:01,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.79/10.95 [2019-03-28 12:38:01,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.79/10.95 [2019-03-28 12:38:01,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.79/10.95 [2019-03-28 12:38:01,582 INFO L87 Difference]: Start difference. First operand 20 states and 47 transitions. Second operand 3 states. 25.79/10.95 [2019-03-28 12:38:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.79/10.95 [2019-03-28 12:38:01,643 INFO L93 Difference]: Finished difference Result 35 states and 79 transitions. 25.79/10.95 [2019-03-28 12:38:01,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.79/10.95 [2019-03-28 12:38:01,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 25.79/10.95 [2019-03-28 12:38:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.79/10.95 [2019-03-28 12:38:01,645 INFO L225 Difference]: With dead ends: 35 25.79/10.95 [2019-03-28 12:38:01,645 INFO L226 Difference]: Without dead ends: 24 25.79/10.95 [2019-03-28 12:38:01,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.79/10.95 [2019-03-28 12:38:01,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 25.79/10.95 [2019-03-28 12:38:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. 25.79/10.95 [2019-03-28 12:38:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 25.79/10.95 [2019-03-28 12:38:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. 25.79/10.95 [2019-03-28 12:38:01,650 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 49 transitions. Word has length 9 25.79/10.95 [2019-03-28 12:38:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. 25.79/10.95 [2019-03-28 12:38:01,651 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 49 transitions. 25.79/10.95 [2019-03-28 12:38:01,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.79/10.95 [2019-03-28 12:38:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 49 transitions. 25.79/10.95 [2019-03-28 12:38:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 25.79/10.95 [2019-03-28 12:38:01,651 INFO L394 BasicCegarLoop]: Found error trace 25.79/10.95 [2019-03-28 12:38:01,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 25.79/10.95 [2019-03-28 12:38:01,652 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.79/10.95 [2019-03-28 12:38:01,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.95 [2019-03-28 12:38:01,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1069322818, now seen corresponding path program 1 times 25.79/10.95 [2019-03-28 12:38:01,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.95 [2019-03-28 12:38:01,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.95 [2019-03-28 12:38:01,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.95 [2019-03-28 12:38:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.95 [2019-03-28 12:38:01,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.79/10.95 [2019-03-28 12:38:01,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.79/10.95 [2019-03-28 12:38:01,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.79/10.95 [2019-03-28 12:38:01,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.79/10.95 [2019-03-28 12:38:01,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.79/10.95 [2019-03-28 12:38:01,682 INFO L87 Difference]: Start difference. First operand 22 states and 49 transitions. Second operand 3 states. 25.79/10.95 [2019-03-28 12:38:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.79/10.95 [2019-03-28 12:38:01,753 INFO L93 Difference]: Finished difference Result 37 states and 86 transitions. 25.79/10.95 [2019-03-28 12:38:01,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.79/10.95 [2019-03-28 12:38:01,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 25.79/10.95 [2019-03-28 12:38:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.79/10.95 [2019-03-28 12:38:01,755 INFO L225 Difference]: With dead ends: 37 25.79/10.95 [2019-03-28 12:38:01,755 INFO L226 Difference]: Without dead ends: 21 25.79/10.95 [2019-03-28 12:38:01,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.79/10.95 [2019-03-28 12:38:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 25.79/10.95 [2019-03-28 12:38:01,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 25.79/10.95 [2019-03-28 12:38:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 25.79/10.95 [2019-03-28 12:38:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 42 transitions. 25.79/10.95 [2019-03-28 12:38:01,760 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 42 transitions. Word has length 9 25.79/10.95 [2019-03-28 12:38:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. 25.79/10.95 [2019-03-28 12:38:01,760 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 42 transitions. 25.79/10.95 [2019-03-28 12:38:01,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.79/10.95 [2019-03-28 12:38:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 42 transitions. 25.79/10.95 [2019-03-28 12:38:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 25.79/10.95 [2019-03-28 12:38:01,761 INFO L394 BasicCegarLoop]: Found error trace 25.79/10.95 [2019-03-28 12:38:01,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.79/10.95 [2019-03-28 12:38:01,761 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.79/10.95 [2019-03-28 12:38:01,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.95 [2019-03-28 12:38:01,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1091890854, now seen corresponding path program 1 times 25.79/10.95 [2019-03-28 12:38:01,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.95 [2019-03-28 12:38:01,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.95 [2019-03-28 12:38:01,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.95 [2019-03-28 12:38:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.95 [2019-03-28 12:38:01,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.79/10.95 [2019-03-28 12:38:01,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.79/10.95 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.79/10.95 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.79/10.95 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.79/10.95 [2019-03-28 12:38:01,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.95 [2019-03-28 12:38:01,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core 25.79/10.95 [2019-03-28 12:38:01,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.79/10.95 [2019-03-28 12:38:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.95 [2019-03-28 12:38:01,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 25.79/10.95 [2019-03-28 12:38:01,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 25.79/10.95 [2019-03-28 12:38:01,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 25.79/10.95 [2019-03-28 12:38:01,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 25.79/10.95 [2019-03-28 12:38:01,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 25.79/10.95 [2019-03-28 12:38:01,896 INFO L87 Difference]: Start difference. First operand 21 states and 42 transitions. Second operand 6 states. 25.79/10.95 [2019-03-28 12:38:01,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.79/10.95 [2019-03-28 12:38:01,995 INFO L93 Difference]: Finished difference Result 25 states and 43 transitions. 25.79/10.95 [2019-03-28 12:38:01,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 25.79/10.95 [2019-03-28 12:38:01,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 25.79/10.95 [2019-03-28 12:38:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.79/10.95 [2019-03-28 12:38:01,996 INFO L225 Difference]: With dead ends: 25 25.79/10.95 [2019-03-28 12:38:01,997 INFO L226 Difference]: Without dead ends: 22 25.79/10.95 [2019-03-28 12:38:01,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 25.79/10.95 [2019-03-28 12:38:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 25.79/10.95 [2019-03-28 12:38:02,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. 25.79/10.95 [2019-03-28 12:38:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 25.79/10.95 [2019-03-28 12:38:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. 25.79/10.95 [2019-03-28 12:38:02,001 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 11 25.79/10.95 [2019-03-28 12:38:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. 25.79/10.95 [2019-03-28 12:38:02,002 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. 25.79/10.95 [2019-03-28 12:38:02,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 25.79/10.95 [2019-03-28 12:38:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. 25.79/10.95 [2019-03-28 12:38:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 25.79/10.95 [2019-03-28 12:38:02,003 INFO L394 BasicCegarLoop]: Found error trace 25.79/10.95 [2019-03-28 12:38:02,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.79/10.95 [2019-03-28 12:38:02,003 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.79/10.95 [2019-03-28 12:38:02,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.95 [2019-03-28 12:38:02,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1091890855, now seen corresponding path program 1 times 25.79/10.95 [2019-03-28 12:38:02,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.95 [2019-03-28 12:38:02,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.95 [2019-03-28 12:38:02,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:02,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:02,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.95 [2019-03-28 12:38:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.95 [2019-03-28 12:38:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.95 [2019-03-28 12:38:02,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.79/10.95 [2019-03-28 12:38:02,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.79/10.95 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.79/10.96 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.79/10.96 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.79/10.96 [2019-03-28 12:38:02,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.96 [2019-03-28 12:38:02,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core 25.79/10.96 [2019-03-28 12:38:02,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.79/10.96 [2019-03-28 12:38:02,243 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 25.79/10.96 [2019-03-28 12:38:02,243 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.79/10.96 [2019-03-28 12:38:02,254 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.79/10.96 [2019-03-28 12:38:02,256 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 25.79/10.96 [2019-03-28 12:38:02,256 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 25.79/10.96 [2019-03-28 12:38:02,289 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 25.79/10.96 [2019-03-28 12:38:02,290 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 25.79/10.96 [2019-03-28 12:38:02,294 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 25.79/10.96 [2019-03-28 12:38:02,306 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.79/10.96 [2019-03-28 12:38:02,312 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 25.79/10.96 [2019-03-28 12:38:02,312 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 25.79/10.96 [2019-03-28 12:38:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.96 [2019-03-28 12:38:02,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 25.79/10.96 [2019-03-28 12:38:02,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 25.79/10.96 [2019-03-28 12:38:02,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 25.79/10.96 [2019-03-28 12:38:02,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 25.79/10.96 [2019-03-28 12:38:02,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 25.79/10.96 [2019-03-28 12:38:02,390 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 11 states. 25.79/10.96 [2019-03-28 12:38:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.79/10.96 [2019-03-28 12:38:02,902 INFO L93 Difference]: Finished difference Result 29 states and 56 transitions. 25.79/10.96 [2019-03-28 12:38:02,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 25.79/10.96 [2019-03-28 12:38:02,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 25.79/10.96 [2019-03-28 12:38:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.79/10.96 [2019-03-28 12:38:02,903 INFO L225 Difference]: With dead ends: 29 25.79/10.96 [2019-03-28 12:38:02,903 INFO L226 Difference]: Without dead ends: 22 25.79/10.96 [2019-03-28 12:38:02,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 25.79/10.96 [2019-03-28 12:38:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 25.79/10.96 [2019-03-28 12:38:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. 25.79/10.96 [2019-03-28 12:38:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 25.79/10.96 [2019-03-28 12:38:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. 25.79/10.96 [2019-03-28 12:38:02,908 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 11 25.79/10.96 [2019-03-28 12:38:02,908 INFO L84 Accepts]: Finished accepts. word is rejected. 25.79/10.96 [2019-03-28 12:38:02,908 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 34 transitions. 25.79/10.96 [2019-03-28 12:38:02,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 25.79/10.96 [2019-03-28 12:38:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 34 transitions. 25.79/10.96 [2019-03-28 12:38:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 25.79/10.96 [2019-03-28 12:38:02,909 INFO L394 BasicCegarLoop]: Found error trace 25.79/10.96 [2019-03-28 12:38:02,909 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 25.79/10.96 [2019-03-28 12:38:02,909 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.79/10.96 [2019-03-28 12:38:02,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.96 [2019-03-28 12:38:02,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1976309367, now seen corresponding path program 2 times 25.79/10.96 [2019-03-28 12:38:02,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.96 [2019-03-28 12:38:02,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.96 [2019-03-28 12:38:02,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:02,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:02,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.96 [2019-03-28 12:38:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.96 [2019-03-28 12:38:03,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.79/10.96 [2019-03-28 12:38:03,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.79/10.96 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.79/10.96 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.79/10.96 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.79/10.96 [2019-03-28 12:38:03,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 25.79/10.96 [2019-03-28 12:38:03,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 25.79/10.96 [2019-03-28 12:38:03,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 25.79/10.96 [2019-03-28 12:38:03,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjunts are in the unsatisfiable core 25.79/10.96 [2019-03-28 12:38:03,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.79/10.96 [2019-03-28 12:38:03,225 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 25.79/10.96 [2019-03-28 12:38:03,226 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.79/10.96 [2019-03-28 12:38:03,229 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.79/10.96 [2019-03-28 12:38:03,230 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 25.79/10.96 [2019-03-28 12:38:03,230 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 25.79/10.96 [2019-03-28 12:38:03,246 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 25.79/10.96 [2019-03-28 12:38:03,246 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.79/10.96 [2019-03-28 12:38:03,251 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.79/10.96 [2019-03-28 12:38:03,252 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 25.79/10.96 [2019-03-28 12:38:03,252 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 25.79/10.96 [2019-03-28 12:38:03,288 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 25.79/10.96 [2019-03-28 12:38:03,289 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 25.79/10.96 [2019-03-28 12:38:03,290 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 25.79/10.96 [2019-03-28 12:38:03,302 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.79/10.96 [2019-03-28 12:38:03,304 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 25.79/10.96 [2019-03-28 12:38:03,305 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 25.79/10.96 [2019-03-28 12:38:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 25.79/10.96 [2019-03-28 12:38:03,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 25.79/10.96 [2019-03-28 12:38:03,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 25.79/10.96 [2019-03-28 12:38:03,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states 25.79/10.96 [2019-03-28 12:38:03,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 25.79/10.96 [2019-03-28 12:38:03,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 25.79/10.96 [2019-03-28 12:38:03,390 INFO L87 Difference]: Start difference. First operand 18 states and 34 transitions. Second operand 12 states. 25.79/10.96 [2019-03-28 12:38:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.79/10.96 [2019-03-28 12:38:03,897 INFO L93 Difference]: Finished difference Result 34 states and 69 transitions. 25.79/10.96 [2019-03-28 12:38:03,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 25.79/10.96 [2019-03-28 12:38:03,898 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 25.79/10.96 [2019-03-28 12:38:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.79/10.96 [2019-03-28 12:38:03,899 INFO L225 Difference]: With dead ends: 34 25.79/10.96 [2019-03-28 12:38:03,899 INFO L226 Difference]: Without dead ends: 33 25.79/10.96 [2019-03-28 12:38:03,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 25.79/10.96 [2019-03-28 12:38:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. 25.79/10.96 [2019-03-28 12:38:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. 25.79/10.96 [2019-03-28 12:38:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 25.79/10.96 [2019-03-28 12:38:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 47 transitions. 25.79/10.96 [2019-03-28 12:38:03,905 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 47 transitions. Word has length 17 25.79/10.96 [2019-03-28 12:38:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. 25.79/10.96 [2019-03-28 12:38:03,905 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 47 transitions. 25.79/10.96 [2019-03-28 12:38:03,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. 25.79/10.96 [2019-03-28 12:38:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 47 transitions. 25.79/10.96 [2019-03-28 12:38:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 25.79/10.96 [2019-03-28 12:38:03,906 INFO L394 BasicCegarLoop]: Found error trace 25.79/10.96 [2019-03-28 12:38:03,906 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] 25.79/10.96 [2019-03-28 12:38:03,907 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 25.79/10.96 [2019-03-28 12:38:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.96 [2019-03-28 12:38:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash 381932421, now seen corresponding path program 1 times 25.79/10.96 [2019-03-28 12:38:03,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.96 [2019-03-28 12:38:03,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.96 [2019-03-28 12:38:03,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:03,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:03,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.96 [2019-03-28 12:38:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. 25.79/10.96 [2019-03-28 12:38:04,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.79/10.96 [2019-03-28 12:38:04,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.79/10.96 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.79/10.96 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.79/10.96 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.79/10.96 [2019-03-28 12:38:04,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.96 [2019-03-28 12:38:04,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 25 conjunts are in the unsatisfiable core 25.79/10.96 [2019-03-28 12:38:04,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.79/10.96 [2019-03-28 12:38:04,074 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 25.79/10.96 [2019-03-28 12:38:04,075 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.79/10.96 [2019-03-28 12:38:04,079 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.79/10.96 [2019-03-28 12:38:04,079 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 25.79/10.96 [2019-03-28 12:38:04,080 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 25.79/10.96 [2019-03-28 12:38:04,087 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 25.79/10.96 [2019-03-28 12:38:04,087 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.79/10.96 [2019-03-28 12:38:04,091 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.79/10.96 [2019-03-28 12:38:04,091 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 25.79/10.96 [2019-03-28 12:38:04,092 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 25.79/10.96 [2019-03-28 12:38:04,111 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 25.79/10.96 [2019-03-28 12:38:04,111 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 25.79/10.96 [2019-03-28 12:38:04,113 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 25.79/10.96 [2019-03-28 12:38:04,122 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.79/10.96 [2019-03-28 12:38:04,122 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 25.79/10.96 [2019-03-28 12:38:04,122 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 25.79/10.96 [2019-03-28 12:38:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. 25.79/10.96 [2019-03-28 12:38:04,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 25.79/10.96 [2019-03-28 12:38:04,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 25.79/10.96 [2019-03-28 12:38:04,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 25.79/10.96 [2019-03-28 12:38:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 25.79/10.96 [2019-03-28 12:38:04,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 25.79/10.96 [2019-03-28 12:38:04,185 INFO L87 Difference]: Start difference. First operand 24 states and 47 transitions. Second operand 9 states. 25.79/10.96 [2019-03-28 12:38:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.79/10.96 [2019-03-28 12:38:04,296 INFO L93 Difference]: Finished difference Result 24 states and 47 transitions. 25.79/10.96 [2019-03-28 12:38:04,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 25.79/10.96 [2019-03-28 12:38:04,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 25.79/10.96 [2019-03-28 12:38:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.79/10.96 [2019-03-28 12:38:04,297 INFO L225 Difference]: With dead ends: 24 25.79/10.96 [2019-03-28 12:38:04,297 INFO L226 Difference]: Without dead ends: 0 25.79/10.96 [2019-03-28 12:38:04,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 25.79/10.96 [2019-03-28 12:38:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 25.79/10.96 [2019-03-28 12:38:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 25.79/10.96 [2019-03-28 12:38:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 25.79/10.96 [2019-03-28 12:38:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 25.79/10.96 [2019-03-28 12:38:04,298 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 25.79/10.96 [2019-03-28 12:38:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. 25.79/10.96 [2019-03-28 12:38:04,299 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 25.79/10.96 [2019-03-28 12:38:04,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 25.79/10.96 [2019-03-28 12:38:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 25.79/10.96 [2019-03-28 12:38:04,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 25.79/10.96 [2019-03-28 12:38:04,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 25.79/10.96 [2019-03-28 12:38:04,468 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 25.79/10.96 [2019-03-28 12:38:04,471 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,471 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,471 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 23) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,471 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,471 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,471 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,472 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,472 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,472 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,472 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,472 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,472 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,472 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,472 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,473 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,473 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,473 INFO L448 ceAbstractionStarter]: For program point L14-6(lines 14 15) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,473 INFO L444 ceAbstractionStarter]: At program point L14-8(lines 14 15) the Hoare annotation is: (let ((.cse1 (select |#length| ULTIMATE.start_cstrchr_~s.base))) (let ((.cse0 (= ULTIMATE.start_main_~nondetString~0.offset 0)) (.cse2 (= 1 (select |#valid| ULTIMATE.start_cstrchr_~s.base))) (.cse3 (<= 1 ULTIMATE.start_main_~length~0)) (.cse4 (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (.cse6 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrchr_~s.base) (+ .cse1 (- 1))))) (.cse5 (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1))) (or (and .cse0 (<= 1 ULTIMATE.start_cstrchr_~s.offset) (<= (+ ULTIMATE.start_cstrchr_~s.offset 1) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse5 (exists ((ULTIMATE.start_main_~length~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= 1 ULTIMATE.start_main_~length~0) (<= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstrchr_~s.base)) (<= ULTIMATE.start_cstrchr_~s.offset ULTIMATE.start_main_~nondetString~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrchr_~s.base) (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset (- 1))) 0))) (= 0 ULTIMATE.start_cstrchr_~s.offset))))) 25.79/10.96 [2019-03-28 12:38:04,473 INFO L448 ceAbstractionStarter]: For program point L14-9(lines 14 15) no Hoare annotation was computed. 25.79/10.96 [2019-03-28 12:38:04,474 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 25.79/10.96 [2019-03-28 12:38:04,483 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.79/10.96 [2019-03-28 12:38:04,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.79/10.96 [2019-03-28 12:38:04,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.79/10.96 [2019-03-28 12:38:04,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.79/10.96 [2019-03-28 12:38:04,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.79/10.96 [2019-03-28 12:38:04,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.79/10.96 [2019-03-28 12:38:04,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.79/10.96 [2019-03-28 12:38:04,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.79/10.96 [2019-03-28 12:38:04,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.79/10.96 [2019-03-28 12:38:04,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.79/10.96 [2019-03-28 12:38:04,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.79/10.96 [2019-03-28 12:38:04,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.79/10.96 [2019-03-28 12:38:04,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.79/10.96 [2019-03-28 12:38:04,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.79/10.96 [2019-03-28 12:38:04,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.79/10.96 [2019-03-28 12:38:04,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.79/10.96 [2019-03-28 12:38:04,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.79/10.96 [2019-03-28 12:38:04,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.79/10.96 [2019-03-28 12:38:04,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.79/10.96 [2019-03-28 12:38:04,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.79/10.96 [2019-03-28 12:38:04,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.79/10.96 [2019-03-28 12:38:04,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.79/10.96 [2019-03-28 12:38:04,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.79/10.96 [2019-03-28 12:38:04,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.79/10.96 [2019-03-28 12:38:04,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.79/10.96 [2019-03-28 12:38:04,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.79/10.96 [2019-03-28 12:38:04,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.79/10.96 [2019-03-28 12:38:04,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.79/10.96 [2019-03-28 12:38:04,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.79/10.96 [2019-03-28 12:38:04,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.79/10.96 [2019-03-28 12:38:04,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:04 BasicIcfg 25.79/10.96 [2019-03-28 12:38:04,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 25.79/10.96 [2019-03-28 12:38:04,507 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 25.79/10.96 [2019-03-28 12:38:04,507 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 25.79/10.96 [2019-03-28 12:38:04,510 INFO L276 PluginConnector]: BuchiAutomizer initialized 25.79/10.96 [2019-03-28 12:38:04,511 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.79/10.96 [2019-03-28 12:38:04,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:37:59" (1/5) ... 25.79/10.96 [2019-03-28 12:38:04,512 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c7d1fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:38:04, skipping insertion in model container 25.79/10.96 [2019-03-28 12:38:04,512 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.79/10.96 [2019-03-28 12:38:04,512 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:59" (2/5) ... 25.79/10.96 [2019-03-28 12:38:04,512 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c7d1fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:38:04, skipping insertion in model container 25.79/10.96 [2019-03-28 12:38:04,512 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.79/10.96 [2019-03-28 12:38:04,512 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:00" (3/5) ... 25.79/10.96 [2019-03-28 12:38:04,513 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c7d1fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:04, skipping insertion in model container 25.79/10.96 [2019-03-28 12:38:04,513 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.79/10.96 [2019-03-28 12:38:04,513 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:00" (4/5) ... 25.79/10.96 [2019-03-28 12:38:04,513 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c7d1fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:04, skipping insertion in model container 25.79/10.96 [2019-03-28 12:38:04,513 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.79/10.96 [2019-03-28 12:38:04,514 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:04" (5/5) ... 25.79/10.96 [2019-03-28 12:38:04,515 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.79/10.96 [2019-03-28 12:38:04,537 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.79/10.96 [2019-03-28 12:38:04,538 INFO L374 BuchiCegarLoop]: Interprodecural is true 25.79/10.96 [2019-03-28 12:38:04,538 INFO L375 BuchiCegarLoop]: Hoare is true 25.79/10.96 [2019-03-28 12:38:04,538 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 25.79/10.96 [2019-03-28 12:38:04,538 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 25.79/10.96 [2019-03-28 12:38:04,538 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.79/10.96 [2019-03-28 12:38:04,538 INFO L379 BuchiCegarLoop]: Difference is false 25.79/10.96 [2019-03-28 12:38:04,538 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 25.79/10.96 [2019-03-28 12:38:04,539 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 25.79/10.96 [2019-03-28 12:38:04,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. 25.79/10.96 [2019-03-28 12:38:04,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 25.79/10.96 [2019-03-28 12:38:04,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.79/10.96 [2019-03-28 12:38:04,547 INFO L119 BuchiIsEmpty]: Starting construction of run 25.79/10.96 [2019-03-28 12:38:04,552 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.79/10.96 [2019-03-28 12:38:04,553 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 25.79/10.96 [2019-03-28 12:38:04,553 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 25.79/10.96 [2019-03-28 12:38:04,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. 25.79/10.96 [2019-03-28 12:38:04,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 25.79/10.96 [2019-03-28 12:38:04,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.79/10.96 [2019-03-28 12:38:04,555 INFO L119 BuchiIsEmpty]: Starting construction of run 25.79/10.96 [2019-03-28 12:38:04,555 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.79/10.96 [2019-03-28 12:38:04,555 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 25.79/10.96 [2019-03-28 12:38:04,560 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue [133] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, ULTIMATE.start_main_#t~ret9.offset=|v_ULTIMATE.start_main_#t~ret9.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_#t~ret9.base=|v_ULTIMATE.start_main_#t~ret9.base_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~ret9.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret9.base, ULTIMATE.start_main_~length~0] 12#L21true [60] L21-->L21-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 9#L21-2true [100] L21-2-->L25: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.base, #valid, ULTIMATE.start_main_~nondetString~0.offset, #length, ULTIMATE.start_main_#t~malloc7.offset] 20#L25true [134] L25-->L14-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (<= 1 .cse0) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet8_5|) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12) (<= .cse0 (select |v_#length_11| v_ULTIMATE.start_main_~nondetString~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite5.base=|v_ULTIMATE.start_cstrchr_#t~ite5.base_6|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_4|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_4|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~mem4=|v_ULTIMATE.start_cstrchr_#t~mem4_6|, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_6|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_10|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrchr_#t~ite5.offset=|v_ULTIMATE.start_cstrchr_#t~ite5.offset_6|, #length=|v_#length_11|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_6|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start_cstrchr_#t~ite5.base, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem4, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, #memory_int, ULTIMATE.start_cstrchr_#t~ite5.offset, ULTIMATE.start_cstrchr_~c, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~mem0] 4#L14-8true 25.79/10.96 [2019-03-28 12:38:04,561 INFO L796 eck$LassoCheckResult]: Loop: 4#L14-8true [79] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem0_2|) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3))) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem0] 19#L14-1true [113] L14-1-->L14-2: Formula: (and |v_ULTIMATE.start_cstrchr_#t~short2_2| (< 0 |v_ULTIMATE.start_cstrchr_#t~mem0_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|} OutVars{ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short2] 17#L14-2true [66] L14-2-->L14-6: Formula: (not |v_ULTIMATE.start_cstrchr_#t~short2_5|) InVars {ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_5|} OutVars{ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_5|} AuxVars[] AssignedVars[] 8#L14-6true [83] L14-6-->L14-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short2_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_8|, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_5|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_2|, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~short2, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~mem0] 4#L14-8true 25.79/10.96 [2019-03-28 12:38:04,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.96 [2019-03-28 12:38:04,562 INFO L82 PathProgramCache]: Analyzing trace with hash 4946618, now seen corresponding path program 1 times 25.79/10.96 [2019-03-28 12:38:04,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.96 [2019-03-28 12:38:04,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.96 [2019-03-28 12:38:04,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:04,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:04,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.79/10.96 [2019-03-28 12:38:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.79/10.96 [2019-03-28 12:38:04,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.79/10.96 [2019-03-28 12:38:04,593 INFO L82 PathProgramCache]: Analyzing trace with hash 3387732, now seen corresponding path program 1 times 25.79/10.96 [2019-03-28 12:38:04,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.79/10.96 [2019-03-28 12:38:04,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.79/10.96 [2019-03-28 12:38:04,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:04,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:04,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.79/10.96 [2019-03-28 12:38:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.79/10.96 [2019-03-28 12:38:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.79/10.96 [2019-03-28 12:38:04,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.79/10.96 [2019-03-28 12:38:04,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.84/10.96 [2019-03-28 12:38:04,604 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.84/10.96 [2019-03-28 12:38:04,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.84/10.96 [2019-03-28 12:38:04,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.84/10.96 [2019-03-28 12:38:04,606 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. 25.84/10.96 [2019-03-28 12:38:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.84/10.96 [2019-03-28 12:38:04,660 INFO L93 Difference]: Finished difference Result 21 states and 42 transitions. 25.84/10.96 [2019-03-28 12:38:04,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.84/10.96 [2019-03-28 12:38:04,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 42 transitions. 25.84/10.96 [2019-03-28 12:38:04,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 25.84/10.96 [2019-03-28 12:38:04,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 12 states and 25 transitions. 25.84/10.96 [2019-03-28 12:38:04,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 25.84/10.96 [2019-03-28 12:38:04,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 25.84/10.96 [2019-03-28 12:38:04,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 25 transitions. 25.84/10.96 [2019-03-28 12:38:04,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.84/10.96 [2019-03-28 12:38:04,667 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 25 transitions. 25.84/10.96 [2019-03-28 12:38:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 25 transitions. 25.84/10.96 [2019-03-28 12:38:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. 25.84/10.96 [2019-03-28 12:38:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 25.84/10.96 [2019-03-28 12:38:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. 25.84/10.96 [2019-03-28 12:38:04,670 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. 25.84/10.96 [2019-03-28 12:38:04,670 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. 25.84/10.96 [2019-03-28 12:38:04,670 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 25.84/10.96 [2019-03-28 12:38:04,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 24 transitions. 25.84/10.96 [2019-03-28 12:38:04,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 25.84/10.96 [2019-03-28 12:38:04,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.84/10.96 [2019-03-28 12:38:04,671 INFO L119 BuchiIsEmpty]: Starting construction of run 25.84/10.96 [2019-03-28 12:38:04,671 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.84/10.96 [2019-03-28 12:38:04,671 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 25.84/10.96 [2019-03-28 12:38:04,673 INFO L794 eck$LassoCheckResult]: Stem: 53#ULTIMATE.startENTRY [133] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, ULTIMATE.start_main_#t~ret9.offset=|v_ULTIMATE.start_main_#t~ret9.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_#t~ret9.base=|v_ULTIMATE.start_main_#t~ret9.base_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~ret9.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret9.base, ULTIMATE.start_main_~length~0] 51#L21 [60] L21-->L21-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 52#L21-2 [100] L21-2-->L25: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.base, #valid, ULTIMATE.start_main_~nondetString~0.offset, #length, ULTIMATE.start_main_#t~malloc7.offset] 59#L25 [134] L25-->L14-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (<= 1 .cse0) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet8_5|) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12) (<= .cse0 (select |v_#length_11| v_ULTIMATE.start_main_~nondetString~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite5.base=|v_ULTIMATE.start_cstrchr_#t~ite5.base_6|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_4|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_4|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~mem4=|v_ULTIMATE.start_cstrchr_#t~mem4_6|, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_6|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_10|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrchr_#t~ite5.offset=|v_ULTIMATE.start_cstrchr_#t~ite5.offset_6|, #length=|v_#length_11|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_6|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start_cstrchr_#t~ite5.base, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem4, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, #memory_int, ULTIMATE.start_cstrchr_#t~ite5.offset, ULTIMATE.start_cstrchr_~c, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~mem0] 55#L14-8 25.84/10.96 [2019-03-28 12:38:04,674 INFO L796 eck$LassoCheckResult]: Loop: 55#L14-8 [79] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem0_2|) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3))) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem0] 56#L14-1 [114] L14-1-->L14-2: Formula: (and (not |v_ULTIMATE.start_cstrchr_#t~short2_2|) (= 0 |v_ULTIMATE.start_cstrchr_#t~mem0_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|} OutVars{ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short2] 58#L14-2 [66] L14-2-->L14-6: Formula: (not |v_ULTIMATE.start_cstrchr_#t~short2_5|) InVars {ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_5|} OutVars{ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_5|} AuxVars[] AssignedVars[] 50#L14-6 [83] L14-6-->L14-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short2_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_8|, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_5|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_2|, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~short2, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~mem0] 55#L14-8 25.84/10.96 [2019-03-28 12:38:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.84/10.96 [2019-03-28 12:38:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash 4946618, now seen corresponding path program 2 times 25.84/10.96 [2019-03-28 12:38:04,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.84/10.96 [2019-03-28 12:38:04,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.84/10.96 [2019-03-28 12:38:04,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.84/10.96 [2019-03-28 12:38:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.84/10.96 [2019-03-28 12:38:04,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.84/10.96 [2019-03-28 12:38:04,688 INFO L82 PathProgramCache]: Analyzing trace with hash 3388693, now seen corresponding path program 1 times 25.84/10.96 [2019-03-28 12:38:04,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.84/10.96 [2019-03-28 12:38:04,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.84/10.96 [2019-03-28 12:38:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.84/10.96 [2019-03-28 12:38:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.84/10.96 [2019-03-28 12:38:04,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.84/10.96 [2019-03-28 12:38:04,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.84/10.96 [2019-03-28 12:38:04,700 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.84/10.96 [2019-03-28 12:38:04,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.84/10.96 [2019-03-28 12:38:04,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.84/10.96 [2019-03-28 12:38:04,700 INFO L87 Difference]: Start difference. First operand 11 states and 24 transitions. cyclomatic complexity: 14 Second operand 3 states. 25.84/10.96 [2019-03-28 12:38:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.84/10.96 [2019-03-28 12:38:04,749 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. 25.84/10.96 [2019-03-28 12:38:04,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.84/10.96 [2019-03-28 12:38:04,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 23 transitions. 25.84/10.96 [2019-03-28 12:38:04,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 25.84/10.96 [2019-03-28 12:38:04,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 19 transitions. 25.84/10.96 [2019-03-28 12:38:04,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 25.84/10.96 [2019-03-28 12:38:04,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 25.84/10.96 [2019-03-28 12:38:04,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 19 transitions. 25.84/10.96 [2019-03-28 12:38:04,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.84/10.96 [2019-03-28 12:38:04,752 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. 25.84/10.96 [2019-03-28 12:38:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 19 transitions. 25.84/10.96 [2019-03-28 12:38:04,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 25.84/10.96 [2019-03-28 12:38:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 25.84/10.96 [2019-03-28 12:38:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. 25.84/10.96 [2019-03-28 12:38:04,753 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. 25.84/10.96 [2019-03-28 12:38:04,753 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. 25.84/10.96 [2019-03-28 12:38:04,753 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 25.84/10.96 [2019-03-28 12:38:04,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 19 transitions. 25.84/10.96 [2019-03-28 12:38:04,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 25.84/10.96 [2019-03-28 12:38:04,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.84/10.96 [2019-03-28 12:38:04,754 INFO L119 BuchiIsEmpty]: Starting construction of run 25.84/10.96 [2019-03-28 12:38:04,755 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.84/10.96 [2019-03-28 12:38:04,755 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 25.84/10.96 [2019-03-28 12:38:04,756 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY [133] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, ULTIMATE.start_main_#t~ret9.offset=|v_ULTIMATE.start_main_#t~ret9.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_#t~ret9.base=|v_ULTIMATE.start_main_#t~ret9.base_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~ret9.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret9.base, ULTIMATE.start_main_~length~0] 80#L21 [60] L21-->L21-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 81#L21-2 [100] L21-2-->L25: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.base, #valid, ULTIMATE.start_main_~nondetString~0.offset, #length, ULTIMATE.start_main_#t~malloc7.offset] 87#L25 [134] L25-->L14-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (<= 1 .cse0) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet8_5|) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12) (<= .cse0 (select |v_#length_11| v_ULTIMATE.start_main_~nondetString~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite5.base=|v_ULTIMATE.start_cstrchr_#t~ite5.base_6|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_4|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_4|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~mem4=|v_ULTIMATE.start_cstrchr_#t~mem4_6|, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_6|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_10|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrchr_#t~ite5.offset=|v_ULTIMATE.start_cstrchr_#t~ite5.offset_6|, #length=|v_#length_11|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_6|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start_cstrchr_#t~ite5.base, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem4, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, #memory_int, ULTIMATE.start_cstrchr_#t~ite5.offset, ULTIMATE.start_cstrchr_~c, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~mem0] 84#L14-8 25.84/10.96 [2019-03-28 12:38:04,756 INFO L796 eck$LassoCheckResult]: Loop: 84#L14-8 [79] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem0_2|) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3))) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem0] 85#L14-1 [113] L14-1-->L14-2: Formula: (and |v_ULTIMATE.start_cstrchr_#t~short2_2| (< 0 |v_ULTIMATE.start_cstrchr_#t~mem0_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|} OutVars{ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short2] 86#L14-2 [65] L14-2-->L14-3: Formula: |v_ULTIMATE.start_cstrchr_#t~short2_3| InVars {ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_3|} OutVars{ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_3|} AuxVars[] AssignedVars[] 83#L14-3 [62] L14-3-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrchr_~s.base_6)) (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_5) (= (select |v_#valid_9| v_ULTIMATE.start_cstrchr_~s.base_6) 1) (= (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrchr_~s.base_6) v_ULTIMATE.start_cstrchr_~s.offset_5) |v_ULTIMATE.start_cstrchr_#t~mem1_2|)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem1] 78#L14-4 [130] L14-4-->L14-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrchr_~c_3 256))) (and |v_ULTIMATE.start_cstrchr_#t~short2_4| (< (+ .cse0 (- 256)) |v_ULTIMATE.start_cstrchr_#t~mem1_3|) (> .cse0 127))) InVars {ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_3|} OutVars{ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_3|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_4|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short2] 79#L14-6 [83] L14-6-->L14-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short2_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_8|, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_5|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_2|, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~short2, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~mem0] 84#L14-8 25.84/10.96 [2019-03-28 12:38:04,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.84/10.96 [2019-03-28 12:38:04,756 INFO L82 PathProgramCache]: Analyzing trace with hash 4946618, now seen corresponding path program 3 times 25.84/10.96 [2019-03-28 12:38:04,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.84/10.96 [2019-03-28 12:38:04,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.84/10.96 [2019-03-28 12:38:04,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.84/10.96 [2019-03-28 12:38:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.84/10.96 [2019-03-28 12:38:04,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.84/10.96 [2019-03-28 12:38:04,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1039402703, now seen corresponding path program 1 times 25.84/10.96 [2019-03-28 12:38:04,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.84/10.96 [2019-03-28 12:38:04,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.84/10.96 [2019-03-28 12:38:04,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.84/10.96 [2019-03-28 12:38:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.84/10.96 [2019-03-28 12:38:04,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.84/10.96 [2019-03-28 12:38:04,780 INFO L82 PathProgramCache]: Analyzing trace with hash 280282410, now seen corresponding path program 1 times 25.84/10.96 [2019-03-28 12:38:04,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.84/10.96 [2019-03-28 12:38:04,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.84/10.96 [2019-03-28 12:38:04,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.84/10.96 [2019-03-28 12:38:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.84/10.96 [2019-03-28 12:38:04,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.84/10.96 [2019-03-28 12:38:04,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 25.84/10.96 [2019-03-28 12:38:04,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 25.84/10.96 [2019-03-28 12:38:04,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 25.84/10.96 [2019-03-28 12:38:04,918 INFO L87 Difference]: Start difference. First operand 10 states and 19 transitions. cyclomatic complexity: 10 Second operand 6 states. 25.84/10.96 [2019-03-28 12:38:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.84/10.96 [2019-03-28 12:38:04,993 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. 25.84/10.96 [2019-03-28 12:38:04,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 25.84/10.96 [2019-03-28 12:38:04,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 23 transitions. 25.84/10.96 [2019-03-28 12:38:04,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 25.84/10.96 [2019-03-28 12:38:04,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 18 transitions. 25.84/10.96 [2019-03-28 12:38:04,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 25.84/10.96 [2019-03-28 12:38:04,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 25.84/10.96 [2019-03-28 12:38:04,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 18 transitions. 25.84/10.96 [2019-03-28 12:38:04,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.84/10.96 [2019-03-28 12:38:04,995 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 25.84/10.96 [2019-03-28 12:38:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 18 transitions. 25.84/10.96 [2019-03-28 12:38:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 25.84/10.96 [2019-03-28 12:38:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 25.84/10.96 [2019-03-28 12:38:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. 25.84/10.96 [2019-03-28 12:38:04,997 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 25.84/10.96 [2019-03-28 12:38:04,997 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 25.84/10.96 [2019-03-28 12:38:04,997 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 25.84/10.96 [2019-03-28 12:38:04,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 18 transitions. 25.84/10.96 [2019-03-28 12:38:04,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 25.84/10.96 [2019-03-28 12:38:04,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.84/10.96 [2019-03-28 12:38:04,998 INFO L119 BuchiIsEmpty]: Starting construction of run 25.84/10.96 [2019-03-28 12:38:04,998 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.84/10.96 [2019-03-28 12:38:04,998 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 25.84/10.96 [2019-03-28 12:38:04,999 INFO L794 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY [133] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, ULTIMATE.start_main_#t~ret9.offset=|v_ULTIMATE.start_main_#t~ret9.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_#t~ret9.base=|v_ULTIMATE.start_main_#t~ret9.base_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~ret9.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret9.base, ULTIMATE.start_main_~length~0] 119#L21 [86] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 120#L21-2 [100] L21-2-->L25: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.base, #valid, ULTIMATE.start_main_~nondetString~0.offset, #length, ULTIMATE.start_main_#t~malloc7.offset] 126#L25 [134] L25-->L14-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (<= 1 .cse0) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet8_5|) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12) (<= .cse0 (select |v_#length_11| v_ULTIMATE.start_main_~nondetString~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite5.base=|v_ULTIMATE.start_cstrchr_#t~ite5.base_6|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_4|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_4|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~mem4=|v_ULTIMATE.start_cstrchr_#t~mem4_6|, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_6|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_10|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrchr_#t~ite5.offset=|v_ULTIMATE.start_cstrchr_#t~ite5.offset_6|, #length=|v_#length_11|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_6|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start_cstrchr_#t~ite5.base, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem4, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, #memory_int, ULTIMATE.start_cstrchr_#t~ite5.offset, ULTIMATE.start_cstrchr_~c, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~mem0] 123#L14-8 25.84/10.96 [2019-03-28 12:38:04,999 INFO L796 eck$LassoCheckResult]: Loop: 123#L14-8 [79] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem0_2|) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3))) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem0] 124#L14-1 [113] L14-1-->L14-2: Formula: (and |v_ULTIMATE.start_cstrchr_#t~short2_2| (< 0 |v_ULTIMATE.start_cstrchr_#t~mem0_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|} OutVars{ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short2] 125#L14-2 [65] L14-2-->L14-3: Formula: |v_ULTIMATE.start_cstrchr_#t~short2_3| InVars {ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_3|} OutVars{ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_3|} AuxVars[] AssignedVars[] 122#L14-3 [62] L14-3-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrchr_~s.base_6)) (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_5) (= (select |v_#valid_9| v_ULTIMATE.start_cstrchr_~s.base_6) 1) (= (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrchr_~s.base_6) v_ULTIMATE.start_cstrchr_~s.offset_5) |v_ULTIMATE.start_cstrchr_#t~mem1_2|)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem1] 117#L14-4 [130] L14-4-->L14-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrchr_~c_3 256))) (and |v_ULTIMATE.start_cstrchr_#t~short2_4| (< (+ .cse0 (- 256)) |v_ULTIMATE.start_cstrchr_#t~mem1_3|) (> .cse0 127))) InVars {ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_3|} OutVars{ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_3|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_4|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short2] 118#L14-6 [83] L14-6-->L14-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short2_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_8|, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_5|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_2|, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~short2, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~mem0] 123#L14-8 25.84/10.96 [2019-03-28 12:38:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.84/10.96 [2019-03-28 12:38:04,999 INFO L82 PathProgramCache]: Analyzing trace with hash 4971604, now seen corresponding path program 1 times 25.84/10.96 [2019-03-28 12:38:05,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.84/10.96 [2019-03-28 12:38:05,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.84/10.96 [2019-03-28 12:38:05,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:05,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:05,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.84/10.96 [2019-03-28 12:38:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.84/10.96 [2019-03-28 12:38:05,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.84/10.96 [2019-03-28 12:38:05,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1039402703, now seen corresponding path program 2 times 25.84/10.96 [2019-03-28 12:38:05,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.84/10.96 [2019-03-28 12:38:05,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.84/10.96 [2019-03-28 12:38:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:05,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.84/10.96 [2019-03-28 12:38:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.84/10.96 [2019-03-28 12:38:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.84/10.96 [2019-03-28 12:38:05,020 INFO L82 PathProgramCache]: Analyzing trace with hash 531106628, now seen corresponding path program 1 times 25.84/10.96 [2019-03-28 12:38:05,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.84/10.96 [2019-03-28 12:38:05,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.84/10.96 [2019-03-28 12:38:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:05,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.84/10.96 [2019-03-28 12:38:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.84/10.96 [2019-03-28 12:38:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.84/10.96 [2019-03-28 12:38:05,226 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 25.84/10.96 [2019-03-28 12:38:05,285 INFO L216 LassoAnalysis]: Preferences: 25.84/10.96 [2019-03-28 12:38:05,286 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.84/10.96 [2019-03-28 12:38:05,286 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.84/10.96 [2019-03-28 12:38:05,287 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.84/10.96 [2019-03-28 12:38:05,287 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.84/10.96 [2019-03-28 12:38:05,287 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.84/10.96 [2019-03-28 12:38:05,287 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.84/10.96 [2019-03-28 12:38:05,287 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.84/10.96 [2019-03-28 12:38:05,287 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 25.84/10.96 [2019-03-28 12:38:05,287 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.84/10.96 [2019-03-28 12:38:05,288 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.84/10.96 [2019-03-28 12:38:05,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.84/10.96 [2019-03-28 12:38:05,729 INFO L300 LassoAnalysis]: Preprocessing complete. 25.84/10.96 [2019-03-28 12:38:05,734 INFO L497 LassoAnalysis]: Using template 'affine'. 25.84/10.96 [2019-03-28 12:38:05,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.84/10.96 Termination analysis: LINEAR_WITH_GUESSES 25.84/10.96 Number of strict supporting invariants: 0 25.84/10.96 Number of non-strict supporting invariants: 1 25.84/10.96 Consider only non-deceasing supporting invariants: true 25.84/10.96 Simplify termination arguments: true 25.84/10.96 Simplify supporting invariants: trueOverapproximate stem: false 25.84/10.96 [2019-03-28 12:38:05,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.84/10.96 [2019-03-28 12:38:05,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.84/10.96 [2019-03-28 12:38:05,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.84/10.96 [2019-03-28 12:38:05,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.84/10.96 [2019-03-28 12:38:05,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.84/10.96 [2019-03-28 12:38:05,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.84/10.96 [2019-03-28 12:38:05,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.84/10.96 [2019-03-28 12:38:05,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.84/10.96 [2019-03-28 12:38:05,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.84/10.96 Termination analysis: LINEAR_WITH_GUESSES 25.84/10.96 Number of strict supporting invariants: 0 25.84/10.96 Number of non-strict supporting invariants: 1 25.84/10.96 Consider only non-deceasing supporting invariants: true 25.84/10.96 Simplify termination arguments: true 25.84/10.96 Simplify supporting invariants: trueOverapproximate stem: false 25.84/10.96 [2019-03-28 12:38:05,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.84/10.96 [2019-03-28 12:38:05,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.84/10.96 [2019-03-28 12:38:05,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.84/10.96 [2019-03-28 12:38:05,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.84/10.96 [2019-03-28 12:38:05,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.84/10.96 [2019-03-28 12:38:05,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.84/10.96 [2019-03-28 12:38:05,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.84/10.96 [2019-03-28 12:38:05,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.84/10.96 [2019-03-28 12:38:05,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.84/10.96 Termination analysis: LINEAR_WITH_GUESSES 25.84/10.96 Number of strict supporting invariants: 0 25.84/10.96 Number of non-strict supporting invariants: 1 25.84/10.96 Consider only non-deceasing supporting invariants: true 25.84/10.96 Simplify termination arguments: true 25.84/10.96 Simplify supporting invariants: trueOverapproximate stem: false 25.84/10.96 [2019-03-28 12:38:05,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.84/10.96 [2019-03-28 12:38:05,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.84/10.96 [2019-03-28 12:38:05,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.84/10.96 [2019-03-28 12:38:05,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.84/10.96 [2019-03-28 12:38:05,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.84/10.96 [2019-03-28 12:38:05,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.84/10.96 [2019-03-28 12:38:05,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.84/10.96 [2019-03-28 12:38:05,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.84/10.96 Termination analysis: LINEAR_WITH_GUESSES 25.84/10.96 Number of strict supporting invariants: 0 25.84/10.96 Number of non-strict supporting invariants: 1 25.84/10.96 Consider only non-deceasing supporting invariants: true 25.84/10.96 Simplify termination arguments: true 25.84/10.96 Simplify supporting invariants: trueOverapproximate stem: false 25.84/10.96 [2019-03-28 12:38:05,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.84/10.96 [2019-03-28 12:38:05,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.84/10.96 [2019-03-28 12:38:05,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.84/10.96 [2019-03-28 12:38:05,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.84/10.96 [2019-03-28 12:38:05,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.84/10.96 [2019-03-28 12:38:05,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.84/10.96 [2019-03-28 12:38:05,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.84/10.96 [2019-03-28 12:38:05,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.84/10.96 [2019-03-28 12:38:05,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.84/10.96 Termination analysis: LINEAR_WITH_GUESSES 25.84/10.96 Number of strict supporting invariants: 0 25.84/10.96 Number of non-strict supporting invariants: 1 25.84/10.96 Consider only non-deceasing supporting invariants: true 25.84/10.96 Simplify termination arguments: true 25.84/10.96 Simplify supporting invariants: trueOverapproximate stem: false 25.84/10.96 [2019-03-28 12:38:05,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.84/10.96 [2019-03-28 12:38:05,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.84/10.96 [2019-03-28 12:38:05,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.84/10.96 [2019-03-28 12:38:05,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.84/10.96 [2019-03-28 12:38:05,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.84/10.96 [2019-03-28 12:38:05,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.84/10.96 [2019-03-28 12:38:05,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.84/10.96 [2019-03-28 12:38:05,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.84/10.96 [2019-03-28 12:38:05,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.84/10.96 Termination analysis: LINEAR_WITH_GUESSES 25.84/10.96 Number of strict supporting invariants: 0 25.84/10.96 Number of non-strict supporting invariants: 1 25.84/10.96 Consider only non-deceasing supporting invariants: true 25.84/10.96 Simplify termination arguments: true 25.84/10.96 Simplify supporting invariants: trueOverapproximate stem: false 25.84/10.96 [2019-03-28 12:38:05,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.84/10.96 [2019-03-28 12:38:05,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.84/10.96 [2019-03-28 12:38:05,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.84/10.96 [2019-03-28 12:38:05,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.84/10.96 [2019-03-28 12:38:05,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.84/10.96 [2019-03-28 12:38:05,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.84/10.96 [2019-03-28 12:38:05,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.84/10.96 [2019-03-28 12:38:05,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.84/10.96 Termination analysis: LINEAR_WITH_GUESSES 25.84/10.96 Number of strict supporting invariants: 0 25.84/10.96 Number of non-strict supporting invariants: 1 25.84/10.96 Consider only non-deceasing supporting invariants: true 25.84/10.96 Simplify termination arguments: true 25.84/10.96 Simplify supporting invariants: trueOverapproximate stem: false 25.84/10.96 [2019-03-28 12:38:05,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.84/10.96 [2019-03-28 12:38:05,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.84/10.96 [2019-03-28 12:38:05,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.84/10.96 [2019-03-28 12:38:05,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.84/10.96 [2019-03-28 12:38:05,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.84/10.96 [2019-03-28 12:38:05,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.84/10.96 [2019-03-28 12:38:05,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.84/10.96 [2019-03-28 12:38:05,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.84/10.96 Termination analysis: LINEAR_WITH_GUESSES 25.84/10.96 Number of strict supporting invariants: 0 25.84/10.96 Number of non-strict supporting invariants: 1 25.84/10.96 Consider only non-deceasing supporting invariants: true 25.84/10.96 Simplify termination arguments: true 25.84/10.96 Simplify supporting invariants: trueOverapproximate stem: false 25.84/10.96 [2019-03-28 12:38:05,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.84/10.96 [2019-03-28 12:38:05,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.84/10.96 [2019-03-28 12:38:05,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.84/10.96 [2019-03-28 12:38:05,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.84/10.96 [2019-03-28 12:38:05,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.84/10.96 [2019-03-28 12:38:05,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.84/10.96 [2019-03-28 12:38:05,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.84/10.96 [2019-03-28 12:38:05,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.84/10.96 Termination analysis: LINEAR_WITH_GUESSES 25.84/10.96 Number of strict supporting invariants: 0 25.84/10.96 Number of non-strict supporting invariants: 1 25.84/10.96 Consider only non-deceasing supporting invariants: true 25.84/10.96 Simplify termination arguments: true 25.84/10.96 Simplify supporting invariants: trueOverapproximate stem: false 25.84/10.96 [2019-03-28 12:38:05,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.84/10.96 [2019-03-28 12:38:05,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.84/10.96 [2019-03-28 12:38:05,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.84/10.96 [2019-03-28 12:38:05,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.84/10.96 [2019-03-28 12:38:05,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.84/10.96 [2019-03-28 12:38:05,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.84/10.96 [2019-03-28 12:38:05,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.84/10.96 [2019-03-28 12:38:05,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.84/10.96 Termination analysis: LINEAR_WITH_GUESSES 25.84/10.96 Number of strict supporting invariants: 0 25.84/10.96 Number of non-strict supporting invariants: 1 25.84/10.96 Consider only non-deceasing supporting invariants: true 25.84/10.96 Simplify termination arguments: true 25.84/10.96 Simplify supporting invariants: trueOverapproximate stem: false 25.84/10.96 [2019-03-28 12:38:05,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.84/10.96 [2019-03-28 12:38:05,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.84/10.96 [2019-03-28 12:38:05,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.84/10.96 [2019-03-28 12:38:05,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.84/10.96 [2019-03-28 12:38:05,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.84/10.96 [2019-03-28 12:38:05,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.84/10.96 [2019-03-28 12:38:05,817 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.84/10.96 [2019-03-28 12:38:05,833 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 25.84/10.96 [2019-03-28 12:38:05,833 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. 25.84/10.96 [2019-03-28 12:38:05,836 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.84/10.96 [2019-03-28 12:38:05,837 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.84/10.96 [2019-03-28 12:38:05,838 INFO L518 LassoAnalysis]: Proved termination. 25.84/10.96 [2019-03-28 12:38:05,838 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.84/10.96 Ranking function f(ULTIMATE.start_cstrchr_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_1) = -1*ULTIMATE.start_cstrchr_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_1 25.84/10.96 Supporting invariants [] 25.84/10.96 [2019-03-28 12:38:05,854 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed 25.84/10.96 [2019-03-28 12:38:05,858 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.84/10.96 [2019-03-28 12:38:05,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.84/10.96 [2019-03-28 12:38:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.84/10.96 [2019-03-28 12:38:05,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core 25.84/10.96 [2019-03-28 12:38:05,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.84/10.96 [2019-03-28 12:38:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.84/10.96 [2019-03-28 12:38:05,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core 25.84/10.96 [2019-03-28 12:38:05,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.84/10.96 [2019-03-28 12:38:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.84/10.96 [2019-03-28 12:38:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.84/10.96 [2019-03-28 12:38:05,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core 25.84/10.96 [2019-03-28 12:38:05,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.84/10.96 [2019-03-28 12:38:06,040 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 25.84/10.96 [2019-03-28 12:38:06,044 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 25.84/10.96 [2019-03-28 12:38:06,045 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 9 Second operand 4 states. 25.84/10.96 [2019-03-28 12:38:06,152 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 16 states and 32 transitions. Complement of second has 5 states. 25.84/10.96 [2019-03-28 12:38:06,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states 25.84/10.96 [2019-03-28 12:38:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 25.84/10.96 [2019-03-28 12:38:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. 25.84/10.96 [2019-03-28 12:38:06,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 6 letters. 25.84/10.96 [2019-03-28 12:38:06,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.84/10.96 [2019-03-28 12:38:06,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 6 letters. 25.84/10.96 [2019-03-28 12:38:06,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.84/10.96 [2019-03-28 12:38:06,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 12 letters. 25.84/10.96 [2019-03-28 12:38:06,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.84/10.96 [2019-03-28 12:38:06,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 32 transitions. 25.84/10.96 [2019-03-28 12:38:06,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.84/10.96 [2019-03-28 12:38:06,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. 25.84/10.96 [2019-03-28 12:38:06,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 25.84/10.96 [2019-03-28 12:38:06,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 25.84/10.96 [2019-03-28 12:38:06,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 25.84/10.96 [2019-03-28 12:38:06,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.84/10.96 [2019-03-28 12:38:06,166 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.84/10.96 [2019-03-28 12:38:06,166 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.84/10.96 [2019-03-28 12:38:06,166 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.84/10.96 [2019-03-28 12:38:06,166 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 25.84/10.96 [2019-03-28 12:38:06,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 25.84/10.96 [2019-03-28 12:38:06,166 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.84/10.96 [2019-03-28 12:38:06,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 25.84/10.96 [2019-03-28 12:38:06,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:06 BasicIcfg 25.84/10.96 [2019-03-28 12:38:06,172 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 25.84/10.96 [2019-03-28 12:38:06,173 INFO L168 Benchmark]: Toolchain (without parser) took 6504.51 ms. Allocated memory was 649.6 MB in the beginning and 768.1 MB in the end (delta: 118.5 MB). Free memory was 563.8 MB in the beginning and 473.6 MB in the end (delta: 90.2 MB). Peak memory consumption was 208.7 MB. Max. memory is 50.3 GB. 25.84/10.96 [2019-03-28 12:38:06,174 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.84/10.96 [2019-03-28 12:38:06,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.79 ms. Allocated memory was 649.6 MB in the beginning and 670.0 MB in the end (delta: 20.4 MB). Free memory was 563.8 MB in the beginning and 635.2 MB in the end (delta: -71.4 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 25.84/10.96 [2019-03-28 12:38:06,175 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.00 ms. Allocated memory is still 670.0 MB. Free memory was 635.2 MB in the beginning and 632.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 25.84/10.96 [2019-03-28 12:38:06,175 INFO L168 Benchmark]: Boogie Preprocessor took 25.87 ms. Allocated memory is still 670.0 MB. Free memory was 632.1 MB in the beginning and 630.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 25.84/10.96 [2019-03-28 12:38:06,176 INFO L168 Benchmark]: RCFGBuilder took 330.96 ms. Allocated memory is still 670.0 MB. Free memory was 630.7 MB in the beginning and 610.9 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 50.3 GB. 25.84/10.96 [2019-03-28 12:38:06,176 INFO L168 Benchmark]: BlockEncodingV2 took 120.30 ms. Allocated memory is still 670.0 MB. Free memory was 610.9 MB in the beginning and 601.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 25.84/10.96 [2019-03-28 12:38:06,177 INFO L168 Benchmark]: TraceAbstraction took 4003.38 ms. Allocated memory was 670.0 MB in the beginning and 742.9 MB in the end (delta: 72.9 MB). Free memory was 601.5 MB in the beginning and 380.8 MB in the end (delta: 220.7 MB). Peak memory consumption was 293.5 MB. Max. memory is 50.3 GB. 25.84/10.96 [2019-03-28 12:38:06,177 INFO L168 Benchmark]: BuchiAutomizer took 1665.72 ms. Allocated memory was 742.9 MB in the beginning and 768.1 MB in the end (delta: 25.2 MB). Free memory was 380.8 MB in the beginning and 473.6 MB in the end (delta: -92.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 25.84/10.96 [2019-03-28 12:38:06,182 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 25.84/10.96 --- Results --- 25.84/10.96 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 25.84/10.96 - StatisticsResult: Initial Icfg 25.84/10.96 27 locations, 31 edges 25.84/10.96 - StatisticsResult: Encoded RCFG 25.84/10.96 19 locations, 42 edges 25.84/10.96 * Results from de.uni_freiburg.informatik.ultimate.core: 25.84/10.96 - StatisticsResult: Toolchain Benchmarks 25.84/10.96 Benchmark results are: 25.84/10.96 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.84/10.96 * CACSL2BoogieTranslator took 309.79 ms. Allocated memory was 649.6 MB in the beginning and 670.0 MB in the end (delta: 20.4 MB). Free memory was 563.8 MB in the beginning and 635.2 MB in the end (delta: -71.4 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 25.84/10.96 * Boogie Procedure Inliner took 43.00 ms. Allocated memory is still 670.0 MB. Free memory was 635.2 MB in the beginning and 632.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 25.84/10.96 * Boogie Preprocessor took 25.87 ms. Allocated memory is still 670.0 MB. Free memory was 632.1 MB in the beginning and 630.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 25.84/10.96 * RCFGBuilder took 330.96 ms. Allocated memory is still 670.0 MB. Free memory was 630.7 MB in the beginning and 610.9 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 50.3 GB. 25.84/10.96 * BlockEncodingV2 took 120.30 ms. Allocated memory is still 670.0 MB. Free memory was 610.9 MB in the beginning and 601.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 25.84/10.96 * TraceAbstraction took 4003.38 ms. Allocated memory was 670.0 MB in the beginning and 742.9 MB in the end (delta: 72.9 MB). Free memory was 601.5 MB in the beginning and 380.8 MB in the end (delta: 220.7 MB). Peak memory consumption was 293.5 MB. Max. memory is 50.3 GB. 25.84/10.96 * BuchiAutomizer took 1665.72 ms. Allocated memory was 742.9 MB in the beginning and 768.1 MB in the end (delta: 25.2 MB). Free memory was 380.8 MB in the beginning and 473.6 MB in the end (delta: -92.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 25.84/10.96 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.84/10.96 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #length 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #length 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #memory_int 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #length 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #length 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #memory_int 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #length 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #length 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #memory_int 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #length 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #length 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #memory_int 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #length 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #length 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #memory_int 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #length 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #length 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #memory_int 25.84/10.96 - GenericResult: Unfinished Backtranslation 25.84/10.96 unknown boogie variable #length 25.84/10.96 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 25.84/10.96 - PositiveResult [Line: 14]: pointer dereference always succeeds 25.84/10.96 For all program executions holds that pointer dereference always succeeds at this location 25.84/10.96 - PositiveResult [Line: 16]: pointer dereference always succeeds 25.84/10.96 For all program executions holds that pointer dereference always succeeds at this location 25.84/10.96 - PositiveResult [Line: 25]: pointer dereference always succeeds 25.84/10.96 For all program executions holds that pointer dereference always succeeds at this location 25.84/10.96 - PositiveResult [Line: 14]: pointer dereference always succeeds 25.84/10.96 For all program executions holds that pointer dereference always succeeds at this location 25.84/10.96 - PositiveResult [Line: 14]: pointer dereference always succeeds 25.84/10.96 For all program executions holds that pointer dereference always succeeds at this location 25.84/10.96 - PositiveResult [Line: 25]: pointer dereference always succeeds 25.84/10.96 For all program executions holds that pointer dereference always succeeds at this location 25.84/10.96 - PositiveResult [Line: 14]: pointer dereference always succeeds 25.84/10.96 For all program executions holds that pointer dereference always succeeds at this location 25.84/10.96 - PositiveResult [Line: 16]: pointer dereference always succeeds 25.84/10.96 For all program executions holds that pointer dereference always succeeds at this location 25.84/10.96 - AllSpecificationsHoldResult: All specifications hold 25.84/10.96 8 specifications checked. All of them hold 25.84/10.96 - InvariantResult [Line: 14]: Loop Invariant 25.84/10.96 [2019-03-28 12:38:06,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.84/10.96 [2019-03-28 12:38:06,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.84/10.96 [2019-03-28 12:38:06,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.84/10.96 [2019-03-28 12:38:06,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.84/10.96 [2019-03-28 12:38:06,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.84/10.96 [2019-03-28 12:38:06,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.84/10.96 [2019-03-28 12:38:06,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.84/10.96 [2019-03-28 12:38:06,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.84/10.96 [2019-03-28 12:38:06,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.84/10.96 [2019-03-28 12:38:06,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.84/10.96 [2019-03-28 12:38:06,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.84/10.96 [2019-03-28 12:38:06,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.84/10.96 [2019-03-28 12:38:06,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.84/10.96 [2019-03-28 12:38:06,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.84/10.96 [2019-03-28 12:38:06,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.84/10.96 [2019-03-28 12:38:06,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.84/10.96 [2019-03-28 12:38:06,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.84/10.96 [2019-03-28 12:38:06,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.84/10.96 [2019-03-28 12:38:06,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.84/10.96 [2019-03-28 12:38:06,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 25.84/10.96 [2019-03-28 12:38:06,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 25.84/10.96 [2019-03-28 12:38:06,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.84/10.96 [2019-03-28 12:38:06,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.84/10.96 [2019-03-28 12:38:06,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.84/10.96 [2019-03-28 12:38:06,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.84/10.96 [2019-03-28 12:38:06,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.84/10.96 [2019-03-28 12:38:06,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.84/10.96 [2019-03-28 12:38:06,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.84/10.96 [2019-03-28 12:38:06,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.84/10.96 [2019-03-28 12:38:06,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.84/10.96 Derived loop invariant: (((((((nondetString == 0 && 1 <= s) && s + 1 <= unknown-#length-unknown[s]) && 1 == \valid[s]) && 1 <= length) && length == unknown-#length-unknown[nondetString]) && \valid[nondetString] == 1) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) || (((((((nondetString == 0 && 1 == \valid[s]) && 1 <= length) && length == unknown-#length-unknown[nondetString]) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && \valid[nondetString] == 1) && (\exists ULTIMATE.start_main_~length~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((1 <= ULTIMATE.start_main_~length~0 && ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[s]) && s <= ULTIMATE.start_main_~nondetString~0.offset) && unknown-#memory_int-unknown[s][ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset + -1] == 0)) && 0 == s) 25.84/10.96 - StatisticsResult: Ultimate Automizer benchmark data 25.84/10.96 CFG has 1 procedures, 19 locations, 8 error locations. SAFE Result, 3.9s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 69 SDtfs, 895 SDslu, 246 SDs, 0 SdLazy, 650 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=11, 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, 12 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 4 NumberOfFragments, 105 HoareAnnotationTreeSize, 1 FomulaSimplifications, 144 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 72 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 153 ConstructedInterpolants, 8 QuantifiedInterpolants, 19751 SizeOfPredicates, 24 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 18/64 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 25.84/10.96 - StatisticsResult: Constructed decomposition of program 25.84/10.96 Your program was decomposed into 4 terminating modules (3 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[alloca(length * sizeof(char))] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. 25.84/10.96 - StatisticsResult: Timing statistics 25.84/10.96 BüchiAutomizer plugin needed 1.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 77 SDslu, 87 SDs, 0 SdLazy, 202 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital116 mio100 ax100 hnf100 lsp85 ukn90 mio100 lsp46 div123 bol100 ite100 ukn100 eq153 hnf88 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 25.84/10.96 - TerminationAnalysisResult: Termination proven 25.84/10.96 Buchi Automizer proved that your program is terminating 25.84/10.96 RESULT: Ultimate proved your program to be correct! 25.84/10.96 !SESSION 2019-03-28 12:37:56.434 ----------------------------------------------- 25.84/10.96 eclipse.buildId=unknown 25.84/10.96 java.version=1.8.0_181 25.84/10.96 java.vendor=Oracle Corporation 25.84/10.96 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 25.84/10.96 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.84/10.96 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.84/10.96 25.84/10.96 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:38:06.427 25.84/10.96 !MESSAGE The workspace will exit with unsaved changes in this session. 25.84/10.96 Received shutdown request... 25.84/10.96 Ultimate: 25.84/10.96 GTK+ Version Check 25.84/10.96 EOF