69.23/39.96 YES 69.23/39.96 69.23/39.96 Ultimate: Cannot open display: 69.23/39.96 This is Ultimate 0.1.24-8dc7c08-m 69.23/39.96 [2019-03-28 12:42:31,572 INFO L170 SettingsManager]: Resetting all preferences to default values... 69.23/39.96 [2019-03-28 12:42:31,574 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 69.23/39.96 [2019-03-28 12:42:31,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 69.23/39.96 [2019-03-28 12:42:31,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 69.23/39.96 [2019-03-28 12:42:31,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 69.23/39.96 [2019-03-28 12:42:31,588 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 69.23/39.96 [2019-03-28 12:42:31,590 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 69.23/39.96 [2019-03-28 12:42:31,591 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 69.23/39.96 [2019-03-28 12:42:31,592 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 69.23/39.96 [2019-03-28 12:42:31,593 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 69.23/39.96 [2019-03-28 12:42:31,593 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 69.23/39.96 [2019-03-28 12:42:31,594 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 69.23/39.96 [2019-03-28 12:42:31,595 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 69.23/39.96 [2019-03-28 12:42:31,596 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 69.23/39.96 [2019-03-28 12:42:31,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 69.23/39.96 [2019-03-28 12:42:31,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 69.23/39.96 [2019-03-28 12:42:31,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 69.23/39.96 [2019-03-28 12:42:31,601 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 69.23/39.96 [2019-03-28 12:42:31,603 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 69.23/39.96 [2019-03-28 12:42:31,604 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 69.23/39.96 [2019-03-28 12:42:31,605 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 69.23/39.96 [2019-03-28 12:42:31,607 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 69.23/39.96 [2019-03-28 12:42:31,607 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 69.23/39.96 [2019-03-28 12:42:31,607 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 69.23/39.96 [2019-03-28 12:42:31,608 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 69.23/39.96 [2019-03-28 12:42:31,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 69.23/39.96 [2019-03-28 12:42:31,610 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 69.23/39.96 [2019-03-28 12:42:31,610 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 69.23/39.96 [2019-03-28 12:42:31,611 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 69.23/39.96 [2019-03-28 12:42:31,611 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 69.23/39.96 [2019-03-28 12:42:31,612 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 69.23/39.96 [2019-03-28 12:42:31,613 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 69.23/39.96 [2019-03-28 12:42:31,613 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 69.23/39.96 [2019-03-28 12:42:31,614 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 69.23/39.96 [2019-03-28 12:42:31,614 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 69.23/39.96 [2019-03-28 12:42:31,614 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 69.23/39.96 [2019-03-28 12:42:31,615 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 69.23/39.96 [2019-03-28 12:42:31,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 69.23/39.96 [2019-03-28 12:42:31,616 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 69.23/39.96 [2019-03-28 12:42:31,631 INFO L110 SettingsManager]: Loading preferences was successful 69.23/39.96 [2019-03-28 12:42:31,632 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 69.23/39.96 [2019-03-28 12:42:31,633 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 69.23/39.96 [2019-03-28 12:42:31,633 INFO L133 SettingsManager]: * Rewrite not-equals=true 69.23/39.96 [2019-03-28 12:42:31,633 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 69.23/39.96 [2019-03-28 12:42:31,633 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 69.23/39.96 [2019-03-28 12:42:31,634 INFO L133 SettingsManager]: * Use SBE=true 69.23/39.96 [2019-03-28 12:42:31,634 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 69.23/39.96 [2019-03-28 12:42:31,634 INFO L133 SettingsManager]: * Use old map elimination=false 69.23/39.96 [2019-03-28 12:42:31,634 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 69.23/39.96 [2019-03-28 12:42:31,634 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 69.23/39.96 [2019-03-28 12:42:31,635 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 69.23/39.96 [2019-03-28 12:42:31,635 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 69.23/39.96 [2019-03-28 12:42:31,635 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 69.23/39.96 [2019-03-28 12:42:31,635 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 69.23/39.96 [2019-03-28 12:42:31,635 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 69.23/39.96 [2019-03-28 12:42:31,635 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 69.23/39.96 [2019-03-28 12:42:31,636 INFO L133 SettingsManager]: * Check division by zero=IGNORE 69.23/39.96 [2019-03-28 12:42:31,636 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 69.23/39.96 [2019-03-28 12:42:31,636 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 69.23/39.96 [2019-03-28 12:42:31,636 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 69.23/39.96 [2019-03-28 12:42:31,637 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 69.23/39.96 [2019-03-28 12:42:31,637 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 69.23/39.96 [2019-03-28 12:42:31,637 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 69.23/39.96 [2019-03-28 12:42:31,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 69.23/39.96 [2019-03-28 12:42:31,637 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 69.23/39.96 [2019-03-28 12:42:31,637 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 69.23/39.96 [2019-03-28 12:42:31,638 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 69.23/39.96 [2019-03-28 12:42:31,638 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 69.23/39.96 [2019-03-28 12:42:31,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 69.23/39.96 [2019-03-28 12:42:31,678 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 69.23/39.96 [2019-03-28 12:42:31,681 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 69.23/39.96 [2019-03-28 12:42:31,683 INFO L271 PluginConnector]: Initializing CDTParser... 69.23/39.96 [2019-03-28 12:42:31,683 INFO L276 PluginConnector]: CDTParser initialized 69.23/39.96 [2019-03-28 12:42:31,684 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 69.23/39.96 [2019-03-28 12:42:31,744 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/ad76ab29f2024814afbf932fc445f341/FLAG12579cb85 69.23/39.96 [2019-03-28 12:42:32,088 INFO L307 CDTParser]: Found 1 translation units. 69.23/39.96 [2019-03-28 12:42:32,089 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 69.23/39.96 [2019-03-28 12:42:32,090 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 69.23/39.96 [2019-03-28 12:42:32,096 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/ad76ab29f2024814afbf932fc445f341/FLAG12579cb85 69.23/39.96 [2019-03-28 12:42:32,528 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/ad76ab29f2024814afbf932fc445f341 69.23/39.96 [2019-03-28 12:42:32,540 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 69.23/39.96 [2019-03-28 12:42:32,541 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 69.23/39.96 [2019-03-28 12:42:32,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 69.23/39.96 [2019-03-28 12:42:32,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 69.23/39.96 [2019-03-28 12:42:32,546 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 69.23/39.96 [2019-03-28 12:42:32,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:42:32" (1/1) ... 69.23/39.96 [2019-03-28 12:42:32,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed7c10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:32, skipping insertion in model container 69.23/39.96 [2019-03-28 12:42:32,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:42:32" (1/1) ... 69.23/39.96 [2019-03-28 12:42:32,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 69.23/39.96 [2019-03-28 12:42:32,577 INFO L176 MainTranslator]: Built tables and reachable declarations 69.23/39.96 [2019-03-28 12:42:32,748 INFO L206 PostProcessor]: Analyzing one entry point: main 69.23/39.96 [2019-03-28 12:42:32,760 INFO L191 MainTranslator]: Completed pre-run 69.23/39.96 [2019-03-28 12:42:32,780 INFO L206 PostProcessor]: Analyzing one entry point: main 69.23/39.96 [2019-03-28 12:42:32,865 INFO L195 MainTranslator]: Completed translation 69.23/39.96 [2019-03-28 12:42:32,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:32 WrapperNode 69.23/39.96 [2019-03-28 12:42:32,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 69.23/39.96 [2019-03-28 12:42:32,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 69.23/39.96 [2019-03-28 12:42:32,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 69.23/39.96 [2019-03-28 12:42:32,867 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 69.23/39.96 [2019-03-28 12:42:32,877 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:42:32" (1/1) ... 69.23/39.96 [2019-03-28 12:42:32,887 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:42:32" (1/1) ... 69.23/39.96 [2019-03-28 12:42:32,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 69.23/39.96 [2019-03-28 12:42:32,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 69.23/39.96 [2019-03-28 12:42:32,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 69.23/39.96 [2019-03-28 12:42:32,912 INFO L276 PluginConnector]: Boogie Preprocessor initialized 69.23/39.96 [2019-03-28 12:42:32,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:32" (1/1) ... 69.23/39.96 [2019-03-28 12:42:32,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:32" (1/1) ... 69.23/39.96 [2019-03-28 12:42:32,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:32" (1/1) ... 69.23/39.96 [2019-03-28 12:42:32,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:32" (1/1) ... 69.23/39.96 [2019-03-28 12:42:32,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:32" (1/1) ... 69.23/39.96 [2019-03-28 12:42:32,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:32" (1/1) ... 69.23/39.96 [2019-03-28 12:42:32,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:32" (1/1) ... 69.23/39.96 [2019-03-28 12:42:32,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 69.23/39.96 [2019-03-28 12:42:32,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 69.23/39.96 [2019-03-28 12:42:32,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... 69.23/39.96 [2019-03-28 12:42:32,939 INFO L276 PluginConnector]: RCFGBuilder initialized 69.23/39.96 [2019-03-28 12:42:32,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:32" (1/1) ... 69.23/39.96 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 69.23/39.96 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 69.23/39.96 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 69.23/39.96 [2019-03-28 12:42:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 69.23/39.96 [2019-03-28 12:42:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 69.23/39.96 [2019-03-28 12:42:33,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 69.23/39.96 [2019-03-28 12:42:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 69.23/39.96 [2019-03-28 12:42:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 69.23/39.96 [2019-03-28 12:42:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 69.23/39.96 [2019-03-28 12:42:33,288 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 69.23/39.96 [2019-03-28 12:42:33,289 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 69.23/39.96 [2019-03-28 12:42:33,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:42:33 BoogieIcfgContainer 69.23/39.96 [2019-03-28 12:42:33,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 69.23/39.96 [2019-03-28 12:42:33,291 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 69.23/39.96 [2019-03-28 12:42:33,291 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 69.23/39.96 [2019-03-28 12:42:33,293 INFO L276 PluginConnector]: BlockEncodingV2 initialized 69.23/39.96 [2019-03-28 12:42:33,294 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:42:33" (1/1) ... 69.23/39.96 [2019-03-28 12:42:33,313 INFO L313 BlockEncoder]: Initial Icfg 36 locations, 40 edges 69.23/39.96 [2019-03-28 12:42:33,315 INFO L258 BlockEncoder]: Using Remove infeasible edges 69.23/39.96 [2019-03-28 12:42:33,316 INFO L263 BlockEncoder]: Using Maximize final states 69.23/39.96 [2019-03-28 12:42:33,316 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 69.23/39.96 [2019-03-28 12:42:33,317 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 69.23/39.96 [2019-03-28 12:42:33,319 INFO L296 BlockEncoder]: Using Remove sink states 69.23/39.96 [2019-03-28 12:42:33,319 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 69.23/39.96 [2019-03-28 12:42:33,320 INFO L179 BlockEncoder]: Using Rewrite not-equals 69.23/39.96 [2019-03-28 12:42:33,348 INFO L185 BlockEncoder]: Using Use SBE 69.23/39.96 [2019-03-28 12:42:33,378 INFO L200 BlockEncoder]: SBE split 17 edges 69.23/39.96 [2019-03-28 12:42:33,384 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 69.23/39.96 [2019-03-28 12:42:33,385 INFO L71 MaximizeFinalStates]: 0 new accepting states 69.23/39.96 [2019-03-28 12:42:33,418 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 69.23/39.96 [2019-03-28 12:42:33,421 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 69.23/39.96 [2019-03-28 12:42:33,422 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 69.23/39.96 [2019-03-28 12:42:33,423 INFO L71 MaximizeFinalStates]: 0 new accepting states 69.23/39.96 [2019-03-28 12:42:33,423 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 69.23/39.96 [2019-03-28 12:42:33,424 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 69.23/39.96 [2019-03-28 12:42:33,424 INFO L313 BlockEncoder]: Encoded RCFG 27 locations, 48 edges 69.23/39.96 [2019-03-28 12:42:33,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:42:33 BasicIcfg 69.23/39.96 [2019-03-28 12:42:33,425 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 69.23/39.96 [2019-03-28 12:42:33,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 69.23/39.96 [2019-03-28 12:42:33,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... 69.23/39.96 [2019-03-28 12:42:33,429 INFO L276 PluginConnector]: TraceAbstraction initialized 69.23/39.96 [2019-03-28 12:42:33,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:42:32" (1/4) ... 69.23/39.96 [2019-03-28 12:42:33,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd0591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:42:33, skipping insertion in model container 69.23/39.96 [2019-03-28 12:42:33,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:32" (2/4) ... 69.23/39.96 [2019-03-28 12:42:33,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd0591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:42:33, skipping insertion in model container 69.23/39.96 [2019-03-28 12:42:33,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:42:33" (3/4) ... 69.23/39.96 [2019-03-28 12:42:33,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd0591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:42:33, skipping insertion in model container 69.23/39.96 [2019-03-28 12:42:33,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:42:33" (4/4) ... 69.23/39.96 [2019-03-28 12:42:33,433 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 69.23/39.96 [2019-03-28 12:42:33,443 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 69.23/39.96 [2019-03-28 12:42:33,451 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. 69.23/39.96 [2019-03-28 12:42:33,468 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. 69.23/39.96 [2019-03-28 12:42:33,497 INFO L133 ementStrategyFactory]: Using default assertion order modulation 69.23/39.96 [2019-03-28 12:42:33,498 INFO L382 AbstractCegarLoop]: Interprodecural is true 69.23/39.96 [2019-03-28 12:42:33,498 INFO L383 AbstractCegarLoop]: Hoare is true 69.23/39.96 [2019-03-28 12:42:33,499 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 69.23/39.96 [2019-03-28 12:42:33,499 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 69.23/39.96 [2019-03-28 12:42:33,499 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 69.23/39.96 [2019-03-28 12:42:33,499 INFO L387 AbstractCegarLoop]: Difference is false 69.23/39.96 [2019-03-28 12:42:33,499 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 69.23/39.96 [2019-03-28 12:42:33,499 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 69.23/39.96 [2019-03-28 12:42:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. 69.23/39.96 [2019-03-28 12:42:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 69.23/39.96 [2019-03-28 12:42:33,521 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:33,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:33,522 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:33,527 INFO L82 PathProgramCache]: Analyzing trace with hash 177628423, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:33,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:33,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:33,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:33,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:33,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:33,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:33,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 69.23/39.96 [2019-03-28 12:42:33,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 69.23/39.96 [2019-03-28 12:42:33,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 69.23/39.96 [2019-03-28 12:42:33,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 69.23/39.96 [2019-03-28 12:42:33,751 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. 69.23/39.96 [2019-03-28 12:42:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:33,877 INFO L93 Difference]: Finished difference Result 28 states and 48 transitions. 69.23/39.96 [2019-03-28 12:42:33,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 69.23/39.96 [2019-03-28 12:42:33,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 69.23/39.96 [2019-03-28 12:42:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:33,892 INFO L225 Difference]: With dead ends: 28 69.23/39.96 [2019-03-28 12:42:33,892 INFO L226 Difference]: Without dead ends: 27 69.23/39.96 [2019-03-28 12:42:33,896 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 69.23/39.96 [2019-03-28 12:42:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 69.23/39.96 [2019-03-28 12:42:33,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 69.23/39.96 [2019-03-28 12:42:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 69.23/39.96 [2019-03-28 12:42:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. 69.23/39.96 [2019-03-28 12:42:33,936 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 5 69.23/39.96 [2019-03-28 12:42:33,937 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:33,937 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. 69.23/39.96 [2019-03-28 12:42:33,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 69.23/39.96 [2019-03-28 12:42:33,937 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. 69.23/39.96 [2019-03-28 12:42:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 69.23/39.96 [2019-03-28 12:42:33,938 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:33,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:33,938 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:33,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:33,939 INFO L82 PathProgramCache]: Analyzing trace with hash 177628424, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:33,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:33,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:33,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:33,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:33,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:33,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:33,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 69.23/39.96 [2019-03-28 12:42:33,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 69.23/39.96 [2019-03-28 12:42:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 69.23/39.96 [2019-03-28 12:42:33,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 69.23/39.96 [2019-03-28 12:42:33,982 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand 4 states. 69.23/39.96 [2019-03-28 12:42:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:34,055 INFO L93 Difference]: Finished difference Result 27 states and 47 transitions. 69.23/39.96 [2019-03-28 12:42:34,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:34,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 69.23/39.96 [2019-03-28 12:42:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:34,057 INFO L225 Difference]: With dead ends: 27 69.23/39.96 [2019-03-28 12:42:34,057 INFO L226 Difference]: Without dead ends: 26 69.23/39.96 [2019-03-28 12:42:34,058 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 69.23/39.96 [2019-03-28 12:42:34,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 69.23/39.96 [2019-03-28 12:42:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 69.23/39.96 [2019-03-28 12:42:34,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 69.23/39.96 [2019-03-28 12:42:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 46 transitions. 69.23/39.96 [2019-03-28 12:42:34,063 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 46 transitions. Word has length 5 69.23/39.96 [2019-03-28 12:42:34,063 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:34,063 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 46 transitions. 69.23/39.96 [2019-03-28 12:42:34,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 46 transitions. 69.23/39.96 [2019-03-28 12:42:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 69.23/39.96 [2019-03-28 12:42:34,064 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:34,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:34,064 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:34,065 INFO L82 PathProgramCache]: Analyzing trace with hash 177628421, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:34,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:34,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:34,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:34,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:34,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 69.23/39.96 [2019-03-28 12:42:34,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 69.23/39.96 [2019-03-28 12:42:34,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 69.23/39.96 [2019-03-28 12:42:34,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 69.23/39.96 [2019-03-28 12:42:34,096 INFO L87 Difference]: Start difference. First operand 26 states and 46 transitions. Second operand 3 states. 69.23/39.96 [2019-03-28 12:42:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:34,179 INFO L93 Difference]: Finished difference Result 26 states and 46 transitions. 69.23/39.96 [2019-03-28 12:42:34,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 69.23/39.96 [2019-03-28 12:42:34,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 69.23/39.96 [2019-03-28 12:42:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:34,180 INFO L225 Difference]: With dead ends: 26 69.23/39.96 [2019-03-28 12:42:34,181 INFO L226 Difference]: Without dead ends: 25 69.23/39.96 [2019-03-28 12:42:34,181 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 69.23/39.96 [2019-03-28 12:42:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 69.23/39.96 [2019-03-28 12:42:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 69.23/39.96 [2019-03-28 12:42:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 69.23/39.96 [2019-03-28 12:42:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. 69.23/39.96 [2019-03-28 12:42:34,185 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 5 69.23/39.96 [2019-03-28 12:42:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:34,186 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 44 transitions. 69.23/39.96 [2019-03-28 12:42:34,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 69.23/39.96 [2019-03-28 12:42:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 44 transitions. 69.23/39.96 [2019-03-28 12:42:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 69.23/39.96 [2019-03-28 12:42:34,186 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:34,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:34,187 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:34,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:34,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1211512521, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:34,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:34,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:34,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:34,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:34,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 69.23/39.96 [2019-03-28 12:42:34,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 69.23/39.96 [2019-03-28 12:42:34,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 69.23/39.96 [2019-03-28 12:42:34,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 69.23/39.96 [2019-03-28 12:42:34,231 INFO L87 Difference]: Start difference. First operand 25 states and 44 transitions. Second operand 3 states. 69.23/39.96 [2019-03-28 12:42:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:34,287 INFO L93 Difference]: Finished difference Result 25 states and 44 transitions. 69.23/39.96 [2019-03-28 12:42:34,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 69.23/39.96 [2019-03-28 12:42:34,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 69.23/39.96 [2019-03-28 12:42:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:34,289 INFO L225 Difference]: With dead ends: 25 69.23/39.96 [2019-03-28 12:42:34,289 INFO L226 Difference]: Without dead ends: 24 69.23/39.96 [2019-03-28 12:42:34,289 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 69.23/39.96 [2019-03-28 12:42:34,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 69.23/39.96 [2019-03-28 12:42:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 69.23/39.96 [2019-03-28 12:42:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 69.23/39.96 [2019-03-28 12:42:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 42 transitions. 69.23/39.96 [2019-03-28 12:42:34,293 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 42 transitions. Word has length 6 69.23/39.96 [2019-03-28 12:42:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:34,293 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 42 transitions. 69.23/39.96 [2019-03-28 12:42:34,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 69.23/39.96 [2019-03-28 12:42:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 42 transitions. 69.23/39.96 [2019-03-28 12:42:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 69.23/39.96 [2019-03-28 12:42:34,294 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:34,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:34,294 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:34,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:34,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1211512523, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:34,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:34,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:34,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:34,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 69.23/39.96 [2019-03-28 12:42:34,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 69.23/39.96 [2019-03-28 12:42:34,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 69.23/39.96 [2019-03-28 12:42:34,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 69.23/39.96 [2019-03-28 12:42:34,331 INFO L87 Difference]: Start difference. First operand 24 states and 42 transitions. Second operand 3 states. 69.23/39.96 [2019-03-28 12:42:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:34,408 INFO L93 Difference]: Finished difference Result 25 states and 42 transitions. 69.23/39.96 [2019-03-28 12:42:34,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 69.23/39.96 [2019-03-28 12:42:34,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 69.23/39.96 [2019-03-28 12:42:34,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:34,409 INFO L225 Difference]: With dead ends: 25 69.23/39.96 [2019-03-28 12:42:34,410 INFO L226 Difference]: Without dead ends: 24 69.23/39.96 [2019-03-28 12:42:34,410 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 69.23/39.96 [2019-03-28 12:42:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 69.23/39.96 [2019-03-28 12:42:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 69.23/39.96 [2019-03-28 12:42:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 69.23/39.96 [2019-03-28 12:42:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. 69.23/39.96 [2019-03-28 12:42:34,414 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 41 transitions. Word has length 6 69.23/39.96 [2019-03-28 12:42:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:34,414 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 41 transitions. 69.23/39.96 [2019-03-28 12:42:34,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 69.23/39.96 [2019-03-28 12:42:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. 69.23/39.96 [2019-03-28 12:42:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 69.23/39.96 [2019-03-28 12:42:34,415 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:34,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:34,415 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:34,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:34,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1211512524, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:34,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:34,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:34,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:34,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:34,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 69.23/39.96 [2019-03-28 12:42:34,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 69.23/39.96 [2019-03-28 12:42:34,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 69.23/39.96 [2019-03-28 12:42:34,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 69.23/39.96 [2019-03-28 12:42:34,452 INFO L87 Difference]: Start difference. First operand 24 states and 41 transitions. Second operand 4 states. 69.23/39.96 [2019-03-28 12:42:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:34,523 INFO L93 Difference]: Finished difference Result 24 states and 41 transitions. 69.23/39.96 [2019-03-28 12:42:34,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:34,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 69.23/39.96 [2019-03-28 12:42:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:34,524 INFO L225 Difference]: With dead ends: 24 69.23/39.96 [2019-03-28 12:42:34,524 INFO L226 Difference]: Without dead ends: 23 69.23/39.96 [2019-03-28 12:42:34,525 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 69.23/39.96 [2019-03-28 12:42:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 69.23/39.96 [2019-03-28 12:42:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 69.23/39.96 [2019-03-28 12:42:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 69.23/39.96 [2019-03-28 12:42:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. 69.23/39.96 [2019-03-28 12:42:34,528 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 6 69.23/39.96 [2019-03-28 12:42:34,528 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:34,529 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 40 transitions. 69.23/39.96 [2019-03-28 12:42:34,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 40 transitions. 69.23/39.96 [2019-03-28 12:42:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 69.23/39.96 [2019-03-28 12:42:34,529 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:34,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:34,530 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:34,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:34,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1097816480, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:34,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:34,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:34,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:34,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:34,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 69.23/39.96 [2019-03-28 12:42:34,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 69.23/39.96 [2019-03-28 12:42:34,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 69.23/39.96 [2019-03-28 12:42:34,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 69.23/39.96 [2019-03-28 12:42:34,590 INFO L87 Difference]: Start difference. First operand 23 states and 40 transitions. Second operand 4 states. 69.23/39.96 [2019-03-28 12:42:34,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:34,677 INFO L93 Difference]: Finished difference Result 23 states and 40 transitions. 69.23/39.96 [2019-03-28 12:42:34,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:34,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 69.23/39.96 [2019-03-28 12:42:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:34,679 INFO L225 Difference]: With dead ends: 23 69.23/39.96 [2019-03-28 12:42:34,679 INFO L226 Difference]: Without dead ends: 21 69.23/39.96 [2019-03-28 12:42:34,679 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 69.23/39.96 [2019-03-28 12:42:34,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 69.23/39.96 [2019-03-28 12:42:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 69.23/39.96 [2019-03-28 12:42:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 69.23/39.96 [2019-03-28 12:42:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. 69.23/39.96 [2019-03-28 12:42:34,682 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 7 69.23/39.96 [2019-03-28 12:42:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:34,683 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. 69.23/39.96 [2019-03-28 12:42:34,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. 69.23/39.96 [2019-03-28 12:42:34,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 69.23/39.96 [2019-03-28 12:42:34,683 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:34,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:34,684 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:34,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:34,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1097816478, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:34,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:34,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:34,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:34,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:34,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 69.23/39.96 [2019-03-28 12:42:34,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 69.23/39.96 [2019-03-28 12:42:34,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 69.23/39.96 [2019-03-28 12:42:34,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 69.23/39.96 [2019-03-28 12:42:34,719 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 4 states. 69.23/39.96 [2019-03-28 12:42:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:34,810 INFO L93 Difference]: Finished difference Result 34 states and 54 transitions. 69.23/39.96 [2019-03-28 12:42:34,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:34,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 69.23/39.96 [2019-03-28 12:42:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:34,812 INFO L225 Difference]: With dead ends: 34 69.23/39.96 [2019-03-28 12:42:34,812 INFO L226 Difference]: Without dead ends: 32 69.23/39.96 [2019-03-28 12:42:34,812 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 69.23/39.96 [2019-03-28 12:42:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 69.23/39.96 [2019-03-28 12:42:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. 69.23/39.96 [2019-03-28 12:42:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 69.23/39.96 [2019-03-28 12:42:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 48 transitions. 69.23/39.96 [2019-03-28 12:42:34,818 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 48 transitions. Word has length 7 69.23/39.96 [2019-03-28 12:42:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:34,818 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 48 transitions. 69.23/39.96 [2019-03-28 12:42:34,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 48 transitions. 69.23/39.96 [2019-03-28 12:42:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 69.23/39.96 [2019-03-28 12:42:34,819 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:34,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:34,820 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:34,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:34,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1097816477, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:34,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:34,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:34,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:34,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:34,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 69.23/39.96 [2019-03-28 12:42:34,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 69.23/39.96 [2019-03-28 12:42:34,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 69.23/39.96 [2019-03-28 12:42:34,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 69.23/39.96 [2019-03-28 12:42:34,884 INFO L87 Difference]: Start difference. First operand 25 states and 48 transitions. Second operand 6 states. 69.23/39.96 [2019-03-28 12:42:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:34,987 INFO L93 Difference]: Finished difference Result 32 states and 52 transitions. 69.23/39.96 [2019-03-28 12:42:34,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 69.23/39.96 [2019-03-28 12:42:34,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 69.23/39.96 [2019-03-28 12:42:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:34,989 INFO L225 Difference]: With dead ends: 32 69.23/39.96 [2019-03-28 12:42:34,989 INFO L226 Difference]: Without dead ends: 30 69.23/39.96 [2019-03-28 12:42:34,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 69.23/39.96 [2019-03-28 12:42:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 69.23/39.96 [2019-03-28 12:42:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. 69.23/39.96 [2019-03-28 12:42:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 69.23/39.96 [2019-03-28 12:42:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. 69.23/39.96 [2019-03-28 12:42:34,993 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 46 transitions. Word has length 7 69.23/39.96 [2019-03-28 12:42:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:34,994 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 46 transitions. 69.23/39.96 [2019-03-28 12:42:34,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 69.23/39.96 [2019-03-28 12:42:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 46 transitions. 69.23/39.96 [2019-03-28 12:42:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 69.23/39.96 [2019-03-28 12:42:34,995 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:34,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:34,995 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:34,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:34,996 INFO L82 PathProgramCache]: Analyzing trace with hash 327428438, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:34,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:34,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:34,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:34,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:35,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:35,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 69.23/39.96 [2019-03-28 12:42:35,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 69.23/39.96 [2019-03-28 12:42:35,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 69.23/39.96 [2019-03-28 12:42:35,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 69.23/39.96 [2019-03-28 12:42:35,058 INFO L87 Difference]: Start difference. First operand 25 states and 46 transitions. Second operand 6 states. 69.23/39.96 [2019-03-28 12:42:35,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:35,184 INFO L93 Difference]: Finished difference Result 27 states and 46 transitions. 69.23/39.96 [2019-03-28 12:42:35,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 69.23/39.96 [2019-03-28 12:42:35,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 69.23/39.96 [2019-03-28 12:42:35,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:35,185 INFO L225 Difference]: With dead ends: 27 69.23/39.96 [2019-03-28 12:42:35,185 INFO L226 Difference]: Without dead ends: 26 69.23/39.96 [2019-03-28 12:42:35,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 69.23/39.96 [2019-03-28 12:42:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 69.23/39.96 [2019-03-28 12:42:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. 69.23/39.96 [2019-03-28 12:42:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 69.23/39.96 [2019-03-28 12:42:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. 69.23/39.96 [2019-03-28 12:42:35,191 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 8 69.23/39.96 [2019-03-28 12:42:35,191 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:35,191 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 44 transitions. 69.23/39.96 [2019-03-28 12:42:35,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 69.23/39.96 [2019-03-28 12:42:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 44 transitions. 69.23/39.96 [2019-03-28 12:42:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 69.23/39.96 [2019-03-28 12:42:35,192 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:35,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:35,192 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:35,192 INFO L82 PathProgramCache]: Analyzing trace with hash 327428436, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:35,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:35,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:35,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:35,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:35,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 69.23/39.96 [2019-03-28 12:42:35,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 69.23/39.96 [2019-03-28 12:42:35,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 69.23/39.96 [2019-03-28 12:42:35,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 69.23/39.96 [2019-03-28 12:42:35,225 INFO L87 Difference]: Start difference. First operand 25 states and 44 transitions. Second operand 4 states. 69.23/39.96 [2019-03-28 12:42:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:35,298 INFO L93 Difference]: Finished difference Result 25 states and 44 transitions. 69.23/39.96 [2019-03-28 12:42:35,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:35,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 69.23/39.96 [2019-03-28 12:42:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:35,299 INFO L225 Difference]: With dead ends: 25 69.23/39.96 [2019-03-28 12:42:35,299 INFO L226 Difference]: Without dead ends: 24 69.23/39.96 [2019-03-28 12:42:35,300 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 69.23/39.96 [2019-03-28 12:42:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 69.23/39.96 [2019-03-28 12:42:35,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 69.23/39.96 [2019-03-28 12:42:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 69.23/39.96 [2019-03-28 12:42:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 40 transitions. 69.23/39.96 [2019-03-28 12:42:35,304 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 40 transitions. Word has length 8 69.23/39.96 [2019-03-28 12:42:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:35,304 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 40 transitions. 69.23/39.96 [2019-03-28 12:42:35,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 40 transitions. 69.23/39.96 [2019-03-28 12:42:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 69.23/39.96 [2019-03-28 12:42:35,305 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:35,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:35,305 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:35,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1126074271, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:35,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:35,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:35,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:35,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:35,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 69.23/39.96 [2019-03-28 12:42:35,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 69.23/39.96 [2019-03-28 12:42:35,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 69.23/39.96 [2019-03-28 12:42:35,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 69.23/39.96 [2019-03-28 12:42:35,351 INFO L87 Difference]: Start difference. First operand 24 states and 40 transitions. Second operand 4 states. 69.23/39.96 [2019-03-28 12:42:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:35,415 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. 69.23/39.96 [2019-03-28 12:42:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:35,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 69.23/39.96 [2019-03-28 12:42:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:35,416 INFO L225 Difference]: With dead ends: 24 69.23/39.96 [2019-03-28 12:42:35,416 INFO L226 Difference]: Without dead ends: 23 69.23/39.96 [2019-03-28 12:42:35,417 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 69.23/39.96 [2019-03-28 12:42:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 69.23/39.96 [2019-03-28 12:42:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 69.23/39.96 [2019-03-28 12:42:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 69.23/39.96 [2019-03-28 12:42:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. 69.23/39.96 [2019-03-28 12:42:35,420 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 10 69.23/39.96 [2019-03-28 12:42:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:35,420 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. 69.23/39.96 [2019-03-28 12:42:35,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. 69.23/39.96 [2019-03-28 12:42:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 69.23/39.96 [2019-03-28 12:42:35,421 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:35,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:35,422 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:35,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:35,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1126074273, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:35,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:35,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:35,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:35,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 69.23/39.96 [2019-03-28 12:42:35,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 69.23/39.96 [2019-03-28 12:42:35,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 69.23/39.96 [2019-03-28 12:42:35,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 69.23/39.96 [2019-03-28 12:42:35,503 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 7 states. 69.23/39.96 [2019-03-28 12:42:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:35,628 INFO L93 Difference]: Finished difference Result 29 states and 47 transitions. 69.23/39.96 [2019-03-28 12:42:35,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 69.23/39.96 [2019-03-28 12:42:35,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 69.23/39.96 [2019-03-28 12:42:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:35,631 INFO L225 Difference]: With dead ends: 29 69.23/39.96 [2019-03-28 12:42:35,631 INFO L226 Difference]: Without dead ends: 28 69.23/39.96 [2019-03-28 12:42:35,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 69.23/39.96 [2019-03-28 12:42:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 69.23/39.96 [2019-03-28 12:42:35,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. 69.23/39.96 [2019-03-28 12:42:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 69.23/39.96 [2019-03-28 12:42:35,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. 69.23/39.96 [2019-03-28 12:42:35,635 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 10 69.23/39.96 [2019-03-28 12:42:35,636 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:35,636 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. 69.23/39.96 [2019-03-28 12:42:35,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 69.23/39.96 [2019-03-28 12:42:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. 69.23/39.96 [2019-03-28 12:42:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 69.23/39.96 [2019-03-28 12:42:35,637 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:35,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:35,637 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:35,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:35,637 INFO L82 PathProgramCache]: Analyzing trace with hash 548616352, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:35,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:35,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:35,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:35,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 69.23/39.96 [2019-03-28 12:42:35,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 69.23/39.96 [2019-03-28 12:42:35,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 69.23/39.96 [2019-03-28 12:42:35,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 69.23/39.96 [2019-03-28 12:42:35,670 INFO L87 Difference]: Start difference. First operand 24 states and 39 transitions. Second operand 4 states. 69.23/39.96 [2019-03-28 12:42:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:35,732 INFO L93 Difference]: Finished difference Result 24 states and 39 transitions. 69.23/39.96 [2019-03-28 12:42:35,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:35,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 69.23/39.96 [2019-03-28 12:42:35,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:35,733 INFO L225 Difference]: With dead ends: 24 69.23/39.96 [2019-03-28 12:42:35,733 INFO L226 Difference]: Without dead ends: 23 69.23/39.96 [2019-03-28 12:42:35,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 69.23/39.96 [2019-03-28 12:42:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 69.23/39.96 [2019-03-28 12:42:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 69.23/39.96 [2019-03-28 12:42:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 69.23/39.96 [2019-03-28 12:42:35,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. 69.23/39.96 [2019-03-28 12:42:35,737 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 37 transitions. Word has length 11 69.23/39.96 [2019-03-28 12:42:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:35,737 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 37 transitions. 69.23/39.96 [2019-03-28 12:42:35,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 69.23/39.96 [2019-03-28 12:42:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 37 transitions. 69.23/39.96 [2019-03-28 12:42:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 69.23/39.96 [2019-03-28 12:42:35,738 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:35,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:35,738 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:35,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:35,738 INFO L82 PathProgramCache]: Analyzing trace with hash 548616354, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:35,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:35,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:35,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:35,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:35,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 69.23/39.96 [2019-03-28 12:42:35,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 69.23/39.96 [2019-03-28 12:42:35,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 69.23/39.96 [2019-03-28 12:42:35,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 69.23/39.96 [2019-03-28 12:42:35,798 INFO L87 Difference]: Start difference. First operand 23 states and 37 transitions. Second operand 7 states. 69.23/39.96 [2019-03-28 12:42:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:35,918 INFO L93 Difference]: Finished difference Result 24 states and 37 transitions. 69.23/39.96 [2019-03-28 12:42:35,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 69.23/39.96 [2019-03-28 12:42:35,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 69.23/39.96 [2019-03-28 12:42:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:35,919 INFO L225 Difference]: With dead ends: 24 69.23/39.96 [2019-03-28 12:42:35,919 INFO L226 Difference]: Without dead ends: 23 69.23/39.96 [2019-03-28 12:42:35,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 69.23/39.96 [2019-03-28 12:42:35,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 69.23/39.96 [2019-03-28 12:42:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 69.23/39.96 [2019-03-28 12:42:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 69.23/39.96 [2019-03-28 12:42:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. 69.23/39.96 [2019-03-28 12:42:35,922 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 11 69.23/39.96 [2019-03-28 12:42:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:35,923 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 36 transitions. 69.23/39.96 [2019-03-28 12:42:35,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 69.23/39.96 [2019-03-28 12:42:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 36 transitions. 69.23/39.96 [2019-03-28 12:42:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 69.23/39.96 [2019-03-28 12:42:35,924 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:35,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:35,924 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:35,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:35,924 INFO L82 PathProgramCache]: Analyzing trace with hash 548616355, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:35,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:35,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:35,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:36,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:36,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 69.23/39.96 [2019-03-28 12:42:36,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 69.23/39.96 [2019-03-28 12:42:36,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 69.23/39.96 [2019-03-28 12:42:36,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 69.23/39.96 [2019-03-28 12:42:36,005 INFO L87 Difference]: Start difference. First operand 23 states and 36 transitions. Second operand 8 states. 69.23/39.96 [2019-03-28 12:42:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:36,178 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. 69.23/39.96 [2019-03-28 12:42:36,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 69.23/39.96 [2019-03-28 12:42:36,178 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 69.23/39.96 [2019-03-28 12:42:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:36,179 INFO L225 Difference]: With dead ends: 28 69.23/39.96 [2019-03-28 12:42:36,179 INFO L226 Difference]: Without dead ends: 25 69.23/39.96 [2019-03-28 12:42:36,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 69.23/39.96 [2019-03-28 12:42:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 69.23/39.96 [2019-03-28 12:42:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. 69.23/39.96 [2019-03-28 12:42:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 69.23/39.96 [2019-03-28 12:42:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. 69.23/39.96 [2019-03-28 12:42:36,183 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 11 69.23/39.96 [2019-03-28 12:42:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:36,183 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. 69.23/39.96 [2019-03-28 12:42:36,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 69.23/39.96 [2019-03-28 12:42:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. 69.23/39.96 [2019-03-28 12:42:36,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 69.23/39.96 [2019-03-28 12:42:36,184 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:36,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:36,184 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:36,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:36,184 INFO L82 PathProgramCache]: Analyzing trace with hash -174459913, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:36,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:36,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:36,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:36,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:36,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:36,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 69.23/39.96 [2019-03-28 12:42:36,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 69.23/39.96 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 69.23/39.96 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 69.23/39.96 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 69.23/39.96 [2019-03-28 12:42:36,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:36,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core 69.23/39.96 [2019-03-28 12:42:36,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... 69.23/39.96 [2019-03-28 12:42:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:36,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:36,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 69.23/39.96 [2019-03-28 12:42:36,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 69.23/39.96 [2019-03-28 12:42:36,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 69.23/39.96 [2019-03-28 12:42:36,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 69.23/39.96 [2019-03-28 12:42:36,339 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand 7 states. 69.23/39.96 [2019-03-28 12:42:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:36,460 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. 69.23/39.96 [2019-03-28 12:42:36,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 69.23/39.96 [2019-03-28 12:42:36,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 69.23/39.96 [2019-03-28 12:42:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:36,461 INFO L225 Difference]: With dead ends: 25 69.23/39.96 [2019-03-28 12:42:36,461 INFO L226 Difference]: Without dead ends: 23 69.23/39.96 [2019-03-28 12:42:36,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 69.23/39.96 [2019-03-28 12:42:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 69.23/39.96 [2019-03-28 12:42:36,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. 69.23/39.96 [2019-03-28 12:42:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 69.23/39.96 [2019-03-28 12:42:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. 69.23/39.96 [2019-03-28 12:42:36,465 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 12 69.23/39.96 [2019-03-28 12:42:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:36,465 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. 69.23/39.96 [2019-03-28 12:42:36,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 69.23/39.96 [2019-03-28 12:42:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. 69.23/39.96 [2019-03-28 12:42:36,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 69.23/39.96 [2019-03-28 12:42:36,466 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:36,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:36,466 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:36,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:36,467 INFO L82 PathProgramCache]: Analyzing trace with hash -174459912, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:36,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:36,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:36,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:36,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:36,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:36,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:36,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 69.23/39.96 [2019-03-28 12:42:36,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 69.23/39.96 [2019-03-28 12:42:36,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 69.23/39.96 [2019-03-28 12:42:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 69.23/39.96 [2019-03-28 12:42:36,609 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. 69.23/39.96 [2019-03-28 12:42:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:36,889 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. 69.23/39.96 [2019-03-28 12:42:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 69.23/39.96 [2019-03-28 12:42:36,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 69.23/39.96 [2019-03-28 12:42:36,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:36,890 INFO L225 Difference]: With dead ends: 43 69.23/39.96 [2019-03-28 12:42:36,890 INFO L226 Difference]: Without dead ends: 22 69.23/39.96 [2019-03-28 12:42:36,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 69.23/39.96 [2019-03-28 12:42:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 69.23/39.96 [2019-03-28 12:42:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 69.23/39.96 [2019-03-28 12:42:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 69.23/39.96 [2019-03-28 12:42:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. 69.23/39.96 [2019-03-28 12:42:36,894 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 12 69.23/39.96 [2019-03-28 12:42:36,894 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:36,894 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. 69.23/39.96 [2019-03-28 12:42:36,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 69.23/39.96 [2019-03-28 12:42:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. 69.23/39.96 [2019-03-28 12:42:36,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 69.23/39.96 [2019-03-28 12:42:36,895 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:36,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:36,895 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:36,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:36,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1270346693, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:36,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:36,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:36,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:36,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:36,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:37,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 69.23/39.96 [2019-03-28 12:42:37,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 69.23/39.96 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 69.23/39.96 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 69.23/39.96 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 69.23/39.96 [2019-03-28 12:42:37,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:37,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 25 conjunts are in the unsatisfiable core 69.23/39.96 [2019-03-28 12:42:37,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... 69.23/39.96 [2019-03-28 12:42:37,227 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 69.23/39.96 [2019-03-28 12:42:37,228 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 69.23/39.96 [2019-03-28 12:42:37,242 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.96 [2019-03-28 12:42:37,243 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. 69.23/39.96 [2019-03-28 12:42:37,243 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 69.23/39.96 [2019-03-28 12:42:37,307 INFO L189 IndexEqualityManager]: detected not equals via solver 69.23/39.96 [2019-03-28 12:42:37,310 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 25 treesize of output 24 69.23/39.96 [2019-03-28 12:42:37,310 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 69.23/39.96 [2019-03-28 12:42:37,327 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.96 [2019-03-28 12:42:37,329 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. 69.23/39.96 [2019-03-28 12:42:37,329 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:46, output treesize:42 69.23/39.96 [2019-03-28 12:42:37,430 INFO L189 IndexEqualityManager]: detected not equals via solver 69.23/39.96 [2019-03-28 12:42:37,436 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.96 [2019-03-28 12:42:37,436 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 28 treesize of output 21 69.23/39.96 [2019-03-28 12:42:37,440 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 69.23/39.96 [2019-03-28 12:42:37,458 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.96 [2019-03-28 12:42:37,465 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 69.23/39.96 [2019-03-28 12:42:37,466 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:54, output treesize:27 69.23/39.96 [2019-03-28 12:42:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:37,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:37,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 69.23/39.96 [2019-03-28 12:42:37,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 69.23/39.96 [2019-03-28 12:42:37,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 69.23/39.96 [2019-03-28 12:42:37,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 69.23/39.96 [2019-03-28 12:42:37,570 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 15 states. 69.23/39.96 [2019-03-28 12:42:38,312 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 69.23/39.96 [2019-03-28 12:42:39,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:39,063 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. 69.23/39.96 [2019-03-28 12:42:39,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 69.23/39.96 [2019-03-28 12:42:39,064 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 69.23/39.96 [2019-03-28 12:42:39,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:39,064 INFO L225 Difference]: With dead ends: 50 69.23/39.96 [2019-03-28 12:42:39,064 INFO L226 Difference]: Without dead ends: 48 69.23/39.96 [2019-03-28 12:42:39,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 69.23/39.96 [2019-03-28 12:42:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. 69.23/39.96 [2019-03-28 12:42:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. 69.23/39.96 [2019-03-28 12:42:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 69.23/39.96 [2019-03-28 12:42:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. 69.23/39.96 [2019-03-28 12:42:39,070 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 12 69.23/39.96 [2019-03-28 12:42:39,070 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.96 [2019-03-28 12:42:39,070 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 32 transitions. 69.23/39.96 [2019-03-28 12:42:39,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 69.23/39.96 [2019-03-28 12:42:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. 69.23/39.96 [2019-03-28 12:42:39,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 69.23/39.96 [2019-03-28 12:42:39,071 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.96 [2019-03-28 12:42:39,071 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.96 [2019-03-28 12:42:39,071 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.96 [2019-03-28 12:42:39,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.96 [2019-03-28 12:42:39,071 INFO L82 PathProgramCache]: Analyzing trace with hash -726040962, now seen corresponding path program 1 times 69.23/39.96 [2019-03-28 12:42:39,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.96 [2019-03-28 12:42:39,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.96 [2019-03-28 12:42:39,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:39,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:39,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:39,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 69.23/39.96 [2019-03-28 12:42:39,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 69.23/39.96 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 69.23/39.96 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 69.23/39.96 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 69.23/39.96 [2019-03-28 12:42:39,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.96 [2019-03-28 12:42:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.96 [2019-03-28 12:42:39,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 36 conjunts are in the unsatisfiable core 69.23/39.96 [2019-03-28 12:42:39,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... 69.23/39.96 [2019-03-28 12:42:39,291 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 69.23/39.96 [2019-03-28 12:42:39,292 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 69.23/39.96 [2019-03-28 12:42:39,301 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.96 [2019-03-28 12:42:39,302 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. 69.23/39.96 [2019-03-28 12:42:39,302 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 69.23/39.96 [2019-03-28 12:42:39,470 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.96 [2019-03-28 12:42:39,471 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 29 treesize of output 48 69.23/39.96 [2019-03-28 12:42:39,484 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 69.23/39.96 [2019-03-28 12:42:39,534 INFO L497 ElimStorePlain]: treesize reduction 16, result has 72.4 percent of original size 69.23/39.96 [2019-03-28 12:42:39,542 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 69.23/39.96 [2019-03-28 12:42:39,543 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:23 69.23/39.96 [2019-03-28 12:42:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.96 [2019-03-28 12:42:39,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 69.23/39.96 [2019-03-28 12:42:39,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 69.23/39.96 [2019-03-28 12:42:39,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states 69.23/39.96 [2019-03-28 12:42:39,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 69.23/39.96 [2019-03-28 12:42:39,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 69.23/39.96 [2019-03-28 12:42:39,618 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. Second operand 16 states. 69.23/39.96 [2019-03-28 12:42:39,985 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 69.23/39.96 [2019-03-28 12:42:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.96 [2019-03-28 12:42:40,299 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. 69.23/39.96 [2019-03-28 12:42:40,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 69.23/39.96 [2019-03-28 12:42:40,300 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 69.23/39.96 [2019-03-28 12:42:40,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.96 [2019-03-28 12:42:40,300 INFO L225 Difference]: With dead ends: 26 69.23/39.96 [2019-03-28 12:42:40,301 INFO L226 Difference]: Without dead ends: 25 69.23/39.97 [2019-03-28 12:42:40,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 69.23/39.97 [2019-03-28 12:42:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 69.23/39.97 [2019-03-28 12:42:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. 69.23/39.97 [2019-03-28 12:42:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 69.23/39.97 [2019-03-28 12:42:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. 69.23/39.97 [2019-03-28 12:42:40,306 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 69.23/39.97 [2019-03-28 12:42:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.97 [2019-03-28 12:42:40,306 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. 69.23/39.97 [2019-03-28 12:42:40,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. 69.23/39.97 [2019-03-28 12:42:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. 69.23/39.97 [2019-03-28 12:42:40,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 69.23/39.97 [2019-03-28 12:42:40,307 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.97 [2019-03-28 12:42:40,307 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:42:40,307 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.97 [2019-03-28 12:42:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:42:40,308 INFO L82 PathProgramCache]: Analyzing trace with hash -726040961, now seen corresponding path program 1 times 69.23/39.97 [2019-03-28 12:42:40,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:42:40,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:42:40,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:40,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 69.23/39.97 [2019-03-28 12:42:40,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 69.23/39.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 69.23/39.97 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 69.23/39.97 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 69.23/39.97 [2019-03-28 12:42:40,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:40,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core 69.23/39.97 [2019-03-28 12:42:40,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... 69.23/39.97 [2019-03-28 12:42:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:40,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 69.23/39.97 [2019-03-28 12:42:40,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 69.23/39.97 [2019-03-28 12:42:40,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 69.23/39.97 [2019-03-28 12:42:40,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 69.23/39.97 [2019-03-28 12:42:40,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 69.23/39.97 [2019-03-28 12:42:40,449 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. 69.23/39.97 [2019-03-28 12:42:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.97 [2019-03-28 12:42:40,579 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. 69.23/39.97 [2019-03-28 12:42:40,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 69.23/39.97 [2019-03-28 12:42:40,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 69.23/39.97 [2019-03-28 12:42:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.97 [2019-03-28 12:42:40,580 INFO L225 Difference]: With dead ends: 25 69.23/39.97 [2019-03-28 12:42:40,580 INFO L226 Difference]: Without dead ends: 24 69.23/39.97 [2019-03-28 12:42:40,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 69.23/39.97 [2019-03-28 12:42:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 69.23/39.97 [2019-03-28 12:42:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 69.23/39.97 [2019-03-28 12:42:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 69.23/39.97 [2019-03-28 12:42:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. 69.23/39.97 [2019-03-28 12:42:40,585 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 13 69.23/39.97 [2019-03-28 12:42:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.97 [2019-03-28 12:42:40,585 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. 69.23/39.97 [2019-03-28 12:42:40,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 69.23/39.97 [2019-03-28 12:42:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. 69.23/39.97 [2019-03-28 12:42:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 69.23/39.97 [2019-03-28 12:42:40,586 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.97 [2019-03-28 12:42:40,586 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:42:40,586 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.97 [2019-03-28 12:42:40,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:42:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1940704567, now seen corresponding path program 1 times 69.23/39.97 [2019-03-28 12:42:40,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:42:40,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:42:40,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:40,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 69.23/39.97 [2019-03-28 12:42:40,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 69.23/39.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 69.23/39.97 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 69.23/39.97 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 69.23/39.97 [2019-03-28 12:42:40,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:40,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 15 conjunts are in the unsatisfiable core 69.23/39.97 [2019-03-28 12:42:40,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... 69.23/39.97 [2019-03-28 12:42:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:40,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 69.23/39.97 [2019-03-28 12:42:40,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 69.23/39.97 [2019-03-28 12:42:40,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 69.23/39.97 [2019-03-28 12:42:40,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 69.23/39.97 [2019-03-28 12:42:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 69.23/39.97 [2019-03-28 12:42:40,722 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 6 states. 69.23/39.97 [2019-03-28 12:42:40,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.97 [2019-03-28 12:42:40,830 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. 69.23/39.97 [2019-03-28 12:42:40,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 69.23/39.97 [2019-03-28 12:42:40,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 69.23/39.97 [2019-03-28 12:42:40,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.97 [2019-03-28 12:42:40,833 INFO L225 Difference]: With dead ends: 25 69.23/39.97 [2019-03-28 12:42:40,833 INFO L226 Difference]: Without dead ends: 24 69.23/39.97 [2019-03-28 12:42:40,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 69.23/39.97 [2019-03-28 12:42:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 69.23/39.97 [2019-03-28 12:42:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 69.23/39.97 [2019-03-28 12:42:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 69.23/39.97 [2019-03-28 12:42:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. 69.23/39.97 [2019-03-28 12:42:40,838 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 69.23/39.97 [2019-03-28 12:42:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.97 [2019-03-28 12:42:40,838 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. 69.23/39.97 [2019-03-28 12:42:40,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 69.23/39.97 [2019-03-28 12:42:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. 69.23/39.97 [2019-03-28 12:42:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 69.23/39.97 [2019-03-28 12:42:40,839 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.97 [2019-03-28 12:42:40,839 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:42:40,839 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.97 [2019-03-28 12:42:40,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:42:40,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1940704566, now seen corresponding path program 1 times 69.23/39.97 [2019-03-28 12:42:40,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:42:40,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:42:40,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:40,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.97 [2019-03-28 12:42:40,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 69.23/39.97 [2019-03-28 12:42:40,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 69.23/39.97 [2019-03-28 12:42:40,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 69.23/39.97 [2019-03-28 12:42:40,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 69.23/39.97 [2019-03-28 12:42:40,866 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 4 states. 69.23/39.97 [2019-03-28 12:42:40,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.97 [2019-03-28 12:42:40,921 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. 69.23/39.97 [2019-03-28 12:42:40,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 69.23/39.97 [2019-03-28 12:42:40,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 69.23/39.97 [2019-03-28 12:42:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.97 [2019-03-28 12:42:40,922 INFO L225 Difference]: With dead ends: 24 69.23/39.97 [2019-03-28 12:42:40,922 INFO L226 Difference]: Without dead ends: 23 69.23/39.97 [2019-03-28 12:42:40,923 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 69.23/39.97 [2019-03-28 12:42:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 69.23/39.97 [2019-03-28 12:42:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 69.23/39.97 [2019-03-28 12:42:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 69.23/39.97 [2019-03-28 12:42:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. 69.23/39.97 [2019-03-28 12:42:40,927 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 15 69.23/39.97 [2019-03-28 12:42:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.97 [2019-03-28 12:42:40,927 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. 69.23/39.97 [2019-03-28 12:42:40,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 69.23/39.97 [2019-03-28 12:42:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. 69.23/39.97 [2019-03-28 12:42:40,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 69.23/39.97 [2019-03-28 12:42:40,928 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.97 [2019-03-28 12:42:40,928 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:42:40,928 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.97 [2019-03-28 12:42:40,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:42:40,929 INFO L82 PathProgramCache]: Analyzing trace with hash -32247173, now seen corresponding path program 1 times 69.23/39.97 [2019-03-28 12:42:40,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:42:40,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:42:40,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:40,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.97 [2019-03-28 12:42:40,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 69.23/39.97 [2019-03-28 12:42:40,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 69.23/39.97 [2019-03-28 12:42:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 69.23/39.97 [2019-03-28 12:42:40,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 69.23/39.97 [2019-03-28 12:42:40,985 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 6 states. 69.23/39.97 [2019-03-28 12:42:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.97 [2019-03-28 12:42:41,091 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. 69.23/39.97 [2019-03-28 12:42:41,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 69.23/39.97 [2019-03-28 12:42:41,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 69.23/39.97 [2019-03-28 12:42:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.97 [2019-03-28 12:42:41,092 INFO L225 Difference]: With dead ends: 23 69.23/39.97 [2019-03-28 12:42:41,092 INFO L226 Difference]: Without dead ends: 20 69.23/39.97 [2019-03-28 12:42:41,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 69.23/39.97 [2019-03-28 12:42:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 69.23/39.97 [2019-03-28 12:42:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 69.23/39.97 [2019-03-28 12:42:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 69.23/39.97 [2019-03-28 12:42:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. 69.23/39.97 [2019-03-28 12:42:41,096 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 16 69.23/39.97 [2019-03-28 12:42:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.97 [2019-03-28 12:42:41,096 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. 69.23/39.97 [2019-03-28 12:42:41,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 69.23/39.97 [2019-03-28 12:42:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. 69.23/39.97 [2019-03-28 12:42:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 69.23/39.97 [2019-03-28 12:42:41,097 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.97 [2019-03-28 12:42:41,098 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:42:41,098 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.97 [2019-03-28 12:42:41,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:42:41,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1001360096, now seen corresponding path program 2 times 69.23/39.97 [2019-03-28 12:42:41,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:42:41,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:42:41,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:41,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:41,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:41,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 69.23/39.97 [2019-03-28 12:42:41,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 69.23/39.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 69.23/39.97 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 69.23/39.97 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 69.23/39.97 [2019-03-28 12:42:41,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 69.23/39.97 [2019-03-28 12:42:41,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 69.23/39.97 [2019-03-28 12:42:41,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:41,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 32 conjunts are in the unsatisfiable core 69.23/39.97 [2019-03-28 12:42:41,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... 69.23/39.97 [2019-03-28 12:42:41,378 INFO L189 IndexEqualityManager]: detected not equals via solver 69.23/39.97 [2019-03-28 12:42:41,380 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 69.23/39.97 [2019-03-28 12:42:41,380 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:41,389 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:41,389 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:41,390 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 69.23/39.97 [2019-03-28 12:42:41,418 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 69.23/39.97 [2019-03-28 12:42:41,418 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:41,430 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:41,431 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. 69.23/39.97 [2019-03-28 12:42:41,431 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 69.23/39.97 [2019-03-28 12:42:41,466 INFO L189 IndexEqualityManager]: detected not equals via solver 69.23/39.97 [2019-03-28 12:42:41,467 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 69.23/39.97 [2019-03-28 12:42:41,467 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:41,480 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:41,481 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. 69.23/39.97 [2019-03-28 12:42:41,481 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 69.23/39.97 [2019-03-28 12:42:41,643 INFO L189 IndexEqualityManager]: detected not equals via solver 69.23/39.97 [2019-03-28 12:42:41,649 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:41,650 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 69.23/39.97 [2019-03-28 12:42:41,651 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 69.23/39.97 [2019-03-28 12:42:41,669 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:41,672 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:41,672 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:27 69.23/39.97 [2019-03-28 12:42:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:41,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 69.23/39.97 [2019-03-28 12:42:41,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 69.23/39.97 [2019-03-28 12:42:41,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states 69.23/39.97 [2019-03-28 12:42:41,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. 69.23/39.97 [2019-03-28 12:42:41,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 69.23/39.97 [2019-03-28 12:42:41,771 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 18 states. 69.23/39.97 [2019-03-28 12:42:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.97 [2019-03-28 12:42:50,398 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. 69.23/39.97 [2019-03-28 12:42:50,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 69.23/39.97 [2019-03-28 12:42:50,398 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 69.23/39.97 [2019-03-28 12:42:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.97 [2019-03-28 12:42:50,399 INFO L225 Difference]: With dead ends: 43 69.23/39.97 [2019-03-28 12:42:50,399 INFO L226 Difference]: Without dead ends: 42 69.23/39.97 [2019-03-28 12:42:50,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 69.23/39.97 [2019-03-28 12:42:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. 69.23/39.97 [2019-03-28 12:42:50,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. 69.23/39.97 [2019-03-28 12:42:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. 69.23/39.97 [2019-03-28 12:42:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. 69.23/39.97 [2019-03-28 12:42:50,406 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 17 69.23/39.97 [2019-03-28 12:42:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.97 [2019-03-28 12:42:50,406 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. 69.23/39.97 [2019-03-28 12:42:50,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. 69.23/39.97 [2019-03-28 12:42:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. 69.23/39.97 [2019-03-28 12:42:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 69.23/39.97 [2019-03-28 12:42:50,407 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.97 [2019-03-28 12:42:50,407 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:42:50,407 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.97 [2019-03-28 12:42:50,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:42:50,408 INFO L82 PathProgramCache]: Analyzing trace with hash -977391047, now seen corresponding path program 2 times 69.23/39.97 [2019-03-28 12:42:50,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:42:50,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:42:50,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:50,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:50,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:50,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 69.23/39.97 [2019-03-28 12:42:50,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 69.23/39.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 69.23/39.97 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 69.23/39.97 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 69.23/39.97 [2019-03-28 12:42:50,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 69.23/39.97 [2019-03-28 12:42:50,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 69.23/39.97 [2019-03-28 12:42:50,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:50,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 46 conjunts are in the unsatisfiable core 69.23/39.97 [2019-03-28 12:42:50,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... 69.23/39.97 [2019-03-28 12:42:50,740 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:50,741 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 1 case distinctions, treesize of input 9 treesize of output 25 69.23/39.97 [2019-03-28 12:42:50,741 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:50,760 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 69.23/39.97 [2019-03-28 12:42:50,761 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:50,761 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 69.23/39.97 [2019-03-28 12:42:50,784 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 69.23/39.97 [2019-03-28 12:42:50,785 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:50,792 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:50,792 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. 69.23/39.97 [2019-03-28 12:42:50,793 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 69.23/39.97 [2019-03-28 12:42:50,993 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:50,993 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 31 treesize of output 52 69.23/39.97 [2019-03-28 12:42:51,003 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. 69.23/39.97 [2019-03-28 12:42:51,048 INFO L497 ElimStorePlain]: treesize reduction 34, result has 57.5 percent of original size 69.23/39.97 [2019-03-28 12:42:51,052 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 69.23/39.97 [2019-03-28 12:42:51,053 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:23 69.23/39.97 [2019-03-28 12:42:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:51,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 69.23/39.97 [2019-03-28 12:42:51,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 69.23/39.97 [2019-03-28 12:42:51,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states 69.23/39.97 [2019-03-28 12:42:51,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. 69.23/39.97 [2019-03-28 12:42:51,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 69.23/39.97 [2019-03-28 12:42:51,126 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 18 states. 69.23/39.97 [2019-03-28 12:42:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.97 [2019-03-28 12:42:52,678 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. 69.23/39.97 [2019-03-28 12:42:52,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 69.23/39.97 [2019-03-28 12:42:52,679 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 69.23/39.97 [2019-03-28 12:42:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.97 [2019-03-28 12:42:52,679 INFO L225 Difference]: With dead ends: 51 69.23/39.97 [2019-03-28 12:42:52,680 INFO L226 Difference]: Without dead ends: 50 69.23/39.97 [2019-03-28 12:42:52,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=272, Invalid=1134, Unknown=0, NotChecked=0, Total=1406 69.23/39.97 [2019-03-28 12:42:52,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. 69.23/39.97 [2019-03-28 12:42:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. 69.23/39.97 [2019-03-28 12:42:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 69.23/39.97 [2019-03-28 12:42:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. 69.23/39.97 [2019-03-28 12:42:52,688 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 18 69.23/39.97 [2019-03-28 12:42:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.97 [2019-03-28 12:42:52,688 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. 69.23/39.97 [2019-03-28 12:42:52,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. 69.23/39.97 [2019-03-28 12:42:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. 69.23/39.97 [2019-03-28 12:42:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 69.23/39.97 [2019-03-28 12:42:52,689 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.97 [2019-03-28 12:42:52,689 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:42:52,690 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.97 [2019-03-28 12:42:52,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:42:52,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1169765660, now seen corresponding path program 1 times 69.23/39.97 [2019-03-28 12:42:52,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:42:52,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:42:52,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:52,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:52,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:52,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 69.23/39.97 [2019-03-28 12:42:52,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 69.23/39.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 69.23/39.97 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 69.23/39.97 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 69.23/39.97 [2019-03-28 12:42:52,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:52,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 42 conjunts are in the unsatisfiable core 69.23/39.97 [2019-03-28 12:42:52,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... 69.23/39.97 [2019-03-28 12:42:52,965 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 69.23/39.97 [2019-03-28 12:42:52,965 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:52,972 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:52,974 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 69.23/39.97 [2019-03-28 12:42:52,975 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:52,982 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:52,982 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:52,983 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 69.23/39.97 [2019-03-28 12:42:53,007 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 69.23/39.97 [2019-03-28 12:42:53,007 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:53,014 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:53,014 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:53,015 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 69.23/39.97 [2019-03-28 12:42:53,038 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 69.23/39.97 [2019-03-28 12:42:53,038 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:53,046 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:53,046 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. 69.23/39.97 [2019-03-28 12:42:53,047 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 69.23/39.97 [2019-03-28 12:42:53,168 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:53,168 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 69.23/39.97 [2019-03-28 12:42:53,169 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 69.23/39.97 [2019-03-28 12:42:53,182 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:53,183 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 69.23/39.97 [2019-03-28 12:42:53,184 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:23 69.23/39.97 [2019-03-28 12:42:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:53,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 69.23/39.97 [2019-03-28 12:42:53,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 69.23/39.97 [2019-03-28 12:42:53,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 69.23/39.97 [2019-03-28 12:42:53,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 69.23/39.97 [2019-03-28 12:42:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 69.23/39.97 [2019-03-28 12:42:53,251 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 15 states. 69.23/39.97 [2019-03-28 12:42:54,755 WARN L188 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 43 DAG size of output: 36 69.23/39.97 [2019-03-28 12:42:56,320 WARN L188 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 47 DAG size of output: 40 69.23/39.97 [2019-03-28 12:42:57,752 WARN L188 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 51 DAG size of output: 44 69.23/39.97 [2019-03-28 12:42:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.97 [2019-03-28 12:42:57,928 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. 69.23/39.97 [2019-03-28 12:42:57,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 69.23/39.97 [2019-03-28 12:42:57,928 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 69.23/39.97 [2019-03-28 12:42:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.97 [2019-03-28 12:42:57,929 INFO L225 Difference]: With dead ends: 45 69.23/39.97 [2019-03-28 12:42:57,929 INFO L226 Difference]: Without dead ends: 44 69.23/39.97 [2019-03-28 12:42:57,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 69.23/39.97 [2019-03-28 12:42:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. 69.23/39.97 [2019-03-28 12:42:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 24. 69.23/39.97 [2019-03-28 12:42:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 69.23/39.97 [2019-03-28 12:42:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. 69.23/39.97 [2019-03-28 12:42:57,934 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 22 69.23/39.97 [2019-03-28 12:42:57,934 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.97 [2019-03-28 12:42:57,934 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. 69.23/39.97 [2019-03-28 12:42:57,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 69.23/39.97 [2019-03-28 12:42:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. 69.23/39.97 [2019-03-28 12:42:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 69.23/39.97 [2019-03-28 12:42:57,935 INFO L394 BasicCegarLoop]: Found error trace 69.23/39.97 [2019-03-28 12:42:57,935 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:42:57,935 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 69.23/39.97 [2019-03-28 12:42:57,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:42:57,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1983144161, now seen corresponding path program 1 times 69.23/39.97 [2019-03-28 12:42:57,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:42:57,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:42:57,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:57,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:57,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:58,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 69.23/39.97 [2019-03-28 12:42:58,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 69.23/39.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 69.23/39.97 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 69.23/39.97 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 69.23/39.97 [2019-03-28 12:42:58,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:42:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:42:58,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 59 conjunts are in the unsatisfiable core 69.23/39.97 [2019-03-28 12:42:58,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... 69.23/39.97 [2019-03-28 12:42:58,142 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:58,142 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 1 case distinctions, treesize of input 9 treesize of output 25 69.23/39.97 [2019-03-28 12:42:58,143 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:58,158 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 69.23/39.97 [2019-03-28 12:42:58,159 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:58,159 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 69.23/39.97 [2019-03-28 12:42:58,163 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 69.23/39.97 [2019-03-28 12:42:58,163 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:58,165 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:58,166 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 69.23/39.97 [2019-03-28 12:42:58,166 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 69.23/39.97 [2019-03-28 12:42:58,276 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 69.23/39.97 [2019-03-28 12:42:58,277 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 30 treesize of output 50 69.23/39.97 [2019-03-28 12:42:58,284 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. 69.23/39.97 [2019-03-28 12:42:58,329 INFO L497 ElimStorePlain]: treesize reduction 58, result has 39.6 percent of original size 69.23/39.97 [2019-03-28 12:42:58,331 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 69.23/39.97 [2019-03-28 12:42:58,331 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:35 69.23/39.97 [2019-03-28 12:42:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:42:58,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 69.23/39.97 [2019-03-28 12:42:58,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 69.23/39.97 [2019-03-28 12:42:58,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states 69.23/39.97 [2019-03-28 12:42:58,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. 69.23/39.97 [2019-03-28 12:42:58,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 69.23/39.97 [2019-03-28 12:42:58,414 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 14 states. 69.23/39.97 [2019-03-28 12:42:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.97 [2019-03-28 12:42:58,823 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. 69.23/39.97 [2019-03-28 12:42:58,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 69.23/39.97 [2019-03-28 12:42:58,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 69.23/39.97 [2019-03-28 12:42:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 69.23/39.97 [2019-03-28 12:42:58,824 INFO L225 Difference]: With dead ends: 24 69.23/39.97 [2019-03-28 12:42:58,824 INFO L226 Difference]: Without dead ends: 0 69.23/39.97 [2019-03-28 12:42:58,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 69.23/39.97 [2019-03-28 12:42:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 69.23/39.97 [2019-03-28 12:42:58,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 69.23/39.97 [2019-03-28 12:42:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 69.23/39.97 [2019-03-28 12:42:58,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 69.23/39.97 [2019-03-28 12:42:58,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 69.23/39.97 [2019-03-28 12:42:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. 69.23/39.97 [2019-03-28 12:42:58,825 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 69.23/39.97 [2019-03-28 12:42:58,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. 69.23/39.97 [2019-03-28 12:42:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 69.23/39.97 [2019-03-28 12:42:58,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 69.23/39.97 [2019-03-28 12:42:58,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 69.23/39.97 [2019-03-28 12:42:58,957 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 200 69.23/39.97 [2019-03-28 12:43:05,238 WARN L188 SmtUtils]: Spent 6.28 s on a formula simplification. DAG size of input: 197 DAG size of output: 87 69.23/39.97 [2019-03-28 12:43:05,242 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,253 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 27 29) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,254 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,254 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,254 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,254 INFO L448 ceAbstractionStarter]: For program point L15-3(lines 15 17) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,254 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,254 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,255 INFO L444 ceAbstractionStarter]: At program point L15-5(lines 15 17) the Hoare annotation is: (let ((.cse21 (select |#length| ULTIMATE.start_cstrcmp_~s2.base)) (.cse20 (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base)) (.cse19 (select |#length| ULTIMATE.start_cstrcmp_~s1.base)) (.cse22 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse0 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_cstrcmp_~s1.base ULTIMATE.start_main_~nondetString2~0.base))))) (.cse1 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrcmp_~s2.base) (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse11 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse15 (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse22 (- 1))) 0)) (.cse16 (= 0 (select .cse20 (+ .cse19 (- 1))))) (.cse18 (<= (+ ULTIMATE.start_cstrcmp_~s2.offset 1) .cse21)) (.cse4 (= ULTIMATE.start_main_~length1~0 .cse22)) (.cse5 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse6 (= 1 (select |#valid| ULTIMATE.start_cstrcmp_~s2.base))) (.cse7 (= ULTIMATE.start_cstrcmp_~s1.offset 0)) (.cse17 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse8 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse9 (<= 1 .cse19)) (.cse10 (= ULTIMATE.start_cstrcmp_~s2.offset 0)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse2 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse3 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse13 (= (select |#valid| ULTIMATE.start_cstrcmp_~s1.base) 1)) (.cse14 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))) (or (and (and .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16) .cse17 .cse18) (and .cse3 .cse17 (and .cse0 .cse1 (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) .cse19) (and .cse4 .cse6 (<= 1 ULTIMATE.start_cstrcmp_~s2.offset) (<= 1 ULTIMATE.start_cstrcmp_~s1.offset) .cse8 .cse11 .cse12 .cse2 .cse13 .cse14) .cse5 .cse15 .cse16) .cse18) (and .cse4 .cse5 .cse6 .cse7 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~nondetString1~0.offset)) .cse17 .cse8 .cse9 (= 1 ULTIMATE.start_main_~length1~0) .cse10 (= 0 (select .cse20 ULTIMATE.start_cstrcmp_~s1.offset)) .cse12 .cse2 .cse3 (<= 1 .cse21) .cse13 .cse14)))) 69.23/39.97 [2019-03-28 12:43:05,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,255 INFO L448 ceAbstractionStarter]: For program point L15-6(lines 15 17) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,255 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,255 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,255 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,256 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 21 35) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,256 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,256 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,256 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 17) no Hoare annotation was computed. 69.23/39.97 [2019-03-28 12:43:05,256 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 69.23/39.97 [2019-03-28 12:43:05,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,275 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,276 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,276 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,293 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,293 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,293 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:05,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:05,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:05,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:05 BasicIcfg 69.23/39.97 [2019-03-28 12:43:05,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 69.23/39.97 [2019-03-28 12:43:05,312 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 69.23/39.97 [2019-03-28 12:43:05,312 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 69.23/39.97 [2019-03-28 12:43:05,315 INFO L276 PluginConnector]: BuchiAutomizer initialized 69.23/39.97 [2019-03-28 12:43:05,316 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 69.23/39.97 [2019-03-28 12:43:05,316 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:42:32" (1/5) ... 69.23/39.97 [2019-03-28 12:43:05,317 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2951342c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:43:05, skipping insertion in model container 69.23/39.97 [2019-03-28 12:43:05,317 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 69.23/39.97 [2019-03-28 12:43:05,317 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:32" (2/5) ... 69.23/39.97 [2019-03-28 12:43:05,317 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2951342c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:43:05, skipping insertion in model container 69.23/39.97 [2019-03-28 12:43:05,318 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 69.23/39.97 [2019-03-28 12:43:05,318 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:42:33" (3/5) ... 69.23/39.97 [2019-03-28 12:43:05,318 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2951342c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:05, skipping insertion in model container 69.23/39.97 [2019-03-28 12:43:05,318 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 69.23/39.97 [2019-03-28 12:43:05,318 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:42:33" (4/5) ... 69.23/39.97 [2019-03-28 12:43:05,318 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2951342c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:05, skipping insertion in model container 69.23/39.97 [2019-03-28 12:43:05,319 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 69.23/39.97 [2019-03-28 12:43:05,319 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:05" (5/5) ... 69.23/39.97 [2019-03-28 12:43:05,320 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 69.23/39.97 [2019-03-28 12:43:05,346 INFO L133 ementStrategyFactory]: Using default assertion order modulation 69.23/39.97 [2019-03-28 12:43:05,346 INFO L374 BuchiCegarLoop]: Interprodecural is true 69.23/39.97 [2019-03-28 12:43:05,346 INFO L375 BuchiCegarLoop]: Hoare is true 69.23/39.97 [2019-03-28 12:43:05,346 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 69.23/39.97 [2019-03-28 12:43:05,347 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 69.23/39.97 [2019-03-28 12:43:05,347 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 69.23/39.97 [2019-03-28 12:43:05,347 INFO L379 BuchiCegarLoop]: Difference is false 69.23/39.97 [2019-03-28 12:43:05,347 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 69.23/39.97 [2019-03-28 12:43:05,347 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 69.23/39.97 [2019-03-28 12:43:05,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. 69.23/39.97 [2019-03-28 12:43:05,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 69.23/39.97 [2019-03-28 12:43:05,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 69.23/39.97 [2019-03-28 12:43:05,355 INFO L119 BuchiIsEmpty]: Starting construction of run 69.23/39.97 [2019-03-28 12:43:05,360 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:43:05,360 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:43:05,360 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 69.23/39.97 [2019-03-28 12:43:05,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. 69.23/39.97 [2019-03-28 12:43:05,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 69.23/39.97 [2019-03-28 12:43:05,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 69.23/39.97 [2019-03-28 12:43:05,362 INFO L119 BuchiIsEmpty]: Starting construction of run 69.23/39.97 [2019-03-28 12:43:05,362 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:43:05,362 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:43:05,367 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue [158] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 27#L24true [103] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 22#L24-2true [92] L24-2-->L27-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 4#L27-1true [125] L27-1-->L32: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1)))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 15#L32true [82] L32-->L32-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 14#L32-1true [159] L32-1-->L15-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_7) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrcmp_~s1.base_11 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_7) (= |v_ULTIMATE.start_cstrcmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_9))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_7|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_9, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_7|, ULTIMATE.start_cstrcmp_#t~pre5.offset=|v_ULTIMATE.start_cstrcmp_#t~pre5.offset_6|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_7|, ULTIMATE.start_cstrcmp_#t~mem7=|v_ULTIMATE.start_cstrcmp_#t~mem7_5|, ULTIMATE.start_cstrcmp_#t~mem6=|v_ULTIMATE.start_cstrcmp_#t~mem6_5|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_11, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_7|, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_7|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_7, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_8|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_5|, ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_8|, ULTIMATE.start_cstrcmp_#t~pre5.base=|v_ULTIMATE.start_cstrcmp_#t~pre5.base_7|, #valid=|v_#valid_25|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_10|, 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_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~post0.base, ULTIMATE.start_cstrcmp_#t~pre5.offset, ULTIMATE.start_cstrcmp_#t~mem4, ULTIMATE.start_cstrcmp_#t~mem7, ULTIMATE.start_cstrcmp_#t~mem6, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_#t~post3.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post3.offset, ULTIMATE.start_cstrcmp_#t~pre5.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base, ULTIMATE.start_cstrcmp_#t~post0.offset] 20#L15-5true 69.23/39.97 [2019-03-28 12:43:05,368 INFO L796 eck$LassoCheckResult]: Loop: 20#L15-5true [160] L15-5-->L15-2: Formula: (and (= |v_ULTIMATE.start_cstrcmp_#t~post0.base_9| v_ULTIMATE.start_cstrcmp_~s2.base_9) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrcmp_~s1.base_12) v_ULTIMATE.start_cstrcmp_~s1.offset_10) |v_ULTIMATE.start_cstrcmp_#t~mem1_8|) (= |v_ULTIMATE.start_cstrcmp_#t~post0.offset_8| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (= |v_ULTIMATE.start_cstrcmp_#t~post0.base_9| v_ULTIMATE.start_cstrcmp_~s2.base_8) (= (+ |v_ULTIMATE.start_cstrcmp_#t~post0.offset_8| 1) v_ULTIMATE.start_cstrcmp_~s2.offset_8) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrcmp_~s1.base_12)) (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrcmp_~s1.base_12)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_10)) InVars {ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_12, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_9, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_12, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_8, #valid=|v_#valid_26|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_9|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_10, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~post0.base, ULTIMATE.start_cstrcmp_#t~post0.offset] 26#L15-2true [97] L15-2-->L15-3: Formula: (and (= 1 (select |v_#valid_12| |v_ULTIMATE.start_cstrcmp_#t~post0.base_3|)) (<= (+ |v_ULTIMATE.start_cstrcmp_#t~post0.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrcmp_#t~post0.base_3|)) (<= 0 |v_ULTIMATE.start_cstrcmp_#t~post0.offset_3|) (= (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrcmp_#t~post0.base_3|) |v_ULTIMATE.start_cstrcmp_#t~post0.offset_3|) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_3|, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_3|, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_3|, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 25#L15-3true [96] L15-3-->L16: Formula: (and (= |v_ULTIMATE.start_cstrcmp_#t~post3.base_2| v_ULTIMATE.start_cstrcmp_~s1.base_7) (= |v_ULTIMATE.start_cstrcmp_#t~mem1_6| |v_ULTIMATE.start_cstrcmp_#t~mem2_6|) (= v_ULTIMATE.start_cstrcmp_~s1.offset_5 (+ |v_ULTIMATE.start_cstrcmp_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstrcmp_#t~post3.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_6) (= v_ULTIMATE.start_cstrcmp_~s1.base_6 |v_ULTIMATE.start_cstrcmp_#t~post3.base_2|)) InVars {ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_6|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_6, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_7} OutVars{ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_5|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_7|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post3.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post3.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~post0.base, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~post0.offset] 7#L16true [68] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_14| |v_ULTIMATE.start_cstrcmp_#t~post3.base_3|)) (<= (+ |v_ULTIMATE.start_cstrcmp_#t~post3.offset_3| 1) (select |v_#length_12| |v_ULTIMATE.start_cstrcmp_#t~post3.base_3|)) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstrcmp_#t~post3.base_3|) |v_ULTIMATE.start_cstrcmp_#t~post3.offset_3|) |v_ULTIMATE.start_cstrcmp_#t~mem4_2|) (<= 0 |v_ULTIMATE.start_cstrcmp_#t~post3.offset_3|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_3|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_3|, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_3|, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem4] 3#L16-1true [156] L16-1-->L15-5: Formula: (> 0 |v_ULTIMATE.start_cstrcmp_#t~mem4_6|) InVars {ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_6|} OutVars{ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_7|, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_6|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post3.base, ULTIMATE.start_cstrcmp_#t~post3.offset, ULTIMATE.start_cstrcmp_#t~mem4] 20#L15-5true 69.23/39.97 [2019-03-28 12:43:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:43:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1213928504, now seen corresponding path program 1 times 69.23/39.97 [2019-03-28 12:43:05,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:43:05,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:43:05,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:05,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:05,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 69.23/39.97 [2019-03-28 12:43:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 69.23/39.97 [2019-03-28 12:43:05,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:43:05,399 INFO L82 PathProgramCache]: Analyzing trace with hash 179376758, now seen corresponding path program 1 times 69.23/39.97 [2019-03-28 12:43:05,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:43:05,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:43:05,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:05,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:05,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 69.23/39.97 [2019-03-28 12:43:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 69.23/39.97 [2019-03-28 12:43:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:43:05,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1107101855, now seen corresponding path program 1 times 69.23/39.97 [2019-03-28 12:43:05,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:43:05,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:43:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:05,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:43:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:43:05,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 69.23/39.97 [2019-03-28 12:43:05,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 69.23/39.97 [2019-03-28 12:43:05,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 69.23/39.97 [2019-03-28 12:43:05,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 69.23/39.97 [2019-03-28 12:43:05,632 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 9 states. 69.23/39.97 [2019-03-28 12:43:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 69.23/39.97 [2019-03-28 12:43:06,030 INFO L93 Difference]: Finished difference Result 51 states and 88 transitions. 69.23/39.97 [2019-03-28 12:43:06,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 69.23/39.97 [2019-03-28 12:43:06,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 88 transitions. 69.23/39.97 [2019-03-28 12:43:06,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 69.23/39.97 [2019-03-28 12:43:06,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 11 states and 16 transitions. 69.23/39.97 [2019-03-28 12:43:06,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 69.23/39.97 [2019-03-28 12:43:06,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 69.23/39.97 [2019-03-28 12:43:06,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. 69.23/39.97 [2019-03-28 12:43:06,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 69.23/39.97 [2019-03-28 12:43:06,039 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. 69.23/39.97 [2019-03-28 12:43:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. 69.23/39.97 [2019-03-28 12:43:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 69.23/39.97 [2019-03-28 12:43:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 69.23/39.97 [2019-03-28 12:43:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. 69.23/39.97 [2019-03-28 12:43:06,041 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. 69.23/39.97 [2019-03-28 12:43:06,041 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. 69.23/39.97 [2019-03-28 12:43:06,041 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 69.23/39.97 [2019-03-28 12:43:06,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. 69.23/39.97 [2019-03-28 12:43:06,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 69.23/39.97 [2019-03-28 12:43:06,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 69.23/39.97 [2019-03-28 12:43:06,042 INFO L119 BuchiIsEmpty]: Starting construction of run 69.23/39.97 [2019-03-28 12:43:06,042 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:43:06,042 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 69.23/39.97 [2019-03-28 12:43:06,043 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY [158] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 113#L24 [103] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 114#L24-2 [104] L24-2-->L27-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 109#L27-1 [125] L27-1-->L32: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1)))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 110#L32 [82] L32-->L32-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 105#L32-1 [159] L32-1-->L15-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_7) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrcmp_~s1.base_11 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_7) (= |v_ULTIMATE.start_cstrcmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_9))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_7|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_9, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_7|, ULTIMATE.start_cstrcmp_#t~pre5.offset=|v_ULTIMATE.start_cstrcmp_#t~pre5.offset_6|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_7|, ULTIMATE.start_cstrcmp_#t~mem7=|v_ULTIMATE.start_cstrcmp_#t~mem7_5|, ULTIMATE.start_cstrcmp_#t~mem6=|v_ULTIMATE.start_cstrcmp_#t~mem6_5|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_11, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_7|, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_7|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_7, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_8|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_5|, ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_8|, ULTIMATE.start_cstrcmp_#t~pre5.base=|v_ULTIMATE.start_cstrcmp_#t~pre5.base_7|, #valid=|v_#valid_25|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_10|, 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_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~post0.base, ULTIMATE.start_cstrcmp_#t~pre5.offset, ULTIMATE.start_cstrcmp_#t~mem4, ULTIMATE.start_cstrcmp_#t~mem7, ULTIMATE.start_cstrcmp_#t~mem6, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_#t~post3.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post3.offset, ULTIMATE.start_cstrcmp_#t~pre5.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base, ULTIMATE.start_cstrcmp_#t~post0.offset] 106#L15-5 69.23/39.97 [2019-03-28 12:43:06,043 INFO L796 eck$LassoCheckResult]: Loop: 106#L15-5 [160] L15-5-->L15-2: Formula: (and (= |v_ULTIMATE.start_cstrcmp_#t~post0.base_9| v_ULTIMATE.start_cstrcmp_~s2.base_9) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrcmp_~s1.base_12) v_ULTIMATE.start_cstrcmp_~s1.offset_10) |v_ULTIMATE.start_cstrcmp_#t~mem1_8|) (= |v_ULTIMATE.start_cstrcmp_#t~post0.offset_8| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (= |v_ULTIMATE.start_cstrcmp_#t~post0.base_9| v_ULTIMATE.start_cstrcmp_~s2.base_8) (= (+ |v_ULTIMATE.start_cstrcmp_#t~post0.offset_8| 1) v_ULTIMATE.start_cstrcmp_~s2.offset_8) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrcmp_~s1.base_12)) (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrcmp_~s1.base_12)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_10)) InVars {ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_12, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_9, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_12, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_8, #valid=|v_#valid_26|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_9|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_10, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~post0.base, ULTIMATE.start_cstrcmp_#t~post0.offset] 108#L15-2 [97] L15-2-->L15-3: Formula: (and (= 1 (select |v_#valid_12| |v_ULTIMATE.start_cstrcmp_#t~post0.base_3|)) (<= (+ |v_ULTIMATE.start_cstrcmp_#t~post0.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrcmp_#t~post0.base_3|)) (<= 0 |v_ULTIMATE.start_cstrcmp_#t~post0.offset_3|) (= (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrcmp_#t~post0.base_3|) |v_ULTIMATE.start_cstrcmp_#t~post0.offset_3|) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_3|, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_3|, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_3|, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 115#L15-3 [96] L15-3-->L16: Formula: (and (= |v_ULTIMATE.start_cstrcmp_#t~post3.base_2| v_ULTIMATE.start_cstrcmp_~s1.base_7) (= |v_ULTIMATE.start_cstrcmp_#t~mem1_6| |v_ULTIMATE.start_cstrcmp_#t~mem2_6|) (= v_ULTIMATE.start_cstrcmp_~s1.offset_5 (+ |v_ULTIMATE.start_cstrcmp_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstrcmp_#t~post3.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_6) (= v_ULTIMATE.start_cstrcmp_~s1.base_6 |v_ULTIMATE.start_cstrcmp_#t~post3.base_2|)) InVars {ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_6|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_6, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_7} OutVars{ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_5|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_7|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post3.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post3.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~post0.base, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~post0.offset] 111#L16 [68] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_14| |v_ULTIMATE.start_cstrcmp_#t~post3.base_3|)) (<= (+ |v_ULTIMATE.start_cstrcmp_#t~post3.offset_3| 1) (select |v_#length_12| |v_ULTIMATE.start_cstrcmp_#t~post3.base_3|)) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstrcmp_#t~post3.base_3|) |v_ULTIMATE.start_cstrcmp_#t~post3.offset_3|) |v_ULTIMATE.start_cstrcmp_#t~mem4_2|) (<= 0 |v_ULTIMATE.start_cstrcmp_#t~post3.offset_3|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_3|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_3|, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_3|, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem4] 107#L16-1 [156] L16-1-->L15-5: Formula: (> 0 |v_ULTIMATE.start_cstrcmp_#t~mem4_6|) InVars {ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_6|} OutVars{ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_7|, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_6|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post3.base, ULTIMATE.start_cstrcmp_#t~post3.offset, ULTIMATE.start_cstrcmp_#t~mem4] 106#L15-5 69.23/39.97 [2019-03-28 12:43:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:43:06,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1214285996, now seen corresponding path program 1 times 69.23/39.97 [2019-03-28 12:43:06,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:43:06,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:43:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:06,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 69.23/39.97 [2019-03-28 12:43:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 69.23/39.97 [2019-03-28 12:43:06,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:43:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash 179376758, now seen corresponding path program 2 times 69.23/39.97 [2019-03-28 12:43:06,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:43:06,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:43:06,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:06,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:06,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 69.23/39.97 [2019-03-28 12:43:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 69.23/39.97 [2019-03-28 12:43:06,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:43:06,063 INFO L82 PathProgramCache]: Analyzing trace with hash 892484779, now seen corresponding path program 1 times 69.23/39.97 [2019-03-28 12:43:06,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 69.23/39.97 [2019-03-28 12:43:06,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 69.23/39.97 [2019-03-28 12:43:06,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:06,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:06,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 69.23/39.97 [2019-03-28 12:43:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 69.23/39.97 [2019-03-28 12:43:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 69.23/39.97 [2019-03-28 12:43:06,418 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 69.23/39.97 [2019-03-28 12:43:06,525 INFO L216 LassoAnalysis]: Preferences: 69.23/39.97 [2019-03-28 12:43:06,527 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 69.23/39.97 [2019-03-28 12:43:06,527 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 69.23/39.97 [2019-03-28 12:43:06,527 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 69.23/39.97 [2019-03-28 12:43:06,527 INFO L127 ssoRankerPreferences]: Use exernal solver: false 69.23/39.97 [2019-03-28 12:43:06,527 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 69.23/39.97 [2019-03-28 12:43:06,527 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 69.23/39.97 [2019-03-28 12:43:06,527 INFO L130 ssoRankerPreferences]: Path of dumped script: 69.23/39.97 [2019-03-28 12:43:06,528 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 69.23/39.97 [2019-03-28 12:43:06,528 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 69.23/39.97 [2019-03-28 12:43:06,528 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 69.23/39.97 [2019-03-28 12:43:06,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,841 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 69.23/39.97 [2019-03-28 12:43:06,965 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 69.23/39.97 [2019-03-28 12:43:06,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:06,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 69.23/39.97 [2019-03-28 12:43:07,419 INFO L300 LassoAnalysis]: Preprocessing complete. 69.23/39.97 [2019-03-28 12:43:07,425 INFO L497 LassoAnalysis]: Using template 'affine'. 69.23/39.97 [2019-03-28 12:43:07,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 69.23/39.97 Termination analysis: LINEAR_WITH_GUESSES 69.23/39.97 Number of strict supporting invariants: 0 69.23/39.97 Number of non-strict supporting invariants: 1 69.23/39.97 Consider only non-deceasing supporting invariants: true 69.23/39.97 Simplify termination arguments: true 69.23/39.97 Simplify supporting invariants: trueOverapproximate stem: false 69.23/39.97 [2019-03-28 12:43:07,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. 69.23/39.97 [2019-03-28 12:43:07,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 69.23/39.97 [2019-03-28 12:43:07,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 69.23/39.97 [2019-03-28 12:43:07,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 69.23/39.97 [2019-03-28 12:43:07,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 69.23/39.97 [2019-03-28 12:43:07,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 69.23/39.97 [2019-03-28 12:43:07,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 69.23/39.97 [2019-03-28 12:43:07,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 69.23/39.97 [2019-03-28 12:43:07,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 69.23/39.97 Termination analysis: LINEAR_WITH_GUESSES 69.23/39.97 Number of strict supporting invariants: 0 69.23/39.97 Number of non-strict supporting invariants: 1 69.23/39.97 Consider only non-deceasing supporting invariants: true 69.23/39.97 Simplify termination arguments: true 69.23/39.97 Simplify supporting invariants: trueOverapproximate stem: false 69.23/39.97 [2019-03-28 12:43:07,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. 69.23/39.97 [2019-03-28 12:43:07,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 69.23/39.97 [2019-03-28 12:43:07,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 69.23/39.97 [2019-03-28 12:43:07,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 69.23/39.97 [2019-03-28 12:43:07,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 69.23/39.97 [2019-03-28 12:43:07,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 69.23/39.97 [2019-03-28 12:43:07,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 69.23/39.97 [2019-03-28 12:43:07,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 69.23/39.97 [2019-03-28 12:43:07,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 69.23/39.97 Termination analysis: LINEAR_WITH_GUESSES 69.23/39.97 Number of strict supporting invariants: 0 69.23/39.97 Number of non-strict supporting invariants: 1 69.23/39.97 Consider only non-deceasing supporting invariants: true 69.23/39.97 Simplify termination arguments: true 69.23/39.97 Simplify supporting invariants: trueOverapproximate stem: false 69.23/39.97 [2019-03-28 12:43:07,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. 69.23/39.97 [2019-03-28 12:43:07,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 69.23/39.97 [2019-03-28 12:43:07,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 69.23/39.97 [2019-03-28 12:43:07,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 69.23/39.97 [2019-03-28 12:43:07,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 69.23/39.97 [2019-03-28 12:43:07,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 69.23/39.97 [2019-03-28 12:43:07,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 69.23/39.97 [2019-03-28 12:43:07,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 69.23/39.97 [2019-03-28 12:43:07,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 69.23/39.97 Termination analysis: LINEAR_WITH_GUESSES 69.23/39.97 Number of strict supporting invariants: 0 69.23/39.97 Number of non-strict supporting invariants: 1 69.23/39.97 Consider only non-deceasing supporting invariants: true 69.23/39.97 Simplify termination arguments: true 69.23/39.97 Simplify supporting invariants: trueOverapproximate stem: false 69.23/39.97 [2019-03-28 12:43:07,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. 69.23/39.97 [2019-03-28 12:43:07,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 69.23/39.97 [2019-03-28 12:43:07,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 69.23/39.97 [2019-03-28 12:43:07,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 69.23/39.97 [2019-03-28 12:43:07,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 69.23/39.97 [2019-03-28 12:43:07,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 69.23/39.97 [2019-03-28 12:43:07,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 69.23/39.97 [2019-03-28 12:43:07,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 69.23/39.97 Termination analysis: LINEAR_WITH_GUESSES 69.23/39.97 Number of strict supporting invariants: 0 69.23/39.97 Number of non-strict supporting invariants: 1 69.23/39.97 Consider only non-deceasing supporting invariants: true 69.23/39.97 Simplify termination arguments: true 69.23/39.97 Simplify supporting invariants: trueOverapproximate stem: false 69.23/39.97 [2019-03-28 12:43:07,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. 69.23/39.97 [2019-03-28 12:43:07,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 69.23/39.97 [2019-03-28 12:43:07,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 69.23/39.97 [2019-03-28 12:43:07,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 69.23/39.97 [2019-03-28 12:43:07,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 69.23/39.97 [2019-03-28 12:43:07,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 69.23/39.97 [2019-03-28 12:43:07,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 69.23/39.97 [2019-03-28 12:43:07,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 69.23/39.97 [2019-03-28 12:43:07,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 69.23/39.97 Termination analysis: LINEAR_WITH_GUESSES 69.23/39.97 Number of strict supporting invariants: 0 69.23/39.97 Number of non-strict supporting invariants: 1 69.23/39.97 Consider only non-deceasing supporting invariants: true 69.23/39.97 Simplify termination arguments: true 69.23/39.97 Simplify supporting invariants: trueOverapproximate stem: false 69.23/39.97 [2019-03-28 12:43:07,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. 69.23/39.97 [2019-03-28 12:43:07,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 69.23/39.97 [2019-03-28 12:43:07,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 69.23/39.97 [2019-03-28 12:43:07,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 69.23/39.97 [2019-03-28 12:43:07,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 69.23/39.97 [2019-03-28 12:43:07,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 69.23/39.97 [2019-03-28 12:43:07,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 69.23/39.97 [2019-03-28 12:43:07,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 69.23/39.97 Termination analysis: LINEAR_WITH_GUESSES 69.23/39.97 Number of strict supporting invariants: 0 69.23/39.97 Number of non-strict supporting invariants: 1 69.23/39.97 Consider only non-deceasing supporting invariants: true 69.23/39.97 Simplify termination arguments: true 69.23/39.97 Simplify supporting invariants: trueOverapproximate stem: false 69.23/39.97 [2019-03-28 12:43:07,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. 69.23/39.97 [2019-03-28 12:43:07,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 69.23/39.97 [2019-03-28 12:43:07,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 69.23/39.97 [2019-03-28 12:43:07,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 69.23/39.97 [2019-03-28 12:43:07,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 69.23/39.97 [2019-03-28 12:43:07,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 69.23/39.97 [2019-03-28 12:43:07,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 69.23/39.97 [2019-03-28 12:43:07,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 69.23/39.97 Termination analysis: LINEAR_WITH_GUESSES 69.23/39.97 Number of strict supporting invariants: 0 69.23/39.97 Number of non-strict supporting invariants: 1 69.23/39.97 Consider only non-deceasing supporting invariants: true 69.23/39.97 Simplify termination arguments: true 69.23/39.97 Simplify supporting invariants: trueOverapproximate stem: false 69.23/39.97 [2019-03-28 12:43:07,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. 69.23/39.97 [2019-03-28 12:43:07,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 69.23/39.97 [2019-03-28 12:43:07,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 69.23/39.97 [2019-03-28 12:43:07,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 69.23/39.97 [2019-03-28 12:43:07,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 69.23/39.97 [2019-03-28 12:43:07,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 69.23/39.97 [2019-03-28 12:43:07,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 69.23/39.97 [2019-03-28 12:43:07,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 69.23/39.97 Termination analysis: LINEAR_WITH_GUESSES 69.23/39.97 Number of strict supporting invariants: 0 69.23/39.97 Number of non-strict supporting invariants: 1 69.23/39.97 Consider only non-deceasing supporting invariants: true 69.23/39.97 Simplify termination arguments: true 69.23/39.97 Simplify supporting invariants: trueOverapproximate stem: false 69.23/39.97 [2019-03-28 12:43:07,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. 69.23/39.97 [2019-03-28 12:43:07,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 69.23/39.97 [2019-03-28 12:43:07,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 69.23/39.97 [2019-03-28 12:43:07,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 69.23/39.97 [2019-03-28 12:43:07,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 69.23/39.97 [2019-03-28 12:43:07,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 69.23/39.97 [2019-03-28 12:43:07,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 69.23/39.97 [2019-03-28 12:43:07,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 69.23/39.97 [2019-03-28 12:43:07,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 69.23/39.97 Termination analysis: LINEAR_WITH_GUESSES 69.23/39.97 Number of strict supporting invariants: 0 69.23/39.97 Number of non-strict supporting invariants: 1 69.23/39.97 Consider only non-deceasing supporting invariants: true 69.23/39.97 Simplify termination arguments: true 69.23/39.97 Simplify supporting invariants: trueOverapproximate stem: false 69.23/39.97 [2019-03-28 12:43:07,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. 69.23/39.97 [2019-03-28 12:43:07,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 69.23/39.97 [2019-03-28 12:43:07,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 69.23/39.97 [2019-03-28 12:43:07,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 69.23/39.97 [2019-03-28 12:43:07,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 69.23/39.97 [2019-03-28 12:43:07,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 69.23/39.97 [2019-03-28 12:43:07,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 69.23/39.97 [2019-03-28 12:43:07,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 69.23/39.97 Termination analysis: LINEAR_WITH_GUESSES 69.23/39.97 Number of strict supporting invariants: 0 69.23/39.97 Number of non-strict supporting invariants: 1 69.23/39.97 Consider only non-deceasing supporting invariants: true 69.23/39.97 Simplify termination arguments: true 69.23/39.97 Simplify supporting invariants: trueOverapproximate stem: false 69.23/39.97 [2019-03-28 12:43:07,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. 69.23/39.97 [2019-03-28 12:43:07,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 69.23/39.97 [2019-03-28 12:43:07,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 69.23/39.97 [2019-03-28 12:43:07,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 69.23/39.97 [2019-03-28 12:43:07,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 69.23/39.97 [2019-03-28 12:43:07,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 69.23/39.97 [2019-03-28 12:43:07,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 69.23/39.97 [2019-03-28 12:43:07,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 69.23/39.97 Termination analysis: LINEAR_WITH_GUESSES 69.23/39.97 Number of strict supporting invariants: 0 69.23/39.97 Number of non-strict supporting invariants: 1 69.23/39.97 Consider only non-deceasing supporting invariants: true 69.23/39.97 Simplify termination arguments: true 69.23/39.97 Simplify supporting invariants: trueOverapproximate stem: false 69.23/39.97 [2019-03-28 12:43:07,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. 69.23/39.97 [2019-03-28 12:43:07,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 69.23/39.97 [2019-03-28 12:43:07,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 69.23/39.97 [2019-03-28 12:43:07,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 69.23/39.97 [2019-03-28 12:43:07,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 69.23/39.97 [2019-03-28 12:43:07,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 69.23/39.97 [2019-03-28 12:43:07,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 69.23/39.97 [2019-03-28 12:43:07,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 69.23/39.97 Termination analysis: LINEAR_WITH_GUESSES 69.23/39.97 Number of strict supporting invariants: 0 69.23/39.97 Number of non-strict supporting invariants: 1 69.23/39.97 Consider only non-deceasing supporting invariants: true 69.23/39.97 Simplify termination arguments: true 69.23/39.97 Simplify supporting invariants: trueOverapproximate stem: false 69.23/39.97 [2019-03-28 12:43:07,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. 69.23/39.97 [2019-03-28 12:43:07,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 69.23/39.97 [2019-03-28 12:43:07,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 69.23/39.97 [2019-03-28 12:43:07,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 69.23/39.97 [2019-03-28 12:43:07,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 69.23/39.97 [2019-03-28 12:43:07,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 69.23/39.97 [2019-03-28 12:43:07,534 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 69.23/39.97 [2019-03-28 12:43:07,556 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 69.23/39.97 [2019-03-28 12:43:07,556 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. 69.23/39.97 [2019-03-28 12:43:07,559 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 69.23/39.97 [2019-03-28 12:43:07,560 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 69.23/39.97 [2019-03-28 12:43:07,560 INFO L518 LassoAnalysis]: Proved termination. 69.23/39.97 [2019-03-28 12:43:07,561 INFO L520 LassoAnalysis]: Termination argument consisting of: 69.23/39.97 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1, ULTIMATE.start_cstrcmp_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 - 1*ULTIMATE.start_cstrcmp_~s2.offset 69.23/39.97 Supporting invariants [] 69.23/39.97 [2019-03-28 12:43:07,605 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed 69.23/39.97 [2019-03-28 12:43:07,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:07,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 69.23/39.97 [2019-03-28 12:43:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:43:07,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core 69.23/39.97 [2019-03-28 12:43:07,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... 69.23/39.97 [2019-03-28 12:43:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:43:07,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core 69.23/39.97 [2019-03-28 12:43:07,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... 69.23/39.97 [2019-03-28 12:43:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 69.23/39.97 [2019-03-28 12:43:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:43:07,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core 69.23/39.97 [2019-03-28 12:43:07,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... 69.23/39.97 [2019-03-28 12:43:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 69.23/39.97 [2019-03-28 12:43:07,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core 69.23/39.97 [2019-03-28 12:43:07,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... 69.23/39.97 [2019-03-28 12:43:07,874 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization 69.23/39.97 [2019-03-28 12:43:07,878 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 8 loop predicates 69.23/39.97 [2019-03-28 12:43:07,879 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 5 states. 69.23/39.97 [2019-03-28 12:43:08,112 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 16 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 17 states and 23 transitions. Complement of second has 8 states. 69.23/39.97 [2019-03-28 12:43:08,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states 69.23/39.97 [2019-03-28 12:43:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 69.23/39.97 [2019-03-28 12:43:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. 69.23/39.97 [2019-03-28 12:43:08,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 6 letters. Loop has 5 letters. 69.23/39.97 [2019-03-28 12:43:08,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. 69.23/39.97 [2019-03-28 12:43:08,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 5 letters. 69.23/39.97 [2019-03-28 12:43:08,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. 69.23/39.97 [2019-03-28 12:43:08,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 6 letters. Loop has 10 letters. 69.23/39.97 [2019-03-28 12:43:08,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. 69.23/39.97 [2019-03-28 12:43:08,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. 69.23/39.97 [2019-03-28 12:43:08,123 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 69.23/39.97 [2019-03-28 12:43:08,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. 69.23/39.97 [2019-03-28 12:43:08,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 69.23/39.97 [2019-03-28 12:43:08,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 69.23/39.97 [2019-03-28 12:43:08,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 69.23/39.97 [2019-03-28 12:43:08,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 69.23/39.97 [2019-03-28 12:43:08,123 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 69.23/39.97 [2019-03-28 12:43:08,123 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 69.23/39.97 [2019-03-28 12:43:08,124 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 69.23/39.97 [2019-03-28 12:43:08,124 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 69.23/39.97 [2019-03-28 12:43:08,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 69.23/39.97 [2019-03-28 12:43:08,124 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 69.23/39.97 [2019-03-28 12:43:08,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 69.23/39.97 [2019-03-28 12:43:08,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:08 BasicIcfg 69.23/39.97 [2019-03-28 12:43:08,130 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 69.23/39.97 [2019-03-28 12:43:08,131 INFO L168 Benchmark]: Toolchain (without parser) took 35590.37 ms. Allocated memory was 649.6 MB in the beginning and 940.0 MB in the end (delta: 290.5 MB). Free memory was 559.2 MB in the beginning and 725.9 MB in the end (delta: -166.7 MB). Peak memory consumption was 123.8 MB. Max. memory is 50.3 GB. 69.23/39.97 [2019-03-28 12:43:08,131 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 69.23/39.97 [2019-03-28 12:43:08,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.74 ms. Allocated memory was 649.6 MB in the beginning and 680.0 MB in the end (delta: 30.4 MB). Free memory was 559.2 MB in the beginning and 647.5 MB in the end (delta: -88.4 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. 69.23/39.97 [2019-03-28 12:43:08,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.73 ms. Allocated memory is still 680.0 MB. Free memory was 647.5 MB in the beginning and 643.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 69.23/39.97 [2019-03-28 12:43:08,132 INFO L168 Benchmark]: Boogie Preprocessor took 27.20 ms. Allocated memory is still 680.0 MB. Free memory was 643.6 MB in the beginning and 641.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 69.23/39.97 [2019-03-28 12:43:08,133 INFO L168 Benchmark]: RCFGBuilder took 351.59 ms. Allocated memory is still 680.0 MB. Free memory was 641.5 MB in the beginning and 618.3 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. 69.23/39.97 [2019-03-28 12:43:08,133 INFO L168 Benchmark]: BlockEncodingV2 took 133.93 ms. Allocated memory is still 680.0 MB. Free memory was 618.3 MB in the beginning and 608.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 69.23/39.97 [2019-03-28 12:43:08,134 INFO L168 Benchmark]: TraceAbstraction took 31885.78 ms. Allocated memory was 680.0 MB in the beginning and 907.5 MB in the end (delta: 227.5 MB). Free memory was 607.5 MB in the beginning and 748.3 MB in the end (delta: -140.8 MB). Peak memory consumption was 455.0 MB. Max. memory is 50.3 GB. 69.23/39.97 [2019-03-28 12:43:08,134 INFO L168 Benchmark]: BuchiAutomizer took 2818.18 ms. Allocated memory was 907.5 MB in the beginning and 940.0 MB in the end (delta: 32.5 MB). Free memory was 748.3 MB in the beginning and 725.9 MB in the end (delta: 22.4 MB). Peak memory consumption was 55.0 MB. Max. memory is 50.3 GB. 69.23/39.97 [2019-03-28 12:43:08,137 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 69.23/39.97 --- Results --- 69.23/39.97 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 69.23/39.97 - StatisticsResult: Initial Icfg 69.23/39.97 36 locations, 40 edges 69.23/39.97 - StatisticsResult: Encoded RCFG 69.23/39.97 27 locations, 48 edges 69.23/39.97 * Results from de.uni_freiburg.informatik.ultimate.core: 69.23/39.97 - StatisticsResult: Toolchain Benchmarks 69.23/39.97 Benchmark results are: 69.23/39.97 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 69.23/39.97 * CACSL2BoogieTranslator took 323.74 ms. Allocated memory was 649.6 MB in the beginning and 680.0 MB in the end (delta: 30.4 MB). Free memory was 559.2 MB in the beginning and 647.5 MB in the end (delta: -88.4 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. 69.23/39.97 * Boogie Procedure Inliner took 44.73 ms. Allocated memory is still 680.0 MB. Free memory was 647.5 MB in the beginning and 643.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 69.23/39.97 * Boogie Preprocessor took 27.20 ms. Allocated memory is still 680.0 MB. Free memory was 643.6 MB in the beginning and 641.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 69.23/39.97 * RCFGBuilder took 351.59 ms. Allocated memory is still 680.0 MB. Free memory was 641.5 MB in the beginning and 618.3 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. 69.23/39.97 * BlockEncodingV2 took 133.93 ms. Allocated memory is still 680.0 MB. Free memory was 618.3 MB in the beginning and 608.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 69.23/39.97 * TraceAbstraction took 31885.78 ms. Allocated memory was 680.0 MB in the beginning and 907.5 MB in the end (delta: 227.5 MB). Free memory was 607.5 MB in the beginning and 748.3 MB in the end (delta: -140.8 MB). Peak memory consumption was 455.0 MB. Max. memory is 50.3 GB. 69.23/39.97 * BuchiAutomizer took 2818.18 ms. Allocated memory was 907.5 MB in the beginning and 940.0 MB in the end (delta: 32.5 MB). Free memory was 748.3 MB in the beginning and 725.9 MB in the end (delta: 22.4 MB). Peak memory consumption was 55.0 MB. Max. memory is 50.3 GB. 69.23/39.97 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #memory_int 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 - GenericResult: Unfinished Backtranslation 69.23/39.97 unknown boogie variable #length 69.23/39.97 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 69.23/39.97 - PositiveResult [Line: 15]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - PositiveResult [Line: 15]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - PositiveResult [Line: 16]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - PositiveResult [Line: 16]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - PositiveResult [Line: 18]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - PositiveResult [Line: 18]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - PositiveResult [Line: 32]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - PositiveResult [Line: 32]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - PositiveResult [Line: 18]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - PositiveResult [Line: 18]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - PositiveResult [Line: 33]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - PositiveResult [Line: 33]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - PositiveResult [Line: 15]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - PositiveResult [Line: 15]: pointer dereference always succeeds 69.23/39.97 For all program executions holds that pointer dereference always succeeds at this location 69.23/39.97 - AllSpecificationsHoldResult: All specifications hold 69.23/39.97 14 specifications checked. All of them hold 69.23/39.97 - InvariantResult [Line: 15]: Loop Invariant 69.23/39.97 [2019-03-28 12:43:08,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,150 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 69.23/39.97 [2019-03-28 12:43:08,163 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,163 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 [2019-03-28 12:43:08,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 69.23/39.97 [2019-03-28 12:43:08,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 69.23/39.97 Derived loop invariant: ((((((((((\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(s1 == ULTIMATE.start_main_~nondetString2~0.base)) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0 && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && nondetString1 == 0) && nondetString2 == 0) && (((((((((length1 == unknown-#length-unknown[nondetString1] && !(nondetString1 == nondetString2)) && 1 == \valid[s2]) && s1 == 0) && 1 <= length2) && 1 <= unknown-#length-unknown[s1]) && s2 == 0) && 1 <= length1) && 1 == \valid[nondetString1]) && \valid[s1] == 1) && 1 == \valid[nondetString2]) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1]) && unknown-#length-unknown[nondetString2] == length2) && s2 + 1 <= unknown-#length-unknown[s2]) || (((nondetString2 == 0 && unknown-#length-unknown[nondetString2] == length2) && ((((((\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(s1 == ULTIMATE.start_main_~nondetString2~0.base)) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0 && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && s1 + 1 <= unknown-#length-unknown[s1]) && ((((((((length1 == unknown-#length-unknown[nondetString1] && 1 == \valid[s2]) && 1 <= s2) && 1 <= s1) && 1 <= length2) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && \valid[s1] == 1) && 1 == \valid[nondetString2]) && !(nondetString1 == nondetString2)) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1]) && s2 + 1 <= unknown-#length-unknown[s2])) || ((((((((((((((((length1 == unknown-#length-unknown[nondetString1] && !(nondetString1 == nondetString2)) && 1 == \valid[s2]) && s1 == 0) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 <= unknown-#length-unknown[s1]) && 1 == length1) && s2 == 0) && 0 == unknown-#memory_int-unknown[s1][s1]) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 <= unknown-#length-unknown[s2]) && \valid[s1] == 1) && 1 == \valid[nondetString2]) 69.23/39.97 - StatisticsResult: Ultimate Automizer benchmark data 69.23/39.97 CFG has 1 procedures, 27 locations, 14 error locations. SAFE Result, 31.7s OverallTime, 28 OverallIterations, 4 TraceHistogramMax, 19.8s AutomataDifference, 0.0s DeadEndRemovalTime, 6.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 1408 SDslu, 876 SDs, 0 SdLazy, 2736 SolverSat, 422 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 406 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=26, 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, 28 MinimizatonAttempts, 76 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 345 HoareAnnotationTreeSize, 1 FomulaSimplifications, 2141 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 2502 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 419 ConstructedInterpolants, 45 QuantifiedInterpolants, 67400 SizeOfPredicates, 104 NumberOfNonLiveVariables, 1165 ConjunctsInSsa, 262 ConjunctsInUnsatCore, 37 InterpolantComputations, 21 PerfectInterpolantSequences, 68/138 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 69.23/39.97 - StatisticsResult: Constructed decomposition of program 69.23/39.97 Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length2 * sizeof(char))] + -1 * s2 and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 9 locations. 69.23/39.97 - StatisticsResult: Timing statistics 69.23/39.97 BüchiAutomizer plugin needed 2.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 20 SDtfs, 117 SDslu, 309 SDs, 0 SdLazy, 562 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital210 mio100 ax100 hnf100 lsp97 ukn85 mio100 lsp46 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 69.23/39.97 - TerminationAnalysisResult: Termination proven 69.23/39.97 Buchi Automizer proved that your program is terminating 69.23/39.97 RESULT: Ultimate proved your program to be correct! 69.23/39.97 !SESSION 2019-03-28 12:42:29.240 ----------------------------------------------- 69.23/39.97 eclipse.buildId=unknown 69.23/39.97 java.version=1.8.0_181 69.23/39.97 java.vendor=Oracle Corporation 69.23/39.97 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 69.23/39.97 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 69.23/39.97 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 69.23/39.97 69.23/39.97 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:43:08.396 69.23/39.97 !MESSAGE The workspace will exit with unsaved changes in this session. 69.23/39.97 Received shutdown request... 69.23/39.97 Ultimate: 69.23/39.97 GTK+ Version Check 69.23/39.97 EOF