67.24/35.75 YES 67.24/35.75 67.24/35.75 Ultimate: Cannot open display: 67.24/35.75 This is Ultimate 0.1.24-8dc7c08-m 67.24/35.75 [2019-03-28 12:03:47,286 INFO L170 SettingsManager]: Resetting all preferences to default values... 67.24/35.75 [2019-03-28 12:03:47,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 67.24/35.75 [2019-03-28 12:03:47,304 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 67.24/35.75 [2019-03-28 12:03:47,304 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 67.24/35.75 [2019-03-28 12:03:47,305 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 67.24/35.75 [2019-03-28 12:03:47,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 67.24/35.75 [2019-03-28 12:03:47,308 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 67.24/35.75 [2019-03-28 12:03:47,309 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 67.24/35.75 [2019-03-28 12:03:47,310 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 67.24/35.75 [2019-03-28 12:03:47,311 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 67.24/35.75 [2019-03-28 12:03:47,311 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 67.24/35.75 [2019-03-28 12:03:47,312 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 67.24/35.75 [2019-03-28 12:03:47,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 67.24/35.75 [2019-03-28 12:03:47,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 67.24/35.75 [2019-03-28 12:03:47,315 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 67.24/35.75 [2019-03-28 12:03:47,316 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 67.24/35.75 [2019-03-28 12:03:47,317 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 67.24/35.75 [2019-03-28 12:03:47,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 67.24/35.75 [2019-03-28 12:03:47,321 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 67.24/35.75 [2019-03-28 12:03:47,322 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 67.24/35.75 [2019-03-28 12:03:47,323 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 67.24/35.75 [2019-03-28 12:03:47,326 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 67.24/35.75 [2019-03-28 12:03:47,326 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 67.24/35.75 [2019-03-28 12:03:47,326 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 67.24/35.75 [2019-03-28 12:03:47,327 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 67.24/35.75 [2019-03-28 12:03:47,328 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 67.24/35.75 [2019-03-28 12:03:47,329 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 67.24/35.75 [2019-03-28 12:03:47,329 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 67.24/35.75 [2019-03-28 12:03:47,330 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 67.24/35.75 [2019-03-28 12:03:47,331 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 67.24/35.75 [2019-03-28 12:03:47,331 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 67.24/35.75 [2019-03-28 12:03:47,333 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 67.24/35.75 [2019-03-28 12:03:47,333 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 67.24/35.75 [2019-03-28 12:03:47,334 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 67.24/35.75 [2019-03-28 12:03:47,334 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 67.24/35.75 [2019-03-28 12:03:47,334 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 67.24/35.75 [2019-03-28 12:03:47,335 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 67.24/35.75 [2019-03-28 12:03:47,336 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 67.24/35.75 [2019-03-28 12:03:47,336 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 67.24/35.75 [2019-03-28 12:03:47,352 INFO L110 SettingsManager]: Loading preferences was successful 67.24/35.75 [2019-03-28 12:03:47,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 67.24/35.75 [2019-03-28 12:03:47,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 67.24/35.75 [2019-03-28 12:03:47,353 INFO L133 SettingsManager]: * Rewrite not-equals=true 67.24/35.75 [2019-03-28 12:03:47,354 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 67.24/35.75 [2019-03-28 12:03:47,354 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 67.24/35.75 [2019-03-28 12:03:47,354 INFO L133 SettingsManager]: * Use SBE=true 67.24/35.75 [2019-03-28 12:03:47,354 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 67.24/35.75 [2019-03-28 12:03:47,354 INFO L133 SettingsManager]: * Use old map elimination=false 67.24/35.75 [2019-03-28 12:03:47,355 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 67.24/35.75 [2019-03-28 12:03:47,355 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 67.24/35.75 [2019-03-28 12:03:47,355 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 67.24/35.75 [2019-03-28 12:03:47,355 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 67.24/35.75 [2019-03-28 12:03:47,355 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 67.24/35.75 [2019-03-28 12:03:47,356 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 67.24/35.75 [2019-03-28 12:03:47,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 67.24/35.75 [2019-03-28 12:03:47,356 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 67.24/35.75 [2019-03-28 12:03:47,356 INFO L133 SettingsManager]: * Check division by zero=IGNORE 67.24/35.75 [2019-03-28 12:03:47,356 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 67.24/35.75 [2019-03-28 12:03:47,357 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 67.24/35.75 [2019-03-28 12:03:47,357 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 67.24/35.75 [2019-03-28 12:03:47,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 67.24/35.75 [2019-03-28 12:03:47,357 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 67.24/35.75 [2019-03-28 12:03:47,357 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 67.24/35.75 [2019-03-28 12:03:47,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 67.24/35.75 [2019-03-28 12:03:47,358 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 67.24/35.75 [2019-03-28 12:03:47,358 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 67.24/35.75 [2019-03-28 12:03:47,358 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 67.24/35.75 [2019-03-28 12:03:47,358 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 67.24/35.75 [2019-03-28 12:03:47,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 67.24/35.75 [2019-03-28 12:03:47,396 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 67.24/35.75 [2019-03-28 12:03:47,399 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 67.24/35.75 [2019-03-28 12:03:47,401 INFO L271 PluginConnector]: Initializing CDTParser... 67.24/35.75 [2019-03-28 12:03:47,401 INFO L276 PluginConnector]: CDTParser initialized 67.24/35.75 [2019-03-28 12:03:47,402 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 67.24/35.75 [2019-03-28 12:03:47,467 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/fdec74c819e24e88b43559904c499607/FLAG210dee9b9 67.24/35.75 [2019-03-28 12:03:47,839 INFO L307 CDTParser]: Found 1 translation units. 67.24/35.75 [2019-03-28 12:03:47,840 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 67.24/35.75 [2019-03-28 12:03:47,840 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 67.24/35.75 [2019-03-28 12:03:47,847 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/fdec74c819e24e88b43559904c499607/FLAG210dee9b9 67.24/35.75 [2019-03-28 12:03:48,268 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/fdec74c819e24e88b43559904c499607 67.24/35.75 [2019-03-28 12:03:48,280 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 67.24/35.75 [2019-03-28 12:03:48,281 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 67.24/35.75 [2019-03-28 12:03:48,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 67.24/35.75 [2019-03-28 12:03:48,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 67.24/35.75 [2019-03-28 12:03:48,286 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 67.24/35.75 [2019-03-28 12:03:48,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:03:48" (1/1) ... 67.24/35.75 [2019-03-28 12:03:48,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@444a7286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:48, skipping insertion in model container 67.24/35.75 [2019-03-28 12:03:48,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:03:48" (1/1) ... 67.24/35.75 [2019-03-28 12:03:48,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 67.24/35.75 [2019-03-28 12:03:48,316 INFO L176 MainTranslator]: Built tables and reachable declarations 67.24/35.75 [2019-03-28 12:03:48,491 INFO L206 PostProcessor]: Analyzing one entry point: main 67.24/35.75 [2019-03-28 12:03:48,503 INFO L191 MainTranslator]: Completed pre-run 67.24/35.75 [2019-03-28 12:03:48,522 INFO L206 PostProcessor]: Analyzing one entry point: main 67.24/35.75 [2019-03-28 12:03:48,643 INFO L195 MainTranslator]: Completed translation 67.24/35.75 [2019-03-28 12:03:48,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:48 WrapperNode 67.24/35.75 [2019-03-28 12:03:48,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 67.24/35.75 [2019-03-28 12:03:48,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 67.24/35.75 [2019-03-28 12:03:48,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 67.24/35.75 [2019-03-28 12:03:48,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 67.24/35.75 [2019-03-28 12:03:48,656 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:03:48" (1/1) ... 67.24/35.75 [2019-03-28 12:03:48,666 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:03:48" (1/1) ... 67.24/35.75 [2019-03-28 12:03:48,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 67.24/35.75 [2019-03-28 12:03:48,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 67.24/35.75 [2019-03-28 12:03:48,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 67.24/35.75 [2019-03-28 12:03:48,691 INFO L276 PluginConnector]: Boogie Preprocessor initialized 67.24/35.75 [2019-03-28 12:03:48,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:48" (1/1) ... 67.24/35.75 [2019-03-28 12:03:48,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:48" (1/1) ... 67.24/35.75 [2019-03-28 12:03:48,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:48" (1/1) ... 67.24/35.75 [2019-03-28 12:03:48,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:48" (1/1) ... 67.24/35.75 [2019-03-28 12:03:48,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:48" (1/1) ... 67.24/35.75 [2019-03-28 12:03:48,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:48" (1/1) ... 67.24/35.75 [2019-03-28 12:03:48,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:48" (1/1) ... 67.24/35.75 [2019-03-28 12:03:48,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 67.24/35.75 [2019-03-28 12:03:48,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 67.24/35.75 [2019-03-28 12:03:48,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... 67.24/35.75 [2019-03-28 12:03:48,718 INFO L276 PluginConnector]: RCFGBuilder initialized 67.24/35.75 [2019-03-28 12:03:48,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:48" (1/1) ... 67.24/35.75 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 67.24/35.75 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 67.24/35.75 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 67.24/35.75 [2019-03-28 12:03:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 67.24/35.75 [2019-03-28 12:03:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap 67.24/35.75 [2019-03-28 12:03:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 67.24/35.75 [2019-03-28 12:03:48,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 67.24/35.75 [2019-03-28 12:03:48,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 67.24/35.75 [2019-03-28 12:03:49,159 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 67.24/35.75 [2019-03-28 12:03:49,159 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. 67.24/35.75 [2019-03-28 12:03:49,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:03:49 BoogieIcfgContainer 67.24/35.75 [2019-03-28 12:03:49,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 67.24/35.75 [2019-03-28 12:03:49,162 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 67.24/35.75 [2019-03-28 12:03:49,162 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 67.24/35.75 [2019-03-28 12:03:49,164 INFO L276 PluginConnector]: BlockEncodingV2 initialized 67.24/35.75 [2019-03-28 12:03:49,165 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:03:49" (1/1) ... 67.24/35.75 [2019-03-28 12:03:49,188 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 48 edges 67.24/35.75 [2019-03-28 12:03:49,189 INFO L258 BlockEncoder]: Using Remove infeasible edges 67.24/35.75 [2019-03-28 12:03:49,190 INFO L263 BlockEncoder]: Using Maximize final states 67.24/35.75 [2019-03-28 12:03:49,191 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 67.24/35.75 [2019-03-28 12:03:49,191 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 67.24/35.75 [2019-03-28 12:03:49,193 INFO L296 BlockEncoder]: Using Remove sink states 67.24/35.75 [2019-03-28 12:03:49,194 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 67.24/35.75 [2019-03-28 12:03:49,194 INFO L179 BlockEncoder]: Using Rewrite not-equals 67.24/35.75 [2019-03-28 12:03:49,218 INFO L185 BlockEncoder]: Using Use SBE 67.24/35.75 [2019-03-28 12:03:49,249 INFO L200 BlockEncoder]: SBE split 19 edges 67.24/35.75 [2019-03-28 12:03:49,255 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 67.24/35.75 [2019-03-28 12:03:49,257 INFO L71 MaximizeFinalStates]: 0 new accepting states 67.24/35.75 [2019-03-28 12:03:49,307 INFO L100 BaseMinimizeStates]: Removed 20 edges and 10 locations by large block encoding 67.24/35.75 [2019-03-28 12:03:49,310 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states 67.24/35.75 [2019-03-28 12:03:49,312 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 67.24/35.75 [2019-03-28 12:03:49,312 INFO L71 MaximizeFinalStates]: 0 new accepting states 67.24/35.75 [2019-03-28 12:03:49,312 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 67.24/35.75 [2019-03-28 12:03:49,313 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 67.24/35.75 [2019-03-28 12:03:49,313 INFO L313 BlockEncoder]: Encoded RCFG 30 locations, 53 edges 67.24/35.75 [2019-03-28 12:03:49,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:03:49 BasicIcfg 67.24/35.75 [2019-03-28 12:03:49,314 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 67.24/35.75 [2019-03-28 12:03:49,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 67.24/35.75 [2019-03-28 12:03:49,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... 67.24/35.75 [2019-03-28 12:03:49,318 INFO L276 PluginConnector]: TraceAbstraction initialized 67.24/35.75 [2019-03-28 12:03:49,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:03:48" (1/4) ... 67.24/35.75 [2019-03-28 12:03:49,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b78776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:03:49, skipping insertion in model container 67.24/35.75 [2019-03-28 12:03:49,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:48" (2/4) ... 67.24/35.75 [2019-03-28 12:03:49,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b78776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:03:49, skipping insertion in model container 67.24/35.75 [2019-03-28 12:03:49,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:03:49" (3/4) ... 67.24/35.75 [2019-03-28 12:03:49,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b78776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:03:49, skipping insertion in model container 67.24/35.75 [2019-03-28 12:03:49,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:03:49" (4/4) ... 67.24/35.75 [2019-03-28 12:03:49,322 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 67.24/35.75 [2019-03-28 12:03:49,332 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 67.24/35.75 [2019-03-28 12:03:49,340 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. 67.24/35.75 [2019-03-28 12:03:49,357 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. 67.24/35.75 [2019-03-28 12:03:49,386 INFO L133 ementStrategyFactory]: Using default assertion order modulation 67.24/35.75 [2019-03-28 12:03:49,387 INFO L382 AbstractCegarLoop]: Interprodecural is true 67.24/35.75 [2019-03-28 12:03:49,387 INFO L383 AbstractCegarLoop]: Hoare is true 67.24/35.75 [2019-03-28 12:03:49,387 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 67.24/35.75 [2019-03-28 12:03:49,387 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 67.24/35.75 [2019-03-28 12:03:49,388 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 67.24/35.75 [2019-03-28 12:03:49,388 INFO L387 AbstractCegarLoop]: Difference is false 67.24/35.75 [2019-03-28 12:03:49,388 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 67.24/35.75 [2019-03-28 12:03:49,388 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 67.24/35.75 [2019-03-28 12:03:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. 67.24/35.75 [2019-03-28 12:03:49,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 67.24/35.75 [2019-03-28 12:03:49,409 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:49,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:49,410 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:49,415 INFO L82 PathProgramCache]: Analyzing trace with hash 6584673, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:49,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:49,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:49,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:49,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:49,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:49,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:49,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 67.24/35.75 [2019-03-28 12:03:49,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 67.24/35.75 [2019-03-28 12:03:49,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.24/35.75 [2019-03-28 12:03:49,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.24/35.75 [2019-03-28 12:03:49,603 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. 67.24/35.75 [2019-03-28 12:03:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:49,830 INFO L93 Difference]: Finished difference Result 30 states and 53 transitions. 67.24/35.75 [2019-03-28 12:03:49,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.24/35.75 [2019-03-28 12:03:49,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 67.24/35.75 [2019-03-28 12:03:49,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:49,848 INFO L225 Difference]: With dead ends: 30 67.24/35.75 [2019-03-28 12:03:49,848 INFO L226 Difference]: Without dead ends: 28 67.24/35.75 [2019-03-28 12:03:49,852 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 67.24/35.75 [2019-03-28 12:03:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 67.24/35.75 [2019-03-28 12:03:49,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 67.24/35.75 [2019-03-28 12:03:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 67.24/35.75 [2019-03-28 12:03:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 49 transitions. 67.24/35.75 [2019-03-28 12:03:49,894 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 49 transitions. Word has length 4 67.24/35.75 [2019-03-28 12:03:49,894 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.75 [2019-03-28 12:03:49,894 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 49 transitions. 67.24/35.75 [2019-03-28 12:03:49,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 67.24/35.75 [2019-03-28 12:03:49,895 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 49 transitions. 67.24/35.75 [2019-03-28 12:03:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 67.24/35.75 [2019-03-28 12:03:49,895 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:49,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:49,895 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:49,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:49,896 INFO L82 PathProgramCache]: Analyzing trace with hash 6584675, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:49,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:49,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:49,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:49,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:49,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:49,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:49,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 67.24/35.75 [2019-03-28 12:03:49,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 67.24/35.75 [2019-03-28 12:03:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.24/35.75 [2019-03-28 12:03:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.24/35.75 [2019-03-28 12:03:49,948 INFO L87 Difference]: Start difference. First operand 28 states and 49 transitions. Second operand 3 states. 67.24/35.75 [2019-03-28 12:03:50,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:50,030 INFO L93 Difference]: Finished difference Result 30 states and 49 transitions. 67.24/35.75 [2019-03-28 12:03:50,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.24/35.75 [2019-03-28 12:03:50,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 67.24/35.75 [2019-03-28 12:03:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:50,032 INFO L225 Difference]: With dead ends: 30 67.24/35.75 [2019-03-28 12:03:50,032 INFO L226 Difference]: Without dead ends: 28 67.24/35.75 [2019-03-28 12:03:50,033 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 67.24/35.75 [2019-03-28 12:03:50,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 67.24/35.75 [2019-03-28 12:03:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 67.24/35.75 [2019-03-28 12:03:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 67.24/35.75 [2019-03-28 12:03:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 47 transitions. 67.24/35.75 [2019-03-28 12:03:50,038 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 47 transitions. Word has length 4 67.24/35.75 [2019-03-28 12:03:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.75 [2019-03-28 12:03:50,039 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 47 transitions. 67.24/35.75 [2019-03-28 12:03:50,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 67.24/35.75 [2019-03-28 12:03:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 47 transitions. 67.24/35.75 [2019-03-28 12:03:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 67.24/35.75 [2019-03-28 12:03:50,039 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:50,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:50,040 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:50,040 INFO L82 PathProgramCache]: Analyzing trace with hash 6584676, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:50,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:50,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:50,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:50,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:50,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 67.24/35.75 [2019-03-28 12:03:50,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 67.24/35.75 [2019-03-28 12:03:50,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 67.24/35.75 [2019-03-28 12:03:50,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 67.24/35.75 [2019-03-28 12:03:50,072 INFO L87 Difference]: Start difference. First operand 28 states and 47 transitions. Second operand 4 states. 67.24/35.75 [2019-03-28 12:03:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:50,155 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. 67.24/35.75 [2019-03-28 12:03:50,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 67.24/35.75 [2019-03-28 12:03:50,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 67.24/35.75 [2019-03-28 12:03:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:50,157 INFO L225 Difference]: With dead ends: 28 67.24/35.75 [2019-03-28 12:03:50,157 INFO L226 Difference]: Without dead ends: 26 67.24/35.75 [2019-03-28 12:03:50,157 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 67.24/35.75 [2019-03-28 12:03:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 67.24/35.75 [2019-03-28 12:03:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 67.24/35.75 [2019-03-28 12:03:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 67.24/35.75 [2019-03-28 12:03:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. 67.24/35.75 [2019-03-28 12:03:50,162 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 4 67.24/35.75 [2019-03-28 12:03:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.75 [2019-03-28 12:03:50,162 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. 67.24/35.75 [2019-03-28 12:03:50,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 67.24/35.75 [2019-03-28 12:03:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. 67.24/35.75 [2019-03-28 12:03:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 67.24/35.75 [2019-03-28 12:03:50,163 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:50,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:50,164 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:50,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:50,164 INFO L82 PathProgramCache]: Analyzing trace with hash -549407375, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:50,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:50,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:50,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:50,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:50,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:50,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:50,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 67.24/35.75 [2019-03-28 12:03:50,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 67.24/35.75 [2019-03-28 12:03:50,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 67.24/35.75 [2019-03-28 12:03:50,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 67.24/35.75 [2019-03-28 12:03:50,249 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 6 states. 67.24/35.75 [2019-03-28 12:03:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:50,575 INFO L93 Difference]: Finished difference Result 80 states and 155 transitions. 67.24/35.75 [2019-03-28 12:03:50,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 67.24/35.75 [2019-03-28 12:03:50,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 67.24/35.75 [2019-03-28 12:03:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:50,577 INFO L225 Difference]: With dead ends: 80 67.24/35.75 [2019-03-28 12:03:50,577 INFO L226 Difference]: Without dead ends: 77 67.24/35.75 [2019-03-28 12:03:50,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 67.24/35.75 [2019-03-28 12:03:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. 67.24/35.75 [2019-03-28 12:03:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 23. 67.24/35.75 [2019-03-28 12:03:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 67.24/35.75 [2019-03-28 12:03:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 39 transitions. 67.24/35.75 [2019-03-28 12:03:50,584 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 39 transitions. Word has length 8 67.24/35.75 [2019-03-28 12:03:50,584 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.75 [2019-03-28 12:03:50,584 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 39 transitions. 67.24/35.75 [2019-03-28 12:03:50,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 67.24/35.75 [2019-03-28 12:03:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 39 transitions. 67.24/35.75 [2019-03-28 12:03:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 67.24/35.75 [2019-03-28 12:03:50,585 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:50,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:50,586 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:50,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:50,586 INFO L82 PathProgramCache]: Analyzing trace with hash -549407374, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:50,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:50,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:50,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:50,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:50,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:50,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:50,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 67.24/35.75 [2019-03-28 12:03:50,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 67.24/35.75 [2019-03-28 12:03:50,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 67.24/35.75 [2019-03-28 12:03:50,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 67.24/35.75 [2019-03-28 12:03:50,641 INFO L87 Difference]: Start difference. First operand 23 states and 39 transitions. Second operand 5 states. 67.24/35.75 [2019-03-28 12:03:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:50,760 INFO L93 Difference]: Finished difference Result 42 states and 67 transitions. 67.24/35.75 [2019-03-28 12:03:50,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 67.24/35.75 [2019-03-28 12:03:50,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 67.24/35.75 [2019-03-28 12:03:50,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:50,762 INFO L225 Difference]: With dead ends: 42 67.24/35.75 [2019-03-28 12:03:50,762 INFO L226 Difference]: Without dead ends: 39 67.24/35.75 [2019-03-28 12:03:50,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 67.24/35.75 [2019-03-28 12:03:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 67.24/35.75 [2019-03-28 12:03:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. 67.24/35.75 [2019-03-28 12:03:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 67.24/35.75 [2019-03-28 12:03:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. 67.24/35.75 [2019-03-28 12:03:50,769 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 60 transitions. Word has length 8 67.24/35.75 [2019-03-28 12:03:50,769 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.75 [2019-03-28 12:03:50,769 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 60 transitions. 67.24/35.75 [2019-03-28 12:03:50,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 67.24/35.75 [2019-03-28 12:03:50,769 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 60 transitions. 67.24/35.75 [2019-03-28 12:03:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 67.24/35.75 [2019-03-28 12:03:50,770 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:50,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:50,770 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:50,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:50,771 INFO L82 PathProgramCache]: Analyzing trace with hash -549407373, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:50,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:50,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:50,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:50,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:50,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:50,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:50,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 67.24/35.75 [2019-03-28 12:03:50,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 67.24/35.75 [2019-03-28 12:03:50,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 67.24/35.75 [2019-03-28 12:03:50,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 67.24/35.75 [2019-03-28 12:03:50,865 INFO L87 Difference]: Start difference. First operand 31 states and 60 transitions. Second operand 7 states. 67.24/35.75 [2019-03-28 12:03:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:51,302 INFO L93 Difference]: Finished difference Result 122 states and 223 transitions. 67.24/35.75 [2019-03-28 12:03:51,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 67.24/35.75 [2019-03-28 12:03:51,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 67.24/35.75 [2019-03-28 12:03:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:51,305 INFO L225 Difference]: With dead ends: 122 67.24/35.75 [2019-03-28 12:03:51,305 INFO L226 Difference]: Without dead ends: 119 67.24/35.75 [2019-03-28 12:03:51,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 67.24/35.75 [2019-03-28 12:03:51,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. 67.24/35.75 [2019-03-28 12:03:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 43. 67.24/35.75 [2019-03-28 12:03:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. 67.24/35.75 [2019-03-28 12:03:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 84 transitions. 67.24/35.75 [2019-03-28 12:03:51,314 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 84 transitions. Word has length 8 67.24/35.75 [2019-03-28 12:03:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.75 [2019-03-28 12:03:51,314 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 84 transitions. 67.24/35.75 [2019-03-28 12:03:51,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 67.24/35.75 [2019-03-28 12:03:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 84 transitions. 67.24/35.75 [2019-03-28 12:03:51,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 67.24/35.75 [2019-03-28 12:03:51,325 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:51,325 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:51,326 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:51,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:51,326 INFO L82 PathProgramCache]: Analyzing trace with hash -520778222, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:51,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:51,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:51,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:51,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:51,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 67.24/35.75 [2019-03-28 12:03:51,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 67.24/35.75 [2019-03-28 12:03:51,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 67.24/35.75 [2019-03-28 12:03:51,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 67.24/35.75 [2019-03-28 12:03:51,404 INFO L87 Difference]: Start difference. First operand 43 states and 84 transitions. Second operand 7 states. 67.24/35.75 [2019-03-28 12:03:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:51,546 INFO L93 Difference]: Finished difference Result 51 states and 88 transitions. 67.24/35.75 [2019-03-28 12:03:51,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 67.24/35.75 [2019-03-28 12:03:51,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 67.24/35.75 [2019-03-28 12:03:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:51,548 INFO L225 Difference]: With dead ends: 51 67.24/35.75 [2019-03-28 12:03:51,548 INFO L226 Difference]: Without dead ends: 48 67.24/35.75 [2019-03-28 12:03:51,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 67.24/35.75 [2019-03-28 12:03:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. 67.24/35.75 [2019-03-28 12:03:51,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. 67.24/35.75 [2019-03-28 12:03:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 67.24/35.75 [2019-03-28 12:03:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 57 transitions. 67.24/35.75 [2019-03-28 12:03:51,553 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 57 transitions. Word has length 8 67.24/35.75 [2019-03-28 12:03:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.75 [2019-03-28 12:03:51,553 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 57 transitions. 67.24/35.75 [2019-03-28 12:03:51,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 67.24/35.75 [2019-03-28 12:03:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 57 transitions. 67.24/35.75 [2019-03-28 12:03:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 67.24/35.75 [2019-03-28 12:03:51,554 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:51,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:51,554 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:51,555 INFO L82 PathProgramCache]: Analyzing trace with hash 974409270, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:51,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:51,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:51,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:51,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:51,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 67.24/35.75 [2019-03-28 12:03:51,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 67.24/35.75 [2019-03-28 12:03:51,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.24/35.75 [2019-03-28 12:03:51,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.24/35.75 [2019-03-28 12:03:51,596 INFO L87 Difference]: Start difference. First operand 31 states and 57 transitions. Second operand 3 states. 67.24/35.75 [2019-03-28 12:03:51,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:51,639 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. 67.24/35.75 [2019-03-28 12:03:51,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.24/35.75 [2019-03-28 12:03:51,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 67.24/35.75 [2019-03-28 12:03:51,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:51,641 INFO L225 Difference]: With dead ends: 31 67.24/35.75 [2019-03-28 12:03:51,641 INFO L226 Difference]: Without dead ends: 29 67.24/35.75 [2019-03-28 12:03:51,641 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 67.24/35.75 [2019-03-28 12:03:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 67.24/35.75 [2019-03-28 12:03:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 67.24/35.75 [2019-03-28 12:03:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 67.24/35.75 [2019-03-28 12:03:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 51 transitions. 67.24/35.75 [2019-03-28 12:03:51,646 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 51 transitions. Word has length 12 67.24/35.75 [2019-03-28 12:03:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.75 [2019-03-28 12:03:51,646 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 51 transitions. 67.24/35.75 [2019-03-28 12:03:51,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 67.24/35.75 [2019-03-28 12:03:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 51 transitions. 67.24/35.75 [2019-03-28 12:03:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 67.24/35.75 [2019-03-28 12:03:51,647 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:51,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:51,647 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:51,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash 974409272, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:51,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:51,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:51,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:51,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:51,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 67.24/35.75 [2019-03-28 12:03:51,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 67.24/35.75 [2019-03-28 12:03:51,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 67.24/35.75 [2019-03-28 12:03:51,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 67.24/35.75 [2019-03-28 12:03:51,685 INFO L87 Difference]: Start difference. First operand 29 states and 51 transitions. Second operand 4 states. 67.24/35.75 [2019-03-28 12:03:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:51,752 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. 67.24/35.75 [2019-03-28 12:03:51,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 67.24/35.75 [2019-03-28 12:03:51,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 67.24/35.75 [2019-03-28 12:03:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:51,753 INFO L225 Difference]: With dead ends: 34 67.24/35.75 [2019-03-28 12:03:51,753 INFO L226 Difference]: Without dead ends: 32 67.24/35.75 [2019-03-28 12:03:51,754 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 67.24/35.75 [2019-03-28 12:03:51,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 67.24/35.75 [2019-03-28 12:03:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. 67.24/35.75 [2019-03-28 12:03:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 67.24/35.75 [2019-03-28 12:03:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 51 transitions. 67.24/35.75 [2019-03-28 12:03:51,759 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 51 transitions. Word has length 12 67.24/35.75 [2019-03-28 12:03:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.75 [2019-03-28 12:03:51,759 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 51 transitions. 67.24/35.75 [2019-03-28 12:03:51,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 67.24/35.75 [2019-03-28 12:03:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 51 transitions. 67.24/35.75 [2019-03-28 12:03:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 67.24/35.75 [2019-03-28 12:03:51,760 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:51,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:51,760 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:51,760 INFO L82 PathProgramCache]: Analyzing trace with hash 974409273, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:51,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:51,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:51,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:51,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:51,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 67.24/35.75 [2019-03-28 12:03:51,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 67.24/35.75 [2019-03-28 12:03:51,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 67.24/35.75 [2019-03-28 12:03:51,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 67.24/35.75 [2019-03-28 12:03:51,803 INFO L87 Difference]: Start difference. First operand 30 states and 51 transitions. Second operand 4 states. 67.24/35.75 [2019-03-28 12:03:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:51,871 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. 67.24/35.75 [2019-03-28 12:03:51,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 67.24/35.75 [2019-03-28 12:03:51,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 67.24/35.75 [2019-03-28 12:03:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:51,872 INFO L225 Difference]: With dead ends: 32 67.24/35.75 [2019-03-28 12:03:51,872 INFO L226 Difference]: Without dead ends: 28 67.24/35.75 [2019-03-28 12:03:51,873 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 67.24/35.75 [2019-03-28 12:03:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 67.24/35.75 [2019-03-28 12:03:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 67.24/35.75 [2019-03-28 12:03:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 67.24/35.75 [2019-03-28 12:03:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 47 transitions. 67.24/35.75 [2019-03-28 12:03:51,877 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 47 transitions. Word has length 12 67.24/35.75 [2019-03-28 12:03:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.75 [2019-03-28 12:03:51,877 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 47 transitions. 67.24/35.75 [2019-03-28 12:03:51,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 67.24/35.75 [2019-03-28 12:03:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 47 transitions. 67.24/35.75 [2019-03-28 12:03:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 67.24/35.75 [2019-03-28 12:03:51,878 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:51,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:51,878 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:51,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash 974410741, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:51,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:51,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:51,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:51,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:51,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 67.24/35.75 [2019-03-28 12:03:51,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 67.24/35.75 [2019-03-28 12:03:51,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.24/35.75 [2019-03-28 12:03:51,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.24/35.75 [2019-03-28 12:03:51,910 INFO L87 Difference]: Start difference. First operand 28 states and 47 transitions. Second operand 3 states. 67.24/35.75 [2019-03-28 12:03:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:51,955 INFO L93 Difference]: Finished difference Result 47 states and 79 transitions. 67.24/35.75 [2019-03-28 12:03:51,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.24/35.75 [2019-03-28 12:03:51,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 67.24/35.75 [2019-03-28 12:03:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:51,956 INFO L225 Difference]: With dead ends: 47 67.24/35.75 [2019-03-28 12:03:51,957 INFO L226 Difference]: Without dead ends: 32 67.24/35.75 [2019-03-28 12:03:51,957 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 67.24/35.75 [2019-03-28 12:03:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 67.24/35.75 [2019-03-28 12:03:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. 67.24/35.75 [2019-03-28 12:03:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 67.24/35.75 [2019-03-28 12:03:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. 67.24/35.75 [2019-03-28 12:03:51,961 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 12 67.24/35.75 [2019-03-28 12:03:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.75 [2019-03-28 12:03:51,961 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. 67.24/35.75 [2019-03-28 12:03:51,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 67.24/35.75 [2019-03-28 12:03:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. 67.24/35.75 [2019-03-28 12:03:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 67.24/35.75 [2019-03-28 12:03:51,962 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:51,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:51,962 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:51,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:51,963 INFO L82 PathProgramCache]: Analyzing trace with hash 974440532, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:51,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:51,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:51,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:51,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:51,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 67.24/35.75 [2019-03-28 12:03:51,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 67.24/35.75 [2019-03-28 12:03:51,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.24/35.75 [2019-03-28 12:03:51,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.24/35.75 [2019-03-28 12:03:51,985 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. 67.24/35.75 [2019-03-28 12:03:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:52,026 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. 67.24/35.75 [2019-03-28 12:03:52,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.24/35.75 [2019-03-28 12:03:52,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 67.24/35.75 [2019-03-28 12:03:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:52,027 INFO L225 Difference]: With dead ends: 50 67.24/35.75 [2019-03-28 12:03:52,028 INFO L226 Difference]: Without dead ends: 29 67.24/35.75 [2019-03-28 12:03:52,028 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 67.24/35.75 [2019-03-28 12:03:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 67.24/35.75 [2019-03-28 12:03:52,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 67.24/35.75 [2019-03-28 12:03:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 67.24/35.75 [2019-03-28 12:03:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. 67.24/35.75 [2019-03-28 12:03:52,032 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 12 67.24/35.75 [2019-03-28 12:03:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.75 [2019-03-28 12:03:52,032 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. 67.24/35.75 [2019-03-28 12:03:52,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 67.24/35.75 [2019-03-28 12:03:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. 67.24/35.75 [2019-03-28 12:03:52,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 67.24/35.75 [2019-03-28 12:03:52,033 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:52,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:52,033 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:52,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:52,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1059563785, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:52,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:52,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:52,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:52,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:52,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:52,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 67.24/35.75 [2019-03-28 12:03:52,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 67.24/35.75 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 67.24/35.75 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 67.24/35.75 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 67.24/35.75 [2019-03-28 12:03:52,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:52,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core 67.24/35.75 [2019-03-28 12:03:52,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.75 [2019-03-28 12:03:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:52,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:52,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 67.24/35.75 [2019-03-28 12:03:52,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 67.24/35.75 [2019-03-28 12:03:52,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 67.24/35.75 [2019-03-28 12:03:52,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 67.24/35.75 [2019-03-28 12:03:52,189 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 7 states. 67.24/35.75 [2019-03-28 12:03:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:52,315 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. 67.24/35.75 [2019-03-28 12:03:52,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 67.24/35.75 [2019-03-28 12:03:52,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 67.24/35.75 [2019-03-28 12:03:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:52,316 INFO L225 Difference]: With dead ends: 33 67.24/35.75 [2019-03-28 12:03:52,316 INFO L226 Difference]: Without dead ends: 30 67.24/35.75 [2019-03-28 12:03:52,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 67.24/35.75 [2019-03-28 12:03:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 67.24/35.75 [2019-03-28 12:03:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. 67.24/35.75 [2019-03-28 12:03:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 67.24/35.75 [2019-03-28 12:03:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. 67.24/35.75 [2019-03-28 12:03:52,321 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 15 67.24/35.75 [2019-03-28 12:03:52,321 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.75 [2019-03-28 12:03:52,321 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. 67.24/35.75 [2019-03-28 12:03:52,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 67.24/35.75 [2019-03-28 12:03:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. 67.24/35.75 [2019-03-28 12:03:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 67.24/35.75 [2019-03-28 12:03:52,322 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.75 [2019-03-28 12:03:52,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.75 [2019-03-28 12:03:52,322 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.75 [2019-03-28 12:03:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.75 [2019-03-28 12:03:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1059563784, now seen corresponding path program 1 times 67.24/35.75 [2019-03-28 12:03:52,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.75 [2019-03-28 12:03:52,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.75 [2019-03-28 12:03:52,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:52,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:52,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.75 [2019-03-28 12:03:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.75 [2019-03-28 12:03:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.75 [2019-03-28 12:03:52,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.75 [2019-03-28 12:03:52,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 67.24/35.75 [2019-03-28 12:03:52,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 67.24/35.75 [2019-03-28 12:03:52,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 67.24/35.75 [2019-03-28 12:03:52,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 67.24/35.75 [2019-03-28 12:03:52,432 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 8 states. 67.24/35.75 [2019-03-28 12:03:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.75 [2019-03-28 12:03:52,784 INFO L93 Difference]: Finished difference Result 116 states and 153 transitions. 67.24/35.75 [2019-03-28 12:03:52,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 67.24/35.75 [2019-03-28 12:03:52,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 67.24/35.75 [2019-03-28 12:03:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.75 [2019-03-28 12:03:52,785 INFO L225 Difference]: With dead ends: 116 67.24/35.75 [2019-03-28 12:03:52,785 INFO L226 Difference]: Without dead ends: 83 67.24/35.75 [2019-03-28 12:03:52,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 67.24/35.76 [2019-03-28 12:03:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. 67.24/35.76 [2019-03-28 12:03:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 30. 67.24/35.76 [2019-03-28 12:03:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 67.24/35.76 [2019-03-28 12:03:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. 67.24/35.76 [2019-03-28 12:03:52,790 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 15 67.24/35.76 [2019-03-28 12:03:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.76 [2019-03-28 12:03:52,790 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. 67.24/35.76 [2019-03-28 12:03:52,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 67.24/35.76 [2019-03-28 12:03:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. 67.24/35.76 [2019-03-28 12:03:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 67.24/35.76 [2019-03-28 12:03:52,791 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.76 [2019-03-28 12:03:52,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:03:52,791 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.76 [2019-03-28 12:03:52,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:03:52,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1352966791, now seen corresponding path program 1 times 67.24/35.76 [2019-03-28 12:03:52,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:03:52,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:03:52,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:52,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:52,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:03:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:03:52,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.76 [2019-03-28 12:03:52,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 67.24/35.76 [2019-03-28 12:03:52,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 67.24/35.76 [2019-03-28 12:03:52,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 67.24/35.76 [2019-03-28 12:03:52,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 67.24/35.76 [2019-03-28 12:03:52,887 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 8 states. 67.24/35.76 [2019-03-28 12:03:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.76 [2019-03-28 12:03:53,105 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. 67.24/35.76 [2019-03-28 12:03:53,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 67.24/35.76 [2019-03-28 12:03:53,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 67.24/35.76 [2019-03-28 12:03:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.76 [2019-03-28 12:03:53,106 INFO L225 Difference]: With dead ends: 86 67.24/35.76 [2019-03-28 12:03:53,106 INFO L226 Difference]: Without dead ends: 55 67.24/35.76 [2019-03-28 12:03:53,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 67.24/35.76 [2019-03-28 12:03:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. 67.24/35.76 [2019-03-28 12:03:53,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 29. 67.24/35.76 [2019-03-28 12:03:53,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 67.24/35.76 [2019-03-28 12:03:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. 67.24/35.76 [2019-03-28 12:03:53,111 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 15 67.24/35.76 [2019-03-28 12:03:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.76 [2019-03-28 12:03:53,111 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. 67.24/35.76 [2019-03-28 12:03:53,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 67.24/35.76 [2019-03-28 12:03:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. 67.24/35.76 [2019-03-28 12:03:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 67.24/35.76 [2019-03-28 12:03:53,112 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.76 [2019-03-28 12:03:53,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:03:53,112 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.76 [2019-03-28 12:03:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:03:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1709603571, now seen corresponding path program 1 times 67.24/35.76 [2019-03-28 12:03:53,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:03:53,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:03:53,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:53,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:53,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:03:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:03:53,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.76 [2019-03-28 12:03:53,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 67.24/35.76 [2019-03-28 12:03:53,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 67.24/35.76 [2019-03-28 12:03:53,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 67.24/35.76 [2019-03-28 12:03:53,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 67.24/35.76 [2019-03-28 12:03:53,217 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 9 states. 67.24/35.76 [2019-03-28 12:03:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.76 [2019-03-28 12:03:53,466 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. 67.24/35.76 [2019-03-28 12:03:53,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 67.24/35.76 [2019-03-28 12:03:53,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 67.24/35.76 [2019-03-28 12:03:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.76 [2019-03-28 12:03:53,468 INFO L225 Difference]: With dead ends: 54 67.24/35.76 [2019-03-28 12:03:53,468 INFO L226 Difference]: Without dead ends: 30 67.24/35.76 [2019-03-28 12:03:53,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 67.24/35.76 [2019-03-28 12:03:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 67.24/35.76 [2019-03-28 12:03:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. 67.24/35.76 [2019-03-28 12:03:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 67.24/35.76 [2019-03-28 12:03:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. 67.24/35.76 [2019-03-28 12:03:53,472 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 67.24/35.76 [2019-03-28 12:03:53,472 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.76 [2019-03-28 12:03:53,472 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. 67.24/35.76 [2019-03-28 12:03:53,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 67.24/35.76 [2019-03-28 12:03:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. 67.24/35.76 [2019-03-28 12:03:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 67.24/35.76 [2019-03-28 12:03:53,473 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.76 [2019-03-28 12:03:53,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:03:53,474 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.76 [2019-03-28 12:03:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:03:53,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1271814397, now seen corresponding path program 1 times 67.24/35.76 [2019-03-28 12:03:53,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:03:53,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:03:53,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:53,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:53,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:03:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:03:53,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 67.24/35.76 [2019-03-28 12:03:53,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 67.24/35.76 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 67.24/35.76 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 67.24/35.76 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 67.24/35.76 [2019-03-28 12:03:53,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:03:53,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 27 conjunts are in the unsatisfiable core 67.24/35.76 [2019-03-28 12:03:53,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.76 [2019-03-28 12:03:53,729 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 67.24/35.76 [2019-03-28 12:03:53,729 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:53,740 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:53,741 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:53,741 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 67.24/35.76 [2019-03-28 12:03:53,772 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 67.24/35.76 [2019-03-28 12:03:53,773 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:53,784 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:53,785 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. 67.24/35.76 [2019-03-28 12:03:53,785 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 67.24/35.76 [2019-03-28 12:03:53,837 INFO L189 IndexEqualityManager]: detected not equals via solver 67.24/35.76 [2019-03-28 12:03:53,840 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 67.24/35.76 [2019-03-28 12:03:53,841 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:53,859 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:53,861 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:53,861 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:38 67.24/35.76 [2019-03-28 12:03:53,907 INFO L189 IndexEqualityManager]: detected not equals via solver 67.24/35.76 [2019-03-28 12:03:53,908 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 67.24/35.76 [2019-03-28 12:03:53,909 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:53,928 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:53,930 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:53,930 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:45 67.24/35.76 [2019-03-28 12:03:53,981 INFO L189 IndexEqualityManager]: detected not equals via solver 67.24/35.76 [2019-03-28 12:03:53,991 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:53,992 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 67.24/35.76 [2019-03-28 12:03:53,996 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 67.24/35.76 [2019-03-28 12:03:54,016 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:54,021 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:54,021 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:37 67.24/35.76 [2019-03-28 12:03:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:03:54,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 67.24/35.76 [2019-03-28 12:03:54,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 67.24/35.76 [2019-03-28 12:03:54,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 67.24/35.76 [2019-03-28 12:03:54,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 67.24/35.76 [2019-03-28 12:03:54,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 67.24/35.76 [2019-03-28 12:03:54,164 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 17 states. 67.24/35.76 [2019-03-28 12:03:55,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.76 [2019-03-28 12:03:55,464 INFO L93 Difference]: Finished difference Result 112 states and 153 transitions. 67.24/35.76 [2019-03-28 12:03:55,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 67.24/35.76 [2019-03-28 12:03:55,465 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 67.24/35.76 [2019-03-28 12:03:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.76 [2019-03-28 12:03:55,466 INFO L225 Difference]: With dead ends: 112 67.24/35.76 [2019-03-28 12:03:55,466 INFO L226 Difference]: Without dead ends: 109 67.24/35.76 [2019-03-28 12:03:55,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 67.24/35.76 [2019-03-28 12:03:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. 67.24/35.76 [2019-03-28 12:03:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 39. 67.24/35.76 [2019-03-28 12:03:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 67.24/35.76 [2019-03-28 12:03:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. 67.24/35.76 [2019-03-28 12:03:55,474 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 15 67.24/35.76 [2019-03-28 12:03:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.76 [2019-03-28 12:03:55,475 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. 67.24/35.76 [2019-03-28 12:03:55,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 67.24/35.76 [2019-03-28 12:03:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. 67.24/35.76 [2019-03-28 12:03:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 67.24/35.76 [2019-03-28 12:03:55,476 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.76 [2019-03-28 12:03:55,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:03:55,476 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.76 [2019-03-28 12:03:55,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:03:55,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1565217404, now seen corresponding path program 1 times 67.24/35.76 [2019-03-28 12:03:55,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:03:55,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:03:55,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:55,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:55,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:03:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:03:55,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 67.24/35.76 [2019-03-28 12:03:55,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 67.24/35.76 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 67.24/35.76 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 67.24/35.76 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 67.24/35.76 [2019-03-28 12:03:55,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:03:55,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 30 conjunts are in the unsatisfiable core 67.24/35.76 [2019-03-28 12:03:55,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.76 [2019-03-28 12:03:55,758 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 67.24/35.76 [2019-03-28 12:03:55,759 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:55,766 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:55,769 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 67.24/35.76 [2019-03-28 12:03:55,770 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:55,776 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:55,777 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:55,777 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 67.24/35.76 [2019-03-28 12:03:55,802 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 67.24/35.76 [2019-03-28 12:03:55,803 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:55,815 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:55,816 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. 67.24/35.76 [2019-03-28 12:03:55,817 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 67.24/35.76 [2019-03-28 12:03:55,865 INFO L189 IndexEqualityManager]: detected not equals via solver 67.24/35.76 [2019-03-28 12:03:55,866 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 67.24/35.76 [2019-03-28 12:03:55,867 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:55,884 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:55,895 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:55,895 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 67.24/35.76 [2019-03-28 12:03:55,896 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:55,910 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:55,911 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:55,911 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 67.24/35.76 [2019-03-28 12:03:55,951 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 67.24/35.76 [2019-03-28 12:03:55,951 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:55,966 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:55,967 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:55,968 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:42 67.24/35.76 [2019-03-28 12:03:56,024 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:56,025 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 67.24/35.76 [2019-03-28 12:03:56,026 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 67.24/35.76 [2019-03-28 12:03:56,045 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:56,048 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 67.24/35.76 [2019-03-28 12:03:56,048 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:46 67.24/35.76 [2019-03-28 12:03:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:03:56,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 67.24/35.76 [2019-03-28 12:03:56,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 67.24/35.76 [2019-03-28 12:03:56,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 67.24/35.76 [2019-03-28 12:03:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 67.24/35.76 [2019-03-28 12:03:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 67.24/35.76 [2019-03-28 12:03:56,187 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 17 states. 67.24/35.76 [2019-03-28 12:03:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.76 [2019-03-28 12:03:56,856 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. 67.24/35.76 [2019-03-28 12:03:56,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 67.24/35.76 [2019-03-28 12:03:56,857 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 67.24/35.76 [2019-03-28 12:03:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.76 [2019-03-28 12:03:56,858 INFO L225 Difference]: With dead ends: 54 67.24/35.76 [2019-03-28 12:03:56,858 INFO L226 Difference]: Without dead ends: 53 67.24/35.76 [2019-03-28 12:03:56,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 67.24/35.76 [2019-03-28 12:03:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. 67.24/35.76 [2019-03-28 12:03:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 29. 67.24/35.76 [2019-03-28 12:03:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 67.24/35.76 [2019-03-28 12:03:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. 67.24/35.76 [2019-03-28 12:03:56,864 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 67.24/35.76 [2019-03-28 12:03:56,864 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.76 [2019-03-28 12:03:56,864 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. 67.24/35.76 [2019-03-28 12:03:56,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 67.24/35.76 [2019-03-28 12:03:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. 67.24/35.76 [2019-03-28 12:03:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 67.24/35.76 [2019-03-28 12:03:56,865 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.76 [2019-03-28 12:03:56,865 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:03:56,865 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.76 [2019-03-28 12:03:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:03:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1662121928, now seen corresponding path program 1 times 67.24/35.76 [2019-03-28 12:03:56,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:03:56,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:03:56,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:56,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:56,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:03:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:03:56,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 67.24/35.76 [2019-03-28 12:03:56,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 67.24/35.76 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 67.24/35.76 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 67.24/35.76 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 67.24/35.76 [2019-03-28 12:03:56,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:03:56,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core 67.24/35.76 [2019-03-28 12:03:56,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.76 [2019-03-28 12:03:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:03:56,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 67.24/35.76 [2019-03-28 12:03:56,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 67.24/35.76 [2019-03-28 12:03:56,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 67.24/35.76 [2019-03-28 12:03:56,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 67.24/35.76 [2019-03-28 12:03:56,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 67.24/35.76 [2019-03-28 12:03:56,990 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 6 states. 67.24/35.76 [2019-03-28 12:03:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.76 [2019-03-28 12:03:57,088 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. 67.24/35.76 [2019-03-28 12:03:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 67.24/35.76 [2019-03-28 12:03:57,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 67.24/35.76 [2019-03-28 12:03:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.76 [2019-03-28 12:03:57,089 INFO L225 Difference]: With dead ends: 31 67.24/35.76 [2019-03-28 12:03:57,090 INFO L226 Difference]: Without dead ends: 29 67.24/35.76 [2019-03-28 12:03:57,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 67.24/35.76 [2019-03-28 12:03:57,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 67.24/35.76 [2019-03-28 12:03:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 67.24/35.76 [2019-03-28 12:03:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 67.24/35.76 [2019-03-28 12:03:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. 67.24/35.76 [2019-03-28 12:03:57,095 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 19 67.24/35.76 [2019-03-28 12:03:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.76 [2019-03-28 12:03:57,095 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. 67.24/35.76 [2019-03-28 12:03:57,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 67.24/35.76 [2019-03-28 12:03:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. 67.24/35.76 [2019-03-28 12:03:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 67.24/35.76 [2019-03-28 12:03:57,096 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.76 [2019-03-28 12:03:57,096 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:03:57,096 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.76 [2019-03-28 12:03:57,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:03:57,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1662121929, now seen corresponding path program 1 times 67.24/35.76 [2019-03-28 12:03:57,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:03:57,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:03:57,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:57,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:57,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:03:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:03:57,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 67.24/35.76 [2019-03-28 12:03:57,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 67.24/35.76 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 67.24/35.76 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 67.24/35.76 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 67.24/35.76 [2019-03-28 12:03:57,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:03:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:03:57,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 26 conjunts are in the unsatisfiable core 67.24/35.76 [2019-03-28 12:03:57,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.76 [2019-03-28 12:03:57,321 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 67.24/35.76 [2019-03-28 12:03:57,321 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:57,330 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:57,331 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. 67.24/35.76 [2019-03-28 12:03:57,331 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 67.24/35.76 [2019-03-28 12:03:57,508 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:57,509 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 51 67.24/35.76 [2019-03-28 12:03:57,519 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 67.24/35.76 [2019-03-28 12:03:57,566 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:03:57,569 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 67.24/35.76 [2019-03-28 12:03:57,569 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:74 67.24/35.76 [2019-03-28 12:03:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:03:57,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 67.24/35.76 [2019-03-28 12:03:57,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 67.24/35.76 [2019-03-28 12:03:57,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 67.24/35.76 [2019-03-28 12:03:57,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 67.24/35.76 [2019-03-28 12:03:57,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 67.24/35.76 [2019-03-28 12:03:57,738 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 17 states. 67.24/35.76 [2019-03-28 12:03:59,989 WARN L188 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 57 67.24/35.76 [2019-03-28 12:04:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.76 [2019-03-28 12:04:00,230 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. 67.24/35.76 [2019-03-28 12:04:00,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 67.24/35.76 [2019-03-28 12:04:00,230 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 67.24/35.76 [2019-03-28 12:04:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.76 [2019-03-28 12:04:00,231 INFO L225 Difference]: With dead ends: 45 67.24/35.76 [2019-03-28 12:04:00,231 INFO L226 Difference]: Without dead ends: 38 67.24/35.76 [2019-03-28 12:04:00,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 67.24/35.76 [2019-03-28 12:04:00,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. 67.24/35.76 [2019-03-28 12:04:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. 67.24/35.76 [2019-03-28 12:04:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 67.24/35.76 [2019-03-28 12:04:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. 67.24/35.76 [2019-03-28 12:04:00,236 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 19 67.24/35.76 [2019-03-28 12:04:00,237 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.76 [2019-03-28 12:04:00,237 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. 67.24/35.76 [2019-03-28 12:04:00,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 67.24/35.76 [2019-03-28 12:04:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. 67.24/35.76 [2019-03-28 12:04:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 67.24/35.76 [2019-03-28 12:04:00,238 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.76 [2019-03-28 12:04:00,238 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:04:00,238 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.76 [2019-03-28 12:04:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:04:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash -405830808, now seen corresponding path program 2 times 67.24/35.76 [2019-03-28 12:04:00,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:04:00,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:04:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:00,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:00,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:04:00,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 67.24/35.76 [2019-03-28 12:04:00,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 67.24/35.76 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 67.24/35.76 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 67.24/35.76 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 67.24/35.76 [2019-03-28 12:04:00,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 67.24/35.76 [2019-03-28 12:04:00,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 67.24/35.76 [2019-03-28 12:04:00,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:00,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 36 conjunts are in the unsatisfiable core 67.24/35.76 [2019-03-28 12:04:00,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.76 [2019-03-28 12:04:00,529 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 67.24/35.76 [2019-03-28 12:04:00,529 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:00,535 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:00,535 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:00,535 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 67.24/35.76 [2019-03-28 12:04:00,563 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 67.24/35.76 [2019-03-28 12:04:00,563 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:00,568 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:00,568 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:00,568 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 67.24/35.76 [2019-03-28 12:04:00,589 INFO L189 IndexEqualityManager]: detected not equals via solver 67.24/35.76 [2019-03-28 12:04:00,590 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 67.24/35.76 [2019-03-28 12:04:00,591 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:00,597 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:00,598 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:00,598 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 67.24/35.76 [2019-03-28 12:04:00,624 INFO L189 IndexEqualityManager]: detected not equals via solver 67.24/35.76 [2019-03-28 12:04:00,625 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 67.24/35.76 [2019-03-28 12:04:00,625 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:00,632 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:00,633 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. 67.24/35.76 [2019-03-28 12:04:00,633 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 67.24/35.76 [2019-03-28 12:04:00,786 INFO L189 IndexEqualityManager]: detected not equals via solver 67.24/35.76 [2019-03-28 12:04:00,813 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:00,814 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 73 67.24/35.76 [2019-03-28 12:04:00,815 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:00,883 INFO L497 ElimStorePlain]: treesize reduction 4, result has 94.6 percent of original size 67.24/35.76 [2019-03-28 12:04:00,886 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:00,886 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:70 67.24/35.76 [2019-03-28 12:04:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:04:01,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 67.24/35.76 [2019-03-28 12:04:01,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 67.24/35.76 [2019-03-28 12:04:01,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states 67.24/35.76 [2019-03-28 12:04:01,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. 67.24/35.76 [2019-03-28 12:04:01,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 67.24/35.76 [2019-03-28 12:04:01,021 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 20 states. 67.24/35.76 [2019-03-28 12:04:02,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.76 [2019-03-28 12:04:02,674 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. 67.24/35.76 [2019-03-28 12:04:02,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 67.24/35.76 [2019-03-28 12:04:02,675 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 67.24/35.76 [2019-03-28 12:04:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.76 [2019-03-28 12:04:02,676 INFO L225 Difference]: With dead ends: 134 67.24/35.76 [2019-03-28 12:04:02,676 INFO L226 Difference]: Without dead ends: 133 67.24/35.76 [2019-03-28 12:04:02,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=392, Invalid=1414, Unknown=0, NotChecked=0, Total=1806 67.24/35.76 [2019-03-28 12:04:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. 67.24/35.76 [2019-03-28 12:04:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 72. 67.24/35.76 [2019-03-28 12:04:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. 67.24/35.76 [2019-03-28 12:04:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. 67.24/35.76 [2019-03-28 12:04:02,687 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 22 67.24/35.76 [2019-03-28 12:04:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.76 [2019-03-28 12:04:02,688 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. 67.24/35.76 [2019-03-28 12:04:02,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. 67.24/35.76 [2019-03-28 12:04:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. 67.24/35.76 [2019-03-28 12:04:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 67.24/35.76 [2019-03-28 12:04:02,689 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.76 [2019-03-28 12:04:02,689 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:04:02,689 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.76 [2019-03-28 12:04:02,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:04:02,689 INFO L82 PathProgramCache]: Analyzing trace with hash -814655033, now seen corresponding path program 2 times 67.24/35.76 [2019-03-28 12:04:02,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:04:02,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:04:02,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:02,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:02,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:04:02,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 67.24/35.76 [2019-03-28 12:04:02,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 67.24/35.76 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 67.24/35.76 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 67.24/35.76 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 67.24/35.76 [2019-03-28 12:04:02,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 67.24/35.76 [2019-03-28 12:04:02,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 67.24/35.76 [2019-03-28 12:04:02,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:02,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjunts are in the unsatisfiable core 67.24/35.76 [2019-03-28 12:04:02,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.76 [2019-03-28 12:04:02,937 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 67.24/35.76 [2019-03-28 12:04:02,937 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:02,943 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:02,946 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 67.24/35.76 [2019-03-28 12:04:02,946 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:02,952 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:02,952 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:02,952 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 67.24/35.76 [2019-03-28 12:04:02,971 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 67.24/35.76 [2019-03-28 12:04:02,972 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:02,976 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:02,976 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:02,977 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 67.24/35.76 [2019-03-28 12:04:02,997 INFO L189 IndexEqualityManager]: detected not equals via solver 67.24/35.76 [2019-03-28 12:04:02,999 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 67.24/35.76 [2019-03-28 12:04:02,999 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:03,008 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:03,015 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:03,015 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 67.24/35.76 [2019-03-28 12:04:03,015 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:03,021 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:03,021 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:03,022 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 67.24/35.76 [2019-03-28 12:04:03,046 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 67.24/35.76 [2019-03-28 12:04:03,046 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:03,052 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:03,053 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. 67.24/35.76 [2019-03-28 12:04:03,053 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 67.24/35.76 [2019-03-28 12:04:03,094 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:03,095 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 67.24/35.76 [2019-03-28 12:04:03,096 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 67.24/35.76 [2019-03-28 12:04:03,103 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:03,104 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:03,104 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 67.24/35.76 [2019-03-28 12:04:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:04:03,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 67.24/35.76 [2019-03-28 12:04:03,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 67.24/35.76 [2019-03-28 12:04:03,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states 67.24/35.76 [2019-03-28 12:04:03,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 67.24/35.76 [2019-03-28 12:04:03,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 67.24/35.76 [2019-03-28 12:04:03,188 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 16 states. 67.24/35.76 [2019-03-28 12:04:04,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.76 [2019-03-28 12:04:04,209 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. 67.24/35.76 [2019-03-28 12:04:04,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 67.24/35.76 [2019-03-28 12:04:04,209 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 67.24/35.76 [2019-03-28 12:04:04,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.76 [2019-03-28 12:04:04,210 INFO L225 Difference]: With dead ends: 108 67.24/35.76 [2019-03-28 12:04:04,210 INFO L226 Difference]: Without dead ends: 107 67.24/35.76 [2019-03-28 12:04:04,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 67.24/35.76 [2019-03-28 12:04:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. 67.24/35.76 [2019-03-28 12:04:04,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 62. 67.24/35.76 [2019-03-28 12:04:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. 67.24/35.76 [2019-03-28 12:04:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. 67.24/35.76 [2019-03-28 12:04:04,219 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 22 67.24/35.76 [2019-03-28 12:04:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.76 [2019-03-28 12:04:04,219 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. 67.24/35.76 [2019-03-28 12:04:04,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. 67.24/35.76 [2019-03-28 12:04:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. 67.24/35.76 [2019-03-28 12:04:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 67.24/35.76 [2019-03-28 12:04:04,220 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.76 [2019-03-28 12:04:04,220 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:04:04,220 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.76 [2019-03-28 12:04:04,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:04:04,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1578034770, now seen corresponding path program 2 times 67.24/35.76 [2019-03-28 12:04:04,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:04:04,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:04:04,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:04,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:04,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:04:04,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 67.24/35.76 [2019-03-28 12:04:04,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 67.24/35.76 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 67.24/35.76 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 67.24/35.76 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 67.24/35.76 [2019-03-28 12:04:04,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 67.24/35.76 [2019-03-28 12:04:04,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 67.24/35.76 [2019-03-28 12:04:04,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:04,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 29 conjunts are in the unsatisfiable core 67.24/35.76 [2019-03-28 12:04:04,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.76 [2019-03-28 12:04:04,601 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 67.24/35.76 [2019-03-28 12:04:04,602 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:04,606 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:04,607 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:04,607 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 67.24/35.76 [2019-03-28 12:04:04,629 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 67.24/35.76 [2019-03-28 12:04:04,629 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:04,635 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:04,636 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. 67.24/35.76 [2019-03-28 12:04:04,636 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 67.24/35.76 [2019-03-28 12:04:04,771 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:04,771 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 55 67.24/35.76 [2019-03-28 12:04:04,777 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 67.24/35.76 [2019-03-28 12:04:04,822 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:04,824 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:04,824 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:82 67.24/35.76 [2019-03-28 12:04:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:04:04,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 67.24/35.76 [2019-03-28 12:04:04,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 67.24/35.76 [2019-03-28 12:04:04,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states 67.24/35.76 [2019-03-28 12:04:04,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. 67.24/35.76 [2019-03-28 12:04:04,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 67.24/35.76 [2019-03-28 12:04:04,963 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 18 states. 67.24/35.76 [2019-03-28 12:04:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.76 [2019-03-28 12:04:07,434 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. 67.24/35.76 [2019-03-28 12:04:07,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 67.24/35.76 [2019-03-28 12:04:07,435 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 67.24/35.76 [2019-03-28 12:04:07,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.76 [2019-03-28 12:04:07,436 INFO L225 Difference]: With dead ends: 129 67.24/35.76 [2019-03-28 12:04:07,436 INFO L226 Difference]: Without dead ends: 123 67.24/35.76 [2019-03-28 12:04:07,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=610, Invalid=1840, Unknown=0, NotChecked=0, Total=2450 67.24/35.76 [2019-03-28 12:04:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. 67.24/35.76 [2019-03-28 12:04:07,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 76. 67.24/35.76 [2019-03-28 12:04:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. 67.24/35.76 [2019-03-28 12:04:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. 67.24/35.76 [2019-03-28 12:04:07,447 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 26 67.24/35.76 [2019-03-28 12:04:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.76 [2019-03-28 12:04:07,447 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. 67.24/35.76 [2019-03-28 12:04:07,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. 67.24/35.76 [2019-03-28 12:04:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. 67.24/35.76 [2019-03-28 12:04:07,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 67.24/35.76 [2019-03-28 12:04:07,448 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.76 [2019-03-28 12:04:07,448 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:04:07,449 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.76 [2019-03-28 12:04:07,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:04:07,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1111039804, now seen corresponding path program 1 times 67.24/35.76 [2019-03-28 12:04:07,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:04:07,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:04:07,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:07,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:07,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:04:07,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 67.24/35.76 [2019-03-28 12:04:07,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 67.24/35.76 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 67.24/35.76 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 67.24/35.76 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 67.24/35.76 [2019-03-28 12:04:07,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:07,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 39 conjunts are in the unsatisfiable core 67.24/35.76 [2019-03-28 12:04:07,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.76 [2019-03-28 12:04:07,653 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 67.24/35.76 [2019-03-28 12:04:07,653 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:07,659 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:07,662 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 67.24/35.76 [2019-03-28 12:04:07,662 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:07,667 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:07,668 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:07,668 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 67.24/35.76 [2019-03-28 12:04:07,686 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 67.24/35.76 [2019-03-28 12:04:07,686 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:07,690 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:07,690 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:07,691 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 67.24/35.76 [2019-03-28 12:04:07,699 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:07,700 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 67.24/35.76 [2019-03-28 12:04:07,700 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:07,706 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:07,709 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 67.24/35.76 [2019-03-28 12:04:07,709 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:07,715 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:07,716 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:07,716 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 67.24/35.76 [2019-03-28 12:04:07,736 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 67.24/35.76 [2019-03-28 12:04:07,736 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:07,743 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:07,743 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. 67.24/35.76 [2019-03-28 12:04:07,743 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 67.24/35.76 [2019-03-28 12:04:07,897 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:07,898 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 73 67.24/35.76 [2019-03-28 12:04:07,899 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:07,961 INFO L497 ElimStorePlain]: treesize reduction 4, result has 94.4 percent of original size 67.24/35.76 [2019-03-28 12:04:07,964 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:07,964 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:68 67.24/35.76 [2019-03-28 12:04:13,013 WARN L188 SmtUtils]: Spent 5.02 s on a formula simplification that was a NOOP. DAG size: 41 67.24/35.76 [2019-03-28 12:04:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:04:13,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 67.24/35.76 [2019-03-28 12:04:13,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 67.24/35.76 [2019-03-28 12:04:13,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 67.24/35.76 [2019-03-28 12:04:13,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 67.24/35.76 [2019-03-28 12:04:13,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 67.24/35.76 [2019-03-28 12:04:13,059 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 17 states. 67.24/35.76 [2019-03-28 12:04:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.76 [2019-03-28 12:04:13,461 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. 67.24/35.76 [2019-03-28 12:04:13,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 67.24/35.76 [2019-03-28 12:04:13,462 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 67.24/35.76 [2019-03-28 12:04:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.76 [2019-03-28 12:04:13,463 INFO L225 Difference]: With dead ends: 97 67.24/35.76 [2019-03-28 12:04:13,463 INFO L226 Difference]: Without dead ends: 96 67.24/35.76 [2019-03-28 12:04:13,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 67.24/35.76 [2019-03-28 12:04:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. 67.24/35.76 [2019-03-28 12:04:13,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 42. 67.24/35.76 [2019-03-28 12:04:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 67.24/35.76 [2019-03-28 12:04:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. 67.24/35.76 [2019-03-28 12:04:13,469 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 29 67.24/35.76 [2019-03-28 12:04:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.76 [2019-03-28 12:04:13,469 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. 67.24/35.76 [2019-03-28 12:04:13,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 67.24/35.76 [2019-03-28 12:04:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. 67.24/35.76 [2019-03-28 12:04:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 67.24/35.76 [2019-03-28 12:04:13,470 INFO L394 BasicCegarLoop]: Found error trace 67.24/35.76 [2019-03-28 12:04:13,470 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:04:13,471 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 67.24/35.76 [2019-03-28 12:04:13,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:04:13,471 INFO L82 PathProgramCache]: Analyzing trace with hash -684629589, now seen corresponding path program 1 times 67.24/35.76 [2019-03-28 12:04:13,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:04:13,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:04:13,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:13,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:13,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:04:13,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 67.24/35.76 [2019-03-28 12:04:13,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 67.24/35.76 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 67.24/35.76 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 67.24/35.76 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 67.24/35.76 [2019-03-28 12:04:13,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:13,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 32 conjunts are in the unsatisfiable core 67.24/35.76 [2019-03-28 12:04:13,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.76 [2019-03-28 12:04:13,813 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 67.24/35.76 [2019-03-28 12:04:13,813 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:13,817 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:13,817 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:13,817 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 67.24/35.76 [2019-03-28 12:04:13,836 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 67.24/35.76 [2019-03-28 12:04:13,837 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:13,839 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:13,839 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:13,839 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 67.24/35.76 [2019-03-28 12:04:13,952 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:13,952 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 55 67.24/35.76 [2019-03-28 12:04:13,957 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 67.24/35.76 [2019-03-28 12:04:13,990 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 67.24/35.76 [2019-03-28 12:04:13,992 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 67.24/35.76 [2019-03-28 12:04:13,992 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:76 67.24/35.76 [2019-03-28 12:04:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:04:14,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 67.24/35.76 [2019-03-28 12:04:14,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 67.24/35.76 [2019-03-28 12:04:14,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states 67.24/35.76 [2019-03-28 12:04:14,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. 67.24/35.76 [2019-03-28 12:04:14,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 67.24/35.76 [2019-03-28 12:04:14,132 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 21 states. 67.24/35.76 [2019-03-28 12:04:15,306 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 67.24/35.76 [2019-03-28 12:04:15,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.76 [2019-03-28 12:04:15,521 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. 67.24/35.76 [2019-03-28 12:04:15,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 67.24/35.76 [2019-03-28 12:04:15,521 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 67.24/35.76 [2019-03-28 12:04:15,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 67.24/35.76 [2019-03-28 12:04:15,521 INFO L225 Difference]: With dead ends: 52 67.24/35.76 [2019-03-28 12:04:15,521 INFO L226 Difference]: Without dead ends: 0 67.24/35.76 [2019-03-28 12:04:15,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=496, Invalid=1144, Unknown=0, NotChecked=0, Total=1640 67.24/35.76 [2019-03-28 12:04:15,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 67.24/35.76 [2019-03-28 12:04:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 67.24/35.76 [2019-03-28 12:04:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 67.24/35.76 [2019-03-28 12:04:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 67.24/35.76 [2019-03-28 12:04:15,523 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 67.24/35.76 [2019-03-28 12:04:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. 67.24/35.76 [2019-03-28 12:04:15,523 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 67.24/35.76 [2019-03-28 12:04:15,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. 67.24/35.76 [2019-03-28 12:04:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 67.24/35.76 [2019-03-28 12:04:15,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 67.24/35.76 [2019-03-28 12:04:15,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 67.24/35.76 [2019-03-28 12:04:15,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:15,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:15,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:15,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:15,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:15,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:15,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:15,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:15,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:15,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:15,835 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 239 67.24/35.76 [2019-03-28 12:04:15,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:15,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:15,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:15,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 67.24/35.76 [2019-03-28 12:04:17,111 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 230 DAG size of output: 90 67.24/35.76 [2019-03-28 12:04:17,355 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 67.24/35.76 [2019-03-28 12:04:17,358 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,358 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,358 INFO L448 ceAbstractionStarter]: For program point L30-2(line 30) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,358 INFO L448 ceAbstractionStarter]: For program point L30-3(line 30) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,359 INFO L448 ceAbstractionStarter]: For program point L30-4(line 30) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,359 INFO L448 ceAbstractionStarter]: For program point L30-5(line 30) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,359 INFO L448 ceAbstractionStarter]: For program point L30-7(lines 30 33) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,359 INFO L444 ceAbstractionStarter]: At program point L30-9(lines 30 33) the Hoare annotation is: (let ((.cse22 (select |#length| ULTIMATE.start_cstrcmp_~s2.base)) (.cse20 (select |#length| ULTIMATE.start_cstrcmp_~s1.base)) (.cse23 (select |#length| |ULTIMATE.start_main_#t~ret11.base|))) (let ((.cse0 (= (select |#valid| ULTIMATE.start_cstrcmp_~s2.base) 1)) (.cse1 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse2 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse3 (<= 1 .cse23)) (.cse4 (= ULTIMATE.start_cstrcmp_~s1.offset 0)) (.cse6 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse7 (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)) (.cse8 (<= 1 .cse20)) (.cse9 (= ULTIMATE.start_cstrcmp_~s2.offset 0)) (.cse11 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret11.base|))) (.cse12 (<= 1 .cse22)) (.cse13 (= 0 |ULTIMATE.start_main_#t~ret11.offset|)) (.cse14 (= (select |#valid| ULTIMATE.start_cstrcmp_~s1.base) 1)) (.cse10 (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base)) (.cse5 (select |#memory_int| |ULTIMATE.start_main_#t~ret11.base|))) (let ((.cse15 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int) (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base Int)) (and (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base ULTIMATE.start_cstrcmp_~s1.base)) (= 0 (select (select |#memory_int| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (- 1))))))) (.cse17 (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret11.base|))) (.cse18 (= (select .cse5 (+ .cse23 (- 1))) 0)) (.cse19 (= 0 (select .cse10 (+ .cse20 (- 1))))) (.cse16 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14)) (.cse21 (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (select .cse5 |ULTIMATE.start_main_#t~ret11.offset|) 0) .cse6 .cse7 .cse8 .cse9 (= 0 (select .cse10 ULTIMATE.start_cstrcmp_~s1.offset)) .cse11 .cse12 .cse13 .cse14) (and (and .cse15 .cse16) .cse17 .cse18 .cse19 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int)) (and (<= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (<= 0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start_cstrcmp_~s2.base) (- 1))) 0)))) (and (<= ULTIMATE.start_cstrcmp_~s1.offset ULTIMATE.start_cstrcmp_~s2.offset) (and (and (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse6 .cse14 (<= 1 ULTIMATE.start_cstrcmp_~s1.offset) .cse7) .cse15 .cse17 (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) .cse20) .cse18) .cse19) .cse13 (= (select .cse21 (+ ULTIMATE.start_cstrcmp_~s1.offset (* (- 1) ULTIMATE.start_cstrcmp_~s2.offset) .cse22 (- 1))) 0) (<= (+ ULTIMATE.start_cstrcmp_~s2.offset 1) .cse22) (<= ULTIMATE.start_cstrcmp_~s2.offset ULTIMATE.start_cstrcmp_~s1.offset)) (and (= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) .cse16 (= 0 (select .cse21 ULTIMATE.start_cstrcmp_~s2.offset))))))) 67.24/35.76 [2019-03-28 12:04:17,359 INFO L448 ceAbstractionStarter]: For program point L30-10(lines 30 33) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,360 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)) 67.24/35.76 [2019-03-28 12:04:17,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,360 INFO L444 ceAbstractionStarter]: At program point L16-2(line 16) the Hoare annotation is: (let ((.cse0 (and (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret11.base|)) (<= 1 (select |#length| |ULTIMATE.start_main_#t~ret11.base|)) (= 0 |ULTIMATE.start_main_#t~ret11.offset|) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)))) (or (and (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret11.base|)) .cse0 (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 Int)) (let ((.cse1 (select |#length| |ULTIMATE.start_main_#t~ret11.base|))) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret11.base|) (+ .cse1 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 (- 1)))) (<= |ULTIMATE.start_main_#t~ret11.offset| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 0) (<= 1 (+ .cse1 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18)))))) (and (= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) .cse0) (and .cse0 (= (select (select |#memory_int| |ULTIMATE.start_main_#t~ret11.base|) |ULTIMATE.start_main_#t~ret11.offset|) 0)))) 67.24/35.76 [2019-03-28 12:04:17,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,360 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,361 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,361 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,361 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 14) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,361 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,361 INFO L448 ceAbstractionStarter]: For program point L12-3(lines 12 14) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,361 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,361 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,361 INFO L448 ceAbstractionStarter]: For program point L12-5(lines 12 14) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,361 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,362 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,362 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,362 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,362 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 67.24/35.76 [2019-03-28 12:04:17,362 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 67.24/35.76 [2019-03-28 12:04:17,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,399 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,408 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,408 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,408 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,408 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,409 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,409 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,409 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,409 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,410 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,410 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,410 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,410 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 [2019-03-28 12:04:17,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:17,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.76 [2019-03-28 12:04:17,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:04:17 BasicIcfg 67.24/35.76 [2019-03-28 12:04:17,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 67.24/35.76 [2019-03-28 12:04:17,430 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 67.24/35.76 [2019-03-28 12:04:17,430 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 67.24/35.76 [2019-03-28 12:04:17,434 INFO L276 PluginConnector]: BuchiAutomizer initialized 67.24/35.76 [2019-03-28 12:04:17,435 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 67.24/35.76 [2019-03-28 12:04:17,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:03:48" (1/5) ... 67.24/35.76 [2019-03-28 12:04:17,436 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@358b621d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:04:17, skipping insertion in model container 67.24/35.76 [2019-03-28 12:04:17,436 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 67.24/35.76 [2019-03-28 12:04:17,436 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:48" (2/5) ... 67.24/35.76 [2019-03-28 12:04:17,436 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@358b621d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:04:17, skipping insertion in model container 67.24/35.76 [2019-03-28 12:04:17,436 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 67.24/35.76 [2019-03-28 12:04:17,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:03:49" (3/5) ... 67.24/35.76 [2019-03-28 12:04:17,437 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@358b621d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:04:17, skipping insertion in model container 67.24/35.76 [2019-03-28 12:04:17,437 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 67.24/35.76 [2019-03-28 12:04:17,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:03:49" (4/5) ... 67.24/35.76 [2019-03-28 12:04:17,437 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@358b621d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:04:17, skipping insertion in model container 67.24/35.76 [2019-03-28 12:04:17,437 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 67.24/35.76 [2019-03-28 12:04:17,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:04:17" (5/5) ... 67.24/35.76 [2019-03-28 12:04:17,439 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 67.24/35.76 [2019-03-28 12:04:17,460 INFO L133 ementStrategyFactory]: Using default assertion order modulation 67.24/35.76 [2019-03-28 12:04:17,460 INFO L374 BuchiCegarLoop]: Interprodecural is true 67.24/35.76 [2019-03-28 12:04:17,460 INFO L375 BuchiCegarLoop]: Hoare is true 67.24/35.76 [2019-03-28 12:04:17,460 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 67.24/35.76 [2019-03-28 12:04:17,461 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 67.24/35.76 [2019-03-28 12:04:17,461 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 67.24/35.76 [2019-03-28 12:04:17,461 INFO L379 BuchiCegarLoop]: Difference is false 67.24/35.76 [2019-03-28 12:04:17,461 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 67.24/35.76 [2019-03-28 12:04:17,461 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 67.24/35.76 [2019-03-28 12:04:17,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. 67.24/35.76 [2019-03-28 12:04:17,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 67.24/35.76 [2019-03-28 12:04:17,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.24/35.76 [2019-03-28 12:04:17,469 INFO L119 BuchiIsEmpty]: Starting construction of run 67.24/35.76 [2019-03-28 12:04:17,473 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:04:17,474 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:04:17,474 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 67.24/35.76 [2019-03-28 12:04:17,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. 67.24/35.76 [2019-03-28 12:04:17,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 67.24/35.76 [2019-03-28 12:04:17,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.24/35.76 [2019-03-28 12:04:17,475 INFO L119 BuchiIsEmpty]: Starting construction of run 67.24/35.76 [2019-03-28 12:04:17,476 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:04:17,476 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:04:17,481 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue [187] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 13#L12true [126] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 10#L12-2true [148] L12-2-->L16: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (store |v_#length_3| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 4#L16true [189] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret11.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (= |v_ULTIMATE.start_main_#t~ret11.base_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#t~ret11.base, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 26#L12-3true [130] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 22#L12-5true [154] L12-5-->L16-2: Formula: (and (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 16#L16-2true [191] L16-2-->L30-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (= |v_ULTIMATE.start_main_#t~ret11.base_7| |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret12.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start_main_#t~ret11.offset_7| |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_main_#t~ret12.offset_5| |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrcmp_#t~mem9=|v_ULTIMATE.start_cstrcmp_#t~mem9_5|, ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_10|, ULTIMATE.start_cstrcmp_#t~mem8=|v_ULTIMATE.start_cstrcmp_#t~mem8_5|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_4|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_4|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_4|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_6|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_6|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_4|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_5|, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_5|, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~ite10=|v_ULTIMATE.start_cstrcmp_#t~ite10_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem9, ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~mem8, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrcmp_~uc1~0, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_main_#t~ret12.offset, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_main_#t~ret12.base, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_#t~ite10, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base] 29#L30-9true 67.24/35.76 [2019-03-28 12:04:17,481 INFO L796 eck$LassoCheckResult]: Loop: 29#L30-9true [118] L30-9-->L30-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_10| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3) (= (select |v_#valid_11| v_ULTIMATE.start_cstrcmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 24#L30-1true [167] L30-1-->L30-2: Formula: (and |v_ULTIMATE.start_cstrcmp_#t~short5_2| (< 0 |v_ULTIMATE.start_cstrcmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_2|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5] 21#L30-2true [111] L30-2-->L30-7: Formula: (not |v_ULTIMATE.start_cstrcmp_#t~short5_5|) InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_5|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_5|} AuxVars[] AssignedVars[] 31#L30-7true [123] L30-7-->L30-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_7 1) v_ULTIMATE.start_cstrcmp_~s2.offset_6) (= v_ULTIMATE.start_cstrcmp_~s2.base_8 v_ULTIMATE.start_cstrcmp_~s2.base_7) |v_ULTIMATE.start_cstrcmp_#t~short5_9| (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10)) InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_9|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_7, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_8} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_8|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_2|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_2|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_5|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_5|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4] 29#L30-9true 67.24/35.76 [2019-03-28 12:04:17,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:04:17,482 INFO L82 PathProgramCache]: Analyzing trace with hash -342978630, now seen corresponding path program 1 times 67.24/35.76 [2019-03-28 12:04:17,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:04:17,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:04:17,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.24/35.76 [2019-03-28 12:04:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.24/35.76 [2019-03-28 12:04:17,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:04:17,512 INFO L82 PathProgramCache]: Analyzing trace with hash 4602910, now seen corresponding path program 1 times 67.24/35.76 [2019-03-28 12:04:17,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:04:17,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:04:17,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:04:17,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.76 [2019-03-28 12:04:17,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 67.24/35.76 [2019-03-28 12:04:17,520 INFO L811 eck$LassoCheckResult]: loop already infeasible 67.24/35.76 [2019-03-28 12:04:17,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.24/35.76 [2019-03-28 12:04:17,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.24/35.76 [2019-03-28 12:04:17,521 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. 67.24/35.76 [2019-03-28 12:04:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.76 [2019-03-28 12:04:17,595 INFO L93 Difference]: Finished difference Result 32 states and 55 transitions. 67.24/35.76 [2019-03-28 12:04:17,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.24/35.76 [2019-03-28 12:04:17,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 55 transitions. 67.24/35.76 [2019-03-28 12:04:17,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 67.24/35.76 [2019-03-28 12:04:17,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 16 states and 25 transitions. 67.24/35.76 [2019-03-28 12:04:17,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 67.24/35.76 [2019-03-28 12:04:17,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 67.24/35.76 [2019-03-28 12:04:17,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 25 transitions. 67.24/35.76 [2019-03-28 12:04:17,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 67.24/35.76 [2019-03-28 12:04:17,602 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. 67.24/35.76 [2019-03-28 12:04:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 25 transitions. 67.24/35.76 [2019-03-28 12:04:17,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. 67.24/35.76 [2019-03-28 12:04:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 67.24/35.76 [2019-03-28 12:04:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. 67.24/35.76 [2019-03-28 12:04:17,604 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 24 transitions. 67.24/35.76 [2019-03-28 12:04:17,604 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 24 transitions. 67.24/35.76 [2019-03-28 12:04:17,604 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 67.24/35.76 [2019-03-28 12:04:17,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 24 transitions. 67.24/35.76 [2019-03-28 12:04:17,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 67.24/35.76 [2019-03-28 12:04:17,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.24/35.76 [2019-03-28 12:04:17,605 INFO L119 BuchiIsEmpty]: Starting construction of run 67.24/35.76 [2019-03-28 12:04:17,605 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:04:17,605 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:04:17,606 INFO L794 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY [187] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 84#L12 [126] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 81#L12-2 [148] L12-2-->L16: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (store |v_#length_3| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 73#L16 [189] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret11.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (= |v_ULTIMATE.start_main_#t~ret11.base_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#t~ret11.base, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 74#L12-3 [130] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 77#L12-5 [154] L12-5-->L16-2: Formula: (and (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 78#L16-2 [191] L16-2-->L30-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (= |v_ULTIMATE.start_main_#t~ret11.base_7| |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret12.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start_main_#t~ret11.offset_7| |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_main_#t~ret12.offset_5| |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrcmp_#t~mem9=|v_ULTIMATE.start_cstrcmp_#t~mem9_5|, ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_10|, ULTIMATE.start_cstrcmp_#t~mem8=|v_ULTIMATE.start_cstrcmp_#t~mem8_5|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_4|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_4|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_4|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_6|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_6|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_4|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_5|, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_5|, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~ite10=|v_ULTIMATE.start_cstrcmp_#t~ite10_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem9, ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~mem8, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrcmp_~uc1~0, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_main_#t~ret12.offset, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_main_#t~ret12.base, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_#t~ite10, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base] 82#L30-9 67.24/35.76 [2019-03-28 12:04:17,607 INFO L796 eck$LassoCheckResult]: Loop: 82#L30-9 [118] L30-9-->L30-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_10| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3) (= (select |v_#valid_11| v_ULTIMATE.start_cstrcmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 79#L30-1 [168] L30-1-->L30-2: Formula: (and (not |v_ULTIMATE.start_cstrcmp_#t~short5_2|) (= 0 |v_ULTIMATE.start_cstrcmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_2|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5] 80#L30-2 [111] L30-2-->L30-7: Formula: (not |v_ULTIMATE.start_cstrcmp_#t~short5_5|) InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_5|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_5|} AuxVars[] AssignedVars[] 85#L30-7 [123] L30-7-->L30-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_7 1) v_ULTIMATE.start_cstrcmp_~s2.offset_6) (= v_ULTIMATE.start_cstrcmp_~s2.base_8 v_ULTIMATE.start_cstrcmp_~s2.base_7) |v_ULTIMATE.start_cstrcmp_#t~short5_9| (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10)) InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_9|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_7, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_8} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_8|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_2|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_2|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_5|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_5|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4] 82#L30-9 67.24/35.76 [2019-03-28 12:04:17,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:04:17,607 INFO L82 PathProgramCache]: Analyzing trace with hash -342978630, now seen corresponding path program 2 times 67.24/35.76 [2019-03-28 12:04:17,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:04:17,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:04:17,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.24/35.76 [2019-03-28 12:04:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.24/35.76 [2019-03-28 12:04:17,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:04:17,620 INFO L82 PathProgramCache]: Analyzing trace with hash 4603871, now seen corresponding path program 1 times 67.24/35.76 [2019-03-28 12:04:17,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:04:17,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:04:17,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:04:17,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 67.24/35.76 [2019-03-28 12:04:17,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 67.24/35.76 [2019-03-28 12:04:17,627 INFO L811 eck$LassoCheckResult]: loop already infeasible 67.24/35.76 [2019-03-28 12:04:17,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 67.24/35.76 [2019-03-28 12:04:17,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 67.24/35.76 [2019-03-28 12:04:17,628 INFO L87 Difference]: Start difference. First operand 15 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. 67.24/35.76 [2019-03-28 12:04:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 67.24/35.76 [2019-03-28 12:04:17,656 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. 67.24/35.76 [2019-03-28 12:04:17,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 67.24/35.76 [2019-03-28 12:04:17,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. 67.24/35.76 [2019-03-28 12:04:17,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 67.24/35.76 [2019-03-28 12:04:17,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 19 transitions. 67.24/35.76 [2019-03-28 12:04:17,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 67.24/35.76 [2019-03-28 12:04:17,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 67.24/35.76 [2019-03-28 12:04:17,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. 67.24/35.76 [2019-03-28 12:04:17,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 67.24/35.76 [2019-03-28 12:04:17,658 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. 67.24/35.76 [2019-03-28 12:04:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. 67.24/35.76 [2019-03-28 12:04:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 67.24/35.76 [2019-03-28 12:04:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 67.24/35.76 [2019-03-28 12:04:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. 67.24/35.76 [2019-03-28 12:04:17,659 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. 67.24/35.76 [2019-03-28 12:04:17,660 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. 67.24/35.76 [2019-03-28 12:04:17,660 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 67.24/35.76 [2019-03-28 12:04:17,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. 67.24/35.76 [2019-03-28 12:04:17,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 67.24/35.76 [2019-03-28 12:04:17,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 67.24/35.76 [2019-03-28 12:04:17,661 INFO L119 BuchiIsEmpty]: Starting construction of run 67.24/35.76 [2019-03-28 12:04:17,661 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:04:17,661 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 67.24/35.76 [2019-03-28 12:04:17,662 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY [187] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 120#L12 [126] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 117#L12-2 [148] L12-2-->L16: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (store |v_#length_3| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 110#L16 [189] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret11.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (= |v_ULTIMATE.start_main_#t~ret11.base_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#t~ret11.base, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 111#L12-3 [130] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 114#L12-5 [154] L12-5-->L16-2: Formula: (and (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 115#L16-2 [191] L16-2-->L30-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (= |v_ULTIMATE.start_main_#t~ret11.base_7| |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret12.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start_main_#t~ret11.offset_7| |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_main_#t~ret12.offset_5| |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrcmp_#t~mem9=|v_ULTIMATE.start_cstrcmp_#t~mem9_5|, ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_10|, ULTIMATE.start_cstrcmp_#t~mem8=|v_ULTIMATE.start_cstrcmp_#t~mem8_5|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_4|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_4|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_4|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_6|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_6|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_4|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_5|, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_5|, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~ite10=|v_ULTIMATE.start_cstrcmp_#t~ite10_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem9, ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~mem8, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrcmp_~uc1~0, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_main_#t~ret12.offset, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_main_#t~ret12.base, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_#t~ite10, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base] 118#L30-9 67.24/35.76 [2019-03-28 12:04:17,662 INFO L796 eck$LassoCheckResult]: Loop: 118#L30-9 [118] L30-9-->L30-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_10| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3) (= (select |v_#valid_11| v_ULTIMATE.start_cstrcmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 116#L30-1 [167] L30-1-->L30-2: Formula: (and |v_ULTIMATE.start_cstrcmp_#t~short5_2| (< 0 |v_ULTIMATE.start_cstrcmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_2|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5] 113#L30-2 [110] L30-2-->L30-3: Formula: |v_ULTIMATE.start_cstrcmp_#t~short5_3| InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_3|} AuxVars[] AssignedVars[] 112#L30-3 [106] L30-3-->L30-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_cstrcmp_~s1.base_6)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_5) (= 1 (select |v_#valid_13| v_ULTIMATE.start_cstrcmp_~s1.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrcmp_~s1.base_6) v_ULTIMATE.start_cstrcmp_~s1.offset_5) |v_ULTIMATE.start_cstrcmp_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_2|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem3] 108#L30-4 [99] L30-4-->L30-5: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_4 1) (select |v_#length_14| v_ULTIMATE.start_cstrcmp_~s2.base_4)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrcmp_~s2.base_4) v_ULTIMATE.start_cstrcmp_~s2.offset_4) |v_ULTIMATE.start_cstrcmp_#t~mem4_2|) (<= 0 v_ULTIMATE.start_cstrcmp_~s2.offset_4) (= (select |v_#valid_15| v_ULTIMATE.start_cstrcmp_~s2.base_4) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_14|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_4, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_4, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_4, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_14|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem4] 109#L30-5 [184] L30-5-->L30-7: Formula: (and (= |v_ULTIMATE.start_cstrcmp_#t~mem4_3| |v_ULTIMATE.start_cstrcmp_#t~mem3_3|) |v_ULTIMATE.start_cstrcmp_#t~short5_4|) InVars {ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_3|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_4|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_3|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5] 121#L30-7 [123] L30-7-->L30-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_7 1) v_ULTIMATE.start_cstrcmp_~s2.offset_6) (= v_ULTIMATE.start_cstrcmp_~s2.base_8 v_ULTIMATE.start_cstrcmp_~s2.base_7) |v_ULTIMATE.start_cstrcmp_#t~short5_9| (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10)) InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_9|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_7, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_8} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_8|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_2|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_2|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_5|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_5|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4] 118#L30-9 67.24/35.76 [2019-03-28 12:04:17,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:04:17,663 INFO L82 PathProgramCache]: Analyzing trace with hash -342978630, now seen corresponding path program 3 times 67.24/35.76 [2019-03-28 12:04:17,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:04:17,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:04:17,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.24/35.76 [2019-03-28 12:04:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.24/35.76 [2019-03-28 12:04:17,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:04:17,676 INFO L82 PathProgramCache]: Analyzing trace with hash -314990664, now seen corresponding path program 1 times 67.24/35.76 [2019-03-28 12:04:17,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:04:17,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:04:17,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.24/35.76 [2019-03-28 12:04:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.24/35.76 [2019-03-28 12:04:17,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:04:17,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1605737951, now seen corresponding path program 1 times 67.24/35.76 [2019-03-28 12:04:17,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 67.24/35.76 [2019-03-28 12:04:17,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 67.24/35.76 [2019-03-28 12:04:17,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 67.24/35.76 [2019-03-28 12:04:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.24/35.76 [2019-03-28 12:04:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 67.24/35.76 [2019-03-28 12:04:18,070 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 67.24/35.76 [2019-03-28 12:04:18,180 INFO L216 LassoAnalysis]: Preferences: 67.24/35.76 [2019-03-28 12:04:18,181 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 67.24/35.76 [2019-03-28 12:04:18,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 67.24/35.76 [2019-03-28 12:04:18,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 67.24/35.76 [2019-03-28 12:04:18,182 INFO L127 ssoRankerPreferences]: Use exernal solver: false 67.24/35.76 [2019-03-28 12:04:18,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 67.24/35.76 [2019-03-28 12:04:18,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 67.24/35.76 [2019-03-28 12:04:18,182 INFO L130 ssoRankerPreferences]: Path of dumped script: 67.24/35.76 [2019-03-28 12:04:18,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 67.24/35.76 [2019-03-28 12:04:18,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 67.24/35.76 [2019-03-28 12:04:18,183 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 67.24/35.76 [2019-03-28 12:04:18,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,486 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 67.24/35.76 [2019-03-28 12:04:18,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:18,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 67.24/35.76 [2019-03-28 12:04:19,025 INFO L300 LassoAnalysis]: Preprocessing complete. 67.24/35.76 [2019-03-28 12:04:19,030 INFO L497 LassoAnalysis]: Using template 'affine'. 67.24/35.76 [2019-03-28 12:04:19,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 67.24/35.76 [2019-03-28 12:04:19,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 67.24/35.76 [2019-03-28 12:04:19,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 67.24/35.76 Termination analysis: LINEAR_WITH_GUESSES 67.24/35.76 Number of strict supporting invariants: 0 67.24/35.76 Number of non-strict supporting invariants: 1 67.24/35.76 Consider only non-deceasing supporting invariants: true 67.24/35.76 Simplify termination arguments: true 67.24/35.76 Simplify supporting invariants: trueOverapproximate stem: false 67.24/35.76 [2019-03-28 12:04:19,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. 67.24/35.76 [2019-03-28 12:04:19,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 67.24/35.76 [2019-03-28 12:04:19,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 67.24/35.76 [2019-03-28 12:04:19,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 67.24/35.76 [2019-03-28 12:04:19,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 67.24/35.76 [2019-03-28 12:04:19,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 67.24/35.76 [2019-03-28 12:04:19,162 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 67.24/35.76 [2019-03-28 12:04:19,191 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 67.24/35.76 [2019-03-28 12:04:19,192 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. 67.24/35.76 [2019-03-28 12:04:19,194 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 67.24/35.76 [2019-03-28 12:04:19,195 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 67.24/35.76 [2019-03-28 12:04:19,196 INFO L518 LassoAnalysis]: Proved termination. 67.24/35.76 [2019-03-28 12:04:19,196 INFO L520 LassoAnalysis]: Termination argument consisting of: 67.24/35.76 Ranking function f(v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1, ULTIMATE.start_cstrcmp_~s2.offset) = 1*v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1 - 1*ULTIMATE.start_cstrcmp_~s2.offset 67.24/35.76 Supporting invariants [] 67.24/35.76 [2019-03-28 12:04:19,236 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed 67.24/35.76 [2019-03-28 12:04:19,240 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.76 [2019-03-28 12:04:19,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 67.24/35.76 [2019-03-28 12:04:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:19,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjunts are in the unsatisfiable core 67.24/35.76 [2019-03-28 12:04:19,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.76 [2019-03-28 12:04:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:19,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core 67.24/35.76 [2019-03-28 12:04:19,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.76 [2019-03-28 12:04:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 67.24/35.76 [2019-03-28 12:04:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:19,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core 67.24/35.76 [2019-03-28 12:04:19,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.76 [2019-03-28 12:04:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 67.24/35.76 [2019-03-28 12:04:19,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core 67.24/35.76 [2019-03-28 12:04:19,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... 67.24/35.76 [2019-03-28 12:04:19,440 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization 67.24/35.76 [2019-03-28 12:04:19,444 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 5 loop predicates 67.24/35.76 [2019-03-28 12:04:19,445 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. 67.24/35.76 [2019-03-28 12:04:19,540 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 21 states and 28 transitions. Complement of second has 7 states. 67.24/35.76 [2019-03-28 12:04:19,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states 67.24/35.76 [2019-03-28 12:04:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 67.24/35.76 [2019-03-28 12:04:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. 67.24/35.76 [2019-03-28 12:04:19,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 7 letters. Loop has 7 letters. 67.24/35.76 [2019-03-28 12:04:19,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.24/35.76 [2019-03-28 12:04:19,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 14 letters. Loop has 7 letters. 67.24/35.76 [2019-03-28 12:04:19,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.24/35.76 [2019-03-28 12:04:19,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 7 letters. Loop has 14 letters. 67.24/35.76 [2019-03-28 12:04:19,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. 67.24/35.76 [2019-03-28 12:04:19,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. 67.24/35.76 [2019-03-28 12:04:19,553 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 67.24/35.76 [2019-03-28 12:04:19,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. 67.24/35.76 [2019-03-28 12:04:19,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 67.24/35.76 [2019-03-28 12:04:19,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 67.24/35.76 [2019-03-28 12:04:19,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 67.24/35.76 [2019-03-28 12:04:19,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 67.24/35.76 [2019-03-28 12:04:19,553 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 67.24/35.76 [2019-03-28 12:04:19,553 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 67.24/35.76 [2019-03-28 12:04:19,553 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 67.24/35.76 [2019-03-28 12:04:19,554 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 67.24/35.76 [2019-03-28 12:04:19,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 67.24/35.76 [2019-03-28 12:04:19,554 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 67.24/35.76 [2019-03-28 12:04:19,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 67.24/35.76 [2019-03-28 12:04:19,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:04:19 BasicIcfg 67.24/35.76 [2019-03-28 12:04:19,560 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 67.24/35.76 [2019-03-28 12:04:19,560 INFO L168 Benchmark]: Toolchain (without parser) took 31280.28 ms. Allocated memory was 649.6 MB in the beginning and 920.1 MB in the end (delta: 270.5 MB). Free memory was 563.9 MB in the beginning and 756.7 MB in the end (delta: -192.8 MB). Peak memory consumption was 77.7 MB. Max. memory is 50.3 GB. 67.24/35.76 [2019-03-28 12:04:19,561 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 586.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 67.24/35.76 [2019-03-28 12:04:19,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.36 ms. Allocated memory was 649.6 MB in the beginning and 708.3 MB in the end (delta: 58.7 MB). Free memory was 563.9 MB in the beginning and 673.8 MB in the end (delta: -110.0 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. 67.24/35.76 [2019-03-28 12:04:19,562 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.94 ms. Allocated memory is still 708.3 MB. Free memory was 673.8 MB in the beginning and 671.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 67.24/35.76 [2019-03-28 12:04:19,562 INFO L168 Benchmark]: Boogie Preprocessor took 26.79 ms. Allocated memory is still 708.3 MB. Free memory was 671.1 MB in the beginning and 669.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 67.24/35.76 [2019-03-28 12:04:19,562 INFO L168 Benchmark]: RCFGBuilder took 443.61 ms. Allocated memory is still 708.3 MB. Free memory was 669.8 MB in the beginning and 646.1 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 50.3 GB. 67.24/35.76 [2019-03-28 12:04:19,563 INFO L168 Benchmark]: BlockEncodingV2 took 152.26 ms. Allocated memory is still 708.3 MB. Free memory was 646.1 MB in the beginning and 634.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. 67.24/35.76 [2019-03-28 12:04:19,563 INFO L168 Benchmark]: TraceAbstraction took 28114.48 ms. Allocated memory was 708.3 MB in the beginning and 920.6 MB in the end (delta: 212.3 MB). Free memory was 634.2 MB in the beginning and 731.6 MB in the end (delta: -97.4 MB). Peak memory consumption was 417.6 MB. Max. memory is 50.3 GB. 67.24/35.76 [2019-03-28 12:04:19,564 INFO L168 Benchmark]: BuchiAutomizer took 2130.16 ms. Allocated memory was 920.6 MB in the beginning and 920.1 MB in the end (delta: -524.3 kB). Free memory was 731.6 MB in the beginning and 756.7 MB in the end (delta: -25.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 67.24/35.76 [2019-03-28 12:04:19,567 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 67.24/35.76 --- Results --- 67.24/35.76 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 67.24/35.76 - StatisticsResult: Initial Icfg 67.24/35.76 43 locations, 48 edges 67.24/35.76 - StatisticsResult: Encoded RCFG 67.24/35.76 30 locations, 53 edges 67.24/35.76 * Results from de.uni_freiburg.informatik.ultimate.core: 67.24/35.76 - StatisticsResult: Toolchain Benchmarks 67.24/35.76 Benchmark results are: 67.24/35.76 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 586.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 67.24/35.76 * CACSL2BoogieTranslator took 362.36 ms. Allocated memory was 649.6 MB in the beginning and 708.3 MB in the end (delta: 58.7 MB). Free memory was 563.9 MB in the beginning and 673.8 MB in the end (delta: -110.0 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. 67.24/35.76 * Boogie Procedure Inliner took 44.94 ms. Allocated memory is still 708.3 MB. Free memory was 673.8 MB in the beginning and 671.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 67.24/35.76 * Boogie Preprocessor took 26.79 ms. Allocated memory is still 708.3 MB. Free memory was 671.1 MB in the beginning and 669.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 67.24/35.76 * RCFGBuilder took 443.61 ms. Allocated memory is still 708.3 MB. Free memory was 669.8 MB in the beginning and 646.1 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 50.3 GB. 67.24/35.76 * BlockEncodingV2 took 152.26 ms. Allocated memory is still 708.3 MB. Free memory was 646.1 MB in the beginning and 634.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. 67.24/35.76 * TraceAbstraction took 28114.48 ms. Allocated memory was 708.3 MB in the beginning and 920.6 MB in the end (delta: 212.3 MB). Free memory was 634.2 MB in the beginning and 731.6 MB in the end (delta: -97.4 MB). Peak memory consumption was 417.6 MB. Max. memory is 50.3 GB. 67.24/35.76 * BuchiAutomizer took 2130.16 ms. Allocated memory was 920.6 MB in the beginning and 920.1 MB in the end (delta: -524.3 kB). Free memory was 731.6 MB in the beginning and 756.7 MB in the end (delta: -25.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 67.24/35.76 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.76 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #memory_int 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.76 - GenericResult: Unfinished Backtranslation 67.24/35.76 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #memory_int 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #memory_int 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #memory_int 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #memory_int 67.24/35.77 - GenericResult: Unfinished Backtranslation 67.24/35.77 unknown boogie variable #length 67.24/35.77 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 67.24/35.77 - PositiveResult [Line: 30]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - PositiveResult [Line: 30]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - PositiveResult [Line: 16]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - PositiveResult [Line: 37]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - PositiveResult [Line: 16]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - PositiveResult [Line: 16]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - PositiveResult [Line: 37]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - PositiveResult [Line: 36]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - PositiveResult [Line: 16]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - PositiveResult [Line: 36]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - PositiveResult [Line: 30]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - PositiveResult [Line: 30]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - PositiveResult [Line: 30]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - PositiveResult [Line: 30]: pointer dereference always succeeds 67.24/35.77 For all program executions holds that pointer dereference always succeeds at this location 67.24/35.77 - AllSpecificationsHoldResult: All specifications hold 67.24/35.77 14 specifications checked. All of them hold 67.24/35.77 - InvariantResult [Line: 30]: Loop Invariant 67.24/35.77 [2019-03-28 12:04:19,576 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,576 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,581 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,581 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,581 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,581 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,581 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,583 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,583 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,583 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,583 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,583 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,584 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,584 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,584 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,584 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,584 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,585 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,585 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,585 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,585 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,586 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,586 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,586 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,586 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,590 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,590 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,590 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,590 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,591 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,591 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,591 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,593 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,593 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,593 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,593 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,594 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,594 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,594 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,594 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,595 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,595 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,595 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,595 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,598 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,598 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,598 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,598 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,598 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,599 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,599 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,599 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,599 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,599 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 Derived loop invariant: ((((((((((((((((\valid[s2] == 1 && 1 <= length) && nondetString == 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && s1 == 0) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][__VERIFIER_nondet_String()] == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s1]) && s2 == 0) && 0 == unknown-#memory_int-unknown[s1][s1]) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && 0 == __VERIFIER_nondet_String()) && \valid[s1] == 1) || ((((((\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == s1) && 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1]) && (((((((((((\valid[s2] == 1 && 1 <= length) && nondetString == 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && s1 == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s1]) && s2 == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && 0 == __VERIFIER_nondet_String()) && \valid[s1] == 1) && !(nondetString == __VERIFIER_nondet_String())) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1] == 0) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1]) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= 0 && 0 <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[s2] + -1] == 0))) || (((((s1 <= s2 && ((((((((((((\valid[s2] == 1 && 1 <= length) && nondetString == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && \valid[s1] == 1) && 1 <= s1) && \valid[nondetString] == 1) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == s1) && 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1])) && !(nondetString == __VERIFIER_nondet_String())) && s1 + 1 <= unknown-#length-unknown[s1]) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1] == 0) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1]) && 0 == __VERIFIER_nondet_String()) && unknown-#memory_int-unknown[s2][s1 + -1 * s2 + unknown-#length-unknown[s2] + -1] == 0) && s2 + 1 <= unknown-#length-unknown[s2]) && s2 <= s1)) || ((1 == length && (((((((((((\valid[s2] == 1 && 1 <= length) && nondetString == 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && s1 == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s1]) && s2 == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && 0 == __VERIFIER_nondet_String()) && \valid[s1] == 1) && 0 == unknown-#memory_int-unknown[s2][s2]) 67.24/35.77 - InvariantResult [Line: 16]: Loop Invariant 67.24/35.77 [2019-03-28 12:04:19,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 Derived loop invariant: ((1 <= length && nondetString == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1 67.24/35.77 - InvariantResult [Line: 16]: Loop Invariant 67.24/35.77 [2019-03-28 12:04:19,602 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,602 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,602 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,602 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,604 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,604 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,604 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,604 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,604 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,605 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,605 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,605 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 67.24/35.77 [2019-03-28 12:04:19,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 [2019-03-28 12:04:19,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 67.24/35.77 [2019-03-28 12:04:19,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 67.24/35.77 Derived loop invariant: (((!(nondetString == __VERIFIER_nondet_String()) && (((((1 <= length && nondetString == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 0 == __VERIFIER_nondet_String()) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && (\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 : int :: ((0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + -1] && __VERIFIER_nondet_String() <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 <= 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18)) || (1 == length && (((((1 <= length && nondetString == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 0 == __VERIFIER_nondet_String()) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1)) || (((((((1 <= length && nondetString == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 0 == __VERIFIER_nondet_String()) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][__VERIFIER_nondet_String()] == 0) 67.24/35.77 - StatisticsResult: Ultimate Automizer benchmark data 67.24/35.77 CFG has 1 procedures, 30 locations, 14 error locations. SAFE Result, 27.9s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 14.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 201 SDtfs, 3083 SDslu, 1450 SDs, 0 SdLazy, 3672 SolverSat, 418 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=23, 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.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 546 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 21 NumberOfFragments, 537 HoareAnnotationTreeSize, 3 FomulaSimplifications, 540878 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 16936 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 544 ConstructedInterpolants, 68 QuantifiedInterpolants, 144151 SizeOfPredicates, 106 NumberOfNonLiveVariables, 1345 ConjunctsInSsa, 255 ConjunctsInUnsatCore, 35 InterpolantComputations, 17 PerfectInterpolantSequences, 63/221 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 67.24/35.77 - StatisticsResult: Constructed decomposition of program 67.24/35.77 Your program was decomposed into 3 terminating modules (2 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s2 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. 67.24/35.77 - StatisticsResult: Timing statistics 67.24/35.77 BüchiAutomizer plugin needed 2.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 54 SDslu, 63 SDs, 0 SdLazy, 145 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital209 mio100 ax100 hnf100 lsp97 ukn84 mio100 lsp47 div100 bol100 ite100 ukn100 eq197 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 67.24/35.77 - TerminationAnalysisResult: Termination proven 67.24/35.77 Buchi Automizer proved that your program is terminating 67.24/35.77 RESULT: Ultimate proved your program to be correct! 67.24/35.77 !SESSION 2019-03-28 12:03:44.891 ----------------------------------------------- 67.24/35.77 eclipse.buildId=unknown 67.24/35.77 java.version=1.8.0_181 67.24/35.77 java.vendor=Oracle Corporation 67.24/35.77 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 67.24/35.77 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 67.24/35.77 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 67.24/35.77 67.24/35.77 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:04:19.835 67.24/35.77 !MESSAGE The workspace will exit with unsaved changes in this session. 67.24/35.77 Received shutdown request... 67.24/35.77 Ultimate: 67.24/35.77 GTK+ Version Check 67.24/35.77 EOF